Hello, my name is Mark B. I plan to master Python and Java by doing as much practice problems as possible. I love math, coding, CTFs, music, superheroes, and the oxford comma. I will go to space one day.

Also saying boom instead of QED makes any proof infinitely better.

When I am older I will be stronger and be able to solve:

1. https://dmoj.ca/problem/ds4
2. https://dmoj.ca/problem/ccc03s4 - need to learn Ukkonen's Algorithm
3. https://dmoj.ca/problem/coci08c3p5
4. https://dmoj.ca/problem/ecoo16r2p1
5. https://dmoj.ca/problem/dmpg15s5
6. https://dmoj.ca/problem/acc3p4 - need to learn lazy propagation
7. https://dmoj.ca/problem/tle15p5

I am now older and am able to solve:

1. https://dmoj.ca/problem/coci15c4p4
2. https://dmoj.ca/problem/fibonacci
3. https://dmoj.ca/problem/dwite09c3p5

Problems that taught me how to use cool stuff:

1. https://dmoj.ca/problem/ccc10s4 - Spanning Trees
2. https://dmoj.ca/problem/ccc15s3 - Balanced BSTs
3. https://dmoj.ca/problem/dmopc15c4p4 - Prefix Sums
4. https://dmoj.ca/problem/acc3p4 - Segment Trees
5. https://dmoj.ca/problem/ccc03s4 - Suffix Trees

CP Notes:

• Almost all problems involving primes can be solved elegantly with the Sieve of Eratosthenes.
• When performing a BFS multiple times it might be faster to just precompute all the values once per node.
• Always look for ways to optimise individually computationally intensive tasks dynamically when performing them in bulk.

Also also, check out my Github - https://github.com/Supermac30