## Level order traversal in spiral form | Using Deque

Given a Binary Tree, the task is to print spiral order traversal of the given tree. For below tree, the function should print 1, 2,… Read More »

- Count number of ways to reach destination in a Maze using BFS
- Find the maximum cost path from the bottom-left corner to the top-right corner
- Reversing a Queue using another Queue
- Find the first N pure numbers
- Count of numbers in the range [L, R] which satisfy the given conditions
- Duplicate subtree in Binary Tree | SET 2
- Python | Queue using Doubly Linked List
- Print odd positioned nodes of even levels in level order of the given binary tree
- Find the number on the card that remains in the end after performing the given operations
- Print odd positioned nodes of odd levels in level order of the given binary tree
- Queries to find the left-most given type integer in a binary array
- Print even positioned nodes of odd levels in level order of the given binary tree
- Queue in Python

Given a Binary Tree, the task is to print spiral order traversal of the given tree. For below tree, the function should print 1, 2,… Read More »

Given an N * M matrix mat[][] consisting of lower case characters, the task is to find the minimum cost to reach from the cell… Read More »

Given a string S of length N consisting of lower case character, the task is to find the minimum cost to reach from index i… Read More »

Given an array of infinite length and two integers M and N which are co-primes, the task is to find the number of positions that… Read More »

Given a tree with N vertices numbered from 0 to N – 1 and Q query containing nodes in the tree, the task is to… Read More »

Given a dictionary, and two words start and target (both of the same length). Find length of the smallest chain from start to target if… Read More »

Given a binary array arr[], the task is to design a data structure that supports the following operations in O(1). Type 1: Remove and print… Read More »

Like stack, queue is a linear data structure that stores items in First In First Out (FIFO) manner. With a queue the least recently added… Read More »

Given a range [L, R], the task is to find the count of numbers from this range that satisfy the below conditions: All the digit… Read More »

Given an integer N which represents the number of cards in a deck. The deck is ordered from 1 to N where 1 is the… Read More »

Given a binary tree, the task is to print the odd positioned nodes of even levels in the level order traversal of the tree. The… Read More »

Given a binary tree, the task is to print the even positioned nodes of odd levels in the level order traversal of the tree. The… Read More »

Given a binary tree, the task is to print the odd positioned nodes of odd levels in the level order traversal of the tree. The… Read More »

Given a queue. The task is to reverse the queue using another another empty queue. Examples: Input: queue[] = {1, 2, 3, 4, 5} Output:… Read More »

Given a binary tree, the task is to check whether the binary tree contains a duplicate sub-tree of size two or more. Input: A /… Read More »