We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Tutorials
  3. 10 Days of Javascript
  4. Day 6: Bitwise Operators
  5. Discussions

Day 6: Bitwise Operators

  • bouazizfarouk3
     + 0 comments

    This was my answer

    function getMaxLessThanK(n, k) {
    let max = 0;
    for (let i = 1; i < n; i++)
        for(let j = i + 1; j <= n; j++)
            if (max < (i & j) && (i & j) < k) {
                max = (i & j);
                if (max === k - 1) return max; // since it's the most expected value
            } 
    return max;
}