Given a binary string s and a positive integer k, return the length of the longest subsequence of s that represents a binary number less than or equal to k.

Note: The subsequence may contain leading zeros.

Constraints:

• $1 \leq$ s.length $\leq 1000$

• s[i] is either '0' or '1'

• $1 \leq$ k $\leq 10^9$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.