I had been sick during the last week as a result of which I spent most of my time resting and bingeing.
So, after successfully wasting one week… I’m back on track from today onwards.
I got myself introduced to 2D arrays today and performed basic input/output operations and Searching for a particular element.
I also tried a problem called PAIR SUM PROBLEM using two approaches. One being the O(n) which is the more optimized way and the other, O(n^2) by Brute Force. The idea of the problem is simple. We need to find the index pair whose sum of elements result to the KEY given by the user.
Leave a comment