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 →
Duplicates
2 articles
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 →