CSES-Solutions

KO | EN

gitlite — search

#javascript #python #hacktoberfest #react #ai #typescript #llm #go #golang #android #machine-learning #rust #deep-learning #linux

★ 71 Open GitHub ↗

300+ accepted solutions for CSES problemset

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

The CSES Problem Set contains a collection of algorithm programming practice problems. You can access the problems here: https://cses.fi/problemset/list/. This set has 400 classic problems of various categories and difficulties.

This was my practice run for ICPC. There are more than 290 accepted solutions listed here. I have also added tags for some of the problems.

- At first try to come up with a solution by yourself. 
- If you can't then read some article on the associated tags and try again. 
- If you still can't then you proceed to the solution. Try to understand what is going on. Then try your own approach.

Milestones:

- [x] 29/12/2021: `Solved 100th Problem`
- [x] 05/05/2022: `Solved 150th Problem`
- [x] 05/12/2022: `Solved 200th Problem`
- [x] 11/11/2023: `Solved 250th Problem`
- [x] 14/06/2025: `Solved all Searching and Sorting Problems`
- [x] 26/06/2025: `Solved all Range Queries Problems`
- [x] 30/10/2025: `Solved all Introductory Problems`
- [x] 07/11/2025: `Solved 300th Problem`

## Introductory Problems

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Weird Algorithm |  | [Code](Introductory%20Problems/Weird%20Algorithm.cpp) |
| ✔ | Missing Number |  | [Code](Introductory%20Problems/Missing%20Number.cpp) |
| ✔ | Repetitions |  | [Code](Introductory%20Problems/Repetitions.cpp) |
| ✔ | Increasing Array |  | [Code](Introductory%20Problems/Increasing%20Array.cpp) |
| ✔ | Permutations |  | [Code](Introductory%20Problems/Permutations.cpp) |
| ✔ | Number Spiral |  | [Code](Introductory%20Problems/Number%20Spiral.cpp) |
| ✔ | Two Knights |  | [Code](Introductory%20Problems/Two%20Knights.cpp) |
| ✔ | Two Sets |  | [Code](Introductory%20Problems/Two%20Sets.cpp) |
| ✔ | Bit Strings |  | [Code](Introductory%20Problems/Bit%20Strings.cpp) |
| ✔ | Trailing Zeros |  | [Code](Introductory%20Problems/Trailing%20Zeros.cpp) |
| ✔ | Coin Piles |  | [Code](Introductory%20Problems/Coin%20Piles.cpp) |
| ✔ | Palindrome Reorder |  | [Code](Introductory%20Problems/Palindrome%20Reorder.cpp) |
| ✔ | Gray Code |  | [Code](Introductory%20Problems/Gray%20Code.cpp) |
| ✔ | Tower of Hanoi |  | [Code](Introductory%20Problems/Tower%20of%20Hanoi.cpp) |
| ✔ | Creating Strings |  | [Code](Introductory%20Problems/Creating%20Strings.cpp) |
| ✔ | Apple Division |  | [Code](Introductory%20Problems/Apple%20Division.cpp) |Distinct Values Subsequences
| ✔ | Chessboard and Queens |  | [Code](Introductory%20Problems/Chessboard%20and%20Queens.cpp) |
| ✔ | Raab Game I |  | [Code](Introductory%20Problems/Raab%20Game%20I.cpp) |
| ✔ | Mex Grid Construction | `Brute Force` | [Code](Introductory%20Problems/Mex%20Grid%20Construction.cpp) |
| ✔ | Knight Moves Grid | `BFS` | [Code](Introductory%20Problems/Knight%20Moves%20Grid.cpp) |
| ✔ | Grid Coloring I | `greedy` | [Code](Introductory%20Problems/Grid%20Coloring%20I.cpp) |
| ✔ | Digit Queries |  | [Code](Introductory%20Problems/Digit%20Queries.cpp) |
| ✔ | String Reorder | `greedy` `constructive` | [Code](Introductory%20Problems/String%20Reorder.cpp) |
| ✔ | Grid Path Description |  | [Code](Introductory%20Problems/Grid%20Path%20Description.cpp) |

## Sorting and Searching

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Distinct Numbers |  | [Code](Sorting%20and%20Searching/Distinct%20Numbers.cpp) |
| ✔ | Apartments |  | [Code](Sorting%20and%20Searching/Apartments.cpp) |
| ✔ | Ferris Wheel |  | [Code](Sorting%20and%20Searching/Ferris%20Wheel.cpp) |
| ✔ | Concert Tickets |  | [Code](Sorting%20and%20Searching/Concert%20Tickets.cpp) |
| ✔ | Restaurant Customers |  | [Code](Sorting%20and%20Searching/Restaurant%20Customers.cpp) |
| ✔ | Movie Festival |  | [Code](Sorting%20and%20Searching/Movie%20Festival.cpp) |
| ✔ | Sum of Two Values |  | [Code](Sorting%20and%20Searching/Sum%20of%20Two%20Values.cpp) |
| ✔ | Maximum Subarray Sum |  | [Code](Sorting%20and%20Searching/Maximum%20Subarray%20Sum.cpp) |
| ✔ | Stick Lengths |  | [Code](Sorting%20and%20Searching/Stick%20Lengths.cpp) |
| ✔ | Missing Coin Sum |  | [Code](Sorting%20and%20Searching/Missing%20Coin%20Sum.cpp) |
| ✔ | Collecting Numbers |  | [Code](Sorting%20and%20Searching/Collecting%20Numbers.cpp) |
| ✔ | Collecting Numbers II |  | [Code](Sorting%20and%20Searching/Collecting%20Numbers%20II.cpp) |
| ✔ | Playlist |  | [Code](Sorting%20and%20Searching/Playlist.cpp) |
| ✔ | Towers |  | [Code](Sorting%20and%20Searching/Towers.cpp) |
| ✔ | Traffic Lights |  | [Code](Sorting%20and%20Searching/Traffic%20Lights.cpp) |
| ✔ | Distinct Values Subarrays | `Counting` | [Code](Sorting%20and%20Searching/Distinct%20Values%20Subarrays.cpp) |
| ✔ | Distinct Values Subsequences | `Counting` | [Code](Sorting%20and%20Searching/Distinct%20Values%20Subsequences.cpp) |
| ✔ | Josephus Problem I |  | [Code](Sorting%20and%20Searching/Josephus%20Problem%20I.cpp) |
| ✔ | Josephus Problem II | `OST` | [Code](Sorting%20and%20Searching/Josephus%20Problem%20II.cpp) |
| ✔ | Nested Ranges Check |  | [Code](Sorting%20and%20Searching/Nested%20Ranges%20Check.cpp) |
| ✔ | Nested Ranges Count | `Point Update Range Sum` | [Code](Sorting%20and%20Searching/Nested%20Ranges%20Count.cpp) |
| ✔ | Room Allocation |  | [Code](Sorting%20and%20Searching/Room%20Allocation.cpp) |
| ✔ | Factory Machines |  | [Code](Sorting%20and%20Searching/Factory%20Machines.cpp) |
| ✔ | Tasks and Deadlines |  | [Code](Sorting%20and%20Searching/Tasks%20and%20Deadlines.cpp) |
| ✔ | Reading Books |  | [Code](Sorting%20and%20Searching/Reading%20Books.cpp) |
| ✔ | Sum of Three Values |  | [Code](Sorting%20and%20Searching/Sum%20of%20Three%20Values.cpp) |
| ✔ | Sum of Four Values |  | [Code](Sorting%20and%20Searching/Sum%20of%20Four%20Values.cpp) |
| ✔ | Nearest Smaller Values |  | [Code](Sorting%20and%20Searching/Nearest%20Smaller%20Values.cpp) |
| ✔ | Subarray Sums I |  | [Code](Sorting%20and%20Searching/Subarray%20Sums%20I.cpp) |
| ✔ | Subarray Sums II |  | [Code](Sorting%20and%20Searching/Subarray%20Sums%20II.cpp) |
| ✔ | Subarray Divisibility |  | [Code](Sorting%20and%20Searching/Subarray%20Divisibility.cpp) |
| ✔ | Distinct Values Subarrays II |  | [Code](Sorting%20and%20Searching/Distinct%20Values%20Subarrays%20II.cpp) |
| ✔ | Array Division |  | [Code](Sorting%20and%20Searching/Array%20Division.cpp) |
| ✔ | Movie Festival II | `Greedy Scheduling` `Binary Search` | [Code](Sorting%20and%20Searching/Movie%20Festival%20II.cpp) |
| ✔ | Maximum Subarray Sum II |  | [Code](Sorting%20and%20Searching/Maximum%20Subarray%20Sum%20II.cpp) |

