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

1
/**
2
 * @param {string} s
3
 * @param {number} k
4
 * @return {number}
5
 */
6

7
var longestSubsequence = function (s, k) {
8
  let count = 0;
9
  let j = s.length - 1; // starting from the last digit
10
  let i = 0; // binary number position
11
  let acc = 0;
12

13
  while (j >= 0) {
14
    let positionNumber = Number(s[j]) * Math.pow(2, i);
15
    j--;
16
    i++;
17
    if (acc + positionNumber > k) continue;
18

19
    acc += positionNumber;
20
    count++;
21
  }
22

23
  return count;
24
};