🚀 Day 2 of #100DaysOfCode – Mastering Binary Search in TypeScript

Hey Devs! 👋

Today, I deep-dived into Binary Search and explored some interesting problems using TypeScript. Here's what I worked on:

🔍 What I Learned:
✅ Binary Search in Depth – Understanding the intuition behind it
✅ Floor & Ceil in a Sorted Array – Using Binary Search efficiently
✅ Recursive Approach – Improved understanding of recursion while implementing

🧩 Floor & Ceil Problem:
➡️ Floor: Largest element ≤ target
➡️ Ceil: Smallest element ≥ target

🔥 Key Takeaways:
➡️ Binary Search makes floor & ceil problems efficient.
➡️ Iterative & Recursive approaches both provide valuable insights.
➡️ Understanding edge cases is crucial, like when the target is smaller/larger than all elements.

I’m really enjoying this challenge so far! Next up, I plan to explore strivers DSA sheet and searching in rotated sorted arrays.

💡 What are your thoughts on my implementation? Any improvements or alternative approaches? Let’s discuss!