Codeforces :
1520G --> Bfs && Greedy (2200)
1307D --> Bfs && Sorting (1900)
1454E --> Dfs && Graphs && combinatorics (2000)
1324F --> Tree && rerooting (1800)
1176D --> NumberTheory && sorting (1800)
1092F --> Tree && rerooting (1900)
1573D --> GameTheory (1700)
1538G --> BinarySearch && math (2100)
1573F --> Bipartite graph (2200)
1354E --> Bipartite graph && Dp (2100)
1471F --> Graph && Greedy (2200)
1513D --> Dsu && MST (2000)
1547F --> Seg Tree && BinarySearch (1900)
1551E --> Dp (2000)
1555E --> Seg Tree & lazy (2100)
1567E --> Seg Tree & lazy (2200)
1558B --> Dp && number theory (1900)
0366D --> Dfs && BinarySearch (2000)
1552C --> Adhoc (1800)
0510C --> Graph/Sorting (Topological Sort) (1600)
0126B --> Prefix array || Z function (1700)
0641E --> Fen Tree && Compression (2000)
101473J > LCA && MST (2000)
1605D --> GameTheory && Tree && Bitwise (2100)
104505F > segTree
Others :
thabit.io/contests/1005/problem/D --> Dp