top of page

Reverse a Linked List

Reversing a linked list is one of those fundamental operations that underpins many real-world tasks—reordering a playlist, undo history,...

Missing Number

When you need to find the one missing entry in a sequence—say missing log IDs, seats, or data packets— Missing Number  is the classic...

Top K Frequent Elements

Finding the most frequent items in a dataset is a common real-world task—think trending topics in social media, most visited pages on a...

Intersection of Two Arrays

Finding the intersection of two arrays - i.e. the common elements between two lists - is a real-world task you’ll do when reconciling...

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...

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...

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...

First Bad Version

The First Bad Version problem - a perfect warm-up to demonstrate binary search

Binary Search

Binary Search is a cornerstone algorithm that shows up in everything from database lookups to system libraries. It’s a perfect warm‑up...

Search Insert Position

Problem Statement - Search Insert Position Given a sorted array of distinct integers  and a target value , return the index  if the...

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...

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...

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...

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...

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...

First Unique Character in a String

Finding the first non‑repeating character in a string is a great warm‑up that combines practical string processing with frequency...

Valid Anagram

Today, I’m tackling the Valid Anagram problem, a classic that not only tests basic string manipulation but also real‑world pattern...

Contains Duplicate – A Warm Up

In today’s session, I’m tackling the Contains Duplicate problem, a common warm‑up that helps demonstrate your grasp of array manipulation...

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...

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...

Drop Me a Line, Let Me Know What You Think

Thanks for submitting!

© 2023 by Train of Thoughts. Proudly created with Wix.com

bottom of page