Group Anagrams — Hash Map of Canonical Keys
Solve the Group Anagrams problem cleanly with a hash map keyed by sorted strings or character counts. Includes complexity analysis and interview talking points.
·6 min read · #dsa#leetcode#hashing
#hashing
7 posts · page 1 of 1
Longest Consecutive Sequence — The Hash Set Trick
Solve Longest Consecutive Sequence in O(n) using a hash set and a start-of-run check. Walkthrough, edge cases, and interview script.
·5 min read · #dsa#leetcode#hashing
Top K Frequent Elements — Heap vs Bucket Sort
Solve Top K Frequent Elements with both a min-heap and a bucket sort approach. Trade-offs, complexity, and interview-ready walkthrough.
·5 min read · #dsa#leetcode#hashing
Two Sum — From Brute Force to O(n) Hash Map
A complete walkthrough of the Two Sum problem. We move from the obvious nested loop to a single-pass hash map and dissect why it works.
·6 min read · #dsa#leetcode#hashing
Valid Anagram — Counting Characters in O(n)
A complete walkthrough of the Valid Anagram problem. Compare the sorting approach with the optimal hash map counting solution and learn how to explain it in interviews.
·6 min read · #dsa#leetcode#hashing
Hashing and Hash Maps in DSA
How hash functions, hash maps, and hash sets work — the intuition behind buckets and collisions, chaining vs open addressing, average and worst-case complexity, and the Python containers built on them.
·9 min read · #dsa#hashing#intermediate
Hashing: 8 Practice Problems with Solutions
Eight classic hash map problems with worked Python solutions — Two Sum, Group Anagrams, Subarray Sum Equals K, Longest Consecutive Sequence, Top K Frequent Elements, and more.
·10 min read · #dsa#hashing#practice