- Trending Categories
- Data Structure
- Networking
- RDBMS
- Operating System
- Java
- iOS
- HTML
- CSS
- Android
- Python
- C Programming
- C++
- C#
- MongoDB
- MySQL
- Javascript
- PHP

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

In this tutorial, we are going to write a program that finds the largest number which is less than given x and should have at most k set bits.

Let's see the steps to solve the problem.

- Initialise the numbers x and k.
- Find the set bits in the number x.
- Write a loop that iterates set bits count of x - k.
- Update the value of x with x & (x - 1).

- Return x.

Let's see the code.

#include <bits/stdc++.h> using namespace std; int largestNumberWithKBits(int x, int k) { int set_bit_count = __builtin_popcount(x); if (set_bit_count <= k) { return x; } int diff = set_bit_count - k; for (int i = 0; i < diff; i++) { x &= (x - 1); } return x; } int main() { int x = 65, k = 2; cout << largestNumberWithKBits(x, k) << endl; return 0; }

If you run the above code, then you will get the following result.

65

If you have any queries in the tutorial, mention them in the comment section.

- Related Questions & Answers
- Previous smaller integer having one less number of set bits in C++
- Find the Number of subarrays having sum less than K using C++
- Largest subarray having sum greater than k in C++
- Count all subsequences having product less than K in C++
- Largest permutation after at most k swaps in C++
- Count of alphabets having ASCII value less than and greater than k in C++
- Count the number of words having sum of ASCII values less than and greater than k in C++
- Largest K digit number divisible by X in C++
- Subarray Product Less Than K in C++
- How do I find the largest integer less than x in Python?
- Print all numbers less than N with at-most 2 unique digits in C++
- C++ Program for Largest K digit number divisible by X?
- Form the largest number using at most one swap operation C++
- Count of divisors having more set bits than quotient on dividing N in C++
- Next greater integer having one more number of set bits in C++

Advertisements