#1 Two Sum | LeetCode Problem Solving | DS | Algorithm | Hindi

In this video, we will solve the first problem of leetcode. I will show you the best approach to solve this problem in O(N) time complexity. We will see the difference between O(N) and O(N^2) time complexity solution. You can watch the whole leetcode series in the playlist: https://www.youtube.com/playlist?list=PLyTI7CpFS6wVIc-wBUdvj92V2holCXPUI Content of Video: 0:00 - Intro 0:22 - Problem Explanation 1:04 - Solution in O(N^2) 2:25 - Code for O(N^2) 4:41 - Time Complexity for O(N^2) 6:11- Solution for O(N) 8:51 - Code for O(N) #leetcode #datastructures #algorithm #problemsolving #coding #competitiveprogramming