DEV Community: xscoox

🚀 Day 3 of #100DaysOfCoding

xscoox — Sat, 22 Feb 2025 08:44:06 +0000

Today, I dived into Linked Lists and learned the basics:
✅ Insertion
✅ Traversal
✅ Deletion
✅ Understanding how pointers work

Excited to learn more complex data structures next! 💡

🚀 Day 2 #100DaysOfCode

xscoox — Fri, 21 Feb 2025 14:09:20 +0000

I’m really enjoying this challenge so far! Solved over 15 problems on binary search in python. I plan to explore more exciting challenges ahead. 🚀

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

xscoox — Fri, 21 Feb 2025 05:46:40 +0000

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!

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

xscoox — Thu, 20 Feb 2025 17:27:09 +0000

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 💡🔥