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