Added python solution for the hard problem find median of two sorted arrays (Tahanima#51)

* added python solution to hard problem

* Update Solution.py

* added python solution to easy problem good triplets

* Revert "added python solution to easy problem good triplets"

This reverts commit aa4af3b.

Author: kmabadshah

Algorithms/Hard/4_MedianOfTwoSortedArrays/Solution.py

@@ -0,0 +1,14 @@
+# This solution is for python3, may or may not work for other versions
+
+class Solution:
+    def findMedianSortedArrays(self, nums1: List[int], nums2: List[int]) -> float:
+        nums3 = nums1 + nums2
+        nums3.sort()
+
+        if len(nums3) % 2 != 0:
+            return nums3[(len(nums3) // 2)]
+        else:
+            return (
+                nums3[(len(nums3) // 2)-1] +
+                nums3[(len(nums3) // 2)]
+            ) / 2