Available question text
Find the longest subsequence of a binary string s whose interpreted integer value is ≤ k. The core challenge is maximizing length by exploiting free zeros and carefully choosing a small number of significant ones (usually from the least-significant side) so the resulting binary value stays within k.
Related questions
Continue with questions that share topics or the same question type.
- Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit
Coding · Array · Heap (Priority Queue) · Monotonic Queue
- Count Subarrays With Cost Less Than or Equal to K
Coding
- Maximum Number That Sum of the Prices Is Less Than or Equal to K
Coding
- Maximum Side Length of a Square with Sum Less than or Equal to Threshold
Coding
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 2311. Longest Binary Subsequence Less Than or Equal to K
Interview date not specified · 0 source reports
Source snapshot: Nov 12, 2026
View source