- Find first and last positions of an element in a sorted arrayMedium✓ Solved1 approach
- Search in a rotated sorted arrayMedium✓ Solved1 approach
- Kth smallest numberMedium✓ Solved3 approaches
- Find a fixed point (value equal to index)Easy✓ Solved1 approach
- Integer square rootEasy✓ Solved1 approach
- Find the repeating and the missing numberMedium✓ Solved1 approach
- Majority element (> n/2 times)Easy✓ Solved1 approach
- Search in an array where adjacent elements differ by at most kEasy✓ Solved1 approach
- Find a pair with a given differenceEasy✓ Solved1 approach
- Find four elements that sum to a given value (4-sum)Medium✓ Solved1 approach
- Count triplets with sum smaller than a given valueMedium✓ Solved1 approach
- Merge two sorted arrays into a new arrayEasy✓ Solved1 approach
- Print all subarrays with sum 0Medium✓ Solved1 approach
- Product array puzzle (product of all except self)Medium✓ Solved1 approach
- Sort an array by the number of set bitsEasy✓ Solved1 approach
- Minimum number of swaps to sort an arrayMedium✓ Solved1 approach
- Bishu and SoldiersMedium✓ Solved1 approach
- Kth element of two sorted arraysMedium✓ Solved2 approaches
- Binary search on the answer — Aggressive Cows, Book Allocation, Painter’s Partition, EKO, ROTI-PrataMedium✓ Solved3 approaches
- Find pivot (minimum) in a rotated sorted arrayMedium✓ Solved1 approach
- Missing number in an arithmetic progressionEasy✓ Solved1 approach
- Smallest number whose factorial has at least n trailing zerosMedium✓ Solved1 approach
- DoubleHelix — maximum sum path across two arraysMedium✓ Solved1 approach
- Subset sums (all possible sums of subsets)Easy✓ Solved1 approach
- Implement in-place merge sortHard✓ Solved1 approach
- Sort an array with many repeated entries (3-way quicksort)Medium✓ Solved1 approach
- Optimum location of a point to minimise total distanceHard✓ Solved1 approach
- Rasta and Kheshtak (largest common square submatrix pattern)Hard✓ Solved1 approach
- Maximum sum such that no two elements are adjacent (House Robber)Easy✓ Solved1 approach
- Binary SearchEasy✓ Solved1 approach
- Find Peak ElementMedium✓ Solved1 approach
- Time Based Key-Value StoreMedium✓ Solved1 approach
- Koko Eating BananasMedium✓ Solved1 approach
- Capacity To Ship Packages Within D DaysMedium✓ Solved1 approach
- Minimum Number of Days to Make m BouquetsMedium✓ Solved1 approach