# HackerRank Day 6: Bitwise Operators 10 days of javascript solution

In this HackerRank Day 6: Bitwise Operators 10 Days of the javascript problem We define S to be a sequence of distinct sequential integers from 1 to n; in other words, s = {1,2,3,..., n}. We want to know the maximum bitwise AND value of any two integers, a and b (where a<b), in sequence S that is also less than a given integer, k.

Complete the function in the editor so that given n and k, it returns the maximum a&b < k.

## HackerRank Day 6: Bitwise Operators 10 days of javascript problem solution.

```'use strict';

process.stdin.resume();
process.stdin.setEncoding('utf-8');

let inputString = '';
let currentLine = 0;

process.stdin.on('data', inputStdin => {
inputString += inputStdin;
});

process.stdin.on('end', _ => {
inputString = inputString.trim().split('\n').map(string => {
return string.trim();
});

main();
});

return inputString[currentLine++];
}
function getMaxLessThanK(n,k) {
var max=0;
for(let i=1;i<=n;i++) {
for(let j=i+1;j<=n;j++) {
var x = i&j;
if(x > max & x < k){
max = x;
}
}
}
return(max);
}

function main() {