Java easy solution - O(n) || beats 100% || 0ms || memory less than 61%
\nclass Solution {\n    public int getSum(int a, int b) {\n        \n        int carry = 0;\n        while(b != 0)\n        {   \n           carry = a & b;\n   
```\nclass Solution {\n    public int getSum(int a, int b) {\n        \n        int carry = 0;\n        while(b != 0)\n        {   \n           carry = a & b;\n           a = a ^ b;\n           b = carry <<1; \n        }\n        return a;\n    }\n}\n```
['Bit Manipulation', 'Java']