CodeArena
|
Leaderboard
All (0)
FizzBuzz
Palindrome Check
Fibonacci Number
Reverse String
Two Sum
Anagram Check
Count Vowels
Sum of Array
Capitalize Words
Remove Duplicates
Maximum of Array
Minimum of Array
Chunk Array
Zip Arrays
Array Intersection
Array Difference
Compact Array
Reverse Words
String to camelCase
String to kebab-case
Truncate String
Count Words
Caesar Cipher
ROT13
Repeat String
Factorial
Is Prime
Greatest Common Divisor
Least Common Multiple
Power of Two
Integer to Roman
Deep Clone Object
Pick Keys from Object
Omit Keys from Object
Invert Object
Flatten Array (Depth 1)
Title Case
Sum of Digits
Last N Elements
Balanced Brackets (Simple)
Roman to Integer
Binary Search
Maximum Subarray
Valid Parentheses
Merge Two Sorted Arrays
Flatten Nested Array
Longest Common Prefix
Climbing Stairs
Group Anagrams
Rotate Matrix 90 Degrees
Rotate Array
Merge Intervals
Product Except Self
Container With Most Water
Longest Palindromic Substring
Decode String
String Compression
Zigzag Conversion
Reverse Linked List (Array Sim)
Middle of Linked List (Array Sim)
Maximum Depth of Binary Tree
Invert Binary Tree
Level Order Traversal
Validate Binary Search Tree
House Robber
Longest Increasing Subsequence
Set Matrix Zeroes
Number of Islands
Word Break
Three Sum
Search in Rotated Sorted Array
Generate Parentheses
Permutations
Subsets
Combination Sum
Letter Combinations of Phone Number
Top K Frequent Elements
Sort Colors (Dutch Flag)
Spiral Matrix II (Generate)
Find Peak Element
Best Time to Buy and Sell Stock
Kth Largest Element
Search 2D Matrix
Unique Paths
Longest Substring Without Repeating
Spiral Matrix
LRU Cache
Coin Change
Word Search in Grid
Longest Common Subsequence
0/1 Knapsack
Edit Distance
Topological Sort
N-Queens
Valid Sudoku
Implement Trie (Prefix Tree)
Median of Two Sorted Arrays
Trapping Rain Water
Minimum Window Substring
Binary Tree Max Path Sum
Longest Valid Parentheses
Largest Rectangle in Histogram
Word Ladder
Merge K Sorted Arrays
Maximal Square
Decode Ways
Jump Game
Count Primes (Sieve)
Maximum Product Subarray
Task Scheduler
Array Sum
Array Maximum
Array Minimum
Flatten Array
Chunk Array
Zip Arrays
Array Intersection
Array Difference
Unique Elements
Compact Array
Reverse Array
Rotate Array
Array Includes
Array IndexOf
Fill Array
Copy Within Array
Every and Some Check
Count Occurrences
Remove Duplicates (Unsorted)
Second Largest Element
Moving Average
Pair Sum
Flatten to Depth
Group By
Partition Array
Sliding Window Maximum
Merge Intervals
Product of Array Except Self
Container With Most Water
Three Sum
Four Sum
Subarray Sum Equals K
Longest Consecutive Sequence
Jump Game
Gas Station
Rotate Image
Spiral Matrix Traversal
Next Permutation
Kth Largest Element
Top K Frequent Elements
Sort Colors (Dutch Flag)
Wiggle Sort
Majority Element II
Range Sum Query
Maximum Subarray Sum
Squares of Sorted Array
Search in Rotated Sorted Array
Find Minimum in Rotated Array
Search 2D Matrix
Set Matrix Zeroes
Pascal's Triangle
Missing Number in Range
Move Zeroes
Find Peak Element
Best Time to Buy and Sell Stock
Spiral Matrix II (Generate)
Median of Two Sorted Arrays
Trapping Rain Water
First Missing Positive
Maximum Product Subarray
Longest Increasing Subsequence
Count of Smaller Numbers After Self
Shortest Unsorted Continuous Subarray
Maximum Gap
Candy Distribution
Largest Rectangle in Histogram
Jump Game II
Max Points on a Line
K Inverse Pairs Array
Russian Doll Envelopes
Minimum Window Containing Subsequence
Maximum Sum Circular Subarray
Minimum Operations to Make Array Equal
Longest Mountain in Array
Minimum Swaps to Sort
Subarrays with K Different Integers
Last Element
Array Average
Generate Range
Count Positive and Negative
Interleave Arrays
Take and Drop
Check If Sorted
Frequency Map
Three Sum Closest
Reshape Matrix
Max Consecutive Ones
Array Leaders
Equilibrium Index
Reverse a String
Count Vowels
Capitalize First Letter
Is Palindrome
Repeat String
Truncate String
Remove All Spaces
First Unique Character
Count Words
Reverse Words in String
Title Case
Character Frequency
Is Subsequence
Longest Word
Basic String Compression
Pangram Checker
To camelCase
To kebab-case
Caesar Cipher
Valid Anagram
ROT13 Cipher
Run-Length Encoding
Run-Length Decoding
Longest Common Prefix
Group Anagrams
String Compression with Counts
Longest Substring Without Repeating
Add Strings
Zigzag Conversion
String to Integer (atoi)
Count and Say
Multiply Strings
Longest Palindromic Substring
Decode String
Word Break
Letter Combinations of Phone Number
Minimum Window Substring
Wildcard Matching
Palindrome Pairs
Generate Parentheses
Edit Distance
Interleaving String
Shortest Palindrome
Word Ladder Length
Text Justification
Palindrome Partitioning
Distinct Subsequences
Scramble String
Regular Expression Matching
Palindrome Partitioning II (Min Cuts)
Word Break II
Valid Number
Smallest Window Containing All Characters
Longest Valid Parentheses
String Transforms Into Another String
KMP String Search
Word Ladder II (All Shortest Paths)
Longest Duplicate Substring
Concatenated Words
Minimum Insertions to Make Palindrome
Suffix Array Construction
Burrows-Wheeler Transform
Z-Algorithm (Z-Array)
String Frequency Sort
Longest Repeated Substring
Shortest Superstring
Count Different Palindromic Subsequences
Inverse Burrows-Wheeler Transform
Aho-Corasick Multi-Pattern Search
Suffix Automaton - Count Distinct Substrings
Minimum Cuts for Unique Substrings
LCP Array from Suffix Array
Advanced Regex Engine
Manacher's Algorithm
Rope Data Structure
Minimum Palindrome Factorization
Full Regex Engine with Groups
Rabin-Karp Multi-Pattern Match with Collision Handling
Eertree (Palindromic Tree)
LZ77 Compression Simulation
Fibonacci (DP)
N-th Tribonacci Number
Climbing Stairs (DP)
Best Time to Buy and Sell Stock
Min Cost Climbing Stairs
Counting Bits
House Robber
Maximum Subarray (Kadane)
Coin Change
Longest Increasing Subsequence
Longest Common Subsequence
0/1 Knapsack
Unbounded Knapsack
Partition Equal Subset Sum
Target Sum
Unique Paths
Edit Distance
Word Break
Decode Ways
Jump Game II
Palindrome Partitioning II
Unique Paths with Obstacles
Matrix Chain Multiplication
Burst Balloons
Regular Expression Matching
Wildcard Matching
Interleaving String
Longest Valid Parentheses
Maximal Rectangle
Russian Doll Envelopes
Cherry Pickup
House Robber II (Circular)
Optimal Binary Search Tree
Traveling Salesman (Bitmask DP)
Digit DP: Count Numbers with Property
Bitmask DP: Minimum Cost Assignment
Tree DP: Binary Tree Maximum Path Sum
Probability DP: Knight Probability
Game Theory DP: Sprague-Grundy (Nim Variant)
Profile DP: Domino Tiling
Is Subsequence
Divisor Game
Range Sum Query (Immutable)
Maximum Product Subarray
Coin Change II (Number of Ways)
Longest Palindromic Subsequence
Minimum Path Sum
Perfect Squares
Longest Palindromic Substring
Minimum Falling Path Sum
Maximal Square
Integer Break
Distinct Subsequences
Scramble String
Super Egg Drop
Strange Printer
Stone Game (Game Theory DP)
Count Different Palindromic Subsequences
Frog Jump
Palindrome Removal
Delete and Earn
Ones and Zeroes
House Robber III (Tree)
Arithmetic Slices II (Subsequences)
Ugly Number II
Paint Houses (3 Colors)
Count Subsets with Sum
Dungeon Game
Shortest Common Supersequence
Number of Music Playlists
Minimum Cost to Merge Stones
Paint House III (Neighborhoods)
Student Attendance Record II
Number of Ways to Stay in Same Place
K Inverse Pairs Array
Pascal's Triangle Row
Minimum Cost For Tickets
Climbing Stairs with K Steps
Triangle Minimum Path
Longest String Chain
Best Time to Buy and Sell Stock with Cooldown
Best Time to Buy and Sell Stock IV (At Most K)
Longest Common Substring
Maximum Sum of 3 Non-Overlapping Subarrays
Number of Longest Increasing Subsequences
Minimum Insertion Steps to Make Palindrome
Count Vowels Permutation
Freedom Trail
Stickers to Spell Word
Number of Islands
Flood Fill
Surrounded Regions
Max Area of Island
Clone Graph
Course Schedule
Course Schedule II (Topological Sort)
Network Delay Time (Dijkstra)
Cheapest Flights Within K Stops
Is Graph Bipartite?
Word Ladder
Minimum Spanning Tree (Kruskal)
Union Find - Connected Components
Redundant Connection
Accounts Merge
Evaluate Division
Alien Dictionary
Shortest Path in Binary Matrix
Swim in Rising Water
Critical Connections (Bridges)
Strongly Connected Components
Pacific Atlantic Water Flow
Graph Valid Tree
All Paths From Source to Target
Rotting Oranges
Keys and Rooms
Min Cost to Connect All Points
Possible Bipartition
Reconstruct Itinerary
Shortest Path with Alternating Colors
Minimum Height Trees
Longest Path in DAG
Parallel Courses
Detect Cycle in Directed Graph
Find Eventual Safe States
Word Ladder II - All Shortest Paths
Graph Diameter (Tree Diameter)
Articulation Points
Eulerian Path
Shortest Path Visiting All Nodes
Floyd-Warshall All Pairs Shortest Path
Topological Sort (Kahn's BFS)
Maximum Flow (Ford-Fulkerson)
Minimum Cut
Hungarian Algorithm (Assignment Problem)
Chromatic Number
Hamiltonian Path
Traveling Salesman Approximation
Traveling Salesman Exact (Bitmask DP)
Maximum Bipartite Matching
Bipartite Matching via Network Flow
Graph Coloring (Backtracking)
Bellman-Ford Shortest Path
A* Search on Grid
Johnson's Algorithm (All Pairs with Negative Weights)
Maximum Independent Set
Minimum Vertex Cover
Graph Isomorphism Check
Maximum Clique
All Topological Orderings
Dijkstra with Priority Queue
Multi-Source BFS (Walls and Gates)
Graph BFS Level Order
Connected Components (DFS)
Shortest Path in Unweighted Graph
Path Exists (DFS)
Island Perimeter
Count Sub-Islands
Number of Provinces
DFS Traversal (Iterative)
Cycle Detection in Undirected Graph
Degree of Each Node
Check if Directed Graph is DAG
Adjacency List to Matrix
Adjacency Matrix to List
Number of Operations to Make Network Connected
Path with Maximum Probability
Maximal Network Rank
K Highest Ranked Items BFS
Minimum Cost Maximum Flow
Hamiltonian Cycle
Maximum Depth of Binary Tree
Invert Binary Tree
Same Tree
Symmetric Tree
Count Nodes
Sum of All Nodes
Count Leaf Nodes
Tree Height
Level Order Traversal
Binary Tree Right Side View
Zigzag Level Order Traversal
Path Sum
All Root-to-Leaf Paths
Lowest Common Ancestor
Validate Binary Search Tree
Sorted Array to BST
Serialize and Deserialize Binary Tree
Flatten Binary Tree to Linked List
Construct Tree from Preorder and Inorder
Kth Smallest Element in BST
Diameter of Binary Tree
Binary Tree Maximum Path Sum
Vertical Order Traversal
Binary Tree Inorder Traversal
Binary Tree Cameras
Distribute Coins in Binary Tree
Count Complete Tree Nodes (O(log^2 n))
Recover Binary Search Tree
Boundary Traversal
Morris Inorder Traversal
Maximum Width of Binary Tree
Sum Root to Leaf Numbers
Segment Tree: Range Sum Query
Segment Tree: Range Minimum Query
Persistent Array (Versioned Updates)
Trie (Prefix Tree) Implementation
Heavy-Light Decomposition: Path Queries
Centroid Decomposition
Euler Tour with Range Sum Queries
Euler Tour LCA with Sparse Table
Preorder Traversal
Postorder Traversal
Minimum Value in Tree
Maximum Value in Tree
Balanced Binary Tree
Check Complete Binary Tree
Binary Tree Left Side View
Average of Levels in Binary Tree
Path Sum II (All Paths with Target)
Minimum Depth of Binary Tree
Search in BST
Insert into BST
Delete Node in BST
Construct BST from Preorder
Populate Next Right Pointers
Construct Tree from Postorder and Inorder
BST Iterator
LCA of BST
Subtree of Another Tree
Merge Two Binary Trees
Find Duplicate Subtrees
Sum of Left Leaves
House Robber III (Tree)
Longest Univalue Path
Closest Value in BST
Count Good Nodes
All Nodes at Distance K
Serialize and Deserialize BST
Serialize N-ary Tree
Deepest Leaves Sum
Fenwick Tree (Binary Indexed Tree)
Segment Tree with Lazy Propagation
AVL Tree Rotations
Validate Red-Black Tree Properties
Tree Isomorphism
Diameter of General Tree
Euler Tour with Range Max Queries
Virtual Tree (Auxiliary Tree)
Level Sums
Are Two Trees Mirror Images
Cousins in Binary Tree
Next Greater Node in Level Order
Maximum Level Sum
BST to Greater Sum Tree
Count Univalue Subtrees
Complete Binary Tree Inserter
Path Sum IV (Encoded Tree)
Link-Cut Tree Simulation
Linear Search
Find Minimum
Find Maximum
Is Array Sorted
Bubble Sort
Selection Sort
Insertion Sort
Binary Search (Sorting)
Counting Sort
Find Min and Max Simultaneously
Merge Sort
Quick Sort
Heap Sort
Radix Sort
Search in Rotated Sorted Array
Find Peak Element
Kth Smallest Element
Sort by Frequency
First and Last Position in Sorted Array
Shell Sort
Median of Two Sorted Arrays
Count Inversions
Pancake Sort
Topological Sort
Bucket Sort for Floats
Patience Sort
External Sort Simulation
Median from Data Stream
Search in 2D Sorted Matrix
Three-Way Partition
Sort Colors (Dutch National Flag)
Longest Increasing Subsequence Length
Find Minimum in Rotated Sorted Array
Merge Intervals
Sort Linked List (Merge Sort)
Merge K Sorted Arrays
Quickselect Algorithm
Kth Largest Element
Stable Partition
Four-Way Partition
Tim Sort Simulation
Intro Sort Simulation
Count Smaller Numbers After Self
Wiggle Sort
Sort Characters by Frequency
Smallest Range from K Lists
Inversion Count using BIT
Kth Smallest in Sorted Matrix
Pancake Sort Minimum Flips Count
Minimum Window Sort
Suffix Array Construction
Suffix Array with LCP
Bitonic Sort (Sorting Network)
Parallel Merge Sort Simulation
Cache-Oblivious Funnel Sort
Wavelet Tree Simulation
Optimal Binary Search Tree
Optimal Sorting with Minimum Comparisons
Gravity Sort (Bead Sort)
Cycle Sort
Tournament Sort
Ternary Search
Interpolation Search
Exponential Search
Jump Search
Two Sum in Sorted Array
Sort Array By Parity
Relative Sort Array
H-Index
Comb Sort
Cocktail Shaker Sort
Gnome Sort
Search Insert Position
Closest Pair of Points (1D)
Count Sort for Strings by Length
Sliding Window Maximum
Largest Number from Array
Count of Range Sum
Odd-Even Sort
Next Permutation
Squares of a Sorted Array
Top K Frequent Elements
Reverse Pairs
Maximum Gap
Median of Medians (Deterministic Select)
Count Linked List Nodes
Reverse Linked List
Find Tail of Linked List
Search in Linked List
Find Middle Node
Remove Duplicates from Sorted List
Nth Node From End
Append Node to List
Detect Cycle in Linked List
Palindrome Linked List
Delete Node by Value
Insert at Position
Merge Two Sorted Linked Lists
Remove All Occurrences of Duplicates
Intersection Value of Two Lists
Binary Linked List to Decimal
Add Two Numbers
Remove Nth Node From End
Swap Nodes in Pairs
Odd Even Linked List
Rotate Linked List
Partition Linked List
Reorder Linked List
Delete Middle Node
Add Two Numbers II (Forward Order)
Remove Zero Sum Consecutive Nodes
Next Greater Node In Linked List
Double a Number in Linked List
Find Cycle Start Node
Copy List with Random Pointer
Flatten Multilevel Doubly Linked List
Insertion Sort List
Sort List (Merge Sort)
Split Linked List in Parts
Reverse Linked List Between Positions
Swap Nodes at kth Positions
Reverse Nodes in k-Group
LRU Cache with Linked List
Merge In Between Linked Lists
Remove Nodes With Greater Right
Sort Linked List of 0s, 1s, 2s
Flatten a Sorted Multi-Level List
Add One to Linked List Number
Pairwise Swap Elements
Josephus Problem (Circular List)
Polynomial Addition using Linked Lists
Clone List with Next and Arbitrary Pointer
Reverse Alternate K Nodes
Merge K Sorted Lists
Multiply Two Numbers as Linked Lists
Subtract Two Numbers as Linked Lists
Rearrange Even and Odd Values
Flatten BST to Sorted Linked List
Detect and Remove Cycle
Zigzag Linked List
Rotate Linked List in Blocks
Skip List Search Simulation
Flatten Nested List Iterator
Sort Biotonic Linked List
Merge Sort Doubly Linked List
Polynomial Multiplication via Linked Lists
Reverse K Nodes Alternately (Recursive)
Sort Multilevel Linked List
Reverse K-Groups with Zero Fill
XOR Linked List Simulation
Unrolled Linked List Simulation
K-Way Merge with Duplicate Removal
Functional Linked List
Persistent Linked List
Self-Organizing List (Move to Front)
Self-Organizing List (Transpose)
LFU Cache with Linked Lists
Lock-Free List Simulation
Serialize/Deserialize Complex Linked List
Sparse Matrix as Linked Lists
Expression Evaluation with Linked List
Blockchain as Linked List
Dancing Links (DLX) - Exact Cover
Undo/Redo System with Linked List
Memory Allocator with Free List
Implement a Stack
Implement a Queue
Valid Parentheses
Reverse String with Stack
Min Stack
Balanced Brackets
Sort a Stack
Next Greater Element to the Right
Baseball Game
Evaluate Reverse Polish Notation
Daily Temperatures
Next Greater Element I
Implement Queue using Stacks
Implement Stack using Queues
Asteroid Collision
Decode String
Remove All Adjacent Duplicates in String
Backspace String Compare
Simplify Unix Path
Design Circular Queue
Remove All Adjacent Duplicates in String II
Exclusive Time of Functions
Trapping Rain Water (Stack)
Evaluate Postfix Expression
Validate Stack Sequences
Largest Rectangle in Histogram
Maximal Rectangle
Sliding Window Maximum
Basic Calculator
Basic Calculator II
Remove K Digits
Shortest Subarray with Sum at Least K
Minimum Add to Make Parentheses Valid
Score of Parentheses
132 Pattern
Sum of Subarray Minimums
Stock Span Problem
Next Greater Element II (Circular)
Number of Visible People in a Queue
Basic Calculator III
Tag Validator
Maximum Frequency Stack
Online Stock Span
Car Fleet
Longest Valid Parentheses
Largest Submatrix With Rearrangements
Remove Duplicate Letters
Car Fleet II
Priority Queue: Max Score After K Operations
Maximum Width Ramp
Stamping the Sequence
Strange Printer
Minimum Remove to Make Valid Parentheses
Expression Parsing with Custom Operators
Virtual Machine Stack Simulation
Infix to Postfix Conversion
Task Scheduler with Cooldown
Maximum Nesting Depth of Parentheses
Crawler Log Folder
Make The String Great
Number of Students Unable to Eat
Implement a Deque (Double-Ended Queue)
Max Stack
Next Smaller Element
Largest Values in Each Tree Level (BFS Queue)
Generate Parentheses
Minimum Cost Tree From Leaf Values
Interleave First and Second Half of Queue
Check for Redundant Braces
Flatten Nested List Iterator
Buildings With an Ocean View
Sum of Subarray Ranges
Steps to Make Array Non-Decreasing
Create Maximum Number
Number of Atoms
Reverse Substrings Between Each Pair of Parentheses
Sum of Distances to Nearest Smaller
Constrained Subsequence Sum
Monotone Queue: Jump Game VI
Maximal Range with Stack Constraints
The Celebrity Problem
Shortest Impossible Sequence of Rolls
Text Editor with Undo/Redo
Queue Reconstruction by Height
Ternary Expression Parser
Design Browser History
Minimum Number of Swaps to Make Balanced
Brace Expansion II
Binary Tree Preorder (Iterative Stack)
Valid Parenthesis String with Wildcards
Count Stack Permutations
Maximum Subarray Min-Product
Robot Collisions
Operations on Last K Elements
Longest Well-Performing Interval
All-O-one Data Structure
Dinner Plate Stacks
Two Sum (Hash Map)
Contains Duplicate
Single Number Using Set
Intersection of Two Arrays
Valid Anagram
Word Frequency Count
Ransom Note
Missing Number Using Set
First Unique Character
Isomorphic Strings
Happy Number
Jewels and Stones
Word Pattern
Intersection of Two Arrays II
Uncommon Words from Two Sentences
Majority Element
Group Anagrams
Longest Consecutive Sequence
Top K Frequent Elements
Valid Sudoku
Subarray Sum Equals K
Contiguous Array
Find All Anagrams in a String
Longest Substring with At Most K Distinct Characters
Minimum Index Sum of Two Lists
Brick Wall
Encode and Decode TinyURL
4Sum II
Longest Substring Without Repeating Characters
Sort Characters By Frequency
Task Scheduler
Copy List with Random Pointer (via HashMap)
LRU Cache
LFU Cache
Design HashMap
Design HashSet
Insert Delete GetRandom O(1)
Time Based Key-Value Store
Random Pick with Weight
Kth Distinct String in an Array
Longest Duplicate Substring
Maximum Frequency Stack
Repeated DNA Sequences
Logger Rate Limiter
All O(1) Data Structure
Snapshot Array
Group Shifted Strings
Fraction to Recurring Decimal
Substring with Concatenation of All Words
Minimum Window Substring
Max Points on a Line
Word Break with Hash Set
Alien Dictionary
Design Twitter
Palindrome Pairs
LFU Cache with Capacity Resize
Count of Range Sum
Find Median from Data Stream (Hash Map Approach)
Number of Atoms
Reconstruct Itinerary
Word Ladder (BFS with Hash Set)
Count Distinct Substrings (Rolling Hash)
Smallest Sufficient Team
Sum of Beauty of All Substrings
Consistent Hashing Simulation
Bloom Filter Implementation
Rabin-Karp String Search
MultiMap Data Structure
Count-Min Sketch
Cuckoo Hashing
Distributed Hash Table Simulation
LSM Tree Key-Value Store
Perfect Hashing (FKS Scheme)
Skip List Implementation
Concurrent HashMap Simulation
Extendible Hashing
Minimal Perfect Hash Function
Locality-Sensitive Hashing (LSH)
Hopscotch Hashing
Swiss Table (SIMD-Friendly Hash Map)
Factorial
Is Prime
Greatest Common Divisor
Least Common Multiple
Fibonacci (Iterative)
Power of Two
Count Digits
Sum of Digits
Reverse Integer
Absolute Value
Sieve of Eratosthenes
Prime Factorization
Modular Exponentiation
Roman Numeral to Integer
Integer to Roman Numeral
Base Conversion
Happy Number
Ugly Number
Perfect Number
Armstrong Number
Nth Ugly Number
Count Primes Below N
Extended Euclidean Algorithm
Modular Multiplicative Inverse
Chinese Remainder Theorem
Euler's Totient Function
Catalan Number
Fibonacci via Matrix Exponentiation
Fast Power (Binary Exponentiation)
Integer to English Words
Digital Root
Integer Square Root
Next Prime
Goldbach Pair
Collatz Sequence Length
Pascal's Triangle Row
Number of Divisors
Sum of Divisors
Mobius Function
Josephus Problem
Matrix Determinant
Nth Permutation Sequence
Power Set Count
Miller-Rabin Primality Test
Pollard's Rho Factorization
Continued Fraction of Square Root
Egyptian Fraction Decomposition
Binomial Coefficient mod Prime
Stirling Numbers (Second Kind)
Integer Partition Function
Primitive Pythagorean Triples
Modular Matrix Multiplication
Legendre Symbol
Count Derangements
Bell Numbers
Bernoulli Numbers
Stern-Brocot Path
Pell Numbers
Tribonacci Number
Lucas Numbers
Totient Summatory Function
Square Root Modulo Prime
Smallest Primitive Root
Sum of Two Squares
Polynomial Multiplication (FFT)
Number Theoretic Transform (NTT)
Discrete Logarithm (BSGS)
Quadratic Sieve Factorization
Elliptic Curve Point Addition
Elliptic Curve Scalar Multiplication
Zeckendorf Representation
Multiplicative Order
Farey Sequence
Cantor Pairing Function
Gaussian Integer Multiplication
Pisano Period
Garner's Algorithm
Stern's Diatomic Series
Lagrange Interpolation
Discrete Fourier Transform
Pollard p-1 Factorization
Cornacchia's Algorithm
Jacobi Symbol
Cipolla's Algorithm
Linear Recurrence Solver
Factorial (Recursive)
Sum of Digits (Recursive)
Count Digits (Recursive)
Sum of Array (Recursive)
Power Function (Recursive)
Reverse String (Recursive)
Palindrome Check (Recursive)
Fibonacci (Recursive with Memo)
Flatten Nested Array (Recursive)
Range (Recursive)
GCD (Euclidean Recursive)
Find Maximum (Recursive)
Tower of Hanoi
All Subsets (Power Set)
String Permutations
Deep Clone (Recursive)
Merge Sort
Quick Sort
Binary Search (Recursive)
Flood Fill (Recursive)
Generate Parentheses
Letter Combinations of Phone Number
Pow(x, n) - Fast Exponentiation
Count and Say
N-Queens Count
Combination Sum
All Root-to-Leaf Paths
Word Break (Recursive)
Sudoku Solver (Recursive Backtracking)
Regex Matching (Recursive)
JSON Stringify (Recursive)
Nested Object Sum
Expression Evaluator (Recursive Descent)
Count Inversions (Merge Sort)
Karatsuba Multiplication
Binary Tree Diameter (Recursive)
Closest Pair of Points
Skyline Problem
Maximum Subarray (Divide & Conquer)
Serialize and Deserialize Binary Tree
Matrix Chain Multiplication Order
Longest Common Subsequence (Recursive)
0/1 Knapsack (Recursive)
Edit Distance (Recursive)
Trie with Autocomplete (Recursive)
Optimal BST Cost (Recursive)
Painter's Partition Problem
K-th Element of Two Sorted Arrays
Strassen Matrix Multiplication (Simplified)
Convex Hull (Divide & Conquer)
Subsets with Duplicates
Wildcard Pattern Matching
Multiply Large Numbers (Recursive)
Optimal Game Strategy (Recursive)
Palindrome Partitioning
Interleaving Strings (Recursive)
Burst Balloons (Recursive)
Decode Ways (Recursive)
Scramble String (Recursive)
Largest Rectangle in Histogram (D&C)
Distinct Subsequences (Recursive)
Partition Equal Subset Sum
Super Egg Drop (Recursive)
Minimum Cost Tree From Leaf Values
Master Theorem Solver
Trampolining (Stack-safe Recursion)
Church Numerals
Mutual Recursion: Hofstadter
Y-Combinator Implementation
CPS Transform (Continuation-Passing Style)
Recursive Unfold (Anamorphism)
Generic Recursive Memoizer
Lambda Calculus Evaluator
Parser Combinator (Recursive)
Catamorphism (Generalized Fold)
SKI Combinator Calculus
Metacircular Evaluator
Simple Type Checker (Recursive)
Lazy Evaluation Engine
Zipper Data Structure (Recursive)
Assign Cookies
Maximum Units on a Truck
Best Time to Buy and Sell Stock II
Lemonade Change
Minimum Cost to Connect Sticks
Minimum Moves to Equal Array Elements
Largest Number from Array
Boats to Save People
Can Place Flowers
Maximum Ice Cream Bars
Minimum Meeting Rooms
Array Partition
Valid Parenthesis String
Two City Scheduling
Minimum Deletions for Unique Frequencies
Broken Calculator
Jump Game
Jump Game II
Gas Station
Wiggle Subsequence
Partition Labels
Queue Reconstruction by Height
Task Scheduler
Remove K Digits
Non-overlapping Intervals
Minimum Arrows to Burst Balloons
Reorganize String
Hand of Straights
Car Pooling
Reduce Array Size to Half
Bag of Tokens
Maximum Length of Pair Chain
Activity Selection Problem
Fractional Knapsack
Huffman Encoding Lengths
Minimum Platforms
Job Sequencing with Deadlines
Interval Scheduling Maximization
Maximum Number of Events
Split Array into Consecutive Subsequences
Minimum Cost to Hire K Workers
Meeting Scheduler
Video Stitching
Furthest Building You Can Reach
Maximum Performance of a Team
Minimum Deletions to Make String Balanced
Minimum Swaps to Sort
Advantage Shuffle
Minimum Number of Refueling Stops
IPO - Maximize Capital
Candy Distribution
Course Schedule III
Patching Array
Smallest Range Covering K Lists
Remove Duplicate Letters
Maximum Sum of 3 Non-Overlapping Subarrays
Create Maximum Number
Minimum Cost Tree From Leaf Values
Minimum Number of Taps
Maximum Profit in Job Scheduling
Minimum Operations to Reduce to One
Stamping the Sequence
Earliest Possible Day of Full Bloom
String Without AAA or BBB
Weighted Job Scheduling
Optimal File Merge Pattern
Russian Doll Envelopes
Split Array into Fibonacci Sequence
Matroid Scheduling Simulation
Cheapest Flights Within K Stops
Maximum Points from Cards
Minimum Replacements to Sort Array
Secretary Problem (Optimal Stopping)
Ski Rental Problem
Greedy Exchange Argument Validator
Two Machine Task Assignment
Online Caching (k-Server Problem)
Minimum Cost to Cut a Stick
Maximum Total Beauty of Gardens
Maximum Building Height
Generate Parentheses (n=2)
Subsets
Permutations
Generate Binary Strings
Combinations
Letter Case Permutation
Phone Letter Combinations
Count Subsets with Sum
Subsets II (with Duplicates)
Permutations II (with Duplicates)
String Permutations
Path Sum in Array Tree
Generate Parentheses (General)
Combination Iterator
K-Length Subset Sum
Subset Sum Exists
Combination Sum
Combination Sum II
Combination Sum III
Increasing Subsequences
Palindrome Partitioning
Restore IP Addresses
Word Search
Beautiful Arrangement
N-Queens Count (Small)
Sudoku Validator
Letter Tile Possibilities
Split Array into Fibonacci
Word Break (Backtracking)
Factor Combinations
Generalized Abbreviation
Additive Number
N-Queens (Full Solutions)
Sudoku Solver
Target Sum with +/- Operations
Maximum Length of Concatenated Unique Chars
Word Search II
Partition to K Equal Sum Subsets
Unique Paths III
Matchsticks to Square
Combination Sum IV (Ordered)
All Paths from Source to Target
Gray Code
Minimum Stickers to Spell Word
Word Ladder II (All Shortest Paths)
Maximum Island Area via Backtracking
Distribute Repeating Integers
Domino Tiling of 2xN Board
Expression Add Operators
Remove Invalid Parentheses
Word Break II
24 Game
Parse Chemical Formula
Ambiguous Coordinates
Tiling with L-Triominoes
Hamiltonian Path Exists
Graph Coloring (Chromatic Check)
Knight's Tour (Small Board)
Word Pattern II
Optimal Account Balancing
Hamiltonian Cycle
Zuma Game
Concatenated Words via Backtracking
Verbal Arithmetic Puzzle
Crossword Solver
N-Queens Count (Large N)
Word Squares
Paint House III (Neighborhoods)
Cryptarithmetic Solver (SEND+MORE=MONEY)
Generic Cryptarithmetic Solver
Regular Expression Matching
Wildcard Pattern Matching
CSP: Map Coloring with Constraints
Interval Scheduling with Backtracking
Exact Cover Problem
Number Placement Puzzle
Pentomino Rectangle Tiling
Dancing Links (Algorithm X)
Multi-Sudoku Solver
N-Queens Bitmask All Solutions (N=14)
Power Set Size
Count Structurally Unique BSTs
All k-Element Subsets Sum
Nested List Weight Sum
Decode Ways with Backtracking
Path with Maximum Gold
Flip Binary Tree to Match Preorder
Maximum Score Words Formed by Letters
Pattern Match in Grid
Remove Boxes (Maximum Points)
Count Numbers with Unique Digits
Cherry Pickup via Backtracking
Shortest Superstring via Backtracking
Generate All Structurally Unique BSTs
Maximum Number After K Swaps
Frog Jump (Backtracking)
Robot Room Cleaner Simulation
Squareful Arrays
Maximum Word Rectangle
Traveling Salesman (Exact)
Check Even or Odd
Get Bit at Position
Set Bit at Position
Clear Bit at Position
Count Set Bits (Hamming Weight)
Power of Two
Toggle Bit at Position
Power of Four
Hamming Distance
Reverse Bits
Number Complement
Missing Number
Single Number
Add Without Plus Operator
Swap Two Numbers Without Temp
Binary Gap
Single Number II
Single Number III
Counting Bits Array
Gray Code
Bitwise AND of Numbers Range
UTF-8 Validation
Reverse Bits in Each Byte
Decode XORed Array
Generate Subsets via Bitmask
XOR Queries of a Subarray
Minimum Flips to Make a OR b Equal c
Total Hamming Distance
Repeated DNA Sequences
Divide Two Integers (Bit Manipulation)
Letter Case Permutation
Concatenation of Consecutive Binary Numbers
Maximum XOR of Two Numbers in Array
Find the Duplicate Number (XOR approach)
Minimum Number of Flips to Convert
Find Rightmost Differing Bit
Longest Consecutive 1s After One Flip
Next Higher Power of Two
Compute Parity of a Number
Absolute Value Without Branching
Maximum Product of Word Lengths
Count Pairs With XOR in Range
Circular Bit Shift
Interleave Bits of Two Numbers
Minimum XOR Sum of Two Arrays
Enumerate All Submasks
Shortest Hamiltonian Path (Bitmask DP)
Partition to K Equal Sum Subsets (Bitmask)
Maximum XOR Subarray
Count Triplets With XOR Equal to Zero
Score After Flipping Matrix
Maximum AND of Array After Choosing K Elements
Kth Smallest XOR Coordinate Value
Minimize XOR
Bitwise XOR of All Pairings
Closest Integer With Same Weight
Binary Indexed Tree (Fenwick Tree)
Maximum XOR With an Element From Array
Sum Over Subsets (SOS) DP
Broken Calculator (Bit Greedy)
XOR Basis (Linear Algebra over GF(2))
Maximum XOR From Basis
Count Distinct XOR-Reachable Values
Parallel Bit Count (SWAR)
Bit-Parallel Prefix XOR
SIMD-Style Parallel Byte Addition
Bitboard Rook Attack Mask
Matrix Multiplication over GF(2)
2D Fenwick Tree (Binary Indexed Tree 2D)
XOR Linked List Simulation
Gray Code to Binary Converter
Maximum AND Value of Subarray of Length K
Kth Smallest XOR from Basis
Nimber Multiplication (GF(2^n))
Binary Matrix Exponentiation over GF(2)
Wavelet Tree Rank Query
Bitboard Magic Bitboard Bishop Attacks
2D XOR Prefix Sum Queries
Gaussian Elimination over GF(2)
Complete Chess Move Generation (Bitboard)
Transpose Matrix
Matrix Diagonal Sum
Row and Column Sums
Rotate Matrix 90 Degrees
Reshape Matrix
Flatten Matrix
Spiral Order Traversal
Search a 2D Matrix
Set Matrix Zeroes
Rotate Matrix 180 Degrees
Anti-Diagonal Traversal
Word Search in Matrix
Number of Islands
Surrounded Regions
Maximal Square
Pacific Atlantic Water Flow
Unique Paths in Grid
Minimum Path Sum
Unique Paths with Obstacles
Island Perimeter
Maximal Rectangle
Rotting Oranges
Dungeon Game
Walls and Gates
Longest Increasing Path in Matrix
Shortest Path in Binary Matrix
Count Submatrices With All Ones
Diagonal Traverse
Sparse Matrix Multiplication
Shortest Distance from All Buildings
Game of Life
Swim in Rising Water
Cherry Pickup
Cut Off Trees for Golf Event
Escape the Ghosts
Cherry Pickup II
Kth Smallest Element in Sorted Matrix
Convex Hull on Grid
Game of Life N Generations
Voronoi Diagram on Grid
Image Blur (Box Filter)
Edge Detection (Sobel Operator)
Maze Generation (Recursive Backtracker)
Maze Generation (Prim's Algorithm)
Image Sharpening
Identity Matrix Check
Scalar Multiply Matrix
Matrix Addition
Matrix Multiplication
Rotate Matrix Counter-Clockwise
Matrix Border Elements
Spiral Matrix Generation
Flood Fill
Max Area of Island
Search a 2D Matrix II
Toeplitz Matrix
Lucky Numbers in Matrix
Word Search II (Multiple Words)
Number of Distinct Islands
01 Matrix (Distance to Nearest 0)
Largest Plus Sign
Strassen-Like Matrix Multiply
Count Negatives in Sorted Matrix
Regions Cut By Slashes
1D Cellular Automaton on Grid Row
HighLife Cellular Automaton
Generic Image Convolution
Matrix Determinant
Matrix Inverse
Matrix Exponentiation
Game of Life (Toroidal)
Shortest Path with Obstacle Elimination
Zigzag (Snake) Traversal
Saddle Points
Magic Square Check
Valid Sudoku
Path with Maximum Gold
Candy Crush Simulation
Check Valid Path in Grid
Treasure Island (Shortest Path BFS)
Battleships in a Board
Making A Large Island
Two Sum II - Sorted Array
Valid Palindrome (Two Pointers)
Reverse String In-Place
Merge Sorted Array In-Place
Remove Duplicates from Sorted Array
Move Zeroes
Is Subsequence
Intersection of Two Arrays II
Squares of a Sorted Array
Reverse Vowels of a String
Backspace String Compare
Count Pairs with Sum Less Than Target
Remove Element
Palindrome Number (Two Pointers)
Assign Cookies
Valid Palindrome II
3Sum
Container With Most Water
Sort Colors (Dutch National Flag)
Longest Substring Without Repeating Characters
3Sum Closest
Remove Duplicates from Sorted Array II
Max Number of K-Sum Pairs
Boats to Save People
4Sum
Trapping Rain Water
Partition Labels
Maximum Average Subarray I
Minimum Absolute Difference Pairs
Interval List Intersections
Longest Mountain in Array
String Compression
Minimum Window Substring
Longest Repeating Character Replacement
Permutation in String
Find All Anagrams in a String
Sliding Window Maximum
Fruit Into Baskets
Subarray Product Less Than K
Max Consecutive Ones III
Subarrays with K Different Integers
Minimum Size Subarray Sum
Longest Substring with At Most K Distinct Characters
Count Number of Nice Subarrays
Maximum Points You Can Obtain from Cards
Grumpy Bookstore Owner
Count Binary Substrings
Get Equal Substrings Within Budget
Shortest Subarray with Sum at Least K
Longest Substring with At Most Two Distinct Characters
Maximum Erasure Value
Longest Turbulent Subarray
Number of Substrings Containing All Three Characters
Replace the Substring for Balanced String
Count Subarrays With Score Less Than K
Minimum Operations to Reduce X to Zero
K Radius Subarray Averages
Maximum Sum of Two Non-Overlapping Subarrays
Frequency of the Most Frequent Element
Minimum Number of Moves to Make Palindrome
Substring with Concatenation of All Words
Count Subarrays Where Max Element Appears at Least K Times
Minimum Window Subsequence
Smallest Range Covering Elements from K Lists
Sliding Window Median
Longest Substring with Every Vowel and K Consonants
Maximum Beauty of an Array After Applying Operation
Count Complete Subarrays in an Array
Distinct Numbers in Each Subarray of Size K
Maximum Sum of Distinct Subarrays With Length K
Minimum Recolors to Get K Consecutive Black Blocks
Longest Nice Subarray
Minimum Consecutive Cards to Pick Up
Maximum Length of Repeated Subarray
Count Subarrays With Median K
Find K Closest Elements
Maximum Sum of Almost Unique Subarrays
Minimum Number of Operations to Make Array Continuous
Count Subarrays With Fixed Bounds
Minimum Window That Contains All Targets
Implement Stack
Implement Queue
Stack Using Fixed Array
Queue Using Two Stacks
Implement Deque
Circular Buffer
Min Stack
Max Stack
Two Stacks in One Array
Stack Using Queues
Implement Trie (Prefix Tree)
Implement Min Heap / Priority Queue
Implement Max Heap
Implement HashMap from Scratch
Implement HashSet from Scratch
Implement Singly Linked List
Implement Doubly Linked List
LRU Cache (Design)
Implement Ordered Map (BST-based)
Implement Multiset
LFU Cache
Implement Array Iterator
Flatten Nested List Iterator
Peeking Iterator
BST Iterator
Find Median from Data Stream
Randomized Set
Moving Average from Data Stream
Kth Largest Element in Stream
Zigzag Iterator
Sparse Vector Dot Product
Skip List
Interval Set (Non-overlapping)
Range Module
Snapshot Array
Design Underground System
Design Hit Counter
Design Leaderboard
Design Browser History
Stock Price Fluctuation
Number Container System
Design Food Rating System
B-Tree Simulation (Order 3)
Red-Black Tree Operations
van Emde Boas Tree (Simplified)
Fibonacci Heap (Simplified)
Disjoint Set (Union-Find)
Sparse Table (Range Min Query)
Rope Data Structure for String Editing
Rope with Split and Concat
Segment Tree (Range Sum + Update)
Fenwick Tree (Binary Indexed Tree)
Trie with Wildcard Search
Design Autocomplete System
LRU Cache with TTL
Circular Deque
Time-Based Key-Value Store
Graph with Adjacency List
Design Text Editor
All O(1) Data Structure
Design Twitter
Design In-Memory File System
Consistent Hashing Ring
Design Rate Limiter
Bloom Filter
Count-Min Sketch
Treap (Tree + Heap)
Design Task Scheduler Queue
AVL Tree
Design Event Emitter
LRU Cache with Variable Size Items
Priority Queue with Custom Comparator
Interval Tree
Immutable Persistent Stack
Multi-Level Feedback Queue
Trie with Count and Prefix Sum
Bounded Blocking Queue Simulation
Ordered Set with Rank
Undo/Redo Stack
Double-Ended Priority Queue
Rope: Concat and Split
Hash Map with Chaining
Van Emde Boas Set (Simplified)
Fibonacci Heap (Simplified)
Implement Map
Implement Filter
Implement ForEach
Implement Reduce
Implement Find
Implement Some (Any)
Implement Every (All)
Implement Flatten
Implement Find Index
Implement FlatMap
Implement Includes (Contains)
Implement Reduce Right (Fold Right)
Implement Curry
Implement Compose
Implement Pipe
Implement Partial Application
Implement Memoize
Implement Once
Implement Debounce
Implement Throttle
Implement Promise All
Implement Promise Race
Implement Promise Any
Implement Promise AllSettled
Implement Deep Clone
Implement Deep Equal
Implement JSON Serializer
Implement Event Emitter
Implement Bind
Implement Call
Implement Apply
Implement Object Construction
Implement Instance Check
Implement Prototypal Object Creation
Implement a Validation Proxy
Implement Observable Pattern
Implement Async/Await Simulator
Implement Generator-based Range
Implement Reactive Stream Operators
Implement Tree Diff
Implement Dependency Injection Container
Implement Middleware Pipeline
Implement Lazy Evaluation Chain
Implement Pattern Matching
Implement Trampoline
Implement Functional Lenses
Implement Finite State Machine
Implement Transducers
Implement Zip
Implement Unzip
Implement Chunk
Implement GroupBy
Implement Deep Freeze
Flatten Nested Object
Unflatten Object
Implement Retry with Backoff
Implement Deep Merge
Implement JSON Parser
Implement Either Monad
Implement Maybe Monad
Implement Async Task Queue
Implement Pub/Sub System
Implement Immutable Update Helper
Implement Reactive Signals
Implement a Simple Expression Interpreter
Implement tap
Implement identity
Implement negate
Implement take and drop
Implement range
Implement flip
Implement unary
Implement constant
Implement after
Implement before
Implement converge
Implement juxt
Implement unfold
Implement scan (running reduce)
Trampolined Fibonacci
Implement chain (monadic bind)
Distance Between Two Points
Midpoint of a Segment
Slope of a Line
Circle Area and Circumference
Area of a Triangle (Coordinates)
Is Point in Rectangle
Perimeter of a Polygon
Are Three Points Collinear
Is Point on Line Segment
Classify Triangle by Sides
Angle Between Two Vectors
Reflect Point Over Line y=x
Is Point Inside Circle
Rotate Point Around Origin
Rectangle Area
Is Polygon Convex
Line Segment Intersection
Rectangle Overlap
Circle-Line Intersection
Max Points on a Line
Closest Pair of Points (Brute Force)
Point in Triangle
Do Two Circles Intersect
Centroid of a Polygon
Point in Polygon (Ray Casting)
Convex Hull (Gift Wrapping / Jarvis March)
Distance from Point to Line
Polygon Area (Shoelace Formula)
Do Two Segments Intersect
Point Inside Convex Hull
Closest Point on Segment
Ear Clipping Triangulation Count
Convex Hull (Graham Scan)
Count Segment Intersections (Brute Force)
Point in Convex Polygon (Binary Search)
Nearest Point (Voronoi Cell Membership)
Convex Hull (Andrew's Monotone Chain)
Segment-Polygon Intersection
Is Polygon Simple (No Self-Intersection)
Winding Number (Point in Polygon)
Smallest Axis-Aligned Bounding Box
Polygon Contains Polygon
Area of Convex Polygon Intersection
Minimum Bounding Circle (Brute Force)
Clip Polygon to Rectangle (Sutherland-Hodgman)
Tangent Lines to Circle from Point
Half-Plane Intersection Check
Circumscribed Circle of Triangle
Rotating Calipers (Convex Hull Diameter)
Minimum Enclosing Circle (Welzl's Algorithm)
Polygon Inward Offset
GJK Collision Detection (Simplified)
Closest Pair (Divide and Conquer)
Delaunay Condition Check
Minimum Width of Point Set
Area of Union of Rectangles
Minkowski Sum of Convex Polygons
Visibility Polygon (Simple)
Art Gallery Problem (Upper Bound)
Separating Axis Theorem
Delaunay Triangulation (Incremental)
Boolean Intersection of Convex Polygons
Perimeter of Union of Rectangles
Convex Layers (Onion Peeling)
Motion Planning (Point Robot, Simple Obstacles)
Geometric Hashing (Point Pattern Matching)
Power of a Point (Multiple Circles)
Convex Decomposition Count
Boolean Union of Convex Polygons (Area)
Visibility Graph Edge Count
Convex Polygon Fan Triangulation
Line Arrangement Region Count
Ham Sandwich Theorem (2D Check)
Farthest Pair of Points
Euler's Formula for Planar Graphs
Closest Pair of Line Segments
Symmetric Difference Area (Two Convex Polygons)
K-Nearest Neighbors (2D Points)
Stabbing Number of Segments
Rectilinear MST Weight
FizzBuzz Game Turn
Coin Flip Simulation
Dice Roll Sum Check
Game Score Keeper
Rock Paper Scissors Winner
RPS Best of N
Whose Turn Is It
Dice Roll Probability
Tic-Tac-Toe Winner
Nim Game (Single Pile)
War Card Game Round
Number Guessing Feedback
Tic-Tac-Toe Board State
Mastermind Feedback
Prisoner's Dilemma Score
Hot or Cold Game
Game of Life Step
Josephus Problem
RPS Counter Strategy
Nim with Multiple Piles
Minimax Tic-Tac-Toe
Sprague-Grundy for Subtraction Game
Iterated Prisoner's Dilemma Strategies
Blackjack Hand Value
Minesweeper Neighbor Counts
Connect Four Drop Piece
Battleship Hit Check
21 Pickup Game
Game of Life Pattern Detection
Nim Optimal Move
Greedy vs Patient Strategy
2048 Row Merge
Connect Four Winner Check
Chess Knight Valid Moves
Chess Bishop Coverage
Minesweeper Flood Reveal
Snake Game Step
2048 Full Board Move
Reversi Valid Moves
Knight Tour Reachability
Sudoku Board Validator
Chess Check Detection
Simple Game Tree Evaluation
Dots and Boxes Scoring
Optimal Coin Game
Stone Game (Piles)
Minimax for Custom Nim
Maze Solver (BFS)
Minimax with Alpha-Beta Pruning
Gomoku (Five in a Row) Check
Hex Game Winner Detection
Go Capture Detection
Poker Hand Ranker
Chess Piece Legal Moves
Sprague-Grundy for Combined Games
Checkers Valid Moves
Poker Hand Comparison
Optimal Strategy for Matrix Game
Connect Four AI Move
Stratego Attack Resolution
Stone Game II
Bridge Trick Counting
Connect Four Minimax (Depth Limited)
Second-Price Auction (Vickrey)
Chess Position Evaluator
Monte Carlo Coin Game Estimator
Game Tree with Transposition Table
Banzhaf Power Index
Nash Equilibrium Finder (2x2)
Poker Preflop Equity (Simplified)
Shapley Value Calculator
Evolutionary Game Dynamics Step
Monte Carlo Tree Search (Simplified)
Go Territory Counting
VCG Mechanism (Public Project)
Stable Matching (Gale-Shapley)
Mini Chess Engine
Full Poker Hand Evaluator
Mixed Strategy Nash Equilibrium
Congestion Game Equilibrium
Declare an Integer Variable
Declare a Float Variable
Declare a Char Variable
Simulate printf with %d
Printf with Multiple Arguments
Simulate scanf Parsing
C-Style Type Casting
Simulate sizeof Operator
Detect Integer Overflow
Create a Pointer
Dereference a Pointer
Assign Through a Pointer
Swap via Pointers
Pointer Arithmetic
Pointer Difference
Array to Pointer Decay
Array Subscript as Pointer Arithmetic
NULL Pointer Check
Create Null-Terminated String
Implement strlen
Implement strcpy
Implement strcmp
Implement strcat
Implement strstr
Implement strncpy
Implement atoi
Create a Struct
Struct Member Access (dot vs arrow)
Define an Enum
Simulate a Union
Calculate sizeof a Struct
Nested Struct Access
Simulate typedef
Simulate Bitfields
Calculate sizeof for Arrays
Simulate malloc and free
Detect Memory Leaks
Detect Double Free
Detect Use After Free
Simulate calloc
Simulate realloc
Simulate memcpy
Simulate memset
Simulate File Operations
Simulate fprintf
Simulate Buffered I/O
Simulate fseek and ftell
Process stdin Line by Line
Simulate Unix Pipe
Create a Linked List (C-style)
Insert into Linked List at Position
Reverse a Linked List (Pointer Manipulation)
Free a Linked List
Stack with Dynamic Memory
Queue with Dynamic Memory
BST Insert (C-style Pointers)
BST Search (Iterative, C-style)
Function Pointers: Apply
Implement qsort with Comparator
Implement bsearch
Array Transformation with Callback
Array of Function Pointers
Function Dispatch Table
Generic Reduce (Simulating void* callbacks)
Simulate #define Replacement
Simulate #ifdef / #endif
Simulate Macro Functions
Simulate volatile Behavior
Simulate Include Guards
Pack Values into Bitfields
Unpack Bitfields from Integer
Simulate Token Pasting (## operator)
Simulate Stringification (# operator)
Simulate fork()
Simulate exec() Family
Simulate Signal Handling
Simulate wait() and Process Hierarchy
Simulate Shared Memory IPC
Simulate Semaphore
Simulate Message Queue IPC
Simulate Memory-Mapped File
Validate IPv4 Address
IPv4 to Binary String
Binary String to IPv4
Extract IPv4 Octets
Validate IPv6 Address
Parse MAC Address
Validate MAC Address
Classify IPv4 Address
CIDR Prefix to Subnet Mask
Subnet Mask to CIDR Prefix
Calculate Network Address
Calculate Broadcast Address
Usable Hosts in Subnet
Check IP in Subnet
Is Private IP Address
Split Subnet into Two
Parse Domain Name
DNS Lookup Simulator
Reverse DNS (PTR) Format
Classify DNS Record
DNS Cache with TTL
Domain Hierarchy Level
Wildcard DNS Matching
Parse URL Components
HTTP Status Code Classification
Parse HTTP Request Line
Parse HTTP Headers
Content Negotiation
Build HTTP Response
Parse Query String
Parse Cookie Header
Parse Cache-Control Header
TCP Three-Way Handshake
Reorder TCP Packets
TCP Sliding Window
TCP Flow Control
TCP Retransmission Detection
Verify Internet Checksum
TCP Segment Reassembly
TCP Congestion Window Growth
Build UDP Datagram Header
NAT Translation Table
Port Forwarding Rules
UDP Checksum Calculation
ARP Table Lookup
VLAN Tag Processing
ICMP Ping Statistics
Traceroute Path Analysis
Longest Prefix Match
Build Routing Table
OSPF Path Cost Calculation
BGP Path Selection
Distance Vector Routing
Route Summarization (Supernetting)
Firewall Rule Evaluation
Access Control List with CIDR
TLS Handshake Steps
Certificate Chain Validation
Diffie-Hellman Key Exchange
Simple Network Encryption (Caesar)
Simple Hash Function
HMAC-like Verification
Simplified RSA Encryption
Parse JWT Token
Round Robin Load Balancer
Weighted Round Robin
Least Connections Load Balancer
Consistent Hashing
Load Balancer with Health Checks
Token Bucket Rate Limiter
Session Affinity (Sticky Sessions)
Geo-based Load Balancer
Spanning Tree Protocol
Detect Network Topology
SDN Flow Rule Matching
Network Diameter
Packet Capture Analysis
Detect SYN Flood Attack
Network Flow Aggregation
Bandwidth Monitor
Extract Basename
Extract Directory Name
Extract File Extension
Join Path Segments
Normalize Path
Relative Path Between Two Paths
Resolve Path
Check If Subpath
Simple Glob Matcher
Double-Star Glob Matcher
Gitignore Pattern Checker
Filter Files by Gitignore
Parse Log Level
Parse HTTP Access Log
Aggregate Log Levels
Parse Key-Value Log Format
Parse Semver String
Compare Semver Versions
Semver Range Satisfies
Maximum Satisfying Semver
Topological Sort for Packages
Resolve All Dependencies
Build Dependency Tree
Find Circular Dependencies
Parse Cron Field
Describe Cron Expression
Cron Next Run Time
Rate Limiter
Circuit Breaker Simulation
Retry with Exponential Backoff
Service Health Check Evaluator
Round-Robin Load Balancer
Docker Layer Hash
Merge Docker Layers
Parse Dockerfile Instructions
Docker Layer Cache Simulation
Multi-Stage Build Resolver
Estimate Docker Image Size
Parse INI Config
Environment Variable Expansion
Deep Config Merge
Parse .env File
JSON Pointer Access
JSON Patch Apply
Config Schema Validator
Simple Template Engine
FCFS Process Scheduler
SJF Process Scheduler
Round-Robin Process Scheduler
Priority Process Scheduler
Context Switch Cost Calculator
Scheduling Metrics Calculator
Process Gantt Chart Builder
Multi-Level Feedback Queue
First Fit Memory Allocator
Best Fit Memory Allocator
LRU Page Replacement
CLOCK Page Replacement
Buddy System Allocator
LFU Page Replacement
Inode-Based File System
Directory Operations
Hard Links
Symbolic Links
Journaling File System
File System Snapshots
Lamport Timestamps
Vector Clocks
Consistent Hashing
Raft Leader Election
CRDT G-Counter
CRDT LWW-Register
Gossip Protocol Simulation
Two-Phase Commit Protocol
Longest Common Path Prefix
Log Error Frequency Analyzer
Sort Semver Versions
Validate Cron Expression
Dockerfile ENV Resolution
Flatten Nested Config
Unflatten Config to Nested
Average Turnaround Time
Python Variable Swap
Python Multiple Assignment
Python type() Equivalent
Python f-string Formatting
Python Integer Division & Modulo
Python Power Operator
Python String Repetition
Python String Slicing
Python List Comprehension
Python dict() from Pairs
Python Tuple Unpacking
Python Set Operations
Python Dict Comprehension
Python enumerate()
Python zip()
Python List Methods
Python *args
Python **kwargs
Python Lambda Functions
Python Default Arguments
Python Decorator (Basic)
Python Closures & Nonlocal
Python map() and filter()
Python functools.partial
Python __init__ Method
Python __str__ and __repr__
Python __len__ and __contains__
Python __eq__ Equality
Python Inheritance & super()
Python Method Resolution Order (MRO)
Python __add__ and __mul__
Python __getitem__ Indexing
Python Context Manager (with statement)
Python Generator (yield)
Python Fibonacci Generator
Python File readlines() Simulation
Python Generator send() Protocol
Python yield from (Delegation)
Python Iterator Protocol (__iter__, __next__)
Python contextlib.contextmanager
Python Memoization Decorator
Python Retry Decorator
Python @property Decorator
Python Descriptors (__get__, __set__)
Python Metaclass Simulation
Python Dynamic Class Creation
Python __slots__ Optimization
Python Abstract Base Class
Python collections.Counter
Python collections.defaultdict
Python collections.deque
Python collections.namedtuple
Python itertools.chain
Python itertools.product
Python itertools.groupby
Python functools.reduce
Python Type Hints Validation
Python @dataclass
Python Protocol (Structural Typing)
Python Generic Types
Python __post_init__ Validation
Python Frozen Dataclass (Immutability)
Python Enum Class
Python dataclass field() Factory
Python asyncio.gather Simulation
Python Event Loop Simulation
Python asyncio.Queue Simulation
Python asyncio.Semaphore Simulation
Python GIL Simulation
Python multiprocessing.Pool.map
Python concurrent.futures Simulation
Python threading.Lock Simulation
CPython Reference Counting
CPython String Interning
CPython Garbage Collection (Cycles)
CPython Bytecode Simulation
C Extension Buffer Protocol Simulation
CPython Memory Model (Arenas & Pools)
CPython PyObject Header Simulation
CPython Descriptor Protocol Full Simulation
Simulate cout (Stream Output)
Simulate cin (Stream Input Parser)
Simulate Namespaces
References vs Pointers
C++ Type Casting Simulation
Scope Resolution Operator
Simulate const Qualifier
Simulate auto Type Deduction
Basic Class with Constructor
Simulate Destructor (Resource Cleanup)
Access Modifiers (public/private/protected)
Member Initializer List
Copy Constructor
Static Members
The this Pointer (Method Chaining)
Struct vs Class (Default Access)
Single Inheritance
Virtual Function Dispatch
Abstract Class (Pure Virtual)
Shape Hierarchy (Polymorphism)
Multiple Inheritance (Diamond Problem)
Simulate dynamic_cast
Build a Virtual Table
Simulate Interfaces (Pure Abstract Classes)
Operator Overloading (Complex Numbers)
Operator Overloading (Matrix)
RAII Pattern (Resource Acquisition Is Initialization)
Friend Functions
Move Semantics Simulation
Rule of Five Checker
Scoped Lock (RAII Mutex)
Spaceship Operator (<=>)
Function Templates (Generics)
Template Specialization
Simulate std::vector
Simulate std::map
Simulate std::set
Simulate std::stack
Simulate std::queue
Simulate std::priority_queue
std::sort with Custom Comparator
std::find and std::find_if
std::transform
std::accumulate
Simulate Iterators
Functors (Function Objects)
STL Algorithm Pipeline
Reverse Iterator
Simulate unique_ptr
Simulate shared_ptr (Reference Counting)
Simulate weak_ptr
Memory Pool Allocator
Mark-and-Sweep GC Simulation
Placement New (Memory Reuse)
Singleton Pattern
Factory Pattern
Observer Pattern
Strategy Pattern
Decorator Pattern
Adapter Pattern
Command Pattern (Undo/Redo)
Composite Pattern (File System)
Perfect Forwarding Simulation
SFINAE (Substitution Failure Is Not An Error)
CRTP (Curiously Recurring Template Pattern)
Type Traits Simulation
Move-based Swap Optimization
std::enable_if Simulation
Variadic Templates
Expression Templates
constexpr (Compile-Time Computation)
Concepts (C++20 Constraints)
Template Metaprogramming (Compile-Time Lists)
static_assert (Compile-Time Validation)
Coroutine Simulation (co_yield / co_return)
C++20 Modules Simulation
C++20 Ranges and Views
std::any and std::variant Simulation
Scoped Enumerations (enum class)
Lambda Capture Modes
Exception Hierarchy (try/catch)
Rust Let Bindings
Rust Variable Shadowing
Rust Data Types
Rust Integer Overflow Check
Rust Tuples
Rust Constants and Static Values
Rust Arrays vs Vectors
Rust Type Casting with as
Rust Functions and Expressions
Rust If as Expression
Rust Loop with Break Value
Rust For Loops and Ranges
Rust Match Expression
Rust Match with Ranges and Guards
Rust while let Pattern
Rust Destructuring Patterns
Rust Ownership and Move Semantics
Rust Clone and Copy
Rust Borrowing Rules Checker
Rust Slices
Rust String vs &str
Rust Scope and Drop
Rust Mutable References
Rust Slice Patterns
Rust Structs
Rust Tuple Structs and Newtype Pattern
Rust Enums with Data
Rust Impl Blocks and Methods
Rust Enum Methods
Rust Builder Pattern
Rust #[derive] and Display
Rust Option Enum Preview
Rust Result Type
Rust ? Operator for Error Propagation
Rust unwrap, expect, and unwrap_or
Rust Advanced Pattern Matching
Rust if let and let-else
Rust Result Combinators
Rust Vec Operations
Rust HashMap
Rust HashSet Operations
Rust Iterators
Rust Closures
Rust fold and scan
Rust Traits
Rust Generics
Rust Trait Bounds
Rust Dynamic Dispatch (dyn Trait)
Rust Trait Object Patterns
Rust Supertraits and Trait Inheritance
Rust Lifetimes
Rust Box Smart Pointer
Rust Rc (Reference Counting)
Rust RefCell and Interior Mutability
Rust Cow (Clone on Write)
Rust Weak References
Rust Threads and Message Passing
Rust Mutex and Arc
Rust RwLock (Read-Write Lock)
Rust Async/Await Basics
Rust Future Combinators
Rust Streams (Async Iterators)
Rust Unsafe Superpowers
Rust FFI (Foreign Function Interface)
Rust Macros
Rust PhantomData and Zero-Sized Types
Rust Type-Level Programming
Rust Borrow Checker Simulator
Rust Procedural Macro Simulation
Rust Expressions vs Statements
Rust String Indexing and UTF-8
Rust Nested Match and or-patterns
Rust Ownership Rules Quiz
Rust String Methods
Rust Associated Types in Traits
Rust Error Chaining with thiserror
Rust enumerate and zip Iterators
Rust From and Into Traits
Rust Cell for Copy Types
Rust Pin and Unpin
Var Hoisting Basics
Let vs Var in Loops
Scope Chain Resolution
Const Object Mutability
Temporal Dead Zone Detector
Hoisting Priority
Block Scoping Simulator
Var Function Scoping
Closure Counter
Private Variables with Closures
Closure Loop Trap Fix
Memoize with Closures
Module Pattern
Revealing Module Pattern
Function Currying
Partial Application
Prototype Chain Lookup
Implement Object.create
Simulate instanceof
Setup Prototypal Inheritance
Property Shadowing
Simulate the new Operator
Own vs Inherited Properties
Mixin Pattern
Determine this Binding
Arrow vs Regular this
Implement call and apply
Implement bind
Method Borrowing
Fix Lost this Context
Binding Priority Order
Soft Binding
Event Loop Execution Order
Promise Execution Order
Nested Microtask Order
Promise Chain Resolution
Async Task Scheduler
queueMicrotask Ordering
Promise.allSettled Simulation
Generator Basics
Custom Iterator Protocol
Infinite Generator with Take
Generator Delegation (yield*)
Async Generator Pattern
Composable Iterators
Generator Coroutine
Proxy Validator
Proxy Access Logger
Property Descriptors
Reflect API Operations
Revocable Proxy
Observable Object with Proxy
Object.defineProperty Simulation
WeakMap Cache Pattern
WeakSet Object Tracking
WeakRef Cache Pattern
FinalizationRegistry Pattern
Memory Leak Detector
Reference Counting GC
Circular Reference Detection
Structured Clone Algorithm
Transferable Objects
Atomics Operations Simulation
Race Condition Detector
Mutex Simulation
Spinlock vs Atomics.wait
MessageChannel Communication
V8 Hidden Classes
Inline Cache Hits
Deoptimization Detector
V8 Optimization Checklist
JIT Compilation Pipeline
Monomorphic Operation Design
Escape Analysis
Turbofan Speculative Optimization
typeof Quirks
Equality Coercion Rules
Symbol as Unique Keys
Tagged Template Literals
Well-Known Symbols
Event Emitter Pattern
Implement createElement
JSX Expression Transformer
Create Text VNode
Normalize Children
Build VDom Tree
Flatten VDom to Tag List
Count VDom Nodes
Extract All Props from VDom
Render Function Component
Resolve Component Tree
Props Spreading and Defaults
React.Children.map
React.Children.count
cloneElement
Render VDom to HTML String
Conditional Rendering Helper
Implement Basic useState
Functional State Updates
State History Tracker
Derived State Computation
useEffect Dependency Checker
Effect Cleanup Manager
Effect Scheduling Order
useRef Simulation
Implement useReducer
Reducer with Middleware
Implement createContext
Multi-Context Provider
Custom Hook: useToggle
Custom Hook: usePrevious
Custom Hook: useDebounce Logic
Rules of Hooks Checker
Shallow Compare Objects
Diff Element Props
Classify VDom Diff Type
Simple Children Diff
Key-based List Reconciliation
Apply Patches to VDom
Full VDom Diff Algorithm
Tree Reconciliation Engine
Event Listener Registry
Event Delegation System
Synthetic Event System
Batched State Updates
Update Priority Lanes
Render & Commit Phase Separation
Implement useMemo
Implement useCallback
Implement React.memo
shouldComponentUpdate Logic
Memoized Selector (Reselect)
Render Bailout Optimizer
PureComponent Lifecycle
Fiber Work Unit
Fiber Tree Traversal
Scheduler Priority Queue
Concurrent Mode Simulation
Suspense Boundary Simulation
Error Boundary Simulation
Server Component Serialization
Hydration Mismatch Detector
Streaming SSR Chunks
RSC Wire Protocol Parser
Selective Hydration Scheduler
Islands Architecture
Auto-Memoization Analyzer
Signal Implementation
Computed Signals (Derived)
Fine-Grained Reactivity System
React Compiler Transform
Custom Reconciler
Full React Scheduler
VDom Tree Depth
List Rendering with Keys
Effect Execution Order
Custom Hook: useThrottle Logic
Minimize List Moves (LIS)
Component State Machine
Fiber Effect Tags
Progressive Hydration Strategy
No entries yet
Complete challenges to see your results here.
Start Solving