Find a Local Minimum with Left-Biased Binary Search
Company: Meta
Role: Software Engineer
Category: Coding & Algorithms
Difficulty: medium
Interview Round: Onsite
Overview: Find a deterministic local-minimum index in a nonempty integer array with a left-biased binary search. Understand why the equality case preserves the left interval and how endpoints and duplicates satisfy the non-strict definition.
Read the full Meta Software Engineer interview experience this question came from