DSA question set · 180 questions
Binary Search DSA Practice Questions
Explore 180 DSA questions in Binary Search. Practice with DSAWiser’s code editor and visualizer.
Binary SearchMathArraysPrefix SumMonotonic QueueStringsGraphMatrixDynamic ProgrammingHeap (Priority Queue)Fenwick TreeTreeGeometryConvex Hull TrickUnion Find
What’s in this set
The Binary Search collection contains 180 problems: 50 basic, 50 easy, 35 medium, 25 hard, 20 very hard. Choose a question at your current level, or follow the collection’s order below.
Topics in this collection include Binary Search, Math, Arrays, Prefix Sum, Monotonic Queue. Each question shows its own topics and difficulty so you can decide where to begin.
Practice with the code visualizer
- Open a question in the editor and read the statement, inputs, and expected output. Predict the result for a small example before writing code.
- Write a solution and run the examples. If a result differs from your prediction, reduce the input until you can follow each step.
- Step through your code in the visualizer. Use a breakpoint to inspect the state at a specific line, then compare it with your reasoning.
Questions in this set
180 totalOpen a question in the editor to read its statement and examples. Sign in to practice.
- Calculate Floor Midpoint IndexBinary Search · MathBasic
- Value at Array MidpointBinary Search · Arrays · MathBasic
- Target Compared to MidpointBinary Search · Arrays · MathBasic
- Discard Half Search SpaceBinary SearchBasic
- Single-Step Elimination CountBinary SearchBasic
- Check Sorted OrderBinary Search · ArraysBasic
- Target Range Bounds CheckBinary Search · ArraysBasic
- Binary Search in Two ElementsBinary Search · ArraysBasic
- Binary Search in Three ElementsBinary Search · ArraysBasic
- Standard Binary Search (Distinct Elements)Binary Search · ArraysBasic
- Count Binary Search IterationsBinary Search · Arrays · MathBasic
- Binary Search with 1-Based IndexingBinary Search · Arrays · MathBasic
- Boolean Presence CheckBinary Search · ArraysBasic
- Trace Midpoint IndicesBinary Search · Arrays · MathBasic
- Search in Descending Sorted ArrayBinary Search · ArraysBasic
- Search Insert PositionBinary Search · ArraysBasic
- Maximum Steps BoundBinary Search · MathBasic
- Array Midpoints by ParityBinary Search · Arrays · MathBasic
- Trace Midpoint ValuesBinary Search · Arrays · MathBasic
- Immediate Neighbors of TargetBinary Search · ArraysBasic
- Floor in a Sorted ArrayBinary Search · ArraysBasic
- Ceiling in a Sorted ArrayBinary Search · ArraysBasic
- First Occurrence of TargetBinary Search · ArraysBasic
- Last Occurrence of TargetBinary Search · ArraysBasic
- Count Occurrences in Sorted ArrayBinary Search · ArraysBasic
- First Element Strictly GreaterBinary Search · ArraysBasic
- Last Element Strictly LessBinary Search · ArraysBasic
- Count Elements Strictly Less Than TargetBinary Search · ArraysBasic
- Count Elements Strictly Greater Than TargetBinary Search · ArraysBasic
- Subarray Binary SearchBinary Search · Arrays · Prefix SumBasic
- First True in Monotonic Boolean ArrayBinary Search · Arrays · Monotonic QueueBasic
- Last Zero in Sorted 0-1 ArrayBinary Search · ArraysBasic
- Count Zeros in Sorted 0-1 ArrayBinary Search · ArraysBasic
- First Bad VersionBinary Search · ArraysBasic
- Closest of Two CandidatesBinary SearchBasic
- Binary Search on Sorted CharactersBinary Search · Arrays · StringsBasic
- Next Alphabetical LetterBinary Search · Arrays · StringsBasic
- Guess Feedback FunctionBinary Search · MathBasic
- Integer Square RootBinary Search · MathBasic
- Valid Perfect Square CheckBinary Search · MathBasic
- Binary Search with Negative NumbersBinary Search · ArraysBasic
- Closest Element in Sorted ArrayBinary Search · ArraysBasic
- Overflow-Safe Midpoint CalculationBinary Search · Graph · MathBasic
- First Positive ElementBinary Search · ArraysBasic
- Last Negative ElementBinary Search · ArraysBasic
- First Element At Least KBinary Search · ArraysBasic
- Element Equal to Its IndexBinary Search · ArraysBasic
- Search in Arithmetic SequenceBinary Search · Arrays · MathBasic
- Smallest Missing Non-Negative IntegerBinary Search · ArraysBasic
- First and Last Position RangeBinary Search · ArraysBasic
- Guess Number Higher or LowerBinary SearchEasy
- Arranging CoinsBinary Search · MathEasy
- Special Array With X Elements Greater Than or Equal XBinary Search · ArraysEasy
- Maximum Count of Positive and Negative IntegersBinary Search · ArraysEasy
- Find Target Indices After SortingBinary Search · ArraysEasy
- The K Weakest Rows in a MatrixBinary Search · Arrays · MatrixEasy
- Check If a Number Is Majority Element in Sorted ArrayBinary Search · ArraysEasy
- Missing Number in Arithmetic ProgressionBinary Search · Arrays · MathEasy
- Fair Candy SwapBinary SearchEasy
- Minimum Common ValueBinary Search · ArraysEasy
- Longest Subsequence With Limited SumBinary Search · Arrays · Dynamic ProgrammingEasy
- Count Elements in Range [L, R]Binary Search · ArraysEasy
- Distance Value Between Two ArraysBinary SearchEasy
- Check If N and Its Double ExistBinary Search · ArraysEasy
- Search in a Nearly Sorted ArrayBinary Search · ArraysEasy
- Intersection of Two ArraysBinary Search · ArraysEasy
- Count Pairs Whose Sum Is Less Than TargetBinary Search · ArraysEasy
- Integer Cube RootBinary Search · MathEasy
- Check for Duplicate ElementsBinary Search · ArraysEasy
- Row with Maximum OnesBinary Search · Arrays · MatrixEasy
- Peak Element in Bitonic ArrayBinary Search · ArraysEasy
- Median of a Sorted ArrayBinary Search · ArraysEasy
- Index of the Single Element in Paired Sorted ArrayBinary Search · ArraysEasy
- Frequency of Known ModeBinary Search · ArraysEasy
- Row-Wise Binary SearchBinary Search · Arrays · MatrixEasy
- Real Square Root with PrecisionBinary Search · MathEasy
- Search in Array Sorted by Absolute ValueBinary Search · ArraysEasy
- Smallest Character Greater than Target with WrapBinary Search · Arrays · StringsEasy
- Batch Frequency Queries in Sorted ArrayBinary Search · ArraysEasy
- Missing Number in 1 to N+1Binary Search · ArraysEasy
- First Element Exceeding ThresholdBinary Search · ArraysEasy
- Solve Monotonic Function f(x) = KBinary Search · Monotonic Queue · MathEasy
- Two Sum Existence in Sorted ArrayBinary Search · ArraysEasy
- Closest Equal Sum Split IndexBinary Search · ArraysEasy
- Closest Element in Sorted Array to Given ValueBinary Search · ArraysEasy
- Leftmost and Rightmost Insertion IndicesBinary Search · ArraysEasy
- Batch Range Count QueriesBinary Search · ArraysEasy
- Search with ToleranceBinary Search · ArraysEasy
- Minimum in 3-Element Rotated ArrayBinary Search · ArraysEasy
- Target Span LengthBinary Search · ArraysEasy
- Find Local Minimum in ArrayBinary Search · ArraysEasy
- Minimum Absolute Difference with TargetBinary Search · ArraysEasy
- Worst-Case Comparisons for Power of Two SizeBinary Search · MathEasy
- First Negative in Descending ArrayBinary Search · ArraysEasy
- Multiples of K in Sorted RangeBinary Search · ArraysEasy
- Count Elements Within Distance DBinary Search · ArraysEasy
- Search in Alternating Parity Sorted ArrayBinary Search · ArraysEasy
- Smallest Fixed Point IndexBinary Search · ArraysEasy
- Pair Sum Across Two Sorted ArraysBinary Search · Heap (Priority Queue)Easy
- Comprehensive Target Range and FallbackBinary Search · ArraysEasy
- Search in Rotated Sorted ArrayBinary Search · ArraysMedium
- Find Minimum in Rotated Sorted ArrayBinary Search · ArraysMedium
- Count Array RotationsBinary Search · ArraysMedium
- Search in Rotated Sorted Array with DuplicatesBinary Search · ArraysMedium
- Find Minimum in Rotated Sorted Array with DuplicatesBinary Search · ArraysMedium
- Find Peak ElementBinary Search · ArraysMedium
- Peak Index in a Mountain ArrayBinary Search · ArraysMedium
- Find in Mountain ArrayBinary Search · ArraysMedium
- Single Element in a Sorted ArrayBinary Search · ArraysMedium
- Find K Closest ElementsBinary Search · ArraysMedium
- Search a 2D MatrixBinary Search · Arrays · MatrixMedium
- Search a 2D Matrix IIBinary Search · Arrays · MatrixMedium
- Count Negative Numbers in a Sorted MatrixBinary Search · Arrays · MatrixMedium
- Kth Smallest Element in a Sorted MatrixBinary Search · Arrays · MatrixMedium
- Search in Unbounded Sorted SequenceBinary Search · ArraysMedium
- Koko Eating BananasBinary Search · ArraysMedium
- Capacity to Ship Packages Within D DaysBinary SearchMedium
- Minimum Days to Make M BouquetsBinary SearchMedium
- Smallest Divisor Given a ThresholdBinary Search · ArraysMedium
- Magnetic Force Between Two BallsBinary Search · ArraysMedium
- Minimum Speed to Arrive on TimeBinary Search · ArraysMedium
- Minimum Time to Complete TripsBinary SearchMedium
- Maximum Ribbon Cutting LengthBinary SearchMedium
- Split Array Largest SumBinary Search · ArraysMedium
- Minimum Time to Repair CarsBinary Search · ArraysMedium
- H-Index IIBinary Search · ArraysMedium
- Kth Missing Positive NumberBinary Search · ArraysMedium
- Heaters Coverage RadiusBinary SearchMedium
- Find Right IntervalBinary SearchMedium
- Valid Triangle NumberBinary Search · ArraysMedium
- Two Sum in Sorted Array via Binary SearchBinary Search · ArraysMedium
- Longest Increasing Subsequence LengthBinary Search · Arrays · Dynamic ProgrammingMedium
- Find the Duplicate Number via Value CountingBinary Search · ArraysMedium
- Maximum Value at Index in Bounded ArrayBinary SearchMedium
- Online Election Leader QueryBinary SearchMedium
- Median of Two Sorted ArraysBinary Search · ArraysHard
- K-th Smallest Pair DistanceBinary Search · ArraysHard
- K-th Smallest Number in Multiplication TableBinary SearchHard
- Swim in Rising WaterBinary Search · Arrays · MatrixHard
- K-th Smallest Prime FractionBinary Search · ArraysHard
- Maximum Average Subarray IIBinary Search · Arrays · Prefix SumHard
- Minimize Max Distance to Gas StationBinary Search · ArraysHard
- Smallest Good BaseBinary Search · MathHard
- Preimage Size of Factorial Zeroes FunctionBinary Search · MathHard
- Find Peak Element II (2D Peak Finding)Binary Search · Arrays · MatrixHard
- Russian Doll EnvelopesBinary SearchHard
- Maximum Running Time of N ComputersBinary Search · Heap (Priority Queue)Hard
- Super Egg DropBinary Search · Dynamic ProgrammingHard
- Count of Smaller Numbers After SelfBinary Search · ArraysHard
- Minimum in Rotated Sorted Array with Heavy DuplicatesBinary Search · ArraysHard
- K-th Smallest Sum of Two Sorted ArraysBinary Search · ArraysHard
- Shortest Subarray with Sum at Least KBinary Search · Arrays · Monotonic Queue · Prefix SumHard
- Find Duplicate in Read-Only Array with O(1) SpaceBinary Search · ArraysHard
- Maximum Number of Tasks You Can AssignBinary SearchHard
- Divide Chocolate (Maximize Minimum Sweetness)Binary Search · ArraysHard
- Batch Searches in a Mountain ArrayBinary Search · ArraysHard
- Minimum Cost to Make Array EqualBinary Search · ArraysHard
- Number of Subsequences with Sum ConditionBinary Search · Arrays · Dynamic ProgrammingHard
- K-th Smallest Subarray SumBinary Search · Arrays · Prefix SumHard
- Minimum Initial Energy to Finish TasksBinary SearchHard
- 0-1 Fractional Programming: Maximum Ratio SubsetBinary Search · MathVery hard
- Maximum Median Subsegment of Length at Least LBinary Search · Arrays · Prefix SumVery hard
- Maximum Average Weight Directed CycleBinary Search · GraphVery hard
- Aliens Trick: Exact K Partitions Min-Square CostBinary Search · Arrays · Prefix Sum · Math · Dynamic ProgrammingVery hard
- Parallel Binary Search: Sector MeteorsBinary Search · Fenwick TreeVery hard
- K-th Smallest on Tree PathBinary Search · Graph · TreeVery hard
- K-th Smallest Sum Across M Sorted ArraysBinary Search · Arrays · Heap (Priority Queue)Very hard
- Bottleneck Capacity Flow OptimizationBinary Search · GraphVery hard
- Longest Duplicate SubstringBinary Search · StringsVery hard
- Minimum Enclosing Circle Radius for K PointsBinary Search · GeometryVery hard
- Minimize Maximum Component Diameter via K CutsBinary SearchVery hard
- Dynamic Convex Hull Maximum Line QueryBinary Search · Convex Hull TrickVery hard
- Maximum Ratio Spanning TreeBinary Search · Graph · Tree · MathVery hard
- Parallel Binary Search: Earliest ConnectivityBinary Search · Graph · Union FindVery hard
- K-th Smallest Manhattan DistanceBinary Search · GeometryVery hard
- Maximum Minimum Weight of K Independent Tree VerticesBinary Search · Graph · Tree · Dynamic ProgrammingVery hard
- Bottleneck Weight in Maximum Bipartite MatchingBinary Search · GraphVery hard
- K-th Smallest Subarray XOR Sum via 0-1 TrieBinary Search · Arrays · Prefix SumVery hard
- Maximum Density Subgraph via Min-CutBinary Search · GraphVery hard
- Parallel Binary Search: Range Update Quota TriggerBinary Search · Fenwick TreeVery hard