Sum of two integer (codedecks-in#169)

* Create Sum of Two Integers * Update Readme * Add time complexity and space complexity

Author: MoulinaPradhan

Java/Sum_of_two_integers.java

@@ -0,0 +1,15 @@
+// Time-Complexity:- -> O(1) constant as 32 is the number of bits at most we will have to bit shift until carry is zero.
+// Space-Complexity:- O(1)
+
+
+class Solution {
+ public int getSum(int a, int b) {
+ 
+ int xor=a ^ b;
+ int carry= a & b;
+ if(carry == 0)
+ return xor;
+ else
+ return getSum(xor,carry<<1);
+ }
+}

README.md

@@ -84,7 +84,8 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | ---- | ------------------------------------------------------------------------------------- | -------------------------------------------------------------------------------------------------------------- | ------ | ------ | ---------- | --- | ---------------------------------------- |
 | 136 | [Single Number](https://leetcode.com/problems/single-number/) | [Java](./Java/single-number.java) <br> [Python](./Python/single-number.py) <br> [C++](./C++/Single-Number.cpp) | _O(n)_ | _O(1)_ | Easy | | Using XOR |
 | 137 | [Single Number II](https://leetcode.com/problems/single-number-ii/) | [Python](./Python/single-number-ii.py)<br/> [C++](./C++/Single-Number-II.cpp) | _O(n)_ | _O(1)_ | Medium | | |
-| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [Python](./Python/single-number-iii.py) <br/> [C++](./C++/Single-Number-III.cpp) | _O(n)_ | _O(1)_ | Medium | | |
+| 260 | [Single Number III](https://leetcode.com/problems/single-number-iii/) | [Python](./Python/single-number-iii.py) <br/> [C++](./C++/Single-Number-III.cpp) | _O(n)_ | _O(1)_ | Medium | | |
+| 371 | [Sum of Two Integers](https://leetcode.com/problems/sum-of-two-integers/) | [Java](./Java/Sum_of_two_integers.java) | _O(1)_ | _O(1)_ | Medium | 
 | 476 | [Number Complement](https://leetcode.com/problems/number-complement/) | [Java](./Java/number-complement.java) <br/> [C++](./C++/Number-Complement.cpp) | _O(1)_ | _O(1)_ | Easy | | [Tutorial](https://youtu.be/6bp5V-O3zts) |
 | 520 | [Detect Capital Use](https://leetcode.com/problems/detect-capital/) | [Python](./Python/detect-capital.py) <br/> [C++](./C++/Detect-Capital.cpp) | _O(n)_ | _O(1)_ | Easy | | |
 | 1486 | [XOR Operation in an Array](https://leetcode.com/problems/xor-operation-in-an-array/) | [Java](./Java/xor-op-in-array.java) | _O(n)_ | _O(1)_ | Easy | | Using XOR |