← Back to Citadel

Linked List

6 questions

1Merge k Sorted ListsHard
Linked ListDivide and ConquerHeap (Priority Queue)
Solve →
2Populating Next Right Pointers in Each Node IIMedium
Linked ListTreeDepth-First Search
Solve →
3Populating Next Right Pointers in Each NodeMedium
Linked ListTreeDepth-First Search
Solve →
4Merge k Sorted ListsHard
Linked ListDivide and ConquerHeap (Priority Queue)
Solve →
5Populating Next Right Pointers in Each Node IIMedium
Linked ListTreeDepth-First Search
Solve →
6Populating Next Right Pointers in Each NodeMedium
Linked ListTreeDepth-First Search
Solve →