ORIGINAL CODING QUESTION
Shortest glyph coverage window
Return the shortest contiguous source window containing every target glyph with at least its target multiplicity. Return 0 if no covering window exists.
Original exercise · hard. Editorial role relevance does not imply a company has asked this question.
Input and output
n, n glyph integers, m, m glyph integers. Print the requested integer.
Constraints
1 ≤ n,m ≤ 30; each glyph integer is in [0,25].
Example 1
Input
5 0 1 2 0 1 2 0 1
Output
2
The adjacent 0,1 pair covers the target.
Example 2
Input
3 0 1 2 2 0 0
Output
0
The source lacks two copies of glyph 0.
Explain your approach
Explain your time and auxiliary space complexity. Which input makes your algorithm work hardest?
Private grading inputs, expected outputs and canonical reference implementations are withheld. Authored expected outputs were cross-checked with independent reference oracles; compiler/runtime behavior still needs a verified execution provider.
Hint 1
Coverage includes duplicate target glyphs.
Hint 2
Track required versus observed counts.
Hint 3
Shrink a covering window until removing another glyph would break coverage.
Practice this question
Save your work privately, explain decisions and return to your revision queue.
Open practice workspaceBrowse the question library →