Leetcode 2774. Array Upper Bound

Given a sorted array (nondecreasing, may contain duplicates) and a target value, find the smallest index whose element is strictly greater than the target (the "upper bound"). This is typically solved with a binary search to locate the first element > target and return the index (or array length if none).