diff --git a/.gitignore b/.gitignore
index 5ea546f..d45eb1b 100644
--- a/.gitignore
+++ b/.gitignore
@@ -2,3 +2,4 @@
 !/*/
 !*.cpp
 !TODO.md
+!problemlist.md
diff --git a/problemlist.md b/problemlist.md
new file mode 100644
index 0000000..bfc73c0
--- /dev/null
+++ b/problemlist.md
@@ -0,0 +1,110 @@
+# Problem List
+
+A little collection of interesting problems that I randomly decided to do.
+
+
+## Ad-hoc/Greedy
+- [B. Gellyfish and Baby's Breath](https://codeforces.com/contest/2116/problem/B)
+
+	Cool ad-hoc problem, a little of math but mostly greedy.
+
+- [C. Ranom Numbers](https://codeforces.com/problemset/problem/1841/C)
+
+	One of the most annoying problem I did, good to prepare for the future
+	hell.
+
+- [C. Median Splits](https://codeforces.com/problemset/problem/2103/C)
+
+	Another incredibly annoying problem, beware...
+
+## Data structures
+
+- [D. Recommendations](https://codeforces.com/contest/2042/problem/D)
+
+	Can be solved with two sets or binary search with sparse table.
+
+- [D. Kevin and Competition Memories](https://codeforces.com/problemset/problem/2048/D)
+
+	Another interesting sparse table problem, I'm not sure it needs one, but I solved with
+	one.
+
+- [D. R2D2 and Droid Army](https://codeforces.com/problemset/problem/514/D)
+
+	Another sparse table problem.
+
+- [E. Turn Off The TV](https://codeforces.com/contest/863/problem/E)
+
+	Can be solved with sparse table or coordinate compression with prefix sum.
+
+- [D. CGCDSSQ](https://codeforces.com/problemset/problem/475/D)
+
+	Can be solved in two ways, but the sparse table one is interesting, although
+	the other way seems more versatile.
+
+## Reroot
+
+- [D. Tree XOR](https://codeforces.com/problemset/problem/1882/D)
+
+	Interesting reroot problem, there's not much for me to say about it.
+
+## DP
+
+- [D. World is Mine](https://codeforces.com/problemset/problem/1987/D)
+
+	It's cool to think about this problem, it has an interesting way to solve.
+
+- [D. Inversion Value of a Permutation](https://codeforces.com/contest/2145/problem/D)
+
+	Now THIS is a problem you have to think outside the box!
+
+- [F - Prefix LIS Query](https://atcoder.jp/contests/abc393/tasks/abc393_f)
+
+	Interesting LIS problem.
+
+- [E - Knapsack 2](https://atcoder.jp/contests/dp/tasks/dp_e)
+
+	Knapsack based on weight problem, classic.
+
+- [R - Walk](https://atcoder.jp/contests/dp/tasks/dp_r)
+
+	Classic matrix exponentiation problem.
+
+- [Book Shop II](https://cses.fi/problemset/task/1159)
+
+	Amazing knapsack problem, really satisfying to do!
+
+- [E. Xor-sequences](https://codeforces.com/contest/691/problem/E)
+
+	An interesting way to learn how to visualize a DP as a graph and optmize it
+	using matrix exponentiation.
+
+- [C. Gerrymandering](https://codeforces.com/problemset/problem/2022/C)
+	
+	A bit basic DP problem, but still interesting to think about all the possible
+	cases and make a DP about it.
+
+- [E. Money Buys Happiness](https://codeforces.com/problemset/problem/1974/E)
+
+	Cool DP problem, you have to understand knapsack to do and optmize it.
+
+- [G. Mukhammadali and the Smooth Array](https://codeforces.com/contest/2167/problem/G)
+
+	Pretty simple, but requires optmization.
+
+- [B. Jzzhu and Sequences](https://codeforces.com/contest/450/problem/B)
+
+	Basic problem about matrix exponentation, but not as obvious.
+
+## Graph
+
+- [D. D/D/D](https://codeforces.com/problemset/problem/2109/D)
+
+	Cool graph problem, not exactly difficult, but interesting to think about it.
+
+## Math
+
+- [E2. Rudolf and Snowflakes (hard version)](https://codeforces.com/problemset/problem/1846/E2)
+
+	Not so hard if you know how to deal with C++ or any other language with big integer, but
+	it's interesting to think about regardless, can also be solved with a binary search, but
+	it's not required.