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.
You will be given an integer “n“ and a threshold “k”. For each number ‘i‘ from ‘l‘ through ‘n‘ find the maximum value of the logical and, or, and xor when compared against tall integers through “n“ that are greater than “i“. Consider a value only if the comparison returns a result less than “k“. Print the results of the and, or and exclusive or comparisons on separate lines, in that order.
Cookie support is required to access HackerRank
Seems like cookies are disabled on this browser, please enable them to open this website
Join us
Create a HackerRank account
Be part of a 26 million-strong community of developers
Please signup or login in order to view this challenge
Bitwise Operators
You are viewing a single comment's thread. Return to all comments →
You will be given an integer “n“ and a threshold “k”. For each number ‘i‘ from ‘l‘ through ‘n‘ find the maximum value of the logical and, or, and xor when compared against tall integers through “n“ that are greater than “i“. Consider a value only if the comparison returns a result less than “k“. Print the results of the and, or and exclusive or comparisons on separate lines, in that order.