Is there some way to find 3 elements whose sum equal to K in an array in linear time. Sum of 2 numbers can be done in linear time using hash in O(n) time, what if for that case i am not allowed any extra space.
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To view this discussion on the web visit https://groups.google.com/d/msg/algogeeks/-/90sRhX0Im5EJ. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