## Dynamic Programming

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Dice Combinations | `Coin change DP` | [Code](Dynamic%20Programming/Dice%20Combinations.cpp) |
| ✔ | Minimizing Coins | `Coin change DP` | [Code](Dynamic%20Programming/Minimizing%20Coins.cpp) |
| ✔ | Coin Combinations I | `Coin change DP` | [Code](Dynamic%20Programming/Coin%20Combinations%20I.cpp) |
| ✔ | Coin Combinations II | `Coin change DP` | [Code](Dynamic%20Programming/Coin%20Combinations%20II.cpp) |
| ✔ | Removing Digits |  | [Code](Dynamic%20Programming/Removing%20Digits.cpp) |
| ✔ | Grid Paths I |  | [Code](Dynamic%20Programming/Grid%20Paths%20I.cpp) |
| ✔ | Book Shop |  | [Code](Dynamic%20Programming/Book%20Shop.cpp) |
| ✔ | Array Description |  | [Code](Dynamic%20Programming/Array%20Description.cpp) |
| ✔ | Counting Towers |  | [Code](Dynamic%20Programming/Counting%20Towers.cpp) |
| ✔ | Edit Distance |  | [Code](Dynamic%20Programming/Edit%20Distance.cpp) |
| ✔ | Longest Common Subsequence | `LCS` | [Code](Dynamic%20Programming/Longest%20Common%20Subsequence.cpp) |
| ✔ | Rectangle Cutting |  | [Code](Dynamic%20Programming/Rectangle%20Cutting.cpp) |
| ✔ | Minimal Grid Path | `BFS` | [Code](Dynamic%20Programming/Minimal%20Grid%20Path.cpp) |
| ✔ | Money Sums |  | [Code](Dynamic%20Programming/Money%20Sums.cpp) |
| ✔ | Removal Game |  | [Code](Dynamic%20Programming/Removal%20Game.cpp) |
| ✔ | Two Sets II | `Knapsack DP` | [Code](Dynamic%20Programming/Two%20Sets%20II.cpp) |
|  | Mountain Range |  | [Code](Dynamic%20Programming/Mountain%20Range.cpp) |
| ✔ | Increasing Subsequence | `LIS` | [Code](Dynamic%20Programming/Increasing%20Subsequence.cpp) |
| ✔ | Projects |  | [Code](Dynamic%20Programming/Projects.cpp) |
| ✔ | Elevator Rides | `Bitmask DP` | [Code](Dynamic%20Programming/Elevator%20Rides.cpp) |
| ✔ | Counting Tilings | `Broken Profile DP` `Bitmask` | [Code](Dynamic%20Programming/Counting%20Tilings.cpp) |
| ✔ | Counting Numbers | `Digit Dp` | [Code](Dynamic%20Programming/Counting%20Numbers.cpp) |
| ✔ | Increasing Subsequence II |  | [Code](Dynamic%20Programming/Increasing%20Subsequence%20II.cpp) |

