Pattern

Exactly K = AtMost(K) − AtMost(K−1)

3 problems in the roadmap use this pattern.

• Binary Subarrays With Sum Medium

  in Sliding Window

• Count Number of Nice Subarrays Medium

  in Sliding Window

• Subarrays with K Different Integers Hard

  in Sliding Window