Trying to get better

Personal Journal

Reached 200 points (10/8/2022)

First S1 solve on CCC (15/2/2023)

First 15 pointer solve (16/8/2023)

Notes to self

• find is lazy, using id directly will sometimes give the wrong result because the laziness isn't fully propagated (DSU note)
• Naive dijkstra's: https://dmoj.ca/src/5762308
• count substrings of string that are in given list of strings https://dmoj.ca/problem/coci17c1p3

TODO:

https://dmoj.ca/problem/dmopc16c1p5

https://dmoj.ca/problem/ccc09s3

https://dmoj.ca/problem/ccc23s3

Python too slow / have to implement in fast language like c++ most likely: -https://dmoj.ca/problem/btoi07p3

understand union set data structure fully

https://dmoj.ca/problem/aac5p3

https://dmoj.ca/problem/ccc07s5

Fenwick Tree Problems:

go document answer for https://dmoj.ca/problem/comparingarrays and look up about hash collisions and hash bases/birthday paradox

https://dmoj.ca/problem/dmopc20c4p3

https://dmoj.ca/problem/acc8p5

https://dmoj.ca/problem/aac1p6

https://dmoj.ca/problem/dmopc19c3p3

Fun Problems:

• https://dmoj.ca/problem/subarrayproblem
• https://dmoj.ca/problem/seed3