Given an unsorted array A of size N that contains only non-negative integers, find a continuous sub-array which adds to a given number S and return the left and right index(1-based indexing) of that subarray.

Big O notation tells how well problem can be solved i.e, We can define Big O notation as the language we use for talking about how long an algorithm takes to run. It’s how we compare the efficiency of different approaches to a problem. The Big-O Asymptotic Notation gives us the Upper Bound Idea, mathematically… Read More