Sorting & Searching
Master fundamental sorting and searching algorithms and their applications.
Binary Search
Given a sorted array of integers and a target value, return the index of the target if found, or -1 if not present.
Search in Rotated Sorted Array
Given a rotated sorted array and a target value, return the index of the target if found in O(log n) time, or -1 if not present.