Find Ceil of a Number

function findCeil(nums, target) {
  let left = 0, right = nums.length - 1, ans = -1;
  while (left <= right) {
    const mid = Math.floor((left + right) / 2);
    if (nums[mid] >= target) {
      ans = nums[mid];
      right = mid - 1;
    } else left = mid + 1;
  }
  return ans;
}
                  

Explanation: Track minimum value greater than or equal to target.

⏱ O(log n) | 💾 O(1)