LeetCode 1: Two Sum Explained [Java]

In this video I will show you how to solve a very famous array programming interview question called 'Two Sum'. In this question you are given an array (most likely unsorted) and a target value and asked to return an array of exactly two integers that sum up to the target value. The solution in this video in O(N logN) which is achieved by using Quick Sort to sort the array and then use pointers at end and front to check for equality to target number.

Please like comment and subscribe if you find this content engaging and useful and I'll upload plenty more videos

Follow Ming Tech Media on social media :

Facebook: Mingtechmedia