Available question text
Find the maximum distance between consecutive 1 bits in the binary representation of n by locating the positions of 1s and returning the largest difference between adjacent 1 positions (or 0 if fewer than two 1s).
Related questions
Continue with questions that share topics or the same question type.
- Add Binary
Coding · Bit Manipulation · Math · Simulation
- All Divisions With the Highest Score of a Binary Array
Coding
- All Elements in Two Binary Search Trees
Coding
- All Nodes Distance K in Binary Tree
Coding · Binary Tree · Breadth-First Search · Depth-First Search
Sources · 1 reference
These records explain where the question appears. A company tag or candidate report does not guarantee a future interview question.
Hello Interview · 1 record
No company association
Leetcode 868. Binary Gap
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source