Day 25: Advanced graphs

0 of 4 tasks completed0%

Week 4 Context

4 remaining

Coding dijkstra

LC 743. Dijkstra. Heap, dist[], and why DFS is the wrong story.

Study

Coding bellman ford

LC 787. Bellman-Ford / layered BFS. Constraint on stops is the point.

Study

Coding topo sort

LC 269. Unique edges from adjacent words, then topo. Invalid prefix case.

Study

System design sharding

Hot partitions, resharding, and directory vs hash. Pick for a chat inbox.

Study