Aaroninlearning noteLeetcode 1489: Find Critical and Pseudo-Critical Edges in Minimum Spanning TreeDifficulty: Hard, (8 personal rank) Keywords: Tarjan algo, bridge, DSU, Kruskal algo, MSTDec 6, 2021Dec 6, 2021
Aaroninlearning noteCSES 1202: InvestigationKeywords: Dijkstra’s Algorithm, DP Difficulty: 5 (AA)Sep 21, 2021Sep 21, 2021
Aaroninlearning noteConvex Hull: Andrew’s Monotone Chainkeywords: Andrew’s Monotone Chain, convex hull, cross productSep 3, 2021Sep 3, 2021
Aaroninlearning noteHuffman code with the alphabet of size 3Keywords: greedy, Huffman CodeAug 28, 2021Aug 28, 2021
Aaroninlearning noteMHT Root, Tree CentroidKeywords: minimum height trees (MHTs), tree centroid, topological sort, centroid decompositionAug 20, 2021Aug 20, 2021
Aaroninlearning noteLeetcode 1967. Number of Strings That Appear as Substrings in WordDifficulty: Easy (8 personal rank) Keywords: Aho–Corasick algorithmAug 16, 2021Aug 16, 2021
Aaroninlearning noteLeetcode 1970. Last Day Where You Can Still CrossDifficulty: Hard (5 personal rank) Keywords: DSU, binary searchAug 16, 2021Aug 16, 2021
Aaroninlearning noteCSES: Josephus Problem IIDifficulty: AA 5 Keywords: k-th minimum value in BITAug 14, 2021Aug 14, 2021
Aaroninlearning noteLeetcode 546: Remove BoxesDifficulty: Hard (10 personal rank) Keywords: DPAug 14, 2021Aug 14, 2021
