"MFU algorithms"

More dumbness of the people: 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

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