Skip to content

🎈My notebook and solutions for 300+ problems that I solved during practice for ACM-ICPC

License

Notifications You must be signed in to change notification settings

brpapa/algorithms

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 Cannot retrieve latest commit at this time.
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Acess my personal notebook for this repository here.

Solutions by theme:

string processing

  • πŸ““ spoj/TESSER: finding the tesserect
  • palindrome
  • knuth-morris-pratt (KMP)

searching

mathematics

graphs

  • πŸ““ uri/1076: design labirints
  • shortest paths
    • single-source
    • all-pairs
      • floyd-warshall
  • minimum spanning tree (MST)
  • depth first search (DFS)
  • breadth first search (BFS)
  • binary search tree (BST)

dynamic programming

  • minimum sum
    • πŸ““ uva/116: unidirectional TSP
  • minimax
  • longest common subsequence (LCS)
    • πŸ““ uva/10405: longest common subsequence
  • knapsack
  • edit distance
  • digits

computational geometry

bitmasks

  • πŸ““ uri/1026: to carry or not to carry

ad-hoc