Skip to content

Latest commit

 

History

History
17 lines (13 loc) · 653 Bytes

README.md

File metadata and controls

17 lines (13 loc) · 653 Bytes
Raw

Some algorithms

MFU algorithms

Longest increasing subsequence - O(N * logN)

  • Keep a monotonic array
  • If the present element is freshly greatest append it.
  • Else, Binary search and update so that it reduces for further coming numbers

Intuition

  1. Word ladder -> BFS because we don't want loop. And maybe optimize using A*
  2. Shortest path with obstracles move any direction. -> Perlocation problem BFS with eroding the graph.
    Cat and Mouse -> DP on Graphs

More dumbness

Overwhelmed by the name dutch national flag algorithm -> which is sorting 0,1,2 in O(n) Also, levenshtein_distance -> which is edit distance: DP