ORIGINAL CODING QUESTION
Anagram glyph window count
Count contiguous source windows that are permutations of the target glyph sequence, including target multiplicities.
Original exercise · medium. 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 0 1 2 2 0 1
Output
3
Three length-two windows contain 0 and 1.
Example 2
Input
3 1 1 1 2 1 1
Output
2
Two windows match the repeated target.
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
Every qualifying window has target length.
Hint 2
Compare frequency counts instead of order.
Hint 3
Update the counts when a glyph enters or leaves the fixed window.
Practice this question
Save your work privately, explain decisions and return to your revision queue.
Open practice workspaceBrowse the question library →