Leetcode 81. Search in Rotated Sorted Array II

Given a non-decreasing sorted array rotated at an unknown pivot (and possibly containing duplicates), determine whether a target value exists in the array. The core challenge is adapting binary search to handle rotation and equal elements, which can in the worst case degrade the runtime from logarithmic to linear when duplicates obscure the sorted half.