Tag Archives: Programming interview Questions

Given an array A[] and a number x, check for pair in A[] with sum as K

Let’s say the array is of size N. The naive way to solve the problem, for each element checking whether k-element is present in the array, which is O(N^2). This is of course far from optimal and you might not … Continue reading

Posted in Uncategorized | Tagged | Leave a comment