Create find-the-most-competitive-subsequence.py

Author: kamyu104

Python/find-the-most-competitive-subsequence.py

@@ -0,0 +1,17 @@
+# Time:  O(n)
+# Space: O(k)
+
+class Solution(object):
+    def mostCompetitive(self, nums, k):
+        """
+        :type nums: List[int]
+        :type k: int
+        :rtype: List[int]
+        """
+        stk = []
+        for i, x in enumerate(nums):
+            while stk and stk[-1] > x and len(stk)+(len(nums)-i) > k:
+                stk.pop()
+            if len(stk) < k:
+                stk.append(x)
+        return stk