Enumerating Narrative Sections

Problem Overview

• Count contiguous subarrays that contain at least K pairs of identical values (indices differ).
• Input: an array of integers and K; Output: the number of qualifying subarrays; constraints are unspecified.
• Real-world framing: narrative sections where twin characters both appear within the same segment.
• This problem was asked in Meta interviews and is a common coding interview interview question.