Three Sum (Beats 99%) - Leet Code 15 - TypeScript
3 Sum is the infamous sequel to the 2 Sum questions. It makes use of the two pointer technique such that we can simplify the time complexity from O(n^3) to O(n^2).
--------------------------------------------------
Recommended Udemy courses
--------------------------------------------------
Understanding TypeScript: https://tinyurl.com/9wz6fp7k
NodeJS - The Complete Guide: https://tinyurl.com/3z4ehtpm
React - The Complete Guide: https://tinyurl.com/2t6v5yeu
Angular - The Complete Guide: https://tinyurl.com/4h5rmpsj
DSA TS Playlist: • Data Structures and Algorithms (TypeS...
00:00-02:42- Understanding the problem
02:43-05:45 - Why we first sort the numbers
05:46-11:44 - Solving the problem
11:45-15:30 - Handling duplicates
15:31 - Solution results