Two number, Three number and Smallest different question solutions (codedecks-in#59)

* Two number, Three number and Smallest different question solutions

* Made the changes in readme, proper format followed

Author: AnkitKumarSingh11

Python/SmallestDifference.py

@@ -0,0 +1,67 @@
+"""1200. Minimum Absolute Difference
+Easy
+
+382
+
+25
+
+Add to List
+
+Share
+Given an array of distinct integers arr, find all pairs of elements with the minimum absolute difference of any two elements. 
+
+Return a list of pairs in ascending order(with respect to pairs), each pair [a, b] follows
+
+a, b are from arr
+a < b
+b - a equals to the minimum absolute difference of any two elements in arr
+ 
+
+Example 1:
+
+Input: arr = [4,2,1,3]
+Output: [[1,2],[2,3],[3,4]]
+Explanation: The minimum absolute difference is 1. List all pairs with difference equal to 1 in ascending order.
+Example 2:
+
+Input: arr = [1,3,6,10,15]
+Output: [[1,3]]
+Example 3:
+
+Input: arr = [3,8,-10,23,19,-4,-14,27]
+Output: [[-14,-10],[19,23],[23,27]]
+ 
+
+Constraints:
+
+2 <= arr.length <= 10^5
+-10^6 <= arr[i] <= 10^6
+"""
+
+def smallestDifference(arr1 : list, arr2 : list) : 
+    arr1.sort();arr2.sort()
+    i = 0;j = 0
+
+    smallest = float("inf");current=float("inf")
+    smallestPair = list()
+    
+    while i < len(arr1) and j < len(arr2) : 
+        fnum = arr1[i];snum = arr2[j]
+        
+        if fnum < snum : 
+            current = snum - fnum
+            i += 1
+        elif snum < fnum : 
+            current = snum - fnum
+            j += 1
+        else : 
+            return [fnum, snum]
+
+        if current < smallest : 
+            smallest = current
+            smallestPair.append((fnum, snum))
+            
+
+
+if __name__ == '__main__' : 
+    print(smallestDifference([12,3,45,6], [2,4,3,5]))

Python/ThreeNumbersSum.py

@@ -0,0 +1,54 @@
+"""
+15. 3Sum
+Medium
+
+8121
+
+881
+
+Add to List
+
+Share
+Given an array nums of n integers, are there elements a, b, c in nums such that a + b + c = 0? Find all unique triplets in the array which gives the sum of zero.
+
+Notice that the solution set must not contain duplicate triplets.
+
+ 
+
+Example 1:
+
+Input: nums = [-1,0,1,2,-1,-4]
+Output: [[-1,-1,2],[-1,0,1]]
+Example 2:
+
+Input: nums = []
+Output: []
+Example 3:
+
+Input: nums = [0]
+Output: []
+"""
+
+def sum_of_three(arr, target=0) : 
+    result = list()
+    arr.sort()
+    
+    for i in range(len(arr)-2) : 
+        left = i+1;right=len(arr)-1
+
+        while left < right : 
+            current_sum = arr[i] + arr[left] + arr[right]
+            if current_sum == target : 
+                result.append((arr[i], arr[left], arr[right]))
+                left+=1
+                right-=1
+            elif current_sum < target : 
+                left += 1
+            elif current_sum > target :
+                right -= 1
+    else : 
+        print("Dont with the loop")
+    return result
+
+if __name__ == '__main__' : 
+    print(sum_of_three([3,5,-4,8,11,1,-1,6]))

README.md

@@ -101,6 +101,9 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 53 | [Maximum Subarray](https://leetcode.com/problems/maximum-subarray/)        |  [C++](./C++/maximum-subarray.cpp)  | _O(N)_ | _O(1)_ |Easy | Array |     |
 | 1 | [Two Sum](https://leetcode.com/problems/two-sum/)        |  [C++](./C++/two-sum.cpp)  | _O(N^2)_ | _O(1)_ |Easy | Array |     |
 | 495 | [Teemo Attacking](https://leetcode.com/problems/teemo-attacking)       | [C++](./C++/teemo-attacking.cpp)    | _O(n)_     | _O(1)_ | Medium| Array |    |
+| 15 | [3 Sum](https://leetcode.com/problems/3sum/) | [Python](./Python/ThreeNumbersSum.py) | O( nLog(n) ) | O(1) | Medium | Array |
+| 1200 | [Minimum Absolute Difference](https://leetcode.com/problems/minimum-absolute-difference/) | [Python](./python/SmallestDifference.py) | O(n) | O(1) | Easy | Array | 
+
 
 <br/>
 <div align="right">