CSES-Solutions

KO | EN

gitlite — search

#hacktoberfest #python #javascript #golang #react #rust #machine-learning #hacktoberfest2020 #windows #reactjs #typescript #material-ui

★ 64 Open GitHub ↗

Solutions and Editorials to all problems of CSES

// repository documentation

Was this content helpful?

★ 0 (0 ratings)

# CSES-Solutions

Solutions and Editorials to problems of [CSES](https://cses.fi/problemset/).

## Current Status
<details><summary>Introductory Problems</summary>

- [x] - [Weird Algorithm](https://cses.fi/problemset/task/1068)
 - [x] - [Missing Number](https://cses.fi/problemset/task/1083)
 - [x] - [Repetitions](https://cses.fi/problemset/task/1069)
 - [x] - [Increasing Array](https://cses.fi/problemset/task/1094)
 - [x] - [Permutations](https://cses.fi/problemset/task/1070)
 - [x] - [Number Spiral](https://cses.fi/problemset/task/1071)
 - [x] - [Two Knights](https://cses.fi/problemset/task/1072)
 - [x] - [Two Sets](https://cses.fi/problemset/task/1092)
 - [x] - [Bit Strings](https://cses.fi/problemset/task/1617)
 - [x] - [Trailing Zeros](https://cses.fi/problemset/task/1618)
 - [x] - [Coin Piles](https://cses.fi/problemset/task/1754)
 - [x] - [Palindrome Reorder](https://cses.fi/problemset/task/1755)
 - [x] - [Creating Strings I](https://cses.fi/problemset/task/1622)
 - [x] - [Apple Division](https://cses.fi/problemset/task/1623)
 - [x] - [Chessboard and Queens](https://cses.fi/problemset/task/1624)
 - [ ] - [Grid Paths](https://cses.fi/problemset/task/1625)

</details>
<details><summary>Sorting and Searching</summary>

- [ ] - [Distinct Numbers](https://cses.fi/problemset/task/1621)
 - [ ] - [Apartments](https://cses.fi/problemset/task/1084)
 - [ ] - [Ferris Wheel](https://cses.fi/problemset/task/1090)
 - [ ] - [Concert Tickets](https://cses.fi/problemset/task/1091)
 - [ ] - [Restaurant Customers](https://cses.fi/problemset/task/1619)
 - [ ] - [Movie Festival](https://cses.fi/problemset/task/1629)
 - [ ] - [Sum of Two Values](https://cses.fi/problemset/task/1640)
 - [ ] - [Maximum Subarray Sum](https://cses.fi/problemset/task/1643)
 - [ ] - [Stick Lengths](https://cses.fi/problemset/task/1074)
 - [ ] - [Playlist](https://cses.fi/problemset/task/1141)
 - [ ] - [Towers](https://cses.fi/problemset/task/1073)
 - [ ] - [Traffic Lights](https://cses.fi/problemset/task/1163)
 - [ ] - [Room Allocation](https://cses.fi/problemset/task/1164)
 - [ ] - [Factory Machines](https://cses.fi/problemset/task/1620)
 - [ ] - [Tasks and Deadlines](https://cses.fi/problemset/task/1630)
 - [ ] - [Reading Books](https://cses.fi/problemset/task/1631)
 - [ ] - [Sum of Three Values](https://cses.fi/problemset/task/1641)
 - [ ] - [Sum of Four Values](https://cses.fi/problemset/task/1642)
 - [ ] - [Nearest Smaller Values](https://cses.fi/problemset/task/1645)
 - [ ] - [Subarray Sums I](https://cses.fi/problemset/task/1660)
 - [ ] - [Subarray Sums II](https://cses.fi/problemset/task/1661)
 - [ ] - [Subarray Divisibility](https://cses.fi/problemset/task/1662)
 - [ ] - [Array Division](https://cses.fi/problemset/task/1085)
 - [ ] - [Sliding Median](https://cses.fi/problemset/task/1076)
 - [ ] - [Sliding Cost](https://cses.fi/problemset/task/1077)
 - [ ] - [Movie Festival II](https://cses.fi/problemset/task/1632)
 - [ ] - [Maximum Subarray Sum II](https://cses.fi/problemset/task/1644)

</details>
<details><summary>Dynamic Programming</summary>

- [ ] - [Dice Combinations](https://cses.fi/problemset/task/1633)
 - [ ] - [Minimizing Coins](https://cses.fi/problemset/task/1634)
 - [ ] - [Coin Combinations I](https://cses.fi/problemset/task/1635)
 - [ ] - [Coin Combinations II](https://cses.fi/problemset/task/1636)
 - [ ] - [Removing Digits](https://cses.fi/problemset/task/1637)
 - [ ] - [Grid Paths](https://cses.fi/problemset/task/1638)
 - [ ] - [Book Shop](https://cses.fi/problemset/task/1158)
 - [ ] - [Array Description](https://cses.fi/problemset/task/1746)
 - [ ] - [Edit Distance](https://cses.fi/problemset/task/1639)
 - [ ] - [Rectangle Cutting](https://cses.fi/problemset/task/1744)
 - [ ] - [Money Sums](https://cses.fi/problemset/task/1745)
 - [ ] - [Removal Game](https://cses.fi/problemset/task/1097)
 - [ ] - [Two Sets II](https://cses.fi/problemset/task/1093)
 - [ ] - [Increasing Subsequence](https://cses.fi/problemset/task/1145)
 - [ ] - [Projects](https://cses.fi/problemset/task/1140)

</details>
<details><summary>Graph Algorithms</summary>

- [x] - [Counting Rooms](https://cses.fi/problemset/task/1192)
 - [x] - [Labyrinth](https://cses.fi/problemset/task/1193)
 - [x] - [Building Roads](https://cses.fi/problemset/task/1666)
 - [x] - [Message Route](https://cses.fi/problemset/task/1667)
 - [ ] - [Building Teams](https://cses.fi/problemset/task/1668)
 - [ ] - [Round Trip](https://cses.fi/problemset/task/1669)
 - [x] - [Monsters](https://cses.fi/problemset/task/1194)
 - [x] - [Shortest Routes I](https://cses.fi/problemset/task/1671)
 - [x] - [Shortest Routes II](https://cses.fi/problemset/task/1672)
 - [ ] - [High Score](https://cses.fi/problemset/task/1673)
 - [ ] - [Flight Discount](https://cses.fi/problemset/task/1195)
 - [ ] - [Cycle Finding](https://cses.fi/problemset/task/1197)
 - [ ] - [Flight Routes](https://cses.fi/problemset/task/1196)
 - [x] - [Round Trip II](https://cses.fi/problemset/task/1678)
 - [x] - [Course Schedule](https://cses.fi/problemset/task/1679)
 - [ ] - [Longest Flight Route](https://cses.fi/problemset/task/1680)
 - [x] - [Game Routes](https://cses.fi/problemset/task/1681)
 - [ ] - [Investigation](https://cses.fi/problemset/task/1202)
 - [ ] - [Planets Queries I](https://cses.fi/problemset/task/1750)
 - [ ] - [Planets Queries II](https://cses.fi/problemset/task/1160)
 - [ ] - [Planets Cycles](https://cses.fi/problemset/task/1751)
 - [ ] - [Road Reparation](https://cses.fi/problemset/task/1675)
 - [ ] - [Road Construction](https://cses.fi/problemset/task/1676)
 - [ ] - [Flight Routes Check](https://cses.fi/problemset/task/1682)
 - [ ] - [Planets and Kingdoms](https://cses.fi/problemset/task/1683)
 - [ ] - [Giant Pizza](https://cses.fi/problemset/task/1684)
 - [ ] - [Coin Collector](https://cses.fi/problemset/task/1686)
 - [ ] - [Mail Delivery](https://cses.fi/problemset/task/1691)
 - [ ] - [De Bruijn Sequence](https://cses.fi/problemset/task/1692)
 - [ ] - [Teleporters Path](https://cses.fi/problemset/task/1693)
 - [ ] - [Hamiltonian Flights](https://cses.fi/problemset/task/1690)
 - [ ] - [Knight's Tour](https://cses.fi/problemset/task/1689)
 - [ ] - [Download Speed](https://cses.fi/problemset/task/1694)
 - [ ] - [Police Chase](https://cses.fi/problemset/task/1695)
 - [ ] - [School Dance](https://cses.fi/problemset/task/1696)
 - [ ] - [Distinct Routes](https://cses.fi/problemset/task/1711)

</details>
<details><summary>Range Queries</summary>

- [ ] - [Range Sum Queries I](https://cses.fi/problemset/task/1646)
 - [x] - [Range Minimum Queries I](https://cses.fi/problemset/task/1647)
 - [ ] - [Range Sum Queries II](https://cses.fi/problemset/task/1648)
 - [x] - [Range Minimum Queries II](https://cses.fi/problemset/task/1649)
 - [x] - [Range Xor Queries](https://cses.fi/problemset/task/1650)
 - [ ] - [Range Update Queries](https://cses.fi/problemset/task/1651)
 - [ ] - [Forest Queries](https://cses.fi/problemset/task/1652)
 - [ ] - [Hotel Queries](https://cses.fi/problemset/task/1143)
 - [ ] - [List Removals](https://cses.fi/problemset/task/1749)
 - [ ] - [Salary Queries](https://cses.fi/problemset/task/1144)
 - [x] - [Subarray Sum Queries](https://cses.fi/problemset/task/1190)
 - [x] - [Distinct Values Queries](https://cses.fi/problemset/task/1734)
 - [ ] - [Forest Queries II](https://cses.fi/problemset/task/1739)
 - [ ] - [Range Updates and Sums](https://cses.fi/problemset/task/1735)
 - [ ] - [Polynomial Queries](https://cses.fi/problemset/task/1736)
 - [ ] - [Range Queries and Copies](https://cses.fi/problemset/task/1737)

</details>
<details><summary>Tree Algorithms</summary>

- [x] - [Subordinates](https://cses.fi/problemset/task/1674)
 - [ ] - [Tree Matching](https://cses.fi/problemset/task/1130)
 - [x] - [Tree Diameter](https://cses.fi/problemset/task/1131)
 - [x] - [Tree Distances I](https://cses.fi/problemset/task/1132)
 - [ ] - [Tree Distances II](https://cses.fi/problemset/task/1133)
 - [x] - [Company Queries I](https://cses.fi/problemset/task/1687)
 - [x] - [Company Queries II](https://cses.fi/problemset/task/1688)
 - [x] - [Distance Queries](https://cses.fi/problemset/task/1135)
 - [ ] - [Counting Paths](https://cses.fi/problemset/task/1136)
 - [x] - [Subtree Queries](https://cses.fi/problemset/task/1137)
 - [x] - [Path Queries](https://cses.fi/problemset/task/1138)
 - [ ] - [Distinct Colors](https://cses.fi/problemset/task/1139)

</details>
<details><summary>Mathematics</summary>

- [ ] - [Exponentiation](https://cses.fi/problemset/task/1095)
 - [ ] - [Exponentiation II](https://cses.fi/problemset/task/1712)
 - [ ] - [Counting Divisors](https://cses.fi/problemset/task/1713)
 - [ ] - [Common Divisors](https://cses.fi/problemset/task/1081)
 - [ ] - [Sum of Divisors](https://cses.fi/problemset/task/1082)
 - [ ] - [Binomial Coefficients](https://cses.fi/problemset/task/1079)
 - [ ] - [Creating Strings II](https://cses.fi/problemset/task/1715)
 - [ ] - [Distributing Apples](https://cses.fi/problemset/task/1716)
 - [ ] - [Christmas Party](https://cses.fi/problemset/task/1717)
 - [ ] - [Fibonacci Numbers](https://cses.fi/problemset/task/1722)
 - [ ] - [Throwing Dice](https://cses.fi/problemset/task/1096)
 - [ ] - [Graph Paths I](https://cses.fi/problemset/task/1723)
 - [ ] - [Graph Paths II](https://cses.fi/problemset/task/1724)
 - [ ] - [Dice Probability](https://cses.fi/problemset/task/1725)
 - [ ] - [Moving Robots](https://cses.fi/problemset/task/1726)
 - [ ] - [Candy Lottery](https://cses.fi/problemset/task/1727)
 - [ ] - [Inversion Probability](https://cses.fi/problemset/task/1728)
 - [ ] - [Stick Game](https://cses.fi/problemset/task/1729)
 - [ ] - [Nim Game I](https://cses.fi/problemset/task/1730)
 - [ ] - [Nim Game II](https://cses.fi/problemset/task/1098)
 - [ ] - [Stair Game](https://cses.fi/problemset/task/1099)

</details>
<details><summary>String Algorithms</summary>

- [ ] - [Word Combinations](https://cses.fi/problemset/task/1731)
 - [ ] - [String Matching](https://cses.fi/problemset/task/1753)
 - [ ] - [Finding Borders](https://cses.fi/problemset/task/1732)
 - [ ] - [Finding Periods](https://cses.fi/problemset/task/1733)
 - [ ] - [Minimal Rotation](https://cses.fi/problemset/task/1110)
 - [ ] - [Longest Palindrome](https://cses.fi/problemset/task/1111)
 - [ ] - [Required Substring](https://cses.fi/problemset/task/1112)

</details>
<details><summary>Additional Problems</summary>

- [ ] - [Shortest Subsequence](https://cses.fi/problemset/task/1087)
 - [ ] - [Counting Bits](https://cses.fi/problemset/task/1146)
 - [ ] - [Swap Game](https://cses.fi/problemset/task/1670)
 - [ ] - [Meet in the Middle](https://cses.fi/problemset/task/1628)
 - [ ] - [Prüfer Code](https://cses.fi/problemset/task/1134)
 - [ ] - [Edge Directions](https://cses.fi/problemset/task/1756)
 - [ ] - [Advertisement](https://cses.fi/problemset/task/1142)
 - [ ] - [Elevator Rides](https://cses.fi/problemset/task/1653)
 - [ ] - [Maximum Xor Subarray](https://cses.fi/problemset/task/1655)
 - [ ] - [Movie Festival Queries](https://cses.fi/problemset/task/1664)
 - [ ] - [Chess Tournament](https://cses.fi/problemset/task/1697)
 - [ ] - [Tree Traversals](https://cses.fi/problemset/task/1702)
 - [ ] - [Network Renovation](https://cses.fi/problemset/task/1704)
 - [ ] - [Graph Girth](https://cses.fi/problemset/task/1707)
 - [ ] - [Intersection Points](https://cses.fi/problemset/task/1740)
 - [ ] - [String Reorder](https://cses.fi/problemset/task/1743)
 - [ ] - [Pyramid Array](https://cses.fi/problemset/task/1747)
 - [ ] - [Increasing Subsequence II](https://cses.fi/problemset/task/1748)
 - [ ] - [String Removals](https://cses.fi/problemset/task/1149)
 - [ ] - [Bit Inversions](https://cses.fi/problemset/task/1188)
 - [ ] - [Writing Numbers](https://cses.fi/problemset/task/1086)
 - [ ] - [String Transform](https://cses.fi/problemset/task/1113)
 - [ ] - [Maximum Building I](https://cses.fi/problemset/task/1147)
 - [ ] - [Sorting Methods](https://cses.fi/problemset/task/1162)
 - [ ] - [Cyclic Array](https://cses.fi/problemset/task/1191)
 - [ ] - [Food Division](https://cses.fi/problemset/task/1189)
 - [ ] - [Bit Problem](https://cses.fi/problemset/task/1654)
 - [ ] - [Swap Round Sorting](https://cses.fi/problemset/task/1698)
 - [ ] - [Tree Isomorphism I](https://cses.fi/problemset/task/1700)
 - [ ] - [Critical Cities](https://cses.fi/problemset/task/1703)
 - [ ] - [School Excursion](https://cses.fi/problemset/task/1706)
 - [ ] - [Coin Grid](https://cses.fi/problemset/task/1709)
 - [ ] - [Robot Path](https://cses.fi/problemset/task/1742)
 - [ ] - [Course Schedule II](https://cses.fi/problemset/task/1757)
 - [ ] - [Empty String](https://cses.fi/problemset/task/1080)
 - [ ] - [Grid Paths](https://cses.fi/problemset/task/1078)
 - [ ] - [Book Shop II](https://cses.fi/problemset/task/1159)
 - [ ] - [Network Breakdown](https://cses.fi/problemset/task/1677)
 - [ ] - [Visiting Cities](https://cses.fi/problemset/task/1203)
 - [ ] - [Number Grid](https://cses.fi/problemset/task/1157)
 - [ ] - [Maximum Building II](https://cses.fi/problemset/task/1148)
 - [ ] - [Stick Divisions](https://cses.fi/problemset/task/1161)
 - [ ] - [Coding Company](https://cses.fi/problemset/task/1665)
 - [ ] - [Flight Route Requests](https://cses.fi/problemset/task/1699)
 - [ ] - [Tree Isomorphism II](https://cses.fi/problemset/task/1701)
 - [ ] - [Forbidden Cities](https://cses.fi/problemset/task/1705)
 - [ ] - [Area of Rectangles](https://cses.fi/problemset/task/1741)
 - [ ] - [Creating Offices](https://cses.fi/problemset/task/1752)
 - [ ] - [Permutations II](https://cses.fi/problemset/task/1075)
 - [ ] - [New Flight Routes](https://cses.fi/problemset/task/1685)

</details>

## Important Note

Everyone is requested to either comment their code properly or use appropriate variable and function names throughout the code.

### What's this repo about?

This repo is created to house the solutions and editorials of problems of CSES at one place. CSES contains 200 problems from beginner to advanced levels.

### What is CSES?
The CSES Problem Set contains a collection of competitive programming practice problems. You can access the problems [here](https://cses.fi/problemset/).

### How to contribute?

Read the **Contributing.md** file for this. All the contributions should follow the guidelines.

### Language for contribution

Contributions are accepted only in the following languages:
* Assembly
* C++
* Haskell
* Java
* Node.js
* Pascal
* Python2
* Python3
* Ruby
* Rust
* Scala

### Learning Resources

If you are new to Open source or github. You can follow this [wonderful guide](https://www.digitalocean.com/community/tutorial_series/an-introduction-to-open-source) to learn more about it.

_Keep Learning with Open Source_

CSES-Solutions

Explore Similar Repositories

Was this content helpful?

Recent Feedback

Download README