🗃️ DS&A
7 items
📄️ Why DSA and Big-O Still Matter
DSA and Big-O notation aren't just for interviews — they directly impact real-world performance and costs, from serverless runtime billing to optimizing data pipelines. This article explores their practical value through personal experience and potential demos.
📄️ Common Tasks in Data Structures & Algorithms Problems
A reference list of the most common patterns in DS&A problems, including hashmaps, two pointers, DFS/BFS, dynamic programming, and more. Useful for interviews, practice, or competitive programming prep.
📄️ Data Structure Pairing: Deque + Hash Map (Rolling-Window Dedup)
A reusable pattern for time based sliding window uniqueness problems — combining a deque for order (window) and a hash map for O(1) insertions/lookups/deletes
📄️ Fixed Sliding Window: Rethinking the Pattern
A clean, reusable approach to sliding window problems — starting at the first valid state, removing conditional complexity, and focusing on window validity instead of index juggling.
🗃️ Why Heaps Are Often Implemented as Arrays
1 item
📄️ Inversions Quick Guide: Sorting, Parity, and Why It Matters
Understand what inversion counts are, how to compute them, and why they're crucial in sorting algorithms, permutation parity, and puzzle solvability.
🗃️ Iterate
1 item
🗃️ lang-comparison
4 items
🗃️ matrixes
1 item
📄️ Prefix Sums
Prefix sums (cumulative sums) are a foundational technique for speeding up range queries. They extend beyond arrays into matrices, trees, and even XOR or product computations, forming the backbone of many algorithmic optimizations.
🗃️ trees
5 items
📄️ Why I Still Prefer Whiteboard Interviews
Whiteboard interviews aren't perfect — but they give hiring managers a chance to see how you actually think. Coding platforms, despite their data and automation, often miss the signal. This article explores why.