514. Find the Peak Capacity

You are given a 0-indexed integer array capacities that is strictly increasing and then strictly decreasing. Find the maximum capacity in the array in O(log n) time.

Example:
Input: capacities = [10, 20, 50, 40, 30]
Output: 50

Run this challenge interactively in Python or JavaScript when the app loads.