leetle

Daily challenge for 2026-06-27

543. Find Target in Mountain Array

Given a sorted array of unique integers nums and a target value target, return the index of the target if it exists in the array. If it does not exist, return -1. You must implement a solution with O(log n) runtime complexity.

Example:
Input: nums = [1, 3, 5, 7, 9], target = 7
Output: 3

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