Crack The Backend
HomeCore BackendAlgorithmsSystem DesignData Structures
Navigation
OVERVIEW
GETTING STARTED
  • How to Think in Algorithm Patterns
  • Common Interview Mistakes
  • ETwo Sum
  • EValid Parentheses
  • EReverse Linked List
  • EMerge Two Sorted Lists
  • EMaximum Depth of Binary Tree
  • EInvert Binary Tree
  • EBest Time to Buy and Sell Stock
  • EValid Anagram
  • EContains Duplicate
  • EMissing Number
TWO POINTERS
  • When to Use Two Pointers
  • Fast & Slow Pointers
  • Opposite Direction Pointers
  • ETwo Sum II - Sorted Array
  • MContainer With Most Water
  • M3Sum
  • EValid Palindrome
  • ELinked List Cycle
  • MRemove Nth Node From End
  • HTrapping Rain Water
  • EMove Zeroes
  • ESquares of a Sorted Array
  • EBackspace String Compare
SLIDING WINDOW
  • Sliding Window Basics
  • Fixed-size Window
  • Variable-size Window
  • MMaximum Subarray (Kadane)
  • MLongest Substring Without Repeating Characters
  • MMinimum Size Subarray Sum
  • MSubarray Product Less Than K
  • MMax Consecutive Ones III
  • MLongest Repeating Character Replacement
  • MPermutation in String
  • HSliding Window Maximum
  • HMinimum Window Substring
  • HSubstring with Concatenation of All Words
BINARY SEARCH
  • Binary Search Fundamentals
  • Binary Search on Answer Space
  • Common Pitfalls
  • EBinary Search
  • ESearch Insert Position
  • MFind First and Last Position
  • MSearch in Rotated Sorted Array
  • MFind Minimum in Rotated Sorted Array
  • MCapacity To Ship Within D Days
  • MKoko Eating Bananas
  • HMedian of Two Sorted Arrays
  • HSplit Array Largest Sum
  • MMinimum Number of Days to Make m Bouquets
DFS & BACKTRACKING
  • DFS Thinking Model
  • Subsets & Combinations
  • Permutations
  • Pruning Techniques
  • MSubsets
  • MCombinations
  • MCombination Sum
  • MLetter Combinations of a Phone Number
  • MGenerate Parentheses
  • MWord Search
  • HN-Queens
  • HSudoku Solver
  • MPalindrome Partitioning
  • MRestore IP Addresses
BFS & GRAPH TRAVERSAL
  • BFS Fundamentals
  • Shortest Path (Unweighted)
  • Dijkstra
  • Grid & Matrix Traversal
  • MNumber of Islands
  • MShortest Path in Binary Matrix
  • MRotting Oranges
  • MWalls and Gates
  • HWord Ladder
  • MCourse Schedule
  • MClone Graph
  • MPacific Atlantic Water Flow
  • MSurrounded Regions
  • EFlood Fill
DYNAMIC PROGRAMMING
  • DP Thinking Framework
  • 1D DP
  • 2D DP
  • State Definition & Transition
  • EClimbing Stairs
  • MHouse Robber
  • MCoin Change
  • MLongest Increasing Subsequence
  • MWord Break
  • MCombination Sum
  • MUnique Paths
  • MLongest Common Subsequence
  • HEdit Distance
  • M0/1 Knapsack
GREEDY
  • Greedy Strategy Explained
  • Interval Scheduling
  • When Greedy Works
  • MJump Game
  • MMerge Intervals
  • MNon-overlapping Intervals
  • MTask Scheduler
  • MPartition Labels
  • EBest Time to Buy and Sell Stock II
  • MGas Station
  • MHuffman Coding
  • EFractional Knapsack
  • MMinimum Arrows to Burst Balloons
MONOTONIC STACK / QUEUE
  • Monotonic Stack Basics
  • Next Greater Element
  • Sliding Window Maximum
  • ENext Greater Element I
  • MDaily Temperatures
  • HLargest Rectangle in Histogram
  • HTrapping Rain Water
  • MRemove K Digits
  • MAsteroid Collision
  • MShortest Unsorted Continuous Subarray
  • MOnline Stock Span
  • MNext Greater Element II
HEAP / TOP K
  • Heap Fundamentals
  • Top K Problems
  • Streaming Scenarios
  • Nearest City With Shared Coordinate
  • MKth Largest Element in an Array
  • MTop K Frequent Elements
  • HMerge k Sorted Lists
  • HFind Median from Data Stream
  • MK Closest Points to Origin
  • MTask Scheduler
  • MFurthest Building You Can Reach
  • HSmallest Range Covering K Lists
  • MReorganize String
  • MMinimum Cost to Connect Sticks
MINIMUM SPANNING TREE
  • Prim's Algorithm
  • Kruskal's Algorithm
UNION FIND
  • Union Find Basics
  • Connectivity Problems
  • Cycle Detection
  • MNumber of Connected Components
  • MRedundant Connection
  • MAccounts Merge
  • MLongest Consecutive Sequence
  • HRegions Cut By Slashes
  • HSwim in Rising Water
  • MSmallest String With Swaps
  • MEvaluate Division
  • MSatisfiability of Equality Equations
  • HRemove Max Edges to Keep Graph Traversable
Computational Logic

Master the
Logic

Visualize complex data structures and optimize your code with our deep-dive modules on Divide & Conquer, Dynamic Programming, and more.

Get startedBrowse Articles
Trusted by:
D&C
Divide & Conquer
DP
Dynamic Prog.
GREEDY
Optimal Path
BIG O
Complexity

Latest Case Studies

  • How to Think in Algorithm Patterns

    A practical framework for mapping problems to common algorithm patterns so you don't start from scratch every time.

    Read more
  • Common Interview Mistakes

    Frequent pitfalls in coding interviews — overcomplicating, ignoring edge cases, poor communication, and how to avoid them.

    Read more
  • When to Use Two Pointers

    A guide to recognizing and applying the two-pointers pattern for arrays and strings, with common sub-patterns and pitfalls.

    Read more

© 2026 CrackTheBackend. All rights reserved.

Privacy PolicyTerms of ServiceCookie Settings