📊
Binary Search
Master binary search based algorithms through interactive challenges
About Binary Search
Binary search is a fundamental algorithm for efficiently finding elements in sorted arrays. Mastering binary search and its variants is essential for solving a wide range of computer science problems. Practice and learn through interactive games and visualizations.
Beginner
🎯
First and last position of X
Given a sorted array and a target, find the first and last position of that target in the array using binary search.
15-20 min
Intermediate
🔄
Index of X in Rotated Sorted Array
Given a rotated sorted array and a target, find the index of the target using binary search.
15-20 min
Intermediate
📉
Index of Minimum in Sorted Rotated Array
Given a rotated sorted array, find the index of the minimum element using binary search.
15-20 min
Intermediate
🔢
Find X in Row and Column Wise Sorted Matrix
Given a row and column wise sorted matrix and a target, find if the target exists using an efficient search algorithm.
15-20 min