Leaderboard
Showing:
Handle Score
@Ibrahim Nash 5725
@blackshadows 5685
@akhayrutdinov 5111
@mb1973 4989
@Quandray 4908
@saiujwal13083 4156
@sanjay05 3762
@marius_valentin_dragoi 3511
@sushant_a 3453
@KshamaGupta 3318
@the_coder95 3302
Complete Leaderboard
Perfect XOR
Easy Accuracy: 43.75% Submissions: 16 Points: 2

Given a number N, find the total number of possible X such that (N XOR X) == (N OR X), where 0<=X<=N.

Example 1:

Input: N = 5
Output: 2
Explanation:
5 XOR 2 == 5 OR 2 and 
5 XOR 0 == 5 OR 0

Example 2:

Input: N = 7
Output: 1
Explanation: 7 XOR 0 == 7 OR 0

Your Task:
You don't need to read or print anything. Your task is to complete the function total_count() which takes N as input parameter and returns total count of X. 

 

Expected Time Complexity: O(log(N))
Expected Space Complexity: O(1)

 

Constraints:
1 <= N <= 1018 

to report an issue on this page.

Editorial

We strongly recommend solving this problem on your own before viewing its editorial. Do you still want to view the editorial?

Yes

All Submissions

My Submissions:

Login to access your submissions.

Perfect XOR

Output Window