"Think twice, code once"
I use this repository as a study playground for programming contests, which contains my personal notes and implementations. Note that this is a publish-only repository, so all pull requests will be ignored.
The folders structure is following:
notebook
: well-explained implementation of general-purpose algorithms.scripts
: small scripts for automatizing some repetitive tasks.solutions
: code of accepted problems, categorized by online judges.README.md
: solutions index by themes, containing difficulty, name, description and hint of the problem.
- coin change
- subset sum
- 0-1 knapsack
- edit distance
- longest increasing subsequence (LIS)
- longest common subsequence (LCS)
- longest palindromic subsequence (LPS)
- traveling salesman problem (TSP)
- matrix chain multiplication (MCM)
- rod cutting
- data structures representation
- traversal
- minimum spanning tree (MST)
- kruskal
- variants
- network flow
- shortest path
- single-source
- specials
- number theory
- matrix exponentiation
- HALIM, Steven. "Competitive Programming 3: The new lower bound of programming contests".