49.9K
COComment "CODE" if you want the clear Brute Force and HashMap code with full explanation PDF. 🔥
Day 1 of 100 Days LeetCode DSA Challenge 🚀
Problem: Two Sum
Most beginners solve this using Brute Force, which takes O(n²) time because we check every pair.
But in this video, I explained how to optimize it using HashMap and reduce the time complexity to O(n). ⚡
This is how top programmers think — first brute force, then optimize.
If you are starting DSA, this is the most important problem to understand HashMap concept clearly.
Follow @Codewithkirann for daily DSA problems and explanations.
#day1 #100daysofcode #leetcode #dsa #python coding programming computerscience learntocode codewithkirann
@codewithkirann
