2311. Longest Binary Subsequence Less Than or Equal to K

LeetCodeStringDynamic ProgrammingGreedyMemoizationOpen on judge ↗

You are given a binary string s and a positive integer k. Return the length of the longest subsequence of s that makes up a binary number less than or equal to k. Note: - The subsequence can contain leading zeroes. - The empty string is considered to be equal to 0. - A subsequence is a string that can be derived from another string by deleting some or no characters without changing the order

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI