Longest Binary Subsequence Less Than or Equal to K LeetCode solution in Python

1
class Solution:
2
    def longestSubsequence(self, s: str, k: int) -> int:
3

4
        end, n = len(s) - 1, s.count("0")
5
        while end >= 0 and int(s[end:], 2) <= k:
6
            end -= 1
7
        return n + s[end + 1 :].count("1")