🚀Day 1 of #100DaysOfCode - Upper Bound with Binary Search in TypeScript

Today, I explored an important variation of binary search-the upper bound function. This is useful when we need to find the first element greater than a given value in a sorted array.

🔷 What is Upper Bound?
The upper bound of a target in a sorted array is the smallest index where an element greater than the target exists. If no such element exists, it returns the array length.

⚒️ Implementing Upper Bound in
TypeScript

Here's my TypeScript implementation using binary search:

📌 What I Learned Today

✅ Upper Bound is useful for range queries, insertion positions, and ordered datasets.
✅ Binary Search makes it efficient with
O(log n) time complexity.
✅ Edge Cases are important, like when all
elements are ≤ target.

Feeling great about today's progress! Excited for more learning ahead 💡🔥