## Graph Algorithms

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Counting Rooms | `BFS` | [Code](Graph%20Algorithms/Counting%20Rooms.cpp) |
| ✔ | Labyrinth | `BFS` | [Code](Graph%20Algorithms/Labyrinth.cpp) |
| ✔ | Building Roads | `BFS` `DFS` `Forest Counting` | [Code](Graph%20Algorithms/Building%20Roads.cpp) |
| ✔ | Message Route | `BFS` | [Code](Graph%20Algorithms/Message%20Route.cpp) |
| ✔ | Building Teams | `Bicoloring` `DFS` | [Code](Graph%20Algorithms/Building%20Teams.cpp) |
| ✔ | Round Trip | `Cycle in undirected graph` `DFS` | [Code](Graph%20Algorithms/Round%20Trip.cpp) |
| ✔ | Monsters | `BFS` | [Code](Graph%20Algorithms/Monsters.cpp) |
| ✔ | Shortest Routes I | `Single Source Shortest Path` ` Dijkstra` | [Code](Graph%20Algorithms/Shortest%20Routes%20I.cpp) |
| ✔ | Shortest Routes II | `All Pair Shortes Path` `Floyd Warshall` | [Code](Graph%20Algorithms/Shortest%20Routes%20II.cpp) |
| ✔ | High Score | `Single Source Shortest Path` ` Bellman Ford` | [Code](Graph%20Algorithms/High%20Score.cpp) |
| ✔ | Flight Discount | `Single Source Shortest Path` ` Dijkstra` | [Code](Graph%20Algorithms/Flight%20Discount.cpp) |
| ✔ | Cycle Finding | `Negative Cycle` `Bellman Ford` | [Code](Graph%20Algorithms/Cycle%20Finding.cpp) |
| ✔ | Flight Routes | `Dijkstra` | [Code](Graph%20Algorithms/Flight%20Routes.cpp) |
| ✔ | Round Trip II | `DFS` `Cycle in directed graph` | [Code](Graph%20Algorithms/Round%20Trip%20II.cpp) |
| ✔ | Course Schedule | `Topological Sort` | [Code](Graph%20Algorithms/Course%20Schedule.cpp) |
| ✔ | Longest Flight Route | `Topological Sort` `DP` | [Code](Graph%20Algorithms/Longest%20Flight%20Route.cpp) |
| ✔ | Game Routes | `Topological Sort` `DP` | [Code](Graph%20Algorithms/Game%20Routes.cpp) |
| ✔ | Investigation | `Dijkstra` | [Code](Graph%20Algorithms/Investigation.cpp) |
| ✔ | Planets Queries I | `Binary Lifting` | [Code](Graph%20Algorithms/Planets%20Queries%20I.cpp) |
|  | Planets Queries II |  | [Code](Graph%20Algorithms/Planets%20Queries%20II.cpp) |
| ✔ | Planets Cycles | `DFS` | [Code](Graph%20Algorithms/Planets%20Cycles.cpp) |
| ✔ | Road Reparation | `Minimum Spanning Tree` `Kruskal` | [Code](Graph%20Algorithms/Road%20Reparation.cpp) |
| ✔ | Road Construction | `DSU` | [Code](Graph%20Algorithms/Road%20Construction.cpp) |
| ✔ | Flight Routes Check | `Strongly Connected Components` | [Code](Graph%20Algorithms/Flight%20Routes%20Check.cpp) |
| ✔ | Planets and Kingdoms | `Strongly Connected Components` | [Code](Graph%20Algorithms/Planets%20and%20Kingdoms.cpp) |
| ✔ | Giant Pizza | `2-SAT` | [Code](Graph%20Algorithms/Giant%20Pizza.cpp) |
| ✔ | Coin Collector | `Condensation Graph` `Topological Sort` `DP` | [Code](Graph%20Algorithms/Coin%20Collector.cpp) |
| ✔ | Mail Delivery | `Euler Tour - Undirected` | [Code](Graph%20Algorithms/Mail%20Delivery.cpp) |
| ✔ | De Bruijn Sequence | `De Bruijn Sequence` | [Code](Graph%20Algorithms/De%20Bruijn%20Sequence.cpp) |
| ✔ | Teleporters Path | `Euler Path - Directed` | [Code](Graph%20Algorithms/Teleporters%20Path.cpp) |
| ✔ | Hamiltonian Flights | `Hamiltonian Path` `Bitmask DP` | [Code](Graph%20Algorithms/Hamiltonian%20Flights.cpp) |
| ✔ | Knight's Tour | `Hamiltonian Path` `Heuristics` | [Code](Graph%20Algorithms/Knight's%20Tour.cpp) |
| ✔ | Download Speed | `Max Flow Min Cut` `Push Relabel` `Dinic` | [Code](Graph%20Algorithms/Download%20Speed.cpp) |
| ✔ | Police Chase | `Max Flow Min Cut` `Push Relabel` | [Code](Graph%20Algorithms/Police%20Chase.cpp) |
| ✔ | School Dance | `Max Flow``Bipartite Matching` `Hopkroft Carp` | [Code](Graph%20Algorithms/School%20Dance.cpp) |
| ✔ | Distinct Routes | `Max Flow` `Dinic` `Path reconstruction` | [Code](Graph%20Algorithms/Distinct%20Routes.cpp) |

## Range Queries

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Static Range Sum Queries |  | [Code](Range%20Queries/Static%20Range%20Sum%20Queries.cpp) |
| ✔ | Static Range Minimum Queries |  | [Code](Range%20Queries/Static%20Range%20Minimum%20Queries.cpp) |
| ✔ | Dynamic Range Sum Queries |  | [Code](Range%20Queries/Dynamic%20Range%20Sum%20Queries.cpp) |
| ✔ | Dynamic Range Minimum Queries |  | [Code](Range%20Queries/Dynamic%20Range%20Minimum%20Queries.cpp) |
| ✔ | Range Xor Queries |  | [Code](Range%20Queries/Range%20Xor%20Queries.cpp) |
| ✔ | Range Update Queries |  | [Code](Range%20Queries/Range%20Update%20Queries.cpp) |
| ✔ | Forest Queries |  | [Code](Range%20Queries/Forest%20Queries.cpp) |
| ✔ | Hotel Queries |  | [Code](Range%20Queries/Hotel%20Queries.cpp) |
| ✔ | List Removals |  | [Code](Range%20Queries/List%20Removals.cpp) |
| ✔ | Salary Queries |  | [Code](Range%20Queries/Salary%20Queries.cpp) |
| ✔ | Prefix Sum Queries |  | [Code](Range%20Queries/Prefix%20Sum%20Queries.cpp) |
| ✔ | Pizzeria Queries |  | [Code](Range%20Queries/Pizzeria%20Queries.cpp) |
| ✔ | Visible Buildings Queries | `Binary Lifting` | [Code](Range%20Queries/Visible%20Buildings%20Queries.cpp) |
| ✔ | Range Interval Queries | `Merge Sort Tree` | [Code](Range%20Queries/Range%20Interval%20Queries.cpp) |
| ✔ | Subarray Sum Queries |  | [Code](Range%20Queries/Subarray%20Sum%20Queries.cpp) |
| ✔ | Subarray Sum Queries II | `Segment tree` | [Code](Range%20Queries/Subarray%20Sum%20Queries%20II.cpp) |
| ✔ | Distinct Values Queries |  | [Code](Range%20Queries/Distinct%20Values%20Queries.cpp) |
| ✔ | Distinct Values Queries II | `Segment Tree` | [Code](Range%20Queries/Distinct%20Values%20Queries%20II.cpp) |
| ✔ | Increasing Array Queries | `Segment tree` `Tree walking` | [Code](Range%20Queries/Increasing%20Array%20Queries.cpp) |
| ✔ | Movie Festival Queries | `Greedy Scheduling` `RMQ` `Binary Lifting` | [Code](Range%20Queries/Movie%20Festival%20Queries.cpp) |
| ✔ | Forest Queries II |  | [Code](Range%20Queries/Forest%20Queries%20II.cpp) |
| ✔ | Range Updates and Sums |  | [Code](Range%20Queries/Range%20Updates%20and%20Sums.cpp) |
| ✔ | Polynomial Queries | `Lazy Segment Tree` | [Code](Range%20Queries/Polynomial%20Queries.cpp) |
| ✔ | Range Queries and Copies | `Persistent Segment Tree` | [Code](Range%20Queries/Range%20Queries%20and%20Copies.cpp) |
| ✔ | Missing Coin Sum Queries | `Iterative Segment Tree` | [Code](Range%20Queries/Missing%20Coin%20Sum%20Queries.cpp) |

