Leetcode interview question #167. Two Sum II - explained in Javascript. This is similar to question #1. Two Sum. The time complexity of this problem shown is O(N) and space complexity is O(1)
Timestamps
00:00 - Problem statement
01:25 - Background (Watch Two Sum video)
02:48 - Approach - O(n)
05:17 - Code walkthrough
07:25 - Leetcode
Code
https://github.com/sandeep194920/Leet...
Recommended video - • Two Sum - 1 Leetcode Javascript Solutions