Two Sum - 1 Leetcode Javascript Solutions
Leetcode interview question #1. Two Sum, explained in Javascript. This is a very favourite question for interviewers including FAANG and many other product based companies. This video has two approaches covered, the first one is the brute force way and the second way is to use the hash map (key-value pair), object in Javascript. It also includes code executed on Leetcode.
Timestamps
00:00 - Problem statement
00:50 - Brute force approach - O(n^2)
05:00 - Brute force code walkthrough
08:05 - Brute force solution on leetcode
10:04 - Optimal approach - O(n)
15:45 - Optimal code walkthrough
20:24 - Optimal solution on leetcode
Code - https://github.com/sandeep194920/Leet...