Software Engineer's Blog

Blog posts — page 18

33. Search in Rotated Sorted Array

Coding Interview

33. Search in Rotated Sorted Array

Jason Yang · 03 Dec, 2025

Search in Rotated Sorted Array (LeetCode 33): a modified O(log n) binary search that finds which half is sorted, with an interactive step visual.

Divide and Conquer (D&C): Beyond Merge Sort

Coding Interview

Divide and Conquer (D&C): Beyond Merge Sort

Jason Yang · 03 Dec, 2025

Divide and Conquer is more than Merge Sort: the 3-step design paradigm, how it differs from plain recursion, and the interview patterns that use it.