1673. Find the Most Competitive Subsequence Medium

1/**
2 * [1673] Find the Most Competitive Subsequence
3 *
4 * Given an integer array nums and a positive integer k, return the most competitive subsequence of nums of size k.
5 * An array's subsequence is a resulting sequence obtained by erasing some (possibly zero) elements from the array.
6 * We define that a subsequence a is more competitive than a subsequence b (of the same length) if in the first position where a and b differ, subsequence a has a number less than the corresponding number in b. For example, [1,3,4] is more competitive than [1,3,5] because the first position they differ is at the final number, and 4 is less than 5.
7 *  
8 * Example 1:
9 * 
10 * Input: nums = [3,5,2,6], k = 2
11 * Output: [2,6]
12 * Explanation: Among the set of every possible subsequence: {[3,5], [3,2], [3,6], [5,2], [5,6], [2,6]}, [2,6] is the most competitive.
13 * 
14 * Example 2:
15 * 
16 * Input: nums = [2,4,3,3,5,4,9,6], k = 4
17 * Output: [2,3,3,4]
18 * 
19 *  
20 * Constraints:
21 * 
22 * 	1 <= nums.length <= 10^5
23 * 	0 <= nums[i] <= 10^9
24 * 	1 <= k <= nums.length
25 * 
26 */
27pub struct Solution {}
28
29// problem: https://leetcode.com/problems/find-the-most-competitive-subsequence/
30// discuss: https://leetcode.com/problems/find-the-most-competitive-subsequence/discuss/?currentPage=1&orderBy=most_votes&query=
31
32// submission codes start here
33
34impl Solution {
35    pub fn most_competitive(nums: Vec<i32>, k: i32) -> Vec<i32> {
36        vec![]
37    }
38}
39
40// submission codes end
41
42#[cfg(test)]
43mod tests {
44    use super::*;
45
46    #[test]
47    fn test_1673() {
48    }
49}
50