Introductory Problems
- Weird Algorithm14 / 22
- Missing Number4 / 6
- Repetitions4 / 9
- Increasing Array29 / 29
- Permutations1 / 1
- Number Spiral0 / 1
- Two Knights2 / 2
- Two Sets28 / 28
- Bit Strings0 / 2
- Trailing Zeros0 / 4
- Coin Piles0 / 0
- Palindrome Reorder1 / 1
- Gray Code1 / 1
- Tower of Hanoi29 / 32
- Creating Strings0 / 2
- Apple Division10 / 20
- Chessboard and Queens0 / 0
- Raab Game I0 / 0
- Mex Grid Construction0 / 0
- Knight Moves Grid0 / 0
- Grid Coloring I0 / 0
- Digit Queries0 / 0
- String Reorder1 / 1
- Grid Path Description2 / 3
Sorting and Searching
- Distinct Numbers7 / 13
- Apartments0 / 2
- Ferris Wheel0 / 1
- Concert Tickets6 / 7
- Restaurant Customers3 / 3
- Movie Festival0 / 0
- Sum of Two Values1 / 4
- Maximum Subarray Sum2 / 10
- Stick Lengths0 / 0
- Missing Coin Sum0 / 0
- Collecting Numbers2 / 2
- Collecting Numbers II0 / 0
- Playlist2 / 2
- Towers3 / 3
- Traffic Lights4 / 5
- Distinct Values Subarrays2 / 4
- Distinct Values Subsequences0 / 0
- Josephus Problem I0 / 0
- Josephus Problem II0 / 0
- Nested Ranges Check0 / 0
- Nested Ranges Count0 / 0
- Room Allocation2 / 2
- Factory Machines1 / 1
- Tasks and Deadlines1 / 3
- Reading Books1 / 1
- Sum of Three Values0 / 0
- Sum of Four Values0 / 0
- Nearest Smaller Values0 / 0
- Subarray Sums I0 / 4
- Subarray Sums II0 / 1
- Subarray Divisibility0 / 0
- Distinct Values Subarrays II0 / 0
- Array Division1 / 1
- Movie Festival II0 / 0
- Maximum Subarray Sum II0 / 0
Dynamic Programming
- Dice Combinations1 / 5
- Minimizing Coins1 / 2
- Coin Combinations I1 / 1
- Coin Combinations II1 / 4
- Removing Digits1 / 1
- Grid Paths I0 / 0
- Book Shop2 / 3
- Array Description1 / 1
- Counting Towers0 / 0
- Edit Distance1 / 1
- Longest Common Subsequence0 / 0
- Rectangle Cutting0 / 0
- Minimal Grid Path0 / 4
- Money Sums0 / 0
- Removal Game0 / 0
- Two Sets II0 / 1
- Mountain Range0 / 0
- Increasing Subsequence0 / 0
- Projects0 / 0
- Elevator Rides0 / 1
- Counting Tilings0 / 0
- Counting Numbers5 / 25
- Increasing Subsequence II0 / 0
Graph Algorithms
- Counting Rooms27 / 30
- Labyrinth4 / 4
- Building Roads4 / 8
- Message Route5 / 10
- Building Teams10 / 17
- Round Trip0 / 0
- Monsters1 / 2
- Shortest Routes I1 / 1
- Shortest Routes II0 / 0
- High Score3 / 7
- Flight Discount3 / 8
- Cycle Finding2 / 3
- Flight Routes1 / 3
- Round Trip II0 / 1
- Course Schedule0 / 4
- Longest Flight Route2 / 2
- Game Routes3 / 4
- Investigation1 / 2
- Planets Queries I1 / 1
- Planets Queries II0 / 2
- Planets Cycles0 / 1
- Road Reparation0 / 0
- Road Construction0 / 0
- Flight Routes Check0 / 1
- Planets and Kingdoms0 / 1
- Giant Pizza0 / 0
- Coin Collector0 / 1
- Mail Delivery0 / 0
- De Bruijn Sequence0 / 0
- Teleporters Path0 / 0
- Hamiltonian Flights0 / 0
- Knight's Tour1 / 1
- Download Speed0 / 0
- Police Chase0 / 0
- School Dance0 / 0
- Distinct Routes0 / 0
Range Queries
- Static Range Sum Queries2 / 9
- Static Range Minimum Queries0 / 1
- Dynamic Range Sum Queries0 / 0
- Dynamic Range Minimum Queries0 / 0
- Range Xor Queries0 / 1
- Range Update Queries0 / 3
- Forest Queries1 / 1
- Hotel Queries1 / 1
- List Removals0 / 0
- Salary Queries1 / 2
- Prefix Sum Queries0 / 0
- Pizzeria Queries0 / 3
- Visible Buildings Queries0 / 0
- Range Interval Queries0 / 0
- Subarray Sum Queries0 / 0
- Subarray Sum Queries II0 / 0
- Distinct Values Queries0 / 0
- Distinct Values Queries II0 / 0
- Increasing Array Queries0 / 0
- Movie Festival Queries0 / 0
- Forest Queries II0 / 0
- Range Updates and Sums0 / 2
- Polynomial Queries0 / 1
- Range Queries and Copies0 / 0
- Missing Coin Sum Queries0 / 0
Tree Algorithms
- Subordinates25 / 25
- Tree Matching3 / 4
- Tree Diameter1 / 1
- Tree Distances I0 / 0
- Tree Distances II0 / 0
- Company Queries I0 / 0
- Company Queries II0 / 1
- Distance Queries0 / 1
- Counting Paths0 / 0
- Subtree Queries1 / 1
- Path Queries0 / 0
- Path Queries II0 / 1
- Distinct Colors0 / 1
- Finding a Centroid0 / 0
- Fixed-Length Paths I0 / 0
- Fixed-Length Paths II0 / 0
Mathematics
- Josephus Queries0 / 0
- Exponentiation0 / 0
- Exponentiation II0 / 0
- Counting Divisors3 / 8
- Common Divisors0 / 0
- Sum of Divisors0 / 1
- Divisor Analysis0 / 0
- Prime Multiples0 / 0
- Counting Coprime Pairs0 / 0
- Next Prime0 / 0
- Binomial Coefficients0 / 0
- Creating Strings II0 / 3
- Distributing Apples0 / 0
- Christmas Party0 / 0
- Permutation Order0 / 0
- Permutation Rounds0 / 2
- 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 Probability0 / 0
- Moving Robots0 / 0
- Candy Lottery0 / 0
- Inversion Probability0 / 0
- Stick Game3 / 4
- Nim Game I0 / 0
- Nim Game II0 / 0
- Stair Game0 / 0
- Grundy's Game0 / 0
- Another Game25 / 25
String Algorithms
- Word Combinations0 / 0
- String Matching0 / 0
- Finding Borders24 / 24
- Finding Periods0 / 0
- Minimal Rotation0 / 0
- Longest Palindrome0 / 0
- All Palindromes0 / 0
- Required Substring0 / 0
- Palindrome Queries0 / 0
- 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 Hull0 / 3
- 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 / 0
- 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 / 0
- Sliding Window Minimum0 / 0
- Sliding Window Xor0 / 0
- Sliding Window Or0 / 0
- Sliding Window Distinct Values0 / 0
- Sliding Window Mode0 / 0
- Sliding Window Mex0 / 0
- Sliding Window Median0 / 0
- Sliding Window Cost0 / 0
- Sliding Window Inversions0 / 0
- 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 Cost1 / 1
- Network Breakdown0 / 0
- 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 / 0
- 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