General
Set 1
- Weird Algorithm
- Increasing Array
- Two Sets
- Missing Coin Sum
- Josephus Problem I
- Concert Tickets
- Room Allocation
- Josephus Problem II
Set 2
Set 3
- Dice Combinations
- Coin Combinations I
- Coin Combinations II
- Two Sets II
- Rectangle Cutting
- Removal Game
- Counting Towers
- Counting Numbers
Set 4
- Dynamic Range Sum Queries
- Dynamic Range Minimum Queries
- Range Xor Queries
- Hotel Queries
- List Removals
- Increasing Subsequence
- Range Update Queries
- Distinct Values Queries
Set 5
- Subordinates
- Tree Matching
- Tree Diameter
- Tree Distances I
- Tree Distances II
- Company Queries I
- Company Queries II
- Distance Queries
Set 6
- Planets Queries I
- Planets Queries II
- Mail Delivery
- Teleporters Path
- Necessary Roads
- Necessary Cities
- Parcel Delivery
- Task Assignment
Set 7
- String Matching
- Finding Borders
- Finding Periods
- Minimal Rotation
- Counting Patterns
- Pattern Positions
- Distinct Substrings
- Substring Distribution
Set 8
Additional Tasks
- Prüfer Code
- Acyclic Graph Edges
- Strongly Connected Edges
- Even Outdegree Edges
- String Reorder
- Pyramid Array
- Distinct Subsequences
- Xor Pyramid Peak
- Maximum Building I
- Sorting Methods
- Increasing Array II
- Food Division
- Swap Round Sorting
- Counting Sequences
- Critical Cities
- Empty String
- Missing Coin Sum Queries
- Maximum Building II
- Two Stacks Sorting
- Forbidden Cities
- Area of Rectangles
- Creating Offices
- Functional Graph Distribution
- New Flight Routes
