โ† Zillious questions
CodingReported in a candidate post, Oct 2015

Find inflection point k in a bitonic-like array

Filed under Zillious

The question

Given an array structured as elements increasing up to index k-1, then a[k], followed by elements less than or equal to a[k] onwards, find k in O(n) time.

No write-up yet. Related questions below have one.

Related Zillious questions

Collected from public candidate posts and coding forums. Updated Nov 2026.