## Tree Algorithms

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Subordinates | `Subtree DP` | [Code](Tree%20Algorithms/Subordinates.cpp) |
| ✔ | Tree Matching | `Tree DP` | [Code](Tree%20Algorithms/Tree%20Matching.cpp) |
| ✔ | Tree Diameter | `Tree Diameter` | [Code](Tree%20Algorithms/Tree%20Diameter.cpp) |
| ✔ | Tree Distances I | `Tree Diameter` | [Code](Tree%20Algorithms/Tree%20Distances%20I.cpp) |
| ✔ | Tree Distances II | `Tree Rerooting DP` | [Code](Tree%20Algorithms/Tree%20Distances%20II.cpp) |
| ✔ | Company Queries I | `Binary Lifting` | [Code](Tree%20Algorithms/Company%20Queries%20I.cpp) |
| ✔ | Company Queries II | `LCA` | [Code](Tree%20Algorithms/Company%20Queries%20II.cpp) |
| ✔ | Distance Queries | `LCA` | [Code](Tree%20Algorithms/Distance%20Queries.cpp) |
| ✔ | Counting Paths | `HLD` | [Code](Tree%20Algorithms/Counting%20Paths.cpp) |
| ✔ | Subtree Queries | `HLD` | [Code](Tree%20Algorithms/Subtree%20Queries.cpp) |
| ✔ | Path Queries | `HLD` | [Code](Tree%20Algorithms/Path%20Queries.cpp) |
| ✔ | Path Queries II | `HLD` | [Code](Tree%20Algorithms/Path%20Queries%20II.cpp) |
| ✔ | Distinct Colors | `MO on Tree` / `Sack` `Small to Large` | [Code](Tree%20Algorithms/Distinct%20Colors.cpp) |
| ✔ | Finding a Centroid | `Centroid` | [Code](Tree%20Algorithms/Finding%20a%20Centroid.cpp) |
| ✔ | Fixed-Length Paths I | `Centroid Decomposition` | [Code](Tree%20Algorithms/Fixed-Length%20Paths%20I.cpp) |
|  | Fixed-Length Paths II | `Centroid Decomposition` | [Code](Tree%20Algorithms/Fixed-Length%20Paths%20II.cpp) |

## Mathematics

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Josephus Queries |  | [Code](Mathematics/Josephus%20Queries.cpp) |
| ✔ | Exponentiation |  | [Code](Mathematics/Exponentiation.cpp) |
| ✔ | Exponentiation II |  | [Code](Mathematics/Exponentiation%20II.cpp) |
| ✔ | Counting Divisors |  | [Code](Mathematics/Counting%20Divisors.cpp) |
| ✔ | Common Divisors |  | [Code](Mathematics/Common%20Divisors.cpp) |
| ✔ | Sum of Divisors |  | [Code](Mathematics/Sum%20of%20Divisors.cpp) |
| ✔ | Divisor Analysis |  | [Code](Mathematics/Divisor%20Analysis.cpp) |
| ✔ | Prime Multiples |  | [Code](Mathematics/Prime%20Multiples.cpp) |
| ✔ | Counting Coprime Pairs |  | [Code](Mathematics/Counting%20Coprime%20Pairs.cpp) |
| ✔ | Next Prime | `Segmented Sieve` | [Code](Mathematics/Next%20Prime.cpp) |
| ✔ | Binomial Coefficients |  | [Code](Mathematics/Binomial%20Coefficients.cpp) |
| ✔ | Creating Strings II |  | [Code](Mathematics/Creating%20Strings%20II.cpp) |
| ✔ | Distributing Apples |  | [Code](Mathematics/Distributing%20Apples.cpp) |
| ✔ | Christmas Party |  | [Code](Mathematics/Christmas%20Party.cpp) |
|  | Permutation Order |  | [Code](Mathematics/Permutation%20Order.cpp) |
|  | Permutation Rounds |  | [Code](Mathematics/Permutation%20Rounds.cpp) |
| ✔ | Bracket Sequences I |  | [Code](Mathematics/Bracket%20Sequences%20I.cpp) |
| ✔ | Bracket Sequences II |  | [Code](Mathematics/Bracket%20Sequences%20II.cpp) |
| ✔ | Counting Necklaces |  | [Code](Mathematics/Counting%20Necklaces.cpp) |
| ✔ | Counting Grids |  | [Code](Mathematics/Counting%20Grids.cpp) |
| ✔ | Fibonacci Numbers |  | [Code](Mathematics/Fibonacci%20Numbers.cpp) |
| ✔ | Throwing Dice |  | [Code](Mathematics/Throwing%20Dice.cpp) |
| ✔ | Graph Paths I |  | [Code](Mathematics/Graph%20Paths%20I.cpp) |
| ✔ | Graph Paths II |  | [Code](Mathematics/Graph%20Paths%20II.cpp) |
|  | System of Linear Equations |  | [Code](Mathematics/System%20of%20Linear%20Equations.cpp) |
|  | Sum of Four Squares |  | [Code](Mathematics/Sum%20of%20Four%20Squares.cpp) |
|  | Triangle Number Sums |  | [Code](Mathematics/Triangle%20Number%20Sums.cpp) |
| ✔ | Dice Probability |  | [Code](Mathematics/Dice%20Probability.cpp) |
|  | Moving Robots |  | [Code](Mathematics/Moving%20Robots.cpp) |
|  | Candy Lottery | `Expected Value` | [Code](Mathematics/Candy%20Lottery.cpp) |
|  | Inversion Probability |  | [Code](Mathematics/Inversion%20Probability.cpp) |
| ✔ | Stick Game |  | [Code](Mathematics/Stick%20Game.cpp) |
| ✔ | Nim Game I |  | [Code](Mathematics/Nim%20Game%20I.cpp) |
| ✔ | Nim Game II |  | [Code](Mathematics/Nim%20Game%20II.cpp) |
| ✔ | Stair Game |  | [Code](Mathematics/Stair%20Game.cpp) |
| ✔ | Grundy's Game |  | [Code](Mathematics/Grundy's%20Game.cpp) |
| ✔ | Another Game |  | [Code](Mathematics/Another%20Game.cpp) |

