Learning
Home
CSES
Introductory Problems
Summary
Apple Division
Bit Strings
Coin Piles
Creating Strings
Increasing Array
Missing Number
Weird Algorithm
Chessboard and Queens
Digit Queries
Gray Code
Grid Coloring I
Grid Path Description
Knight Moves Grid
Mex Grid Construction
Number Spiral
Palindrome Reorder
Permutations
Raab Game I
Repetitions
String Reorder
Tower of Hanoi
Trailing Zeros
Two Knights
Mex Grid Construction II
Two Sets
Sorting And Searching
Summary
Apartments
Collecting Numbers
Distinct Numbers
Subarray Sums I
Array Division
Collecting Numbers II
Distinct Values Subarrays
Factory Machines
Josephus Problem I
Maximum Subarray Sum
Movie Festival - Interview
Nearest Smaller Values
Nested Ranges Check
Playlist
Reading Books
Room Allocation
Stick Lengths
Subarray Divisibility
Subarray Sums II
Sum of Four Values
Sum of Three Values
Sum of Two Values
Tasks and Deadlines
Towers
Traffic Lights
Distinct Values Subarrays II
Distinct Values Subsequences
Josephus Problem II
Maximum Subarray Sum II
Missing Coin Sum
Movie Festival II
Nested Ranges Count
Concert Tickets
Ferris Wheel
Restaurant Customers
Ternary Search
Dynamic Programming
Summary
Coin Combinations I
Dice Combinations
Array Description
Book Shop
Coin Combinations II
Counting Towers
Grid Paths
Increasing Subsequence
Longest Common Subsequence
Minimizing Coins
Money Sums
Rectangle Cutting
Removing Digits
Edit Distance
Minimal Grid Path
Removal Game
Two Sets II
SOS DP (Sum over Subsets)
AtCoder DP
Summary
A - Frog 1
B - Frog 2
C - Vacation
D - Knapsack 1
E - Knapsack 2
G - Longest Path
H - Grid 1
I - Coins
J - Sushi
K - Stones
L - Deque
M - Candies
N - Slimes
O - Matching
P - Independent Set
Q - Flowers
R - Walk
S - Digit Sum
T - Permutation
U - Grouping
V - Subtree
W - Intervals
X - Tower
Y - Grid 2
Z - Frog 3
Graph Algorithms
Summary
Building Roads
Counting Rooms
Building Teams
Coin Collector
Coordinate Compression
Cycle Finding
Distinct Routes
Download Speed
Flight Discount
Labyrinth
Mail Delivery
Message Route
Monsters
Planets Cycles
Planets Queries I
Prefix Sum Queries
Road Construction
Road Reparation
Round Trip
School Dance
Shortest Routes I
Topological Sorting
De Bruijn Sequence
Giant Pizza
Hamiltonian Flights
High Score
Knights Tour
Planets Queries II
Planets and Kingdoms
Police Chase
Road Construction II
Road Construction III
Shortest Routes II
Strongly Connected Components
Teleporters Path
Road Construction IV
Articulation Points
Bridges (Cut Edges)
Tree Algorithms
Summary
Company Queries I
Company Queries II
Counting Paths
Distance Queries
Path Queries
Subordinates
Tree Diameter
Tree Distances I
Subtree Queries
Tree Distances II
Tree Matching
Distinct Colors
Finding a Centroid
Fixed-Length Paths I
Fixed-Length Paths II
Path Queries II
DSU on Trees (Sack)
Rerooting DP
Sliding Window
Summary
Fixed Length Subarray Sum
Subarray Sums I
Longest Subarray with Sum
Longest Substring Without Repeating Characters
Maximum Subarray Sum
Minimum Subarray Sum
Shortest Subarray with Sum
Sliding Window Advertisement
Subarray Distinct Values
Subarray Sums II
Subarray with Given Sum
Minimum Window Substring
Subarray Maximums
Subarray Minimums
Subarray with K Distinct
Range Queries
Summary
Static Range Sum Queries
Dynamic Range Sum Queries
Forest Queries
Hotel Queries
List Removals
Pizzeria Queries
Prefix Sum Queries
Salary Queries
Static Range Minimum Queries
Subarray Sum Queries
Range Interval Queries
Range Update Queries
Range Xor Queries
Subarray Distinct Values Queries
Subarray Minimum Queries
Subarray OR Queries
Subarray XOR Queries
Visible Buildings Queries
Subarray Mode Queries
Subarray Maximums
Li Chao Tree
String Algorithms
Summary
Distinct Strings
Finding Borders
Finding Periods
Longest Palindrome
Pattern Positions
Repeating Substring
String Compression
String Functions
String Matching
String Rotation
Minimal Rotation
Required Substring
Word Combinations
String Automaton
Distinct Substrings
Palindrome Queries
String Transformation
Substring Order I
Substring Order II
Suffix Automaton
Palindromic Tree (Eertree)
Geometry
Summary
All Manhattan Distances
Area of Rectangles - Geometry
Line Segment Intersection - Geometry
Line Segments Trace
Lines and Queries I
Maximum Manhattan Distance
Point Location Test - Geometry
Polygon Area
Robot Path
Convex Hull
Intersection Points
Lines and Queries II
Minimum Euclidean Distance
Point in Polygon - Geometry
Polygon Lattice Points - Geometry
Half-Plane Intersection
Rotating Calipers
Counting Problems
Summary
Empty String
All Letter Subgrid Count I
Border Subgrid Count I
Collecting Numbers Distribution
Counting Bishops
Counting Combinations
Counting Permutations
Counting Reorders
Counting Sequences
Filled Subgrid Count I
Grid Completion
Grid Paths II
Tree Traversals
All Letter Subgrid Count II
Border Subgrid Count II
Filled Subgrid Count II
Functional Graph Distribution
Permutation Inversions
Raab Game II
Tournament Graph Distribution
Möbius Function
Stirling Numbers
Advanced Graph Problems
Summary
Acyclic Graph Edges
Course Schedule II
Creating Offices
Even Outdegree Edges
Fixed Length Path Queries
Fixed Length Tour Queries
Fixed Length Trail Queries
Fixed Length Walk Queries
MST Edge Check
Nearest Shops
New Flight Routes
Strongly Connected Edges
Transfer Speeds Sum
Tree Traversals
Fixed Length Circuit Queries
Fixed Length Cycle Queries
Fixed Length Hamiltonian Cycle Queries
Fixed Length Hamiltonian Path Queries
Fixed Length Hamiltonian Tour Queries
Fixed Length Hamiltonian Trail Queries
Graph Girth
Prüfer Code
Fixed Length Eulerian Circuit Queries
Fixed Length Eulerian Trail Queries
Fixed Length Hamiltonian Circuit Queries
Fixed Length Hamiltonian Cycle Queries II
Fixed Length Hamiltonian Path Queries II
Fixed Length Hamiltonian Tour Queries II
Fixed Length Hamiltonian Trail Queries II
Minimum Cost Max Flow
B
Summary
Dynamic Array
Algorithmic Complexity
Sorting
Stack and Queue
String
BFS
DFS
Heap
Dijkstra
Mid Term
Bellman-Ford
Floyd-Warshall
Binary Search
Binary Search Tree
MAP TREEMAP DICT
Prim
Trie
DSU
Kruskal
Final Exam
O
Summary
Backtracking
Bit Manipulation
Divide and Conquer
DP
Final Term
Greedy
Hash Map
Knuth-Morris-Pratt
Midterm
Number Theory
Number Theory 2
Segment Tree
Topological Sort
LeetCode Contests
Weekly Contest 483
Weekly Contest 484
Weekly Contest 485
Weekly Contest 486
Weekly Contest 487
Biweekly Contest 168
Biweekly Contest 169
Biweekly Contest 170
Biweekly Contest 171
Biweekly Contest 172
Biweekly Contest 173
Biweekly Contest 174
Biweekly Contest 175
System Design
Overview
Consistent Hashing
Unique ID Generator
Key-Value Store
URL Shortener
Web Crawler
Payment System
Skills GraphRAG
News Feed
Chat System
Search Autocomplete
YouTube
Google Drive
Message Queue
Ad Click Aggregation
S3 Object Storage
Low Level Design
Overview
Easy
Parking Lot
Stack Overflow
Vending Machine
Logging Framework
Traffic Signal
Coffee Vending Machine
Task Management
Medium
ATM
LinkedIn
LRU Cache
Tic Tac Toe
Pub Sub System
Elevator System
Car Rental System
Online Auction
Hotel Management
Digital Wallet
Airline Management
Library Management
Social Network
Restaurant Management
Concert Booking
Hard
CricInfo
Splitwise
Chess Game
Snake & Ladder
Ride-Sharing (Uber)
Course Registration
Movie Ticket Booking
Online Shopping
Stock Brokerage
Music Streaming
Food Delivery
Quick Reference
Study Guide
Code Templates
Advanced Algorithms
Common Mistakes
Patterns
LCA
Dynamic Programming
Tree Patterns
Graph Patterns
Stack & Queue
Binary Search
Prefix Sum
Backtracking
Bitmask Techniques
Bitmask DP — Subset Partition
Digit DP
Edge Contribution & Rerooting
Contribution Counting
About
About
This project and all its content is generated by AI.