# dsa

Pattern Blueprint: The Backtracking Master Template

The Mental Model Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Backtracking is a DFS search on a decision tree. At every node, you make a choice, explore all resulting poss…

Pattern Blueprint: The Monotonic Stack Template

The Mental Model Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A monotonic stack is a stack that maintains its elements in a strictly increasing or decreasing order. It is…

Pattern Blueprint: The Universal Sliding Window Template

The Mental Model Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A sliding window is just a sub-segment of an array that expands and shrinks based on a condition. Instead of…

Pattern Blueprint: The Two Pointers Master Template

1. Opposite Ends (The Squeeze) Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Use this for sorted arrays where you need to find a pair (e.g., Two Sum II, 3Sum, Reverse Strin…

DSA Masterclass: Dijkstra’s vs. Bellman-Ford (Shortest Path Algorithms)

Introduction to Shortest Path Algorithms Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Finding the shortest path between two points is one of the most practical application…

Binary Search: Curated Practice Problems

Why Practice Binary Search? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Binary Search is more than just finding an index. It's a way to optimize any problem where the sea…

DSA Masterclass Module 12: Binary Search Patterns

Introduction to Binary Search Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Binary Search is the ultimate tool for searching in sorted data. It works by repeatedly halving…

System Design Module 8: CAP Theorem & Consistency Models

What is the CAP Theorem? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The CAP Theorem states that in the event of a Network Partition, a distributed system can only provid…

#ai-ml#dsa#system-design

DSA Complexity: Curated Practice Problems

Why Practice Complexity Analysis? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You cannot optimize what you cannot measure. In FAANG interviews, you must analyze every sol…

System Design Module 6: Database Design (SQL vs NoSQL)

The Core Conflict: SQL vs NoSQL Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. In a system design interview, choosing the right database is half the battle. This choice dete…

#databases#dsa#system-design

Dynamic Programming: Curated Practice Problems

Key Patterns to Master Mental Model > Trading memory for time by caching overlapping sub-problem results. 1. 0/1 Knapsack: Picking items with constraints. 2. Unbounded Knapsack: Reusing items unlimited times (Coin Change…

The Dynamic Programming Masterclass: Tabulation, Memoization, and State

Why is Dynamic Programming (DP) the Final Boss? Mental Model > Trading memory for time by caching overlapping sub-problem results. Most candidates fail DP because they try to "Memorize" the code. DP is not a specific alg…

Graphs: Curated Practice Problems

Key Patterns to Master Mental Model > Mapping relationships and traversals between nodes. 1. Flood Fill: For grid traversal. 2. Topological Sort: For dependency and ordering. 3. Shortest Path: Using BFS (unweighted) or D…

The Graph Mastery Blueprint: BFS, DFS, and Representation

Why Graphs are "The Boss" Data Structure Mental Model > Mapping relationships and traversals between nodes. Most data structures you've learned—Arrays, Lists, and Trees—are actually specialized Graphs. - A Linked List is…

DSA Masterclass Module 11: Greedy Algorithms

Introduction to Greedy Algorithms Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A Greedy Algorithm is an algorithmic paradigm that builds up a solution piece by piece, alwa…

Greedy Algorithms: Curated Practice Problems

Key Patterns to Master Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. 1. Interval Sorting: Sorting by end time to maximize non-overlapping events. 2. Max Reach: Tracking the…

Heaps: Curated Practice Problems

Key Patterns to Master Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. 1. Top K Elements: Maintaining a heap of size $K$. 2. Two Heaps: For tracking medians or balanced sets.…

DSA Masterclass Module 13: Heaps & Priority Queues

Introduction to Heaps Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A Heap is a specialized tree-based data structure that satisfies the Heap Property: - Min-Heap: The valu…

Lesson: The FAANG Interview Checklist

The 45-Minute Breakdown Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. 0-5m: Intro & Clarification - [ ] Understand the problem statement. - [ ] Ask 3-4 clarifying questions…

Apr 26, 20267 min read

DSA Masterclass Module 15: Mock Interviews & Strategy

The Soft Skills of Hard Engineering Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You can have the most optimized code in the world, but if you don't explain it, you might…

Linked List Deep Dive: Memory, References, and Pointers

The Mental Model Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A Linked List is a linear data structure where elements are not stored at contiguous memory locations. Instea…

Linked Lists: Curated Practice Problems

Key Patterns to Master Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. 1. Fast & Slow Pointers: For cycle detection and finding the middle. 2. Sentinel Nodes: For simplifying…

LLD Design Patterns: Curated Practice Problems

Patterns are like Tools Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A good engineer knows when to use a hammer and when to use a screwdriver. Use this practice list to de…

Deep DiveLLD Interview Mastery

LLD Masterclass: Curated Practice Problems

Why Practice LLD? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. System design gets you the job, but LLD determines your level. Senior and Staff roles require you to prove y…

Deep DiveLLD Interview Mastery

DSA Masterclass Module 2: The Problem Solving Mindset

Introduction to the DSA Mindset Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The biggest mistake candidates make is jumping straight into coding. In a FAANG interview, cod…

Recursion & Backtracking: Curated Practice Problems

Key Patterns to Master Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. 1. Combinatorial Search: For generating subsets, permutations, and combinations. 2. State Pruning: For…

Mastering Recursion: The Three Laws and the Decision Tree

What is Recursion? Mental Model > Thinking in recursive sub-problems and hierarchical branching. Recursion is a problem-solving method where the solution depends on solutions to smaller instances of the same problem. In…

Sliding Window Pattern: Curated Practice Problems

Why Practice Sliding Window? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Sliding Window pattern is the ultimate optimization for contiguous subarray and substring pro…

Stack & Queue: Curated Practice Problems

Key Patterns to Master Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. 1. LIFO Logic: For nesting and reversals. 2. Monotonic Stack: For nearest greater/smaller element probl…

DSA Masterclass Module 6: Stack, Queue & Monotonic Stack

Introduction to Stacks and Queues Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Stacks and Queues are linear data structures with strict rules on how data is added and remo…

DSA Masterclass Module 1: Time & Space Complexity

Introduction to Complexity Analysis Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. In a FAANG interview, your code isn't just judged on whether it works. It's judged on how…

Trees: Curated Practice Problems

Why Practice Trees? Mental Model > Thinking in recursive sub-problems and hierarchical branching. Tree problems are the foundation for Graphs and Dynamic Programming on Trees. They are extremely common in mid-level to se…

The Binary Tree Masterclass: BFS, DFS, and Structural Intuition

Why Trees are the Foundation of Modern Engineering Mental Model > Thinking in recursive sub-problems and hierarchical branching. In a standard linear structure like an array, searching takes $O(N)$. In a Binary Tree, we…

Tries: Curated Practice Problems

Why Practice Tries? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Tries are the "secret weapon" of string problems. They turn expensive string comparisons into fast tree tr…

DSA Masterclass Module 14: Tries & Advanced Structures

Introduction to Tries Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A Trie (pronounced "try") or Prefix Tree is a specialized tree structure used for storing strings. Unlik…

Arrays & Two Pointers: Curated Practice Problems

Why Practice Two Pointers? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Two Pointers pattern is one of the highest-yield techniques in coding interviews. It allows you…

Lesson: How to Explain DSA Solutions

The Verbal Script Template Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. When you transition from "Thinking" to "Implementing," use this script: > "I have a brute force ide…

DSA Masterclass: The Bitmasking & XOR Blueprint

1. Why Bitmasking? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A "mask" is just an integer where each bit represents a boolean state. - Example: int mask = 5 (Binary 101)…

Apr 26, 20267 min read

Merge Intervals Pattern in Java: Conquer Overlapping Subarrays Efficiently

Introduction to the Merge Intervals Pattern Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Merge Intervals pattern is an essential algorithmic technique for dealing with…

Apr 26, 20269 min read

Company Playbook: The Google 15

The Google "Flavor" Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Google interviews are famous for "Constraint Satisfaction" and "Optimization under Infinity." They rarely…

Company Playbook: The Meta 15

The Meta "Flavor" Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Meta interviews are about Speed and Correctness. They typically give you 2 Medium/Hard problems in 45 minute…

Problem: 3Sum - Finding Unique Triplets

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k…

MANG Problem #8: Alien Dictionary (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. There is a new alien language that uses the English alphabet. However, the order of the letters is unknow…

MANG Problem #15: Basic Calculator II (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given a string s which represents an expression, evaluate this expression and return its value. The expre…

Problem: Binary Search (Easy)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an array of integers nums which is sorted in ascending order, and an integer target, write a functi…

Problem: Binary Tree In-order Traversal (Easy)

1. Problem Statement Mental Model > Thinking in recursive sub-problems and hierarchical branching. Given the root of a binary tree, return the inorder traversal of its nodes' values. In-order means: Left $\rightarrow$ Ro…

Problem: Binary Tree Level Order Traversal

1. Problem Statement Mental Model > Thinking in recursive sub-problems and hierarchical branching. Given the root of a binary tree, return the level order traversal of its nodes' values. (i.e., from left to right, level…

MANG Problem #29: Burst Balloons (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given n balloons, indexed from 0 to n - 1. Each balloon is painted with a number on it represente…

Problem: Coin Change

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given an integer array coins representing coins of different denominations and an integer amount. Re…

Problem: Combination Sum

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an array of distinct integers candidates and a target, return a list of all unique combinations where…

Problem: Container With Most Water (Medium)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given an integer array height of length n. There are n vertical lines drawn such that the two end…

MANG Problem #46: Count Vowels Permutation (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an integer n, your task is to count how many strings of length n can be formed under the following…

Problem: Course Schedule (Topological Sort)

1. Problem Statement Mental Model > Imposing order to reduce the search space complexity. There are a total of numCourses courses you have to take, labeled from 0 to numCourses - 1. You are given an array prerequisites w…

MANG Problem #43: Cut Off Trees for Golf Event (Hard)

1. Problem Statement Mental Model > Thinking in recursive sub-problems and hierarchical branching. You are asked to cut off all the trees in a forest for a golf event. The forest is represented as an m x n matrix. In thi…

Problem: Daily Temperatures (Monotonic Stack)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an array of integers temperatures represents the daily temperatures, return an array answer such th…

MANG Problem #42: Design In-Memory File System (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Design a data structure that simulates an in-memory file system. Implement the FileSystem class: - List l…

MANG Problem #39: Design Search Autocomplete System (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Design a search autocomplete system for a search engine. Users may input a sentence (at least one word an…

MANG Problem #13: Edit Distance (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given two strings word1 and word2, return the minimum number of operations required to convert word1 to w…

MANG Problem #24: Employee Free Time (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. We are given a list schedule of employees, which represents the working time for each employee. Each empl…

MANG Problem #34: Find Median from Data Stream (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The median is the middle value in an ordered integer list. If the size of the list is even, there is no m…

MANG Problem #27: First Missing Positive (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an unsorted integer array nums, return the smallest missing positive integer. You must implement an…

Problem: Flood Fill (Easy)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. An image is represented by an m x n integer grid image where image[i][j] represents the pixel value of th…

Problem: Group Anagrams

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an array of strings strs, group the anagrams together. You can return the answer in any order. An A…

MANG Problem #33: Insert Interval (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given an array of non-overlapping intervals intervals where intervals[i] = [starti, endi] represe…

Problem: Jump Game

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given an integer array nums. You are initially positioned at the array's first index, and each eleme…

Problem: Koko Eating Bananas (Search on Answer)

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Koko loves to eat bananas. There are n piles of bananas. Koko can decide her eating speed of k bananas per h…

Problem: Kth Largest Element in an Array

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an integer array nums and an integer k, return the k-th largest element in the array. Note that it is…

MANG Problem #14: K-th Smallest in Lexicographical Order (Hard)

1. Problem Statement Mental Model > Mapping relationships and traversals between nodes. Given two integers n and k, return the k-th lexicographically smallest integer in the range [1, n]. Input: n = 13, k = 2 Output: 10…

MANG Problem #26: Largest Rectangle in Histogram (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an array of integers heights representing the histogram's bar height where the width of each bar is…

MANG Problem #16: LFU Cache Design (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Design and implement a data structure for a Least Frequently Used (LFU) cache. - LFUCache(int capacity):…

Problem: Linked List Cycle (Easy)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given head, the head of a linked list, determine if the linked list has a cycle in it. There is a cycle i…

MANG Problem #22: Longest Increasing Path in a Matrix (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an m x n integers matrix, return the length of the longest increasing path in matrix. From each cel…

Problem: Longest Increasing Subsequence

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence…

Problem: Longest Substring with K Distinct Characters

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given a string, find the length of the longest substring in it with no more than k distinct characters. Appr…

MANG Problem #11: Longest Valid Parentheses (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given a string containing just the characters ( and ), return the length of the longest valid (well-forme…

Problem: Lowest Common Ancestor of a Binary Tree

1. Problem Statement Mental Model > Thinking in recursive sub-problems and hierarchical branching. Given a binary tree, find the lowest common ancestor (LCA) of two given nodes in the tree. According to the definition of…

Apr 26, 20267 min read

MANG Problem #5: LRU Cache Design (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the…

MANG Problem #41: Making A Large Island (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given an n x n binary matrix grid. You are allowed to change at most one 0 to be 1. Return the si…

Problem: Maximum Sum Subarray of Size K

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an array of positive numbers and a positive integer k, find the maximum sum of any contiguous subarray…

MANG Problem #25: Maximal Rectangle (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given a rows x cols binary matrix filled with 0's and 1's, find the largest rectangle containing only 1's…

MANG Problem #45: Maximize Score After N Operations (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given nums, an array of positive integers of size 2 n. You must perform n operations. In the i-th…

Problem: Maximum Depth of Binary Tree

Problem Statement Mental Model > Thinking in recursive sub-problems and hierarchical branching. Given the root of a binary tree, return its maximum depth. A binary tree's maximum depth is the number of nodes along the lo…

MANG Problem #35: Maximum Profit in Job Scheduling (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a prof…

MANG Problem #2: Median of Two Sorted Arrays (Expert)

1. Problem Statement Mental Model > Imposing order to reduce the search space complexity. Given two sorted arrays nums1 and nums2 of size m and n respectively, return the median of the two sorted arrays. The overall run…

Problem: Meeting Rooms (Interval Scheduling)

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given a list of meeting intervals [start, end], find the maximum number of meetings one person can attend, a…

Problem: Merge Intervals

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and ret…

MANG Problem #4: Merge K Sorted Lists (Hard)

1. Problem Statement Mental Model > Imposing order to reduce the search space complexity. You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the linked-lists into one…

MANG Problem #23: Minimum Window Subsequence (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given strings S and T, find the minimum (contiguous) substring W of S, such that T is a subsequence of W.…

MANG Problem #37: Minimum Number of K Consecutive Bit Flips (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given a binary array nums and an integer k. A k-bit flip is choosing a subarray of length k from…

Problem: Minimum Window Substring

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given two strings s and t, return the minimum window substring of s such that every character in t (includin…

Problem: Move Zeroes (Easy)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an integer array nums, move all 0's to the end of it while maintaining the relative order of the no…

MANG Problem #12: N-Queens (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The n-queens puzzle is the problem of placing n queens on an n x n chessboard such that no two queens att…

Problem: Analyze Nested Loops

Scenario 1: The Sequential Loop Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Analysis: - Loop 1: $O(n)$ - Loop 2: $O(n)$ - Total: $O(2n) \rightarrow \mathbf{O(n)}$ (Consta…

Problem: Next Greater Element I

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The next greater element of some element x in an array is the first greater element that is to the right of…

Problem: Number of 1 Bits (Easy)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Write a function that takes the binary representation of an unsigned integer and returns the number of '1…

Problem: Number of Islands (DFS/BFS)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the num…

MANG Problem #38: Palindrome Pairs (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given a list of unique words, return all the pairs of the distinct indices (i, j) in the given list, so t…

MANG Problem #48: Parallel Courses III (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given an integer n, which indicates that there are n courses labeled from 1 to n. You are also gi…

Problem: Permutations

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an array nums of distinct integers, return all the possible permutations. You can return the answer in…

MANG Problem #49: Prefix and Suffix Search (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Design a special dictionary that searches the words in it by a prefix and a suffix. Implement the WordFil…

MANG Problem #44: Race Car (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Your car starts at position 0 and speed +1 on an infinite number line. Your car can go into negative posi…

Problem: Range Sum Query (Easy)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an integer array nums, handle multiple queries of the following type: 1. Calculate the sum of the e…

Problem: Analyze Recursive Depth

Recursive Factorial Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Time Complexity - We make $n$ calls: f(5) -> f(4) -> f(3) -> f(2) -> f(1). - Total: $\mathbf{O(n)}$. Space…

MANG Problem #31: Regular Expression Matching (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an input string s and a pattern p, implement regular expression matching with support for '.' and '…

Remove Duplicates from Sorted Array (In-Place)

1. Problem Statement Mental Model > Imposing order to reduce the search space complexity. Given an integer array nums sorted in non-decreasing order, remove the duplicates in-place such that each unique element appears o…

MANG Problem #7: Reverse Nodes in k-Group (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given the head of a linked list, reverse the nodes of the list k at a time and return the modified list.…

Problem: Reverse a Linked List

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given the head of a singly linked list, reverse the list, and return the reversed list. Approach: In-Place R…

Problem: Search in Rotated Sorted Array

1. Problem Statement Mental Model > Imposing order to reduce the search space complexity. There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is p…

MANG Problem #36: Serialize and Deserialize BST (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Serialization is converting a data structure to a sequence of bits. Design an algorithm to serialize and…

MANG Problem #21: Serialize and Deserialize Binary Tree (Hard)

1. Problem Statement Mental Model > Thinking in recursive sub-problems and hierarchical branching. Serialization is the process of converting a data structure or object into a sequence of bits so that it can be stored in…

MANG Problem #50: Sliding Puzzle (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. On an 2 x 3 board, there are five tiles labeled from 1 to 5, and an empty square represented by 0. A move…

MANG Problem #6: Sliding Window Maximum (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given an array of integers nums, there is a sliding window of size k which is moving from the ver…

MANG Problem #30: Smallest Range Covering Elements from K Lists (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You have k lists of sorted integers in non-decreasing order. Find the smallest range that includes at lea…

MANG Problem #10: Sudoku Solver (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Write a program to solve a Sudoku puzzle by filling the empty cells. A sudoku solution must satisfy all o…

MANG Problem #40: Swim in Rising Water (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given an n x n integer matrix grid where each value grid[i][j] represents the elevation at that p…

MANG Problem #1: Trapping Rain Water (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how…

MANG Problem #9: Binary Tree Maximum Path Sum (Hard)

1. Problem Statement Mental Model > Thinking in recursive sub-problems and hierarchical branching. A path in a binary tree is a sequence of nodes where each pair of adjacent nodes in the sequence has an edge connecting t…

Two Sum II: Input Array Is Sorted (Two Pointers)

1. Problem Statement Mental Model > Imposing order to reduce the search space complexity. Given a 1-indexed array of integers numbers that is already sorted in non-decreasing order, find two numbers such that they add up…

Problem: Valid Anagram (Easy)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given two strings s and t, return true if t is an anagram of s, and false otherwise. An Anagram is a word…

MANG Problem #47: Valid Arrangement of Pairs (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. You are given a 0-indexed 2D integer array pairs where pairs[i] = [starti, endi]. An arrangement of pairs…

Problem: Valid Palindrome (Easy)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing a…

Problem: Valid Parentheses

Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given a string s containing just the characters (, ), {, }, [ and ], determine if the input string is valid.…

Problem: Validate Binary Search Tree

Problem Statement Mental Model > Thinking in recursive sub-problems and hierarchical branching. Given the root of a binary tree, determine if it is a valid Binary Search Tree (BST). A valid BST is defined as follows: - T…

MANG Problem #32: Word Break II (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given a string s and a dictionary of strings wordDict, add spaces in s to construct a sentence where each…

MANG Problem #17: Word Ladder (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence o…

MANG Problem #28: Word Ladder II (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given two words, beginWord and endWord, and a dictionary wordList, return all the shortest transformation…

MANG Problem #3: Word Search II (Hard)

1. Problem Statement Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Given an m x n board of characters and a list of strings words, return all words on the board. Each word…

The Sliding Window Pattern: Eliminating Redundant Calculations

What is a Sliding Window? Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Sliding Window pattern is a specific optimization of the Two Pointers technique. It is used when…

Tree Traversals in Java: Mastering BFS and DFS for Coding Interviews

Introduction to Tree Traversals Mental Model > Thinking in recursive sub-problems and hierarchical branching. Trees are foundational data structures in computer science, representing hierarchical relationships. Unlike ar…

Apr 26, 20268 min read

Trie (Prefix Tree) in Java: The Ultimate Data Structure for String Problems

Deep Dive: Trie Implementation Mental Model > Thinking in recursive sub-problems and hierarchical branching. When you type a query into Google, how does it instantly suggest the rest of your sentence? When you type a mis…

Apr 26, 20268 min read

The Two Pointers Pattern: Mastering Linear Array Optimizations

Why Two Pointers are Mandatory for Staff Interviews Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. In a standard array iteration, we use a single loop that moves from $0$ to…

Centroid Decomposition in Java: Solving Tree Path Problems

When dealing with problems that involve paths in a tree (like "how many paths have a length exactly $K$?"), a simple DFS might take $O(N^2)$. Centroid Decomposition is a divide-and-conquer technique that reduces this com…

Apr 21, 20267 min read

Heavy-Light Decomposition in Java: Optimizing Tree Queries

When dealing with large trees, performing path queries (like finding the maximum value on a path between two nodes) or path updates can be slow. A naive approach takes $O(N)$, and while Segment Trees work for arrays, the…

Apr 21, 20265 min read

Link-Cut Trees in Java: Dynamic Tree Connectivity

While Heavy-Light Decomposition (HLD) is excellent for static trees, it struggles with dynamic trees where edges are frequently added or removed. Link-Cut Trees (LCT) are the solution to this problem, allowing us to main…

Apr 21, 20266 min read

Suffix Automaton in Java: The Ultimate String Data Structure

When it comes to string processing, the Suffix Automaton (SAM) is often considered the most powerful data structure. It is a minimal Deterministic Finite Automaton (DFA) that recognizes all suffixes of a given string. Wh…

Apr 21, 20265 min read

AVL Trees: Self-Balancing Binary Search Trees

AVL Trees (Self-Balancing BST) Mental Model > Thinking in recursive sub-problems and hierarchical branching. An AVL Tree is a self-balancing Binary Search Tree (BST) where the difference between heights of left and right…

Cassandra Internals: LSM-Trees, Gossip, and Eventual Consistency

Cassandra Internals: Built for Scale Mental Model > Connecting isolated components into a resilient, scalable, and observable distributed web. Apache Cassandra is a peer-to-peer distributed database designed to handle ma…

Deep DiveDatabase Engineering Mastery

#databases#dsa#system-design

The 'Small Files' Problem in Data Lakes: Why Your Kafka Sink is Slow

The 'Small Files' Problem: The Data Lake Killer Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Streaming data from Kafka into a Data Lake (like Amazon S3 or Azure Blob Stora…

#aws#data-engineering#dsa

Database Sharding Part 4: Consistent Hashing Internals

In Part 3, we successfully identified userid as our shard key. Now, we must write the mathematical algorithm that routes an incoming query containing userid: 1045 to the correct physical database server. The most intuiti…

Deep DiveDatabase Sharding Mastery

#databases#dsa#system-design

Bypassing the Kernel: User-Space Networking for Sub-Microsecond Performance

Bypassing the Kernel Mental Model > Connecting isolated components into a resilient, scalable, and observable distributed web. For high-frequency trading (HFT) and ultra-low-latency messaging, even the Linux kernel's net…

Deep DivePerformance & Optimization Mastery

HyperLogLog at Scale: Billion-Cardinality Estimation

HyperLogLog at Scale Mental Model > Connecting isolated components into a resilient, scalable, and observable distributed web. Counting unique users (cardinality) for billions of events is a classic trade-off problem. Do…

Deep DiveStaff Engineer Playbooks

#databases#dsa#java

Kosaraju's Algorithm for Strongly Connected Components

Kosaraju's Algorithm Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. A Strongly Connected Component (SCC) of a directed graph is a maximal subset of vertices such that for ev…

LSM-Tree Compaction Strategies: Leveled vs. Size-Tiered

LSM-Tree Compaction Strategies Mental Model > Connecting isolated components into a resilient, scalable, and observable distributed web. LSM-tree based databases (Cassandra, RocksDB, ScyllaDB) don't update data in place.…

Deep DiveBackend Systems Mastery

#ai-ml#databases#dsa

Manacher's Algorithm in Java: Linear Time Palindrome Search

Finding the longest palindromic substring is a classic interview problem. While the naive approach takes $O(N^3)$ and dynamic programming takes $O(N^2)$, Manacher's Algorithm achieves the same result in linear time ($O(N…

Mo's Algorithm: Offline Range Queries

Mo's Algorithm Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Mo's Algorithm is a powerful offline technique used to solve range query problems. It is particularly effective…

Red-Black Trees in Java: The Engine Behind TreeMap and HashMap

If you've ever used java.util.TreeMap or java.util.TreeSet, you've already used a Red-Black Tree. It is the most popular self-balancing binary search tree in modern software libraries because it offers a perfect balance…

Apr 20, 20265 min read

Redis Internals: Event Loop, Data Structures, and Persistence

Redis Internals: The Speed of Single-Threading Mental Model > A low-latency memory buffer protecting your primary data source from read spikes. Redis is often categorized as just a "cache," but its internal architecture…

Deep DiveDatabase Engineering Mastery

#databases#dsa#java

Segment Tree Data Structure: Efficient Range Queries

Segment Tree Data Structure Mental Model > Thinking in recursive sub-problems and hierarchical branching. A Segment Tree is a versatile data structure used to perform range queries and updates efficiently. It allows us t…

Skip Lists in Java: The Probabilistic Alternative to Balanced Trees

A Skip List is a probabilistic data structure that allows for fast search, insertion, and deletion in a sorted list of elements. It is often described as a "multi-layered linked list." While balanced trees like AVL or Re…

Apr 20, 20265 min read

B-Trees vs. LSM-Trees: The Battle of Storage Engine Internals

B-Trees vs. LSM-Trees: Choosing Your Storage Engine Mental Model > Connecting isolated components into a resilient, scalable, and observable distributed web. At the heart of every database is a storage engine that decide…

Deep DiveDatabase Engineering Mastery

#ai-ml#databases#dsa

System Design: Designing a Local-First Key-Value Store (LevelDB/RocksDB)

System Design: Designing a Local-First Key-Value Store Mental Model > Connecting isolated components into a resilient, scalable, and observable distributed web. While distributed systems get all the glory, the foundation…

System Design: Designing Google Maps (Navigation and ETA)

System Design: Designing Google Maps Mental Model > Connecting isolated components into a resilient, scalable, and observable distributed web. Designing a navigation system like Google Maps or Waze involves managing mass…

System Design: Designing an Online Judge (LeetCode/HackerRank)

System Design: Designing an Online Judge Mental Model > Connecting isolated components into a resilient, scalable, and observable distributed web. An Online Judge system like LeetCode, Codeforces, or HackerRank allows us…

#devops#dsa#system-design

System Design: Solving the Top K Problem (Heavy Hitters)

System Design: Solving the Top K Problem Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The "Top K" problem (or Heavy Hitters) is about finding the $ most frequent items in…

Tarjan's Algorithm in Java: Finding Strongly Connected Components

In a directed graph, a Strongly Connected Component (SCC) is a maximal subgraph where every node is reachable from every other node. Identifying these components is crucial for solving problems related to dependency anal…

Trie (Prefix Tree) Data Structure - Java Implementation and Use Cases

Trie (Prefix Tree) Data Structure in Java Mental Model > Thinking in recursive sub-problems and hierarchical branching. A Trie, also known as a Prefix Tree, is a specialized tree-based data structure used to store a dyna…

A* Search Algorithm in Java: Heuristic Pathfinding

The A (A-Star) search algorithm is one of the most successful pathfinding algorithms in computer science. It is widely used in video games and robotics because it is both efficient and guaranteed to find the shortest pat…

B-Trees and B+ Trees in Java: The Engines of Modern Databases

While Binary Search Trees (BST) and AVL trees are great for in-memory operations, they perform poorly when data is stored on disk. This is where B-Trees and B+ Trees shine. They are the underlying data structures for alm…

Backtracking Pattern in Java: Permutations and Combinations

Deep Dive: Backtracking Patterns Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Backtracking is a general algorithmic technique for solving problems that incrementally build…

Apr 19, 202613 min read

Bellman-Ford Algorithm in Java: Shortest Paths with Negative Weights

Introduction to Bellman-Ford Algorithm Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Bellman-Ford Algorithm is a single-source shortest path algorithm that works on weighte…

Apr 19, 202612 min read

Bloom Filters in Java: Probabilistic Data Structures

A Bloom Filter is a space-efficient probabilistic data structure used to test whether an element is a member of a set. It is unique because it can give two types of answers: 1. "Possibly in set": The element might be the…

Boyer-Moore Voting Algorithm in Java: Finding the Majority Element

Finding the "majority element" in an array (an element that appears more than $n/2$ times) is a classic interview problem. While you could solve it with a Hash Map in $O(n)$ time and $O(n)$ space, the Boyer-Moore Voting…

Dijkstra's Algorithm in Java: Finding the Shortest Path

Dijkstra's algorithm is the industry standard for finding the shortest path from a starting node to all other nodes in a graph with non-negative edge weights. Whether you are building a navigation system like Google Maps…

Deep DiveDSA Mastery

Fenwick Trees (Binary Indexed Trees) in Java

The Fenwick Tree, also known as a Binary Indexed Tree (BIT), is a compact data structure that provides efficient methods for calculation and manipulation of the prefix sums of an array of values. It is more space-efficie…

Floyd-Warshall Algorithm in Java: All-Pairs Shortest Paths

While Dijkstra's algorithm finds the shortest path from a single source to all other nodes, the Floyd-Warshall algorithm finds the shortest paths between all pairs of vertices in a weighted graph. It is a classic example…

Huffman Coding in Java: Lossless Data Compression

Huffman Coding is a classic greedy algorithm used for lossless data compression. It assigns variable-length codes to input characters, with shorter codes assigned to more frequent characters. This is the foundation of ma…

Kadane's Algorithm in Java: Maximum Sum Subarray

Finding the Maximum Sum Subarray is a classic problem that can be solved in $O(n^2)$ using brute force. However, Kadane's Algorithm allows us to solve it in a single pass ($O(n)$ time and $O(1)$ space). It is a beautiful…

Kruskal's Algorithm in Java: Finding the Minimum Spanning Tree

Kruskal's algorithm is a famous greedy algorithm used to find the Minimum Spanning Tree (MST) of a connected, weighted, and undirected graph. An MST is a subset of edges that connects all vertices together, without any c…

Longest Common Subsequence (LCS) in Java: Dynamic Programming Guide

The Longest Common Subsequence (LCS) problem is a foundation of many string comparison tools, including git diff and bioinformatics software. A subsequence is a sequence that appears in the same relative order, but not n…

Lowest Common Ancestor (LCA) in Java: Binary Trees and DAGs

Introduction to Lowest Common Ancestor (LCA) Mental Model > Thinking in recursive sub-problems and hierarchical branching. The Lowest Common Ancestor (LCA) of two nodes p and q in a tree (or a Directed Acyclic Graph - DA…

Apr 19, 202612 min read

LRU Cache Implementation in Java: $O(1)$ Strategy

The LRU (Least Recently Used) Cache is one of the most popular interview questions because it tests your ability to design a custom data structure. It requires you to maintain a fixed-size cache and, when full, evict the…

Matrix Traversal in Java: Spiral, Diagonal, and Flood Fill

Introduction to Matrix Traversal Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Matrices (or 2D arrays) are fundamental data structures used to represent grids, images, game…

Apr 19, 202613 min read

N-Queens Problem in Java: Solving Constraints with Backtracking

Introduction to the N-Queens Problem Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The N-Queens puzzle is the problem of placing N non-attacking queens on an N×N chessboard…

Apr 19, 202612 min read

Prim's Algorithm in Java: Minimum Spanning Tree via Greedy Growth

While Kruskal's algorithm focuses on edges, Prim's algorithm takes a vertex-centric approach to finding the Minimum Spanning Tree (MST). It starts from an arbitrary node and "grows" the tree by always adding the cheapest…

Apr 19, 20265 min read

Rabin-Karp Algorithm in Java: Efficient String Searching with Hashing

The Rabin-Karp algorithm is a powerful string searching algorithm that uses hashing to find any one of a set of pattern strings in a text. While brute-force matching takes $O(n \cdot m)$ time, Rabin-Karp achieves an aver…

Apr 19, 20265 min read

Sudoku Solver in Java: Efficient Backtracking and Pruning

Introduction to the Sudoku Solver Problem Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Sudoku puzzle is a classic number-placement puzzle. The objective is to fill a 9…

Apr 19, 202611 min read

Suffix Arrays and Suffix Trees in Java: Advanced String Structures

When it comes to advanced string processing, Suffix Trees and Suffix Arrays are the heavy hitters. They allow you to answer complex queries about a string—like "What is the longest repeated substring?" or "How many times…

Z-Algorithm in Java: Linear Time String Matching

The Z-Algorithm is an efficient string matching algorithm that finds all occurrences of a pattern $P$ in a text $T$ in linear time $O(n + m)$. While many developers learn KMP (Knuth-Morris-Pratt), the Z-Algorithm is ofte…

BFS (Breadth First Search) in Java: Level-Order and Shortest Path

Introduction to Breadth First Search (BFS) Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Breadth First Search (BFS) is a fundamental algorithm for traversing or searching t…

Apr 18, 202611 min read

Big-O Notation in Java: Time and Space Complexity for Interview Problem Solving

Big-O notation scares a lot of people because it often gets explained as math first and problem solving second. In interviews, that is backward. You do not need to sound like a theoretician. You need to look at code, est…

Apr 18, 202611 min read

Binary Search Pattern in Java: Efficiently Searching Sorted Data

Introduction to the Binary Search Pattern Mental Model > Imposing order to reduce the search space complexity. The Binary Search pattern is a highly efficient algorithm for finding an item from a sorted list of items. It…

DFS (Depth First Search) in Java: Tree and Graph Traversals

Introduction to Depth First Search (DFS) Mental Model > Thinking in recursive sub-problems and hierarchical branching. Depth First Search (DFS) is a fundamental algorithm for traversing or searching tree or graph data st…

Dutch National Flag Pattern in Java: Efficient Three-Way Partitioning

Introduction to the Dutch National Flag (DNF) Pattern Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Dutch National Flag (DNF) pattern, also known as three-way partition…

Apr 18, 20269 min read

Fast & Slow Pointers in Java: Detecting Cycles and Finding Middle Elements

Introduction to the Fast & Slow Pointers Pattern Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Fast & Slow Pointers pattern, also known as the Hare and Tortoise algorit…

In-place Reversal of a Linked List in Java: Efficient Memory Management

Introduction to In-place Linked List Reversal Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. Reversing a linked list is a fundamental operation in Data Structures and Algori…

Apr 18, 20269 min read

Monotonic Queue Pattern in Java: Efficiently Solving Sliding Window Maximum

Introduction to the Monotonic Queue Pattern Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Monotonic Queue pattern, often implemented using a Deque (double-ended queue),…

Monotonic Stack Pattern in Java: Efficiently Finding Next Greater/Smaller Elements

Introduction to the Monotonic Stack Pattern Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Monotonic Stack pattern is a specialized application of the stack data structu…

Apr 18, 202611 min read

Prefix Sum Pattern in Java: Efficiently Calculate Range Sums and Subarray Properties

Introduction to the Prefix Sum Pattern Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Prefix Sum pattern is a fundamental technique in Data Structures and Algorithms (DS…

Apr 18, 20269 min read

Sorting Algorithms in Java: QuickSort, MergeSort, and HeapSort Explained

Introduction to Sorting Algorithms Mental Model > Imposing order to reduce the search space complexity. Sorting is one of the most fundamental and widely studied problems in computer science. It involves arranging elemen…

Topological Sort in Java: Handling Dependencies with Kahn's Algorithm

Introduction to Topological Sort Mental Model > Imposing order to reduce the search space complexity. Topological Sort (or Topological Ordering) is an algorithm for ordering the vertices of a Directed Acyclic Graph (DAG)…

Apr 18, 202610 min read

Union Find (DSU) in Java: Connectivity and Cycle Detection

Introduction to Union Find (Disjoint Set Union) Mental Model > Breaking down a complex problem into its most efficient algorithmic primitive. The Union Find data structure, also known as Disjoint Set Union (DSU), is a po…

Apr 18, 202610 min read