Given an array of integers, find three numbers (indices i, j, k) such that the sum of two equals the third (A[i] + A[j] = A[k]) in minimum time complexity.
You've read your 3 free write-ups
Sign up free to keep reading. Your account opens the first 10 questions of every company.