Day37

//#Day37 of My #100DaysOfCodingChallenge: Exploring Bitmanipulation!



//Problem Solved : Swap two numbers

//Problem Link : https://www.geeksforgeeks.org/problems/swap-two-numbers3844/1



//Problem Solved : Count total set bits

//Problem Link : https://www.geeksforgeeks.org/problems/count-total-set-bits-1587115620/1



class Solution{
    static List<Integer> get(int a,int b)
    {
        // code here
       List<Integer>demo = new ArrayList<>();
       
        a= a^b;
        b= a^b;
        a= a^b;
        
        
       
        demo.add(a);
        demo.add(b);
        return demo;
    }
    
}



class Solution{
    
    //Function to return sum of count of set bits in the integers from 1 to n.
    public static int countSetBits(int n){
    
      
        int count = 0;
        
       for (int i = 1; i <= n; i++) {
            int num = i;
            
            while (num > 0) {
                if ((num & 1) == 1) { 
                    count++;
                }
                num >>= 1; 
            }
        }
     return count;
    
    }
}