Runtime: 7 ms (Top 96.43%) | Memory: 61.60 MB (Top 10.06%)

AnasImloul · AnasImloul · commit 960644159a32 · 2024-01-16T15:33:01.000+01:00
diff --git a/scripts/algorithms/F/Find the Most Competitive Subsequence/Find the Most Competitive Subsequence.java b/scripts/algorithms/F/Find the Most Competitive Subsequence/Find the Most Competitive Subsequence.java
@@ -1,3 +1,5 @@
+// Runtime: 7 ms (Top 96.43%) | Memory: 61.60 MB (Top 10.06%)
+
 class Solution {
     public int[] mostCompetitive(int[] nums, int k) {
         int[] stack = new int[k];

Original file line number	Diff line number	Diff line change
`@@ -1,3 +1,5 @@`
	`1`	`+// Runtime: 7 ms (Top 96.43%) \| Memory: 61.60 MB (Top 10.06%)`
	`2`	`+`
`1`	`3`	`class Solution {`
`2`	`4`	`public int[] mostCompetitive(int[] nums, int k) {`
`3`	`5`	`int[] stack = new int[k];`