Reaching Expert in 1 year

Revision en1, by theoneandonlytron, 2026-09-27 18:59:28

Thanks so much for anyone that has supported me in that time, thank you so much Also for anyone don't know algorithm that I learned before expert include: - Bsearch, prefix sum, brute force (including recursion) - dfs, bfs, Dijkstra, dsu, hld, centroid decomposition, virtual tree, mst, topo sort - dsa : Fenwick, segment - eulor tour lca - Hasing (imma learn more), meet in the middle - dp: on trees, sos, bit mask, knapsack, dnc, reroot, digit - tricks : convex hull, alien - small to large merging - meet in the middle - and I think some more minors one

But yez so when I connect the hld, centroid, dnc stuff to my lower bit mask and knapsack stuff imma hit cm trust

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en5 English theoneandonlytron 2026-09-27 21:40:04 204
en4 English theoneandonlytron 2026-09-27 19:01:25 71
en3 English theoneandonlytron 2026-09-27 19:00:25 70
en2 English theoneandonlytron 2026-09-27 18:59:52 0 Added Images
en1 English theoneandonlytron 2026-09-27 18:59:28 708 Initial revision (published)