| Problem | Data Structure / Algo | π₯ Key Insight / Mark |
|---|---|---|
| Tree Diameter | BFS | βπ οΈπ₯ |
| Subtree Size | DFS | βπ οΈπ₯ |
April 15, 2025About 4 min
| Problem | Data Structure / Algo | π₯ Key Insight / Mark |
|---|---|---|
| Tree Diameter | BFS | βπ οΈπ₯ |
| Subtree Size | DFS | βπ οΈπ₯ |
2025-04-12| Problem | Type(s) | Data Structure / Algo | π₯ Key Insight / Mark |
|---|---|---|---|
| D | String/constructive | Case Discussion/Greedy | β |
| E | Graph connectivity | DSU | βπ₯π οΈ |
| F | Tree | BFS/Sliding Window | βπ₯π οΈ |
| G | Bipartite matching | Binary Search/Max flow | π |
A bipartite graph is a type of graph where the set of vertices can be divided into two disjoint sets U and V such that:
2025-03-29| Problem | Type(s) | Data Structure / Algo | π₯ Key Insight / Mark |
|---|---|---|---|
| C | Graph | DFS/BFS/DSU | βπ οΈπ₯ |
| D | Pairwise Pattern Check with Indexed Constraints | Simulation | β |
| E | String/Graph | DSU | π§ πβ |
| F | Algebraic Dynamic Programming | DP/Prefix Sum | π |
| G | Tree | Matroid | π§ π |
2025-02-22| Problem | Type(s) | Data Structure / Algo | π₯ Key Insight / Mark |
|---|---|---|---|
| E | Shortest Path | BFS | π§ π₯ |
| F | Tree DP | Tree DP/DFS | π₯ |
2025-02-08| Problem | Type(s) | Data Structure / Algo | π₯ Key Insight / Mark |
|---|---|---|---|
| D | Math | Math | β |
| E | Connected component | DSU/DFS/BFS | π₯π οΈ |
| F | Constructive | Fenwick Tree | π₯π οΈπ§ |
2025-01-04| Problem | Type(s) | Data Structure / Algo | π₯ Key Insight / Mark |
|---|---|---|---|
| D | Shortest Distance | BFS | βπ₯ |
| E | Constructive | Math | π |
| F | DP | DP | π |
| F | FPS | FPS | π |
2024-12-14| Problem | Type(s) | Data Structure / Algo | π₯ Key Insight / Mark |
|---|---|---|---|
| D | Subsequence | Prefix Sum | βπ₯ |
| E | Grid | BFS | π§ |
| F | Math | Math | π |
| G | Query square root decomposition | Moβs Algorithm | π |