Leetcode 2311. Longest Binary Subsequence Less Than or Equal to K

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.

Question Timeline

See when this question was last asked and where, including any notes left by other candidates.

Company

Level

Region

Comments

Your account is free and you can post anonymously if you choose.

Hello Interview Premium

Recent interview questions

System Design Guided Practice

Exclusive content

Learn More

Leetcode 2311. Longest Binary Subsequence Less Than or Equal to K

Question Timeline

Comments

Questions

Learn

Links

Legal

Contact