This is Lecture 38 of DSA Placement Series. Hashing Problems - Part 2.

Want to study for Tech Placements/Internships from us :
Our Latest Placement Batches : https://linktr.ee/apnacollege.in

Company wise DSA Sheet Link : https://docs.google.com/spreadsheets/d/1mvlc8EYc3OVVU3X7NKoC0iZJr_45BL_pVxiJec0r94c/edit?usp=sharing

New DSA Sheet : coming soon!

Share your progress on Twitter : https://x.com/ShradhaKhapra_
DSA Series full playlist : https://www.youtube.com/playlist?list=PLfqMhTWNBTe137I_EPQd34TsgV6IO55pt

Timestamps
00:00 Introduction
00:21 3Sum Qs
02:46 IMPORTANT
03:11 BruteForce Solution
7:55 Code
14:05 Time & Space Complexity
16:02 Better Solution : Hashing
21:02 Code
24:14 Dry Run
27:13 Time & Space Complexity
28:36 Optimal Solution : 2 Pointer Approach
41:25 Code
43:45 Time & Space Complexity

Shradha Ma'am community
Instagram : https://www.instagram.com/shradhakhapra
LinkedIn : https://www.linkedin.com/in/shradha-khapra/