Practice Problems

Daily Challenge: Paths Around the Walls (1500) Solve it to start a streak

binary-search Problems

22 practice problems tagged binary-search , from difficulty 1200 to 2200 — solve them in our in-browser judge with instant verdicts. Browse all problems.

Related: dp fenwick segment-tree sorting math implementation union-find offline strings hashing

ProblemTopics Solvers Acceptance Difficulty
Integer Square Root math binary-search 0 — 1200
Position of the K-th One implementation binary-search 0 — 1200
First Value At Least X binary-search sorting 0 — 1300
Find the Peak binary-search 0 — 1400
The K-th Missing Number binary-search 0 — 1500
Smallest Sufficient Capacity binary-search 0 — 1600
Minimum Eating Speed binary-search 0 — 1600
Fair Reading Load binary-search 0 — 1600
Search a Rotated Array binary-search 0 — 1600
Longest Increasing Subsequence dp binary-search 0 — 1600
Trim to Non-Decreasing dp binary-search 0 — 1600
Longest Non-Decreasing Subsequence dp binary-search 0 — 1600
Spread the Routers binary-search 0 — 1700
K-th in the Times Table binary-search 0 — 1800
When Did We Meet binary-search union-find offline 0 — 1850
The K-th One, Under Fire binary-search fenwick 0 — 1900
Non-Overlapping Gigs dp binary-search 0 — 1900
Order Statistics Live binary-search fenwick 0 — 1900
Longest Common Extension strings binary-search hashing 0 — 2000
Bigger Than X, in a Slice binary-search segment-tree 0 — 2100
The K-th Squarefree Number binary-search number-theory mobius 0 — 2100
K-th Smallest in a Slice binary-search segment-tree 0 — 2200