Power of Two

 https://leetcode.com/problems/power-of-two/submissions/

class Solution {
public:
    bool isPowerOfTwo(int n) {
        if(n<=0) return false;
        return  !(n&(n-1));
    }
};

Comments

Post a Comment

Popular posts from this blog

Is Rectangle?

 https://www.interviewbit.com/old/problems/is-rectangle/ int Solution::solve(int A, int B, int C, int D) {      if (((A==B)&&(C==D))||((A==C)&&(B==D))||((A==D)&&(B==C))){         return 1;     }else{         return 0;     } }  
Read more

Contains Duplicate II

 https://leetcode.com/problems/contains-duplicate-ii/ class Solution { public:     bool containsNearbyDuplicate(vector<int>& nums, int k) {         unordered_map<int,int>m;         for(int i=0;i<nums.size();i++){             if(m.count(nums[i])){                 int diff=abs(i-m[nums[i]]);                 if(diff<=k){                     return true;                 }             }             m[nums[...
Read more

Find First and Last Position of Element in Sorted Array

  Given an array of integers nums sorted in ascending order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1] .   Input: nums = [5,7,7,8,8,10], target = 8 Output: [3,4]  class Solution { public:     vector<int> searchRange(vector<int>& v, int b) {         int n=v.size();         int low=0;         int high=n-1;         int mid;         vector<int> ans(2);         ans[0]=-1;         ans[1]=-1;         while(low<=high)         {             mid=low+(high-low)/2;       ...
Read more