An Algorithmic Synthesis Problem: Path With Minimum Effort
A walkthrough of LeetCode 1631 (minimax path) using binary search + BFS/DFS, union-find (Kruskal), and adapted Dijkstra.
Tech, Data Structures & Algorithms
Posts tagged
2 posts
A walkthrough of LeetCode 1631 (minimax path) using binary search + BFS/DFS, union-find (Kruskal), and adapted Dijkstra.
Binary Search locates targets in ordered or monotonic spaces in O(log n) time. Covers templates, rotated arrays, 2D matrices, BSTs, and answer-space search techniques.