Queue

Find shortest path between two vertices in an unweighted graph using BFS traversal

Implement breadth-first search traversal of a graph

Design a circular queue with fixed size that supports enqueue, dequeue, front, rear, isEmpty, and isFull operations.

Implement a queue using arrays or linked lists with O(1) time complexity for all operations.

Implement a queue using two stacks with O(1) amortized time complexity for all operations.

Implement a stack using two queues with O(1) amortized time complexity for all operations.

Traverse a binary tree level by level from left to right.

Find the minimum time for all oranges to rot using BFS