Find Peak Element?

Short answer: int FindPeakElement(int[] nums) { int left = 0, right = nums.Length - 1; while (left < right) { int mid = (left + right) / 2; if (nums[mid] > nums[mid + 1]) right = mid; else left = mid + 1; } return left; } Explanation: Binary search comparing mid element with right neighbor to find peak.

Example code

int FindPeakElement(int[] nums)
{
int left = 0, right = nums.Length - 1; while (left < right) {
int mid = (left + right) / 2;
if (nums[mid] > nums[mid + 1])
right = mid; else left = mid + 1;
}
return left;
} Explanation: Binary search comparing mid element with right neighbor to find peak.

Real-world example (ShopNest)

In coding rounds, state complexity aloud, write a clear ShopNest-flavored example (orders, carts), then handle edge cases (empty list, null, overflow).

Say this in the interview

1. Define — one clear sentence (the short answer above).
2. Example — relate it to a project like ShopNest or your real work.
3. Trade-off — when you would not use it.