## String Algorithms

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Word Combinations | `Trie` `DP` | [Code](String%20Algorithms/Word%20Combinations.cpp) |
| ✔ | String Matching | `Suffix array` / `Hashing` | [Code](String%20Algorithms/String%20Matching.cpp) |
| ✔ | Finding Borders | `Z function` `Prefix function` / `Hashing` | [Code](String%20Algorithms/Finding%20Borders.cpp) |
| ✔ | Finding Periods | `Z function` `Prefix function` / `Hashing` | [Code](String%20Algorithms/Finding%20Periods.cpp) |
| ✔ | Minimal Rotation | `Suffix Automata` | [Code](String%20Algorithms/Minimal%20Rotation.cpp) |
| ✔ | Longest Palindrome | `Manacher` | [Code](String%20Algorithms/Longest%20Palindrome.cpp) |
|  | All Palindromes |  | [Code](String%20Algorithms/All%20Palindromes.cpp) |
|  | Required Substring |  | [Code](String%20Algorithms/Required%20Substring.cpp) |
| ✔ | Palindrome Queries | `Range Sum` `Hashing` | [Code](String%20Algorithms/Palindrome%20Queries.cpp) |
| ✔ | Finding Patterns |  | [Code](String%20Algorithms/Finding%20Patterns.cpp) |
| ✔ | Counting Patterns |  | [Code](String%20Algorithms/Counting%20Patterns.cpp) |
| ✔ | Pattern Positions |  | [Code](String%20Algorithms/Pattern%20Positions.cpp) |
| ✔ | Distinct Substrings |  | [Code](String%20Algorithms/Distinct%20Substrings.cpp) |
| ✔ | Distinct Subsequences |  | [Code](String%20Algorithms/Distinct%20Subsequences.cpp) |
| ✔ | Repeating Substring | `Hashing` `Binary Search` | [Code](String%20Algorithms/Repeating%20Substring.cpp) |
| ✔ | String Functions |  | [Code](String%20Algorithms/String%20Functions.cpp) |
|  | Inverse Suffix Array |  | [Code](String%20Algorithms/Inverse%20Suffix%20Array.cpp) |
| ✔ | String Transform | `Inverse Burrows Wheeler Transform` | [Code](String%20Algorithms/String%20Transform.cpp) |
| ✔ | Substring Order I |  | [Code](String%20Algorithms/Substring%20Order%20I.cpp) |
| ✔ | Substring Order II |  | [Code](String%20Algorithms/Substring%20Order%20II.cpp) |
| ✔ | Substring Distribution | `Suffix Array` `Longest Common Prefix` | [Code](String%20Algorithms/Substring%20Distribution.cpp) |

## Geometry

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Point Location Test | `Cross Product` | [Code](Geometry/Point%20Location%20Test.cpp) |
| ✔ | Line Segment Intersection |  | [Code](Geometry/Line%20Segment%20Intersection.cpp) |
| ✔ | Polygon Area |  | [Code](Geometry/Polygon%20Area.cpp) |
| ✔ | Point in Polygon |  | [Code](Geometry/Point%20in%20Polygon.cpp) |
| ✔ | Polygon Lattice Points |  | [Code](Geometry/Polygon%20Lattice%20Points.cpp) |
|  | Minimum Euclidean Distance |  | [Code](Geometry/Minimum%20Euclidean%20Distance.cpp) |
| ✔ | Convex Hull |  | [Code](Geometry/Convex%20Hull.cpp) |
| ✔ | Maximum Manhattan Distances | `Chebyshev Transformation` | [Code](Geometry/Maximum%20Manhattan%20Distances.cpp) |
| ✔ | All Manhattan Distances | `Counting` | [Code](Geometry/All%20Manhattan%20Distances.cpp) |
| ✔ | Intersection Points | `Range Query with Sweep Line` | [Code](Geometry/Intersection%20Points.cpp) |
|  | Line Segments Trace I |  | [Code](Geometry/Line%20Segments%20Trace%20I.cpp) |
|  | Line Segments Trace II |  | [Code](Geometry/Line%20Segments%20Trace%20II.cpp) |
|  | Lines and Queries I |  | [Code](Geometry/Lines%20and%20Queries%20I.cpp) |
|  | Lines and Queries II |  | [Code](Geometry/Lines%20and%20Queries%20II.cpp) |
| ✔ | Area of Rectangles | `Range Query and Update with Sweep Line` | [Code](Geometry/Area%20of%20Rectangles.cpp) |
|  | Robot Path |  | [Code](Geometry/Robot%20Path.cpp) |

## Advanced Techniques

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Meet in the Middle |  | [Code](Advanced%20Techniques/Meet%20in%20the%20Middle.cpp) |
| ✔ | Hamming Distance |  | [Code](Advanced%20Techniques/Hamming%20Distance.cpp) |
|  | Corner Subgrid Check |  | [Code](Advanced%20Techniques/Corner%20Subgrid%20Check.cpp) |
| ✔ | Corner Subgrid Count |  | [Code](Advanced%20Techniques/Corner%20Subgrid%20Count.cpp) |
| ✔ | Reachable Nodes |  | [Code](Advanced%20Techniques/Reachable%20Nodes.cpp) |
| ✔ | Reachability Queries |  | [Code](Advanced%20Techniques/Reachability%20Queries.cpp) |
| ✔ | Cut and Paste | `Implicit Treap` | [Code](Advanced%20Techniques/Cut%20and%20Paste.cpp) |
| ✔ | Substring Reversals | `Implicit Treap` | [Code](Advanced%20Techniques/Substring%20Reversals.cpp) |
| ✔ | Reversals and Sums | `Implicit Treap` | [Code](Advanced%20Techniques/Reversals%20and%20Sums.cpp) |
| ✔ | Necessary Roads | `Bridges` | [Code](Advanced%20Techniques/Necessary%20Roads.cpp) |
| ✔ | Necessary Cities | `Articulation Points` | [Code](Advanced%20Techniques/Necessary%20Cities.cpp) |
|  | Eulerian Subgraphs |  | [Code](Advanced%20Techniques/Eulerian%20Subgraphs.cpp) |
| ✔ | Monster Game I | `DP` `Convex Hull Optimization` | [Code](Advanced%20Techniques/Monster%20Game%20I.cpp) |
| ✔ | Monster Game II | `DP` `Convex Hull Optimization` | [Code](Advanced%20Techniques/Monster%20Game%20II.cpp) |
| ✔ | Subarray Squares | `DP` `Convex Hull Optimization` | [Code](Advanced%20Techniques/Subarray%20Squares.cpp) |
|  | Houses and Schools |  | [Code](Advanced%20Techniques/Houses%20and%20Schools.cpp) |
| ✔ | Knuth Division | `DP` `Knuth Optimization` | [Code](Advanced%20Techniques/Knuth%20Division.cpp) |
| ✔ | Apples and Bananas | `FFT` | [Code](Advanced%20Techniques/Apples%20and%20Bananas.cpp) |
| ✔ | One Bit Positions | `FFT` | [Code](Advanced%20Techniques/One%20Bit%20Positions.cpp) |
| ✔ | Signal Processing | `FFT` | [Code](Advanced%20Techniques/Signal%20Processing.cpp) |
| ✔ | New Roads Queries | `HLD` | [Code](Advanced%20Techniques/New%20Roads%20Queries.cpp) |
| ✔ | Dynamic Connectivity | `Dynamic DSU` | [Code](Advanced%20Techniques/Dynamic%20Connectivity.cpp) |
| ✔ | Parcel Delivery | `Max Flow Min Cost` `Fixed flow` | [Code](Advanced%20Techniques/Parcel%20Delivery.cpp) |
| ✔ | Task Assignment | `Max Flow Min Cost` | [Code](Advanced%20Techniques/Task%20Assignment.cpp) |
| ✔ | Distinct Routes II | `Max Flow Min Cost` `Path reconstruction` | [Code](Advanced%20Techniques/Distinct%20Routes%20II.cpp) |

