top of page
Search
Kth Largest Element in an Array
Finding the Kth largest element in an array is a practical problem you’ll face when you need to compute statistics on large...
Apr 284 min read
Sort Colors (Dutch National Flag) Problem
Sorting an array of red, white, and blue objects—represented by 0, 1, and 2—is a classic real-world task when you need to group items by...
Apr 243 min read
Merge Two Sorted Arrays
Merging two sorted arrays is a super-practical task you’ll do whenever you need to combine sorted streams—think merging log files, time...
Apr 223 min read
Majority Element
Finding the majority element—an item that appears more than half the time in an array—is a classic warm‑up that’s surprisingly useful in...
Apr 183 min read
Longest Common Prefix
Finding the longest common prefix among an array of strings is a classic warm‑up. It pops up in real‑world scenarios like building...
Apr 183 min read
Deriving KMP in Real Time
I’m staring at my whiteboard, fresh off writing the brute‑force substring search: two nested loops, compare needle at every haystack...
Apr 174 min read
Needle In a Haystack - Part 1
Searching for a substring within a larger string is a fundamental task in many real‑world applications—think text editors, search...
Apr 173 min read
Valid Palindrome - A Warm Up
Checking whether a string is a palindrome—ignoring punctuation, spaces, and case—is a classic coding interview warm‑up. It’s directly...
Apr 173 min read
Move Zeroes – A Warm‑Up
Let’s walk through one of the classic warm-up problems you might face in a coding interview or on the job: moving all the zeroes in an...
Apr 153 min read
Reverse an Array In Place
In today’s practice question, we talk through the reverse an array in place question - no extra arrays allowed. Problem Statement Given...
Apr 154 min read
Rotate an Array by k Steps
Rotating an array in place is a classic warm‑up that tests your ability to manipulate arrays, handle wrap‑around indexing, and optimize...
Apr 143 min read
Dynamic Programming: A Refresher
Dynamic Programming (DP) is a powerful technique used to solve complex problems by breaking them down into simpler subproblems. Whether...
Mar 283 min read
Graphs: A Refresher
Graphs are one of the most versatile and commonly tested data structures in technical interviews. Whether you’re a new engineer or...
Mar 283 min read
Trees: A Refresher
Trees are one of the most important data structures in computer science and frequently appear in technical interviews. Whether you’re a...
Mar 283 min read
Search Algorithms: A Refresher
Searching is a fundamental operation in computer science, and understanding search algorithms is essential for coding interviews. Whether...
Mar 284 min read
Sorting Algorithms: A Refresher
Sorting is a fundamental topic in computer science and a common subject in technical coding interviews. Whether you're a new engineer...
Mar 283 min read
bottom of page

