Skip to content

Latest commit

 

History

History
5 lines (3 loc) · 258 Bytes

README.md

File metadata and controls

5 lines (3 loc) · 258 Bytes

Deck of Cards

  • sliding window

In this problem, we use the Sliding Window technique to compute the sums of cards between the positions (i,j). This gives us a linear runtime. If the sum of cards is exactly k at any point in time, we can return early.