solves min stack in python

Author: anishLearnsToCode

README.md

@@ -43,7 +43,7 @@
 | 125 | [Valid Palindrome](https://leetcode.com/problems/valid-palindrome) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/ValidPalindrome.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/valid_palindrome.py) |
 | 136 | [Single Number](https://leetcode.com/problems/single-number) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/SingleNumber.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/single_number.py) | 
 | 141 | [Linked List Cycle](https://leetcode.com/problems/linked-list-cycle) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/LinkedListCycle.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/linked_list_cycle.py) | 
-| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MinStack.java) |
+| 155 | [Min Stack](https://leetcode.com/problems/min-stack) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/MinStack.java) [![Python](https://img.icons8.com/color/35/000000/python.png)](python/min_stack.py) |
 | 157 | [Read N Characters Given Read4](https://leetcode.com/problems/read-n-characters-given-read4) | Easy | |
 | 160 | [Intersection of Two Linked Lists](https://leetcode.com/problems/intersection-of-two-linked-lists) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/IntersectionOf2LinkedLists.java) |
 | 167 | [Two Sum II - Input Array is Sorted](https://leetcode.com/problems/two-sum-ii-input-array-is-sorted) | Easy | [![Java](https://img.icons8.com/color/40/000000/java-coffee-cup-logo.png)](src/TwoSumIIInputArrayIsSorted.java) |

python/min_stack.py

@@ -0,0 +1,32 @@
+class Node:
+    def __init__(self, val, min, previous):
+        self.val = val
+        self.next = next
+        self.min = min
+        self.previous = previous
+
+class MinStack:
+
+    def __init__(self):
+        """
+        initialize your data structure here.
+        """
+        self.current = None
+
+    def push(self, val: int) -> None:
+        if self.current is None:
+            self.current = Node(val, val, None)
+        else:
+            self.current.next = Node(val, min(val, self.current.min), self.current)
+            self.current = self.current.next
+
+    def pop(self) -> None:
+        val = self.current.val
+        self.current = self.current.previous
+        return val
+
+    def top(self) -> int:
+        return self.current.val
+
+    def getMin(self) -> int:
+        return self.current.min