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

Vertical Order Traversal of a Binary Tree

Image
 https://leetcode.com/problems/vertical-order-traversal-of-a-binary-tree/ https://gist.github.com/SuryaPratapK/d73b9a97c2c8a2af762af106b794ad2d      //soln class Solution { map<int,map<int,multiset<int>>> mymap; void solve(TreeNode *curr,int col,int row) { if(!curr) return; mymap[col][row].insert(curr->val); solve(curr->left,col-1,row+1); solve(curr->right,col+1,row+1); } public: vector<vector<int>> verticalTraversal(TreeNode* root) { solve(root,0,0); vector<vector<int>> ans; ...
Read more