plan.txt (613B)
1 plan 2 ==== 3 these are the things I want to learn, ordered 4 x number of palindrome substrings (similar to interview where print out all palindrome's len >= 3) 5 x prim's algo (visualized in python) 6 x permutation problem (similar to interview where print all permutations of a string where only certain chars may be moved) 7 x union find 8 x segment tree 9 - successor paths 10 - quickselect 11 x lc 1 12 - lc 2 13 - perlin noise 14 - visualize 15 x merkle tree 16 x find duplicate subtrees (this isn't a merkle tree, but builds on the idea of encoding subtrees in a unique way)