Halloween Sale
Unlock all premium questions for over 30% off
Largest Bounded XOR
Medium
Question
You are given positive integers lo, hi and k. Pick two distinct integers a and b with lo <= a < b <= hi whose bitwise XOR is at most k. Return the maximum XOR value that such a pair can produce.
...
Asked at:IBM
More IBM interview questions
- Earliest Target Reach Timeeasy
- Smallest Nondecreasing Incrementeasy
- Maximum Distinct Split Scoreeasy
- Maximum Test Window Efficiencymedium
- Maximum Balanced Task Distributioneasy
- Find Unused Subsequence Wordseasy
- Count Mismatched Sale Priceseasy
- Minimum Device Purchase Costeasy
OfferRetriever
Master technical interviews with real questions from top companies. Build your confidence and career.
LEGAL
© 2026 Purple Business Holdings LLC. All rights reserved. See Terms of Service.