30% off Lifetime Premium Access expires December 2nd!

30% off Lifetime Premium Access expires Dec 2nd!

Your Dashboard

Interview Coaching

Mock Interviews

1:1 Mentorship

Salary Negotiation

Practice

Learn

System Design

ML System Design

Code

Behavioral

Salary Negotiation

Interview Guides

Blog

Community

Interview Questions

Interview Experiences

Peer System Design Library

Ask The Community

Discord

Refer a Friend

Pricing

Become a Coach

⌘K

Pricing Become a Coach

⌘K

Get Premium

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.

Asked at:

Microsoft

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Early January, 2020

Microsoft

Mid-level

Find in Rotated Sorted Array with Duplicates

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 81. Search in Rotated Sorted Array II

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact