Introductory Problems
- Weird Algorithm0 / 0
- Missing Number1 / 1
- Repetitions0 / 0
- Increasing Array0 / 0
- Permutations0 / 0
- Number Spiral0 / 0
- Two Knights0 / 0
- Two Sets0 / 0
- Bit Strings0 / 0
- Trailing Zeros1 / 1
- Coin Piles0 / 0
- Palindrome Reorder0 / 0
- Gray Code0 / 0
- Tower of Hanoi0 / 0
- Creating Strings0 / 0
- Apple Division0 / 0
- Chessboard and Queens0 / 0
- Digit Queries0 / 0
- Grid Paths0 / 0
Sorting and Searching
- Distinct Numbers0 / 0
- Apartments0 / 0
- Ferris Wheel0 / 0
- Concert Tickets0 / 0
- Restaurant Customers0 / 0
- Movie Festival0 / 0
- Sum of Two Values0 / 0
- Maximum Subarray Sum0 / 0
- Stick Lengths0 / 0
- Missing Coin Sum0 / 0
- Collecting Numbers0 / 0
- Collecting Numbers II0 / 0
- Playlist0 / 0
- Towers0 / 0
- Traffic Lights0 / 0
- Josephus Problem I0 / 0
- Josephus Problem II0 / 0
- Nested Ranges Check0 / 0
- Nested Ranges Count0 / 0
- Room Allocation0 / 0
- Factory Machines0 / 0
- Tasks and Deadlines0 / 0
- Reading Books0 / 0
- Sum of Three Values0 / 0
- Sum of Four Values0 / 0
- Nearest Smaller Values0 / 0
- Subarray Sums I0 / 0
- Subarray Sums II0 / 0
- Subarray Divisibility0 / 0
- Subarray Distinct Values0 / 0
- Array Division0 / 0
- Sliding Window Median0 / 0
- Sliding Window Cost0 / 0
- Movie Festival II0 / 0
- Maximum Subarray Sum II0 / 0
Dynamic Programming
- Dice Combinations0 / 0
- Minimizing Coins0 / 0
- Coin Combinations I0 / 0
- Coin Combinations II0 / 0
- Removing Digits0 / 0
- Grid Paths0 / 0
- Book Shop0 / 0
- Array Description0 / 0
- Counting Towers0 / 0
- Edit Distance0 / 0
- Rectangle Cutting0 / 0
- Money Sums0 / 0
- Removal Game0 / 0
- Two Sets II0 / 0
- Increasing Subsequence0 / 0
- Projects0 / 0
- Elevator Rides0 / 0
- Counting Tilings0 / 0
- Counting Numbers0 / 0
Graph Algorithms
- Counting Rooms0 / 0
- Labyrinth0 / 0
- Building Roads0 / 0
- Message Route0 / 0
- Building Teams0 / 0
- Round Trip0 / 0
- Monsters0 / 0
- Shortest Routes I0 / 0
- Shortest Routes II0 / 0
- High Score0 / 0
- Flight Discount0 / 0
- Cycle Finding0 / 0
- Flight Routes0 / 0
- Round Trip II0 / 0
- Course Schedule0 / 0
- Longest Flight Route0 / 0
- Game Routes0 / 0
- Investigation0 / 0
- Planets Queries I0 / 0
- Planets Queries II0 / 0
- Planets Cycles0 / 0
- Road Reparation0 / 0
- Road Construction0 / 0
- Flight Routes Check0 / 0
- Planets and Kingdoms0 / 0
- Giant Pizza0 / 0
- Coin Collector0 / 0
- Mail Delivery0 / 0
- De Bruijn Sequence0 / 0
- Teleporters Path0 / 0
- Hamiltonian Flights0 / 0
- Knight's Tour0 / 0
- Download Speed0 / 0
- Police Chase0 / 0
- School Dance0 / 0
- Distinct Routes0 / 0
Range Queries
- Static Range Sum Queries0 / 0
- Static Range Minimum Queries0 / 0
- Dynamic Range Sum Queries0 / 0
- Dynamic Range Minimum Queries0 / 0
- Range Xor Queries0 / 0
- Range Update Queries0 / 0
- Forest Queries0 / 0
- Hotel Queries0 / 0
- List Removals0 / 0
- Salary Queries0 / 0
- Prefix Sum Queries0 / 0
- Pizzeria Queries0 / 0
- Subarray Sum Queries0 / 0
- Distinct Values Queries0 / 0
- Increasing Array Queries0 / 0
- Forest Queries II0 / 0
- Range Updates and Sums0 / 0
- Polynomial Queries0 / 0
- Range Queries and Copies0 / 0
Tree Algorithms
- Subordinates0 / 0
- Tree Matching0 / 0
- Tree Diameter0 / 0
- Tree Distances I0 / 0
- Tree Distances II0 / 0
- Company Queries I0 / 0
- Company Queries II0 / 0
- Distance Queries0 / 0
- Counting Paths0 / 0
- Subtree Queries0 / 0
- Path Queries0 / 0
- Path Queries II0 / 0
- Distinct Colors0 / 0
- Finding a Centroid0 / 0
- Fixed-Length Paths I0 / 0
- Fixed-Length Paths II0 / 0
Mathematics
- Josephus Queries0 / 0
- Exponentiation0 / 0
- Exponentiation II0 / 0
- Counting Divisors0 / 0
- Common Divisors0 / 0
- Sum of Divisors0 / 0
- Divisor Analysis0 / 0
- Prime Multiples0 / 0
- Counting Coprime Pairs0 / 0
- Binomial Coefficients0 / 0
- Creating Strings II0 / 0
- Distributing Apples0 / 0
- Christmas Party0 / 0
- 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
- Dice Probability0 / 0
- Moving Robots0 / 0
- Candy Lottery0 / 0
- Inversion Probability0 / 0
- Stick Game0 / 0
- Nim Game I0 / 0
- Nim Game II0 / 0
- Stair Game0 / 0
- Grundy's Game0 / 0
- Another Game0 / 0
String Algorithms
- Word Combinations0 / 0
- String Matching0 / 0
- Finding Borders0 / 0
- Finding Periods0 / 0
- Minimal Rotation0 / 0
- Longest Palindrome0 / 0
- Required Substring0 / 0
- Palindrome Queries0 / 0
- Finding Patterns0 / 0
- Counting Patterns0 / 0
- Pattern Positions0 / 0
- Distinct Substrings0 / 0
- Repeating Substring0 / 0
- String Functions0 / 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 / 0
Advanced Techniques
- Meet in the Middle0 / 0
- Hamming Distance0 / 0
- Beautiful Subgrids0 / 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 / 0
Additional Problems
- Shortest Subsequence0 / 0
- Counting Bits0 / 0
- Swap Game0 / 0
- Prüfer Code0 / 0
- Acyclic Graph Edges0 / 0
- Strongly Connected Edges0 / 0
- Even Outdegree Edges0 / 0
- Multiplication Table0 / 0
- Advertisement0 / 0
- Special Substrings0 / 0
- Permutation Inversions0 / 0
- Maximum Xor Subarray0 / 0
- Movie Festival Queries0 / 0
- Chess Tournament0 / 0
- Tree Traversals0 / 0
- Network Renovation0 / 0
- Graph Girth0 / 0
- Intersection Points0 / 0
- Inverse Inversions0 / 0
- Monotone Subsequences0 / 0
- String Reorder0 / 0
- Stack Weights0 / 0
- Pyramid Array0 / 0
- Increasing Subsequence II0 / 0
- String Removals0 / 0
- Bit Inversions0 / 0
- Xor Pyramid0 / 0
- Writing Numbers0 / 0
- String Transform0 / 0
- Letter Pair Move Game0 / 0
- Maximum Building I0 / 0
- Sorting Methods0 / 0
- Cyclic Array0 / 0
- List of Sums0 / 0
- Increasing Array II0 / 0
- Food Division0 / 0
- Bit Problem0 / 0
- Swap Round Sorting0 / 0
- Binary Subsequences0 / 0
- Tree Isomorphism I0 / 0
- Counting Sequences0 / 0
- Critical Cities0 / 0
- School Excursion0 / 0
- Coin Grid0 / 0
- Robot Path0 / 0
- Programmers and Artists0 / 0
- Course Schedule II0 / 0
- Removing Digits II0 / 0
- Coin Arrangement0 / 0
- Counting Bishops0 / 0
- Grid Puzzle I0 / 0
- Grid Puzzle II0 / 0
- Empty String0 / 0
- Grid Paths0 / 0
- Bit Substrings0 / 0
- Reversal Sorting0 / 0
- Counting Reorders0 / 0
- Book Shop II0 / 0
- Network Breakdown0 / 0
- Visiting Cities0 / 0
- Missing Coin Sum Queries0 / 0
- Number Grid0 / 0
- Maximum Building II0 / 0
- Filling Trominos0 / 0
- Stick Divisions0 / 0
- Coding Company0 / 0
- Flight Route Requests0 / 0
- Two Stacks Sorting0 / 0
- Tree Isomorphism II0 / 0
- Forbidden Cities0 / 0
- Area of Rectangles0 / 0
- Grid Completion0 / 0
- Creating Offices0 / 0
- Permutations II0 / 0
- Functional Graph Distribution0 / 0
- New Flight Routes0 / 0
- Grid Path Construction0 / 0