C# bit manipulation solution
\n\nThe idea of the alogirthm is to convert (a + b) to (n + 0) where n = a + b. For example: (3 + 5) -> (8 + 0)\n (a ^ b): Sum up two number without considering
\n\nThe idea of the alogirthm is to convert (a + b) to (n + 0) where n = a + b. For example: (3 + 5) -> (8 + 0)\n* (a ^ b): Sum up two number without considering carry\n* (a & b) << 1: Calculate the carry\n\n![image](https://assets.leetcode.com/users/images/2ddf55c4-2c20-4908-b391-59e1c1120005_1595193148.7257466.png)\n\n\n\n**Implementation**\n```\npublic class Solution {\n    public int GetSum(int a, int b) {\n                \n        while(b != 0)\n        {\n            int carry  = (a & b) << 1;\n            a = a ^ b;\n            b = carry;\n        }\n        \n        return a;\n    }\n}\n```
[]