You're given student reports and keywords. Determine the top K students based on how many positive and negative keywords appear in their reports.

Find the maximum value within a sliding window of size k as it moves across an array. You'll need to efficiently update the maximum as the window slides.

You are given a file system represented as a list of folder paths. Identify and delete all duplicate folders, keeping only one copy of each unique folder structure.