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.
  • HackerRank Home
  • |
  • Prepare
  • Certify
  • Compete
  • Apply
  • Hiring developers?
  1. Prepare
  2. Algorithms
  3. Bit Manipulation
  4. Sum vs XOR

Sum vs XOR

Problem
Submissions
Leaderboard
Discussions
Editorial

Given an integer , find each such that:

where denotes the bitwise XOR operator. Return the number of 's satisfying the criteria.

Example

There are four values that meet the criteria:

Return .

Function Description

Complete the sumXor function in the editor below.

sumXor has the following parameter(s):
- int n: an integer

Returns
- int: the number of values found

Input Format

A single integer, .

Constraints

Subtasks

  • for of the maximum score.

Output Format

Sample Input 0

5

Sample Output 0

2

Explanation 0

For , the values and satisfy the conditions:

Sample Input 1

10

Sample Output 1

4

Explanation 1

For , the values , , , and satisfy the conditions:

Author

Shafaet

Difficulty

Easy

Max Score

25

Submitted By

56103

Need Help?


View discussions
View editorial
View top submissions

rate this challenge

MORE DETAILS

Download problem statement
Download sample test cases
Suggest Edits
  • Blog
  • Scoring
  • Environment
  • FAQ
  • About Us
  • Helpdesk
  • Careers
  • Terms Of Service
  • Privacy Policy

Cookie support is required to access HackerRank

Seems like cookies are disabled on this browser, please enable them to open this website