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.
public static int bitwiseAnd(int n, int k) {
int max = 0;
for (int i = 1; i <= n; i++) {
if (i == k-1)
continue;
int val = i&(k-1);
if (val > max && val < k)
max = val;
}
return max;
}
}
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Bitwise AND
You are viewing a single comment's thread. Return to all comments →
public static int bitwiseAnd(int n, int k) { int max = 0; for (int i = 1; i <= n; i++) { if (i == k-1) continue; int val = i&(k-1); if (val > max && val < k) max = val; } return max; }
}