Data Structures
queue

16 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

breadth-first search
binary tree
queue
+1 more

89.2%

easy

5

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

54.0%

Med.

6

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

56.9%

Med.

7

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

73.4%

easy

8

breadth-first search
binary tree
queue
+1 more

89.2%

easy

9

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

82.0%

easy

10

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

78.1%

Med.

11

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

76.2%

easy

12

breadth-first search
graph
queue
+2 more

69.5%

hard

13

25.3%

hard

14

33.1%

hard

15

stack
monotonic stack
array
+2 more

49.6%

Med.

16

binary tree
binary search tree
recursion
+4 more

52.8%

Med.