Introductory Problems
- Weird Algorithm16 / 37
- Missing Number8 / 32
- Repetitions8 / 13
- Increasing Array29 / 30
- Permutations1 / 1
- Number Spiral2 / 5
- Two Knights2 / 4
- Two Sets28 / 28
- Bit Strings1 / 5
- Trailing Zeros0 / 4
- Coin Piles0 / 0
- Palindrome Reorder1 / 5
- Gray Code1 / 3
- Tower of Hanoi31 / 37
- Creating Strings0 / 5
- Apple Division14 / 32
- Chessboard and Queens4 / 17
- Raab Game I0 / 0
- Mex Grid Construction0 / 0
- Knight Moves Grid2 / 2
- Grid Coloring I0 / 0
- Digit Queries3 / 4
- String Reorder1 / 1
- Grid Path Description2 / 3
Sorting and Searching
- Distinct Numbers11 / 39
- Apartments1 / 9
- Ferris Wheel11 / 35
- Concert Tickets10 / 16
- Restaurant Customers3 / 3
- Movie Festival6 / 15
- Sum of Two Values2 / 16
- Maximum Subarray Sum5 / 23
- Stick Lengths1 / 1
- Missing Coin Sum1 / 1
- Collecting Numbers2 / 5
- Collecting Numbers II0 / 0
- Playlist4 / 7
- Towers3 / 3
- Traffic Lights5 / 9
- Distinct Values Subarrays3 / 7
- Distinct Values Subsequences0 / 0
- Josephus Problem I0 / 0
- Josephus Problem II0 / 0
- Nested Ranges Check2 / 3
- Nested Ranges Count2 / 3
- Room Allocation3 / 4
- Factory Machines1 / 2
- Tasks and Deadlines4 / 7
- Reading Books4 / 7
- Sum of Three Values0 / 0
- Sum of Four Values2 / 2
- Nearest Smaller Values0 / 0
- Subarray Sums I1 / 8
- Subarray Sums II9 / 16
- Subarray Divisibility1 / 5
- Distinct Values Subarrays II0 / 0
- Array Division1 / 1
- Movie Festival II0 / 3
- Maximum Subarray Sum II0 / 0
Dynamic Programming
- Dice Combinations10 / 50
- Minimizing Coins3 / 6
- Coin Combinations I1 / 12
- Coin Combinations II1 / 11
- Removing Digits5 / 26
- Grid Paths I0 / 9
- Book Shop2 / 10
- Array Description3 / 4
- Counting Towers0 / 1
- Edit Distance2 / 8
- Longest Common Subsequence0 / 0
- Rectangle Cutting1 / 1
- Minimal Grid Path0 / 4
- Money Sums2 / 4
- Removal Game1 / 2
- Two Sets II1 / 3
- Mountain Range0 / 0
- Increasing Subsequence0 / 0
- Projects0 / 5
- Elevator Rides0 / 6
- Counting Tilings0 / 0
- Counting Numbers7 / 31
- Increasing Subsequence II0 / 2
Graph Algorithms
- Counting Rooms33 / 49
- Labyrinth5 / 5
- Building Roads6 / 12
- Message Route7 / 16
- Building Teams13 / 25
- Round Trip1 / 3
- Monsters2 / 7
- Shortest Routes I1 / 1
- Shortest Routes II1 / 4
- High Score4 / 10
- Flight Discount5 / 12
- Cycle Finding3 / 4
- Flight Routes1 / 5
- Round Trip II2 / 4
- Course Schedule3 / 9
- Longest Flight Route5 / 8
- Game Routes6 / 8
- Investigation3 / 6
- Planets Queries I2 / 2
- Planets Queries II0 / 2
- Planets Cycles0 / 1
- Road Reparation2 / 6
- Road Construction1 / 11
- Flight Routes Check3 / 10
- Planets and Kingdoms5 / 9
- Giant Pizza1 / 5
- Coin Collector2 / 4
- Mail Delivery0 / 1
- De Bruijn Sequence0 / 0
- Teleporters Path0 / 0
- Hamiltonian Flights0 / 6
- Knight's Tour1 / 1
- Download Speed0 / 0
- Police Chase0 / 0
- School Dance0 / 0
- Distinct Routes0 / 0
Range Queries
- Static Range Sum Queries4 / 31
- Static Range Minimum Queries4 / 14
- Dynamic Range Sum Queries0 / 2
- Dynamic Range Minimum Queries1 / 1
- Range Xor Queries2 / 6
- Range Update Queries1 / 8
- Forest Queries1 / 6
- Hotel Queries1 / 2
- List Removals0 / 0
- Salary Queries4 / 9
- Prefix Sum Queries0 / 0
- Pizzeria Queries0 / 5
- Visible Buildings Queries0 / 0
- Range Interval Queries0 / 0
- Subarray Sum Queries0 / 0
- Subarray Sum Queries II0 / 0
- Distinct Values Queries0 / 1
- Distinct Values Queries II0 / 0
- Increasing Array Queries0 / 0
- Movie Festival Queries0 / 0
- Forest Queries II0 / 0
- Range Updates and Sums0 / 4
- Polynomial Queries0 / 1
- Range Queries and Copies0 / 0
- Missing Coin Sum Queries0 / 0
Tree Algorithms
- Subordinates27 / 33
- Tree Matching6 / 9
- Tree Diameter3 / 7
- Tree Distances I1 / 1
- Tree Distances II0 / 0
- Company Queries I1 / 2
- Company Queries II2 / 3
- Distance Queries1 / 2
- Counting Paths0 / 1
- Subtree Queries3 / 4
- Path Queries0 / 2
- Path Queries II0 / 3
- Distinct Colors1 / 2
- Finding a Centroid0 / 0
- Fixed-Length Paths I0 / 0
- Fixed-Length Paths II0 / 0
Mathematics
- Josephus Queries0 / 0
- Exponentiation3 / 11
- Exponentiation II1 / 3
- Counting Divisors6 / 20
- Common Divisors0 / 2
- Sum of Divisors3 / 7
- Divisor Analysis0 / 0
- Prime Multiples0 / 0
- Counting Coprime Pairs0 / 0
- Next Prime0 / 0
- Binomial Coefficients1 / 1
- Creating Strings II1 / 5
- Distributing Apples1 / 1
- Christmas Party1 / 1
- Permutation Order0 / 0
- Permutation Rounds0 / 3
- Bracket Sequences I0 / 0
- Bracket Sequences II0 / 0
- Counting Necklaces0 / 0
- Counting Grids0 / 0
- Fibonacci Numbers0 / 0
- Throwing Dice0 / 0
- Graph Paths I0 / 0
- Graph Paths II0 / 0
- System of Linear Equations0 / 0
- Sum of Four Squares0 / 0
- Triangle Number Sums0 / 0
- Dice Probability1 / 2
- Moving Robots0 / 0
- Candy Lottery0 / 0
- Inversion Probability0 / 0
- Stick Game4 / 5
- Nim Game I1 / 1
- Nim Game II1 / 1
- Stair Game0 / 0
- Grundy's Game0 / 0
- Another Game25 / 25
String Algorithms
- Word Combinations0 / 5
- String Matching0 / 0
- Finding Borders24 / 24
- Finding Periods0 / 0
- Minimal Rotation0 / 0
- Longest Palindrome0 / 0
- All Palindromes0 / 0
- Required Substring0 / 0
- Palindrome Queries0 / 1
- Finding Patterns0 / 0
- Counting Patterns0 / 0
- Pattern Positions0 / 0
- Distinct Substrings0 / 0
- Distinct Subsequences0 / 0
- Repeating Substring0 / 0
- String Functions0 / 0
- Inverse Suffix Array0 / 0
- String Transform0 / 0
- Substring Order I0 / 0
- Substring Order II0 / 0
- Substring Distribution0 / 0
Geometry
- Point Location Test0 / 0
- Line Segment Intersection0 / 0
- Polygon Area0 / 0
- Point in Polygon0 / 0
- Polygon Lattice Points0 / 0
- Minimum Euclidean Distance0 / 0
- Convex Hull1 / 4
- Maximum Manhattan Distances0 / 0
- All Manhattan Distances0 / 0
- Intersection Points0 / 0
- Line Segments Trace I0 / 0
- Line Segments Trace II0 / 0
- Lines and Queries I0 / 0
- Lines and Queries II0 / 0
- Area of Rectangles0 / 0
- Robot Path0 / 0
Advanced Techniques
- Meet in the Middle0 / 0
- Hamming Distance0 / 0
- Corner Subgrid Check0 / 1
- Corner Subgrid Count0 / 0
- Reachable Nodes0 / 0
- Reachability Queries0 / 0
- Cut and Paste0 / 0
- Substring Reversals0 / 0
- Reversals and Sums0 / 0
- Necessary Roads0 / 0
- Necessary Cities0 / 0
- Eulerian Subgraphs0 / 0
- Monster Game I0 / 0
- Monster Game II0 / 0
- Subarray Squares0 / 0
- Houses and Schools0 / 0
- Knuth Division0 / 0
- Apples and Bananas0 / 0
- One Bit Positions0 / 0
- Signal Processing0 / 0
- New Roads Queries0 / 0
- Dynamic Connectivity0 / 0
- Parcel Delivery0 / 0
- Task Assignment0 / 0
- Distinct Routes II0 / 1
Sliding Window Problems
- Sliding Window Sum0 / 1
- Sliding Window Minimum1 / 3
- Sliding Window Xor0 / 0
- Sliding Window Or0 / 0
- Sliding Window Distinct Values0 / 0
- Sliding Window Mode0 / 0
- Sliding Window Mex0 / 0
- Sliding Window Median0 / 3
- Sliding Window Cost0 / 0
- Sliding Window Inversions1 / 2
- Sliding Window Advertisement0 / 0
Interactive Problems
- Hidden Integer0 / 0
- Hidden Permutation0 / 0
- K-th Highest Score0 / 0
- Permuted Binary Strings0 / 0
- Colored Chairs0 / 0
- Inversion Sorting0 / 0
Bitwise Operations
- Counting Bits0 / 0
- Maximum Xor Subarray0 / 0
- Maximum Xor Subset0 / 0
- Number of Subset Xors0 / 0
- K Subset Xors0 / 0
- All Subarray Xors0 / 0
- Xor Pyramid Peak0 / 0
- Xor Pyramid Diagonal0 / 0
- Xor Pyramid Row0 / 0
- SOS Bit Problem0 / 0
- And Subset Count0 / 0
Construction Problems
- Inverse Inversions0 / 0
- Monotone Subsequences0 / 0
- Third Permutation0 / 0
- Permutation Prime Sums0 / 0
- Chess Tournament0 / 0
- Distinct Sums Grid0 / 0
- Filling Trominos0 / 0
- Grid Path Construction0 / 0
Advanced Graph Problems
- Nearest Shops0 / 0
- Prüfer Code0 / 0
- Tree Traversals0 / 0
- Course Schedule II0 / 0
- Acyclic Graph Edges0 / 0
- Strongly Connected Edges0 / 0
- Even Outdegree Edges0 / 0
- Graph Girth0 / 0
- Fixed Length Walk Queries0 / 0
- Transfer Speeds Sum0 / 0
- MST Edge Check0 / 2
- MST Edge Set Check0 / 0
- MST Edge Cost2 / 2
- Network Breakdown1 / 1
- Tree Coin Collecting I0 / 2
- Tree Coin Collecting II0 / 0
- Tree Isomorphism I0 / 0
- Tree Isomorphism II0 / 0
- Flight Route Requests1 / 1
- Critical Cities0 / 0
- Visiting Cities0 / 0
- Graph Coloring0 / 0
- Bus Companies0 / 0
- Split into Two Paths0 / 1
- Network Renovation0 / 0
- Forbidden Cities0 / 0
- Creating Offices0 / 0
- New Flight Routes0 / 0
Counting Problems
- Filled Subgrid Count I0 / 0
- Filled Subgrid Count II0 / 0
- All Letter Subgrid Count I0 / 0
- All Letter Subgrid Count II0 / 0
- Border Subgrid Count I0 / 0
- Border Subgrid Count II0 / 0
- Raab Game II0 / 0
- Empty String0 / 0
- Permutation Inversions0 / 0
- Counting Bishops0 / 0
- Counting Sequences0 / 1
- Grid Paths II0 / 0
- Counting Permutations0 / 0
- Grid Completion0 / 0
- Counting Reorders0 / 0
- Tournament Graph Distribution0 / 0
- Collecting Numbers Distribution0 / 0
- Functional Graph Distribution0 / 0
Additional Problems I
- Shortest Subsequence0 / 0
- Distinct Values Sum0 / 0
- Distinct Values Splits0 / 0
- Swap Game0 / 0
- Beautiful Permutation II0 / 0
- Multiplication Table0 / 0
- Bubble Sort Rounds I0 / 0
- Bubble Sort Rounds II0 / 0
- Nearest Campsites I0 / 0
- Nearest Campsites II0 / 0
- Advertisement0 / 0
- Special Substrings0 / 0
- Counting LCM Arrays0 / 0
- Square Subsets0 / 0
- Subarray Sum Constraints0 / 0
- Water Containers Moves0 / 0
- Water Containers Queries0 / 0
- Stack Weights0 / 0
- Maximum Average Subarrays0 / 0
- Subsets with Fixed Average0 / 0
- Two Array Average0 / 0
- Pyramid Array0 / 0
- Permutation Subsequence0 / 0
- Bit Inversions0 / 0
- Writing Numbers0 / 0
- Letter Pair Move Game0 / 0
- Maximum Building I0 / 0
- Sorting Methods0 / 0
- Cyclic Array0 / 0
- List of Sums0 / 0
Additional Problems II
- Bouncing Ball Steps0 / 0
- Bouncing Ball Cycle0 / 0
- Knight Moves Queries0 / 0
- K Subset Sums I0 / 0
- K Subset Sums II0 / 0
- Increasing Array II0 / 0
- Food Division0 / 0
- Swap Round Sorting0 / 0
- Binary Subsequences0 / 0
- School Excursion0 / 0
- Coin Grid0 / 0
- Grid Coloring II0 / 0
- Programmers and Artists0 / 0
- Removing Digits II0 / 0
- Coin Arrangement0 / 0
- Replace with Difference0 / 0
- Grid Puzzle I0 / 0
- Grid Puzzle II0 / 0
- Bit Substrings0 / 0
- Reversal Sorting0 / 0
- Book Shop II0 / 1
- GCD Subsets0 / 0
- Minimum Cost Pairs0 / 0
- Same Sum Subsets0 / 0
- Mex Grid Queries0 / 0
- Maximum Building II0 / 0
- Stick Divisions0 / 0
- Stick Difference0 / 0
- Coding Company0 / 0
- Two Stacks Sorting0 / 0