Patterns
sliding window

15 problems

#

Title

Acceptance

Difficulty

1

Maximum Sum Subarray of Size K (easy)
sliding window
greedy algorithm
array
+1 more

46.3%

easy

2

sliding window
array
two pointers

19.7%

easy

3

28.0%

Med.

4

sliding window
array
two pointers
+1 more

39.4%

Med.

5

29.8%

hard

6

48.7%

hard

7

sliding window
string
hash map
+1 more

16.2%

hard

8

string
hash map
sliding window
+2 more

29.0%

hard

9

20.0%

hard

10

string
hash map
two pointers
+2 more

23.2%

hard

11

29.0%

hard

12

24.7%

hard

13

sliding window
priority queue
array
+1 more

32.2%

hard

14

sliding window
two pointers
array
+1 more

33.6%

Med.

15

prefix sum
hash map
sliding window
+1 more

56.6%

Med.