Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check whether the number has only first and last bits set

  • Difficulty Level : Easy
  • Last Updated : 22 Mar, 2021

Given a positive integer n. The problem is to check whether only the first and last bits are set in the binary representation of n.
Examples: 
 

Input : 9
Output : Yes
(9)10 = (1001)2, only the first and
last bits are set.

Input : 15
Output : No
(15)10 = (1111)2, except first and last
there are other bits also which are set.

 

Approach: Following are the steps:
 

  1. If n == 1, return “Yes”.
  2. Else check whether n-1 is a power of 2. Refer this post.

 

C++




// C++ to check whether the number has only
// first and last bits set
#include <bits/stdc++.h>
 
using namespace std;
 
// function to check whether 'n'
// is a power of 2 or not
bool powerOfTwo(unsigned int n)
{
    return (!(n & n-1));
}
 
// function to check whether the number has only
// first and last bits set
bool onlyFirstAndLastAreSet(unsigned int n)
{
    if (n == 1)
        return true;
    if (n == 2)
        return false;
    return powerOfTwo(n-1);   
}
 
// Driver program to test above
int main()
{
    unsigned int n = 9;
     
    if (onlyFirstAndLastAreSet(n))
        cout << "Yes";
    else
        cout << "No";   
     
    return 0;
}
Java



// Java program to check whether the
// number has only first and last
// bits set
import java.util.*;
 
class GFG
{
    // function to check whether 'n'
    // is a power of 2 or not
    static boolean powerOfTwo(int n)
    {
        return ((n & n - 1) == 0);
    }
 
    // function to check whether the number has 
    // only first and last bits set
    static boolean onlyFirstAndLastAreSet(int n)
    {
        if (n == 1)
            return true;
     
        return powerOfTwo(n-1);
    }
 
    // Driver program to test above
    public static void main (String[] args) {
        
       int n = Integer.parseUnsignedInt("9");
     
        if (onlyFirstAndLastAreSet(n))
            System.out.println("Yes");
        else
            System.out.println("No");
    }
}
 
/* This code is contributed by Mr. Somesh Awasthi */
Python3



# Python3 program to check whether number
# has only first and last bits set
 
# function to check whether 'n'
# is a power of 2 or not
def powerOfTwo (n):
    return (not(n & n-1))
 
 
# function to check whether number 
# has only first and last bits set
def onlyFirstAndLastAreSet (n):
 
    if (n == 1):
        return True
    return powerOfTwo (n-1)
 
# Driver program to test above
n = 9
if (onlyFirstAndLastAreSet (n)):
    print('Yes')
else:
    print('No')
 
# This code is contributed by Shariq Raza
C#



// C# program to check whether the
// number has only first and last
// bits set
using System;
 
class GFG {
 
    // function to check whether 'n'
    // is a power of 2 or not
    static bool powerOfTwo(uint n)
    {
        return ((n & n - 1) == 0);
    }
 
    // function to check whether the number has
    // only first and last bits set
    static bool onlyFirstAndLastAreSet(uint n)
    {
        if (n == 1)
            return true;
 
        return powerOfTwo(n - 1);
    }
 
    // Driver program to test above
    public static void Main()
    {
 
        uint n = (uint)9;
 
        if (onlyFirstAndLastAreSet(n))
            Console.WriteLine("Yes");
        else
            Console.WriteLine("No");
    }
 
}
 
// This code is contributed by Sam007
PHP



<?php
// PHP to check whether the number
// has only first and last bits set
 
// function to check whether 'n'
// is a power of 2 or not
function powerOfTwo($n)
{
    return (!($n & $n - 1));
}
 
// function to check whether
// the number has only first
// and last bits set
function onlyFirstAndLastAreSet($n)
{
    if ($n == 1)
        return true;
    if ($n == 2)
        return false;
    return powerOfTwo($n - 1);    
}
 
// Driver Code
$n = 9;
 
if (onlyFirstAndLastAreSet($n))
    echo "Yes";
else
    echo "No";
 
// This code is contributed
// by Sach_Code
?>
Javascript



<script>
 
// Javascript to check whether the number has only
// first and last bits set
 
// function to check whether 'n'
// is a power of 2 or not
function powerOfTwo(n)
{
    return (!(n & n-1));
}
 
// function to check whether the number has only
// first and last bits set
function onlyFirstAndLastAreSet(n)
{
    if (n == 1)
        return true;
    if (n == 2)
        return false;
    return powerOfTwo(n-1);    
}
 
// Driver program to test above
var n = 9;
 
if (onlyFirstAndLastAreSet(n))
    document.write("Yes");
else
    document.write("No");    
     
</script>
Output: 
Yes
This article is contributed by Ayush Jauhari. If you like GeeksforGeeks and would like to contribute, you can also write an article using write.geeksforgeeks.org or mail your article to review-team@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above.
 

My Personal Notes
arrow_drop_up
Previous
Tribonacci Numbers
Next

Maximum difference between group of k-elements and rest of the array.
Recommended Articles
Page :
Check whether the number has only first and last bits set | Set 2
19, Jun 18
Print numbers having first and last bits as the only set bits
15, Jan 18
Check if bits of a number has count of consecutive set bits in increasing order
12, Jan 17
Count pairs (A, B) such that A has X and B has Y number of set bits and A+B = C
27, Nov 18
Toggle bits of a number except first and last bits
14, Jan 18
Check if a number has same number of set and unset bits
30, Jul 18
Check if a number has bits in alternate pattern | Set 1
12, Jan 17
Check if a number has bits in alternate pattern | Set-2 O(1) Approach
29, Sep 17
Check if a number has two adjacent set bits
10, Sep 17
Toggle first and last bits of a number
11, Jan 18
First and Last Three Bits
08, Jan 19
Count of pairs {X, Y} from an array such that sum of count of set bits in X ⊕ Y and twice the count of set bits in X & Y is M
12, Mar 21
Check whether all the bits are set in the given range
07, Sep 17
Check whether bits are in alternate pattern in the given range | Set-2
01, Oct 18
Number with set bits only between L-th and R-th index
18, Jun 18
Check if all bits can be made same by flipping two consecutive bits
09, Jan 20
Count pairs in an array such that both elements has equal set bits
16, Nov 18
Check whether all the bits are unset in the given range or not
17, Sep 17
Check whether all the bits are unset in the given range
20, Aug 18
Check whether bits are in alternate pattern in the given range
10, Sep 18
Flip bits of the sum of count of set bits of two given numbers
03, Jan 21
Minimize cost of swapping set bits with unset bits in a given Binary string
18, Aug 21
Check whether the two numbers differ at one bit position only
20, Dec 17
Count pairs whose sum consists of set bits only
16, Oct 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
GeeksforGeeks
Vote for difficulty
Current difficulty :
Easy





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!