LeetCode Longest Increasing Subsequence: DP and Patience
LeetCode 300 in detail — the O(n^2) DP, the O(n log n) patience-sorting trick with binary search, and when each one matters.
·5 min read · #dsa#leetcode#dp
#binary-search
3 posts.
LeetCode Search in Rotated Sorted Array
Solve LeetCode 33 Search in Rotated Sorted Array in O(log n) with modified binary search. Pivot detection, half-decision logic, and interview talking points.
·4 min read · #dsa#leetcode#binary-search
Binary Search: The Pattern That Powers a Hundred Problems
A practical guide to binary search — the classic template, off-by-one traps, Python's bisect module, and the binary-search-on-answer pattern, with six worked problems.
·9 min read · #dsa#searching#binary-search