Skip to content

mbLearn/CS-2019

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

10 Commits
 
 
 
 
 
 
 
 
 
 

Repository files navigation

CS-2019

GOAL : Algorithms to learn and excel in

Sieve of Eratosthenes, or another prime number sieve

Depth-first search

Breadth-first search

Dijkstra's algorithm

Floyd--Warshall algorithm

Either Kruskal's or Prim's algorithm

Some implementation of topological sorting, such as by using DFS

Convex hull (I recommend the Monotone Chains algorithm)

Coordinate compression

Edmonds--Karp, or another implementation of the Ford--Fulkerson method; or a preflow-push algorithm; or, if you are preparing an ACM codebook, Dinic's algorithm. (Note: Max flow is not allowed to appear on the IOI, but may nevertheless appear on national team-selection contests)

Al Sweigart Recursion videos

https://www.youtube.com/results?search_query=al+sweigart+recursion

ALgorithm Patterns

https://medium.com/@aahmad_49388/the-ultimate-strategy-to-preparing-for-the-coding-interview-ee9f7eb439f3

About

No description, website, or topics provided.

Resources

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published

Languages