dsa1 min read
Random Pick with Weight [Medium] — Prefix Sum + Binary Search
Implement weighted random selection by building a prefix sum array and using binary search to find the sampled index.
Read →
All Posts
1276 articles
dsa1 min read
Brick Wall [Medium] — Gap Position Frequency Map
Find the vertical line that crosses the fewest bricks by counting the most frequent gap position using a HashMap.
Read →
dsa2 min read
Unique Number of Occurrences — Frequency Map Validation
Check if all value frequencies are unique using two hash sets in O(n).
Read →
dsa2 min read
Count Wonderful Substrings — Bitmask + Prefix XOR Map
Count substrings with at most one odd-frequency letter using bitmask prefix XOR and a hash map.
Read →
dsa2 min read
Equal Row and Column Pairs — Hash Tuple Rows and Columns
Count (row, col) pairs that are equal by hashing each row tuple and each column tuple.
Read →
Page 61 of 256