Create 496_nextgreaterelement.py (#108)

* Create 496_nextgreaterelement.py

* Update README.md

Author: saranshkotnala

Python/496_nextgreaterelement.py

@@ -0,0 +1,10 @@
+class Solution:
+    def check(self, number, nums1, nums2):
+        index = nums2.index(number)
+        for _ in range(index, len(nums2)):
+            if(nums2[_]>number):
+                return nums2[_]
+        return -1
+
+    def nextGreaterElement(self, nums1: List[int], nums2: List[int]) -> List[int]:
+        return [self.check(x, nums1, nums2) for x in nums1]

README.md

@@ -122,6 +122,8 @@ Check out ---> [Sample PR](https://github.com/codedecks-in/LeetCode-Solutions/pu
 | 073     | [Set-Matrix-Zeroes](https://leetcode.com/problems/set-matrix-zeroes/)                                                         | [Java](./Java/set-matrix-zeroes.java)                                                                             | O(MN)        | O(1)          | Medium     | Array              |
 | 1288   | [Remove-Covered-Intervals](https://leetcode.com/problems/remove-covered-intervals)                      | [C++](./C++/Remove-Covered-Intervals.cpp)                                                      | O(N*N)        | O(1)          | Medium     | Array              |
 | 189     | [Rotate-Array](https://leetcode.com/problems/rotate-array/)                                                         | [Python](./Python/rotate-array.py)                                                                             | O(N)        | O(1)          | Medium     | Array 
+| 496    | [next-greater-element-i](https://leetcode.com/problems/next-greater-element-i)                                                         | [Python](./Python/496_nextgreaterelement.py)                                                                             | O(N)        | O(1)          | Medium     | Array 
+
 
 <br/>
 <div align="right">