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
#leetcode
3 posts
Subset Generation
A guide to generating all subsets of a set (power set) using three methods: incremental construction, recursive backtracking, and bit manipulation, with C++ examples for LeetCode 78.
Tech, Data Structures & Algorithms
Binary Search and Its Applications
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.
Tech, Data Structures and Algorithms