LeetCode
Question
·
Aug 2016
·
USA
Microsoft | Minimum Window Subsequence
3 upvotes
6,725 views
14 replies
Question Details
Variation of (premium) Given an array nums and a subsequence sub, find the shortest subarray of nums that contains sub. Example: Input: nums = [1, 2, 3, 5, 8, 7, 6, 9,...
Full Details
🔒
Unlock full leaked content
Full insider details, leaked discussions, and candidate experiences.
Get Premium →Topics
Arrays