Data Structures
queue

18 problems

#

Title

Acceptance

Difficulty

1

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

46.3%

easy

2

28.0%

Med.

3

linked list
recursion
sorting
+4 more

80.1%

easy

4

30.1%

easy

5

subsets
array
stack
+3 more

67.6%

Med.

6

breadth-first search
binary tree
level order traversal
+1 more

73.5%

easy

7

breadth-first search
binary tree
queue
+1 more

89.2%

easy

8

binary tree
breadth-first search
level order traversal
+1 more

82.1%

easy

9

breadth-first search
binary tree
queue
+1 more

90.5%

Med.

10

binary tree
tree breadth first search
level order traversal
+2 more

56.9%

Med.

11

breadth-first search
binary tree
level order traversal
+1 more

78.0%

Med.

12

binary tree
tree breadth first search
level order traversal
+1 more

76.3%

easy

13

breadth-first search
graph
graph algorithms
+1 more

69.5%

hard

14

sliding window
queue
priority queue
+1 more

32.2%

hard

15

greedy algorithm
string
backtracking
+3 more

44.5%

hard

16

33.1%

hard

17

stack
monotonic stack
array
+2 more

49.7%

Med.

18

binary tree
binary search tree
recursion
+4 more

52.7%

Med.