Date (attemp history: use title to fill)
2026-06-05 [Retry][3318] Find X-Sum of All K-Long Subarrays I (Easy) - solved w/out hints but got confused with sorted(key=)
Retry Date
2026-06-11
Difficulty
Easy
Pattern
Sliding Window + Frequency Counting + Custom Sorting
Core Idea
For each subarray of length k, count the frequency of every element. Rank elements by frequency in descending order, breaking ties by larger value. Keep only the top x distinct elements and compute the sum of all their occurrences.
Because the constraints are small, rebuilding the frequency map for every window is efficient enough.
Repo Link
https://github.com/zerexei/software-engineering/blob/main/datastructure-and-algorithm/sliding-window/Gjoe-Y-Tvn-pg-Bmm-L-Mpoh-Tvcbssbzt-J.md
Date (attemp history: use title to fill)
2026-06-05 [Retry][3318] Find X-Sum of All K-Long Subarrays I (Easy) - solved w/out hints but got confused with sorted(key=)
Retry Date
2026-06-11
Difficulty
Easy
Pattern
Sliding Window + Frequency Counting + Custom Sorting
Core Idea
For each subarray of length k, count the frequency of every element. Rank elements by frequency in descending order, breaking ties by larger value. Keep only the top x distinct elements and compute the sum of all their occurrences.
Because the constraints are small, rebuilding the frequency map for every window is efficient enough.
Repo Link
https://github.com/zerexei/software-engineering/blob/main/datastructure-and-algorithm/sliding-window/Gjoe-Y-Tvn-pg-Bmm-L-Mpoh-Tvcbssbzt-J.md