## Sliding Window Problems

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Sliding Window Sum |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Sum.cpp) |
| ✔ | Sliding Window Minimum |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Minimum.cpp) |
| ✔ | Sliding Window Xor |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Xor.cpp) |
| ✔ | Sliding Window Or | `Two Stack` | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Or.cpp) |
| ✔ | Sliding Window Distinct Values |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Distinct%20Values.cpp) |
| ✔ | Sliding Window Mode |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Mode.cpp) |
| ✔ | Sliding Window Mex |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Mex.cpp) |
| ✔ | Sliding Window Median |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Median.cpp) |
| ✔ | Sliding Window Cost |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Cost.cpp) |
| ✔ | Sliding Window Inversions | `Segment Tree` | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Inversions.cpp) |
|  | Sliding Window Advertisement |  | [Code](Sliding%20Window%20Problems/Sliding%20Window%20Advertisement.cpp) |

## Interactive Problems

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Hidden Integer | `Binary Search` | [Code](Interactive%20Problems/Hidden%20Integer.cpp) |
| ✔ | Hidden Permutation | `Merge Sort` | [Code](Interactive%20Problems/Hidden%20Permutation.cpp) |
| ✔ | K-th Highest Score | `Binary Seach`  | [Code](Interactive%20Problems/K-th%20Highest%20Score.cpp) |
|  | Permuted Binary Strings |  | [Code](Interactive%20Problems/Permuted%20Binary%20Strings.cpp) |
|  | Colored Chairs |  | [Code](Interactive%20Problems/Colored%20Chairs.cpp) |
|  | Inversion Sorting |  | [Code](Interactive%20Problems/Inversion%20Sorting.cpp) |

## Bitwise Operations

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Counting Bits |  | [Code](Bitwise%20Operations/Counting%20Bits.cpp) |
| ✔ | Maximum Xor Subarray | `Trie` `Divide and Conquer` | [Code](Bitwise%20Operations/Maximum%20Xor%20Subarray.cpp) |
| ✔ | Maximum Xor Subset | `Xor Basis` | [Code](Bitwise%20Operations/Maximum%20Xor%20Subset.cpp) |
| ✔ | Number of Subset Xors | `Xor Basis` | [Code](Bitwise%20Operations/Number%20of%20Subset%20Xors.cpp) |
|  | K Subset Xors |  | [Code](Bitwise%20Operations/K%20Subset%20Xors.cpp) |
|  | All Subarray Xors |  | [Code](Bitwise%20Operations/All%20Subarray%20Xors.cpp) |
| ✔ | Xor Pyramid Peak |  | [Code](Bitwise%20Operations/Xor%20Pyramid%20Peak.cpp) |
|  | Xor Pyramid Diagonal |  | [Code](Bitwise%20Operations/Xor%20Pyramid%20Diagonal.cpp) |
|  | Xor Pyramid Row |  | [Code](Bitwise%20Operations/Xor%20Pyramid%20Row.cpp) |
| ✔ | SOS Bit Problem |  | [Code](Bitwise%20Operations/SOS%20Bit%20Problem.cpp) |
|  | And Subset Count |  | [Code](Bitwise%20Operations/And%20Subset%20Count.cpp) |

## Construction Problems

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Inverse Inversions |  | [Code](Construction%20Problems/Inverse%20Inversions.cpp) |
| ✔ | Monotone Subsequences |  | [Code](Construction%20Problems/Monotone%20Subsequences.cpp) |
| ✔ | Third Permutation | `Construction` | [Code](Construction%20Problems/Third%20Permutation.cpp) |
| ✔ | Permutation Prime Sums | `Math` `Greedy` | [Code](Construction%20Problems/Permutation%20Prime%20Sums.cpp) |
| ✔ | Chess Tournament | `Greedy` | [Code](Construction%20Problems/Chess%20Tournament.cpp) |
|  | Distinct Sums Grid |  | [Code](Construction%20Problems/Distinct%20Sums%20Grid.cpp) |
|  | Filling Trominos |  | [Code](Construction%20Problems/Filling%20Trominos.cpp) |
|  | Grid Path Construction |  | [Code](Construction%20Problems/Grid%20Path%20Construction.cpp) |

## Advanced Graph Problems

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Nearest Shops | `BFS` | [Code](Advanced%20Graph%20Problems/Nearest%20Shops.cpp) |
| ✔ | Prüfer Code | `Prüfer Code` | [Code](Advanced%20Graph%20Problems/Prüfer%20Code.cpp) |
| ✔ | Tree Traversals |  | [Code](Advanced%20Graph%20Problems/Tree%20Traversals.cpp) |
|  | Course Schedule II |  | [Code](Advanced%20Graph%20Problems/Course%20Schedule%20II.cpp) |
| ✔ | Acyclic Graph Edges |  | [Code](Advanced%20Graph%20Problems/Acyclic%20Graph%20Edges.cpp) |
| ✔ | Strongly Connected Edges | `Bridge` | [Code](Advanced%20Graph%20Problems/Strongly%20Connected%20Edges.cpp) |
|  | Even Outdegree Edges |  | [Code](Advanced%20Graph%20Problems/Even%20Outdegree%20Edges.cpp) |
| ✔ | Graph Girth | `BFS Tree` | [Code](Advanced%20Graph%20Problems/Graph%20Girth.cpp) |
|  | Fixed Length Walk Queries |  | [Code](Advanced%20Graph%20Problems/Fixed%20Length%20Walk%20Queries.cpp) |
|  | Transfer Speeds Sum |  | [Code](Advanced%20Graph%20Problems/Transfer%20Speeds%20Sum.cpp) |
| ✔ | MST Edge Check | `DSU` | [Code](Advanced%20Graph%20Problems/MST%20Edge%20Check.cpp) |
|  | MST Edge Set Check |  | [Code](Advanced%20Graph%20Problems/MST%20Edge%20Set%20Check.cpp) |
| ✔ | MST Edge Cost | `HLD` `DSU` | [Code](Advanced%20Graph%20Problems/MST%20Edge%20Cost.cpp) |
| ✔ | Network Breakdown | `DSU with rollback` | [Code](Advanced%20Graph%20Problems/Network%20Breakdown.cpp) |
|  | Tree Coin Collecting I |  | [Code](Advanced%20Graph%20Problems/Tree%20Coin%20Collecting%20I.cpp) |
|  | Tree Coin Collecting II |  | [Code](Advanced%20Graph%20Problems/Tree%20Coin%20Collecting%20II.cpp) |
| ✔ | Tree Isomorphism I | `Tree Isomorphism` `rooted` | [Code](Advanced%20Graph%20Problems/Tree%20Isomorphism%20I.cpp) |
| ✔ | Tree Isomorphism II | `Tree Isomorphism` `unrooted` | [Code](Advanced%20Graph%20Problems/Tree%20Isomorphism%20II.cpp) |
|  | Flight Route Requests |  | [Code](Advanced%20Graph%20Problems/Flight%20Route%20Requests.cpp) |
| ✔ | Critical Cities | `Dominator Tree` | [Code](Advanced%20Graph%20Problems/Critical%20Cities.cpp) |
| ✔ | Visiting Cities | `Dijkstra` `Articulation Point` | [Code](Advanced%20Graph%20Problems/Visiting%20Cities.cpp) |
|  | Graph Coloring |  | [Code](Advanced%20Graph%20Problems/Graph%20Coloring.cpp) |
|  | Bus Companies |  | [Code](Advanced%20Graph%20Problems/Bus%20Companies.cpp) |
|  | Split into Two Paths |  | [Code](Advanced%20Graph%20Problems/Split%20into%20Two%20Paths.cpp) |
| ✔ | Network Renovation | `Euler Tour` | [Code](Advanced%20Graph%20Problems/Network%20Renovation.cpp) |
| ✔ | Forbidden Cities | `Block Cut Tree` | [Code](Advanced%20Graph%20Problems/Forbidden%20Cities.cpp) |
|  | Creating Offices |  | [Code](Advanced%20Graph%20Problems/Creating%20Offices.cpp) |
|  | New Flight Routes |  | [Code](Advanced%20Graph%20Problems/New%20Flight%20Routes.cpp) |

## Counting Problems

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Filled Subgrid Count I | `DP` | [Code](Counting%20Problems/Filled%20Subgrid%20Count%20I.cpp) |
| ✔ | Filled Subgrid Count II | `DP` `Monotone stack` | [Code](Counting%20Problems/Filled%20Subgrid%20Count%20II.cpp) |
|  | All Letter Subgrid Count I |  | [Code](Counting%20Problems/All%20Letter%20Subgrid%20Count%20I.cpp) |
|  | All Letter Subgrid Count II |  | [Code](Counting%20Problems/All%20Letter%20Subgrid%20Count%20II.cpp) |
|  | Border Subgrid Count I |  | [Code](Counting%20Problems/Border%20Subgrid%20Count%20I.cpp) |
|  | Border Subgrid Count II |  | [Code](Counting%20Problems/Border%20Subgrid%20Count%20II.cpp) |
|  | Raab Game II |  | [Code](Counting%20Problems/Raab%20Game%20II.cpp) |
|  | Empty String |  | [Code](Counting%20Problems/Empty%20String.cpp) |
|  | Permutation Inversions |  | [Code](Counting%20Problems/Permutation%20Inversions.cpp) |
|  | Counting Bishops |  | [Code](Counting%20Problems/Counting%20Bishops.cpp) |
| ✔ | Counting Sequences | `Inclusion Exclusion Principle` | [Code](Counting%20Problems/Counting%20Sequences.cpp) |
| ✔ | Grid Paths II |  | [Code](Counting%20Problems/Grid%20Paths%20II.cpp) |
| ✔ | Counting Permutations |  | [Code](Counting%20Problems/Counting%20Permutations.cpp) |
|  | Grid Completion |  | [Code](Counting%20Problems/Grid%20Completion.cpp) |
|  | Counting Reorders |  | [Code](Counting%20Problems/Counting%20Reorders.cpp) |
|  | Tournament Graph Distribution |  | [Code](Counting%20Problems/Tournament%20Graph%20Distribution.cpp) |
|  | Collecting Numbers Distribution |  | [Code](Counting%20Problems/Collecting%20Numbers%20Distribution.cpp) |
|  | Functional Graph Distribution |  | [Code](Counting%20Problems/Functional%20Graph%20Distribution.cpp) |

## Additional Problems I

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Shortest Subsequence |  | [Code](Additional%20Problems%20I/Shortest%20Subsequence.cpp) |
| ✔ | Distinct Values Sum | `Contribution Technique` | [Code](Additional%20Problems%20I/Distinct%20Values%20Sum.cpp) |
| ✔ | Distinct Values Splits | `DP` `Prefix Sum` | [Code](Additional%20Problems%20I/Distinct%20Values%20Splits.cpp) |
| ✔ | Swap Game |  | [Code](Additional%20Problems%20I/Swap%20Game.cpp) |
|  | Beautiful Permutation II |  | [Code](Additional%20Problems%20I/Beautiful%20Permutation%20II.cpp) |
| ✔ | Multiplication Table | `Binary Search` `Harmonic Progression` | [Code](Additional%20Problems%20I/Multiplication%20Table.cpp) |
| ✔ | Bubble Sort Rounds I | `Sorting` | [Code](Additional%20Problems%20I/Bubble%20Sort%20Rounds%20I.cpp) |
|  | Bubble Sort Rounds II |  | [Code](Additional%20Problems%20I/Bubble%20Sort%20Rounds%20II.cpp) |
|  | Nearest Campsites I |  | [Code](Additional%20Problems%20I/Nearest%20Campsites%20I.cpp) |
|  | Nearest Campsites II |  | [Code](Additional%20Problems%20I/Nearest%20Campsites%20II.cpp) |
| ✔ | Advertisement | `Segment Tree` | [Code](Additional%20Problems%20I/Advertisement.cpp) |
| ✔ | Special Substrings | `Constructive` `Hashing` | [Code](Additional%20Problems%20I/Special%20Substrings.cpp) |
|  | Counting LCM Arrays |  | [Code](Additional%20Problems%20I/Counting%20LCM%20Arrays.cpp) |
|  | Square Subsets |  | [Code](Additional%20Problems%20I/Square%20Subsets.cpp) |
|  | Subarray Sum Constraints |  | [Code](Additional%20Problems%20I/Subarray%20Sum%20Constraints.cpp) |
|  | Water Containers Moves |  | [Code](Additional%20Problems%20I/Water%20Containers%20Moves.cpp) |
|  | Water Containers Queries |  | [Code](Additional%20Problems%20I/Water%20Containers%20Queries.cpp) |
|  | Stack Weights |  | [Code](Additional%20Problems%20I/Stack%20Weights.cpp) |
|  | Maximum Average Subarrays |  | [Code](Additional%20Problems%20I/Maximum%20Average%20Subarrays.cpp) |
|  | Subsets with Fixed Average |  | [Code](Additional%20Problems%20I/Subsets%20with%20Fixed%20Average.cpp) |
|  | Two Array Average |  | [Code](Additional%20Problems%20I/Two%20Array%20Average.cpp) |
|  | Pyramid Array |  | [Code](Additional%20Problems%20I/Pyramid%20Array.cpp) |
|  | Permutation Subsequence |  | [Code](Additional%20Problems%20I/Permutation%20Subsequence.cpp) |
| ✔ | Bit Inversions |  | [Code](Additional%20Problems%20I/Bit%20Inversions.cpp) |
| ✔ | Writing Numbers |  | [Code](Additional%20Problems%20I/Writing%20Numbers.cpp) |
|  | Letter Pair Move Game |  | [Code](Additional%20Problems%20I/Letter%20Pair%20Move%20Game.cpp) |
| ✔ | Maximum Building I | `Segment Tree` | [Code](Additional%20Problems%20I/Maximum%20Building%20I.cpp) |
|  | Sorting Methods |  | [Code](Additional%20Problems%20I/Sorting%20Methods.cpp) |
| ✔ | Cyclic Array | `Binary Search` `Greedy` | [Code](Additional%20Problems%20I/Cyclic%20Array.cpp) |
|  | List of Sums |  | [Code](Additional%20Problems%20I/List%20of%20Sums.cpp) |

## Additional Problems II

| Status | Name | Tags | Link |
| ---- | ---- | ---- | ---- |
| ✔ | Bouncing Ball Steps |  | [Code](Additional%20Problems%20II/Bouncing%20Ball%20Steps.cpp) |
|  | Bouncing Ball Cycle |  | [Code](Additional%20Problems%20II/Bouncing%20Ball%20Cycle.cpp) |
|  | Knight Moves Queries |  | [Code](Additional%20Problems%20II/Knight%20Moves%20Queries.cpp) |
|  | K Subset Sums I |  | [Code](Additional%20Problems%20II/K%20Subset%20Sums%20I.cpp) |
|  | K Subset Sums II |  | [Code](Additional%20Problems%20II/K%20Subset%20Sums%20II.cpp) |
|  | Increasing Array II |  | [Code](Additional%20Problems%20II/Increasing%20Array%20II.cpp) |
|  | Food Division |  | [Code](Additional%20Problems%20II/Food%20Division.cpp) |
|  | Swap Round Sorting |  | [Code](Additional%20Problems%20II/Swap%20Round%20Sorting.cpp) |
|  | Binary Subsequences |  | [Code](Additional%20Problems%20II/Binary%20Subsequences.cpp) |
| ✔ | School Excursion | `Knapsack DP` `Bitset` | [Code](Additional%20Problems%20II/School%20Excursion.cpp) |
|  | Coin Grid |  | [Code](Additional%20Problems%20II/Coin%20Grid.cpp) |
|  | Grid Coloring II |  | [Code](Additional%20Problems%20II/Grid%20Coloring%20II.cpp) |
|  | Programmers and Artists |  | [Code](Additional%20Problems%20II/Programmers%20and%20Artists.cpp) |
|  | Removing Digits II |  | [Code](Additional%20Problems%20II/Removing%20Digits%20II.cpp) |
|  | Coin Arrangement |  | [Code](Additional%20Problems%20II/Coin%20Arrangement.cpp) |
|  | Replace with Difference |  | [Code](Additional%20Problems%20II/Replace%20with%20Difference.cpp) |
| ✔ | Grid Puzzle I | `Max Flow Min Cut` | [Code](Additional%20Problems%20II/Grid%20Puzzle%20I.cpp) |
| ✔ | Grid Puzzle II | `Max Flow Max Cost` | [Code](Additional%20Problems%20II/Grid%20Puzzle%20II.cpp) |
| ✔ | Bit Substrings | `FFT` | [Code](Additional%20Problems%20II/Bit%20Substrings.cpp) |
| ✔ | Reversal Sorting | `Implicit Treap` | [Code](Additional%20Problems%20II/Reversal%20Sorting.cpp) |
|  | Book Shop II |  | [Code](Additional%20Problems%20II/Book%20Shop%20II.cpp) |
|  | GCD Subsets |  | [Code](Additional%20Problems%20II/GCD%20Subsets.cpp) |
|  | Minimum Cost Pairs |  | [Code](Additional%20Problems%20II/Minimum%20Cost%20Pairs.cpp) |
|  | Same Sum Subsets |  | [Code](Additional%20Problems%20II/Same%20Sum%20Subsets.cpp) |
| ✔ | Mex Grid Queries |  | [Code](Additional%20Problems%20II/Mex%20Grid%20Queries.cpp) |
|  | Maximum Building II |  | [Code](Additional%20Problems%20II/Maximum%20Building%20II.cpp) |
| ✔ | Stick Divisions | `Huffman Coding` `greedy` | [Code](Additional%20Problems%20II/Stick%20Divisions.cpp) |
|  | Stick Difference |  | [Code](Additional%20Problems%20II/Stick%20Difference.cpp) |
| ✔ | Coding Company | `Open and Close Interval DP` | [Code](Additional%20Problems%20II/Coding%20Company.cpp) |
|  | Two Stacks Sorting |  | [Code](Additional%20Problems%20II/Two%20Stacks%20Sorting.cpp) |

CSES-Solutions

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README