2026-05-23

---

Daily Prep - Saturday, 2026-05-23

Today’s Targets Completed

DSA - 4 Problems

• LC1: Count Number of Bad Pairs (Medium)
• LC2: Subarrays with K Different Integers (Hard)
• LC3: Count Number of Nice Subarrays (Medium)
• LC4: Binary Subarrays With Sum (Medium)

System Design - 1 Topic

• Topic: Inverted Index

---

End Of Day Reflection

• Smashed a massive LeetCode Hard today: Subarrays with K Different Integers. Used the atMost(K) - atMost(K-1) sliding window helper trick to solve it beautifully.
• Solved Count Number of Bad Pairs by transforming the equation $j-i\ne nums[j]-nums[i]$ to $nums[j]-j\ne nums[i]-i$, and using a HashMap to store differences.
• Solidified my knowledge of how full-text search engines actually run under the hood with the Inverted Index data structure.

---

Next Day Goal

• Continue with

---