This is Lecture 37 of DSA Placement Series. Hashing Problems - Part 1.

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:32 Two Sum (BruteForce)
05:35 Two Sum (Better Approach)
09:55 Two Sum (Optimized)
20:17 Two Sum (Code)
22:01 Repeating & Missing Values
31:03 Repeating & Missing Values (Code)
33:20 Find Duplicate (using Sets)
37:12 Find Duplicate (using Slow Fast Approach)
46:33 Find Duplicate : Pseudocode
50:15 Find Duplicate : Code
51:52 Summary

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