431. Find Smallest Greater Than Target

Given a sorted array of unique integers nums and a target value, return the smallest integer in the array that is strictly greater than the target. If no such integer exists, return -1. You must implement a solution with O(log n) time complexity.

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

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