TCH RA Rashmi Thakur Day 21/100 Days of DSA — Floor and Ceil in a Sorted Array (Binary Search) Binary Search isn’t just about finding whether an element exists. Some of its most useful applications involve finding the closest possible…
TCH RA Rashmi Thakur Day 20/100 Days of DSA — Lower Bound using Binary Search Binary Search is one of the most important algorithms in DSA, and Lower Bound is one of its most common applications. It appears frequently…