Algorithm, Data Structure, Programming Language

Leetcode 1489: Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree

Difficulty: Hard, (8 personal rank)
Keywords: Tarjan algo, bridge, DSU, Kruskal algo, MST

預備知識

• DSU, Tarjan’s…

CSES 1202: Investigation

Keywords: Dijkstra’s Algorithm, DP
Difficulty: 5 (AA)

題目

Convex Hull: Andrew’s Monotone Chain

keywords: Andrew’s Monotone Chain, convex hull, cross product

Sparse Table

Keywords: range minimum query

Sparse Table

MHT Root, Tree Centroid

Keywords: minimum height trees (MHTs), tree centroid, topological sort, centroid decomposition

Leetcode 1967. Number of Strings That Appear as Substrings in Word

Difficulty: Easy (8 personal rank)
Keywords: Aho–Corasick algorithm

前言

Leetcode 1970. Last Day Where You Can Still Cross

CSES: Josephus Problem II

Difficulty: AA 5
Keywords: k-th minimum BIT