All-Pairs Shortest-Paths (Floyd-Warshall Algorithm)
Floyd–Warshall all-pairs shortest paths: DP recurrence, intuition, and Python example
Zürich night over Limmat
Floyd–Warshall all-pairs shortest paths: DP recurrence, intuition, and Python example
Dijkstra’s algorithm: relaxation, invariants, and priority-queue runtime tradeoffs
A compact Big-O cheat sheet for core Java Collections Framework operations
Huffman coding: prefix-free codes, greedy merging, and heap-based runtime analysis
Fractional knapsack: value-density greedy strategy and why it differs from 0-1 knapsack
DP vs greedy through activity selection: optimal substructure, greedy choice, pseudocode