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

Author: kamyu104

C++/find-the-most-competitive-subsequence.cpp

@@ -0,0 +1,19 @@
+// Time:  O(n)
+// Space: O(k)
+
+class Solution {
+public:
+    vector<int> mostCompetitive(vector<int>& nums, int k) {
+        vector<int> stk;
+        for (int i = 0; i < size(nums); ++i) {
+            while (!empty(stk) && stk.back() > nums[i] &&
+                   size(stk) + (size(nums) - i) > k) {
+                stk.pop_back();
+            }
+            if (size(stk) < k) {
+                stk.emplace_back(nums[i]);
+            }
+        }
+        return stk;
+    }
+};