dsa2 min read
Search in Rotated Sorted Array — Half-Sorted Check
Search in a rotated sorted array by identifying which half is sorted and narrowing accordingly.
Read →
Rotated
4 articles
dsa1 min read
Find Minimum in Rotated Sorted Array — Left Boundary on Rotation
Find the minimum element in a rotated sorted array by comparing mid with right boundary to locate the rotation point.
Read →
dsa1 min read
Search in Rotated Sorted Array II — Handle Duplicates
Search in a rotated sorted array that may contain duplicates by skipping lo++ when mid equals both boundaries.
Read →
dsa1 min read
Find Minimum in Rotated Sorted Array II — Duplicates Handling
Find the minimum in a rotated array with duplicates by shrinking hi-- when nums[mid]==nums[hi].
Read →