Like and Subscribe if you enjoy my content!
Support my channel by donating to my CashApp. Even $5 helps!
https://cash.app/$JoshuaCadavez
*******************************************************************************************
Or give advice or alternative solutions in the comments below!
Problem: https://www.hackerrank.com/challenges...
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 is less than 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 is less than k.
Note: The symbol represents the bitwise AND operator.
More CodeSignal: • CodeSignal
More LeetCode: • Leetcode
More HackerRank: • HackerRank
*******************************************************************************************
Follow me on:
Twitter - / joshuacadavez
LinkedIn - / joshuacadavez
GitHub - https://github.com/JoshuaTheEngineer