## Implement Stack and Queue using Deque

Deque also known as double eneded queue, as name suggests is a special kind of queue in which insertions and deletions can be done at… Read More »

- Zig Zag Level order traversal of a tree using single queue
- Minimum steps to reach any of the boundary edges of a matrix | Set-2
- Check if it is possible to reach a number by making jumps of two given length
- Array implementation of queue (Simple)
- FIFO (First-In-First-Out) approach in Programming
- Minimum number of given operations required to make two strings equal
- Print all nodes between two given levels in Binary Tree
- K-th Greatest Element in a Max-Heap
- Minimum distance to the end of a grid from source
- Iterative Method To Print Left View of a Binary Tree
- Shortest Path using Meet In The Middle
- Iterative Letter Combinations of a Phone Number
- Difference between Stack and Queue Data Structures
- Bank Of America (BA Continuum India Pvt. Ltd.) Campus Recruitment
- Check if moves in a stack or queue are possible or not
- Check if Queue Elements are pairwise consecutive
- Canonical Huffman Coding
- Check if N is divisible by a number which is composed of the digits from the set {A, B}
- Difference between a Static Queue and a Singly Linked List
- Nth number made up of odd digits only
- Reverse Cuthill Mckee Algorithm
- Check if Queue Elements are pairwise consecutive | Set-2
- String after processing backspace characters

Deque also known as double eneded queue, as name suggests is a special kind of queue in which insertions and deletions can be done at… Read More »

Write a function to print ZigZag order traversal of a binary tree. For the below binary tree the zigzag order traversal will be 1 3… Read More »

Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends. In previous post Implementation… Read More »

I applied through an employee referral for SDET-1 position. I was interviewed at Amazon Chennai(SP Infocity).I faced 5 face to face rounds. On October 11th,… Read More »

Given a queue of integers of even length, rearrange the elements by interleaving the first half of the queue with the second half of the… Read More »

Online Coding Round: Time: 1.5 hr Questions Format: 20 MCQs + 2 Coding Questions MCQs were based on Data Structures, Operating systems etc. Coding Questions:… Read More »

Give an algorithm for reversing a queue Q. Only following standard operations are allowed on queue. enqueue(x) : Add an item x to rear of… Read More »

Given an integer k and a queue of integers, we need to reverse the order of the first k elements of the queue, leaving the… Read More »

Given two n-ary trees, the task is to check if they are mirror of each other or not. Print “Yes” if they are mirror of… Read More »

Given two binary trees, we have to check if each of their levels are anagrams of each other or not. Example: Tree 1: Level 0… Read More »

Coding Round: A variation of Knapsack Easy string manipulation problem A brute-force based string matching problem Technical Round 1: Finding the length of a Linked-List… Read More »

A stack permutation is a permutation of objects in the given input queue which is done by transferring elements from input queue to the output… Read More »

Given a non-empty binary tree, print the average value of the nodes on each level. Examples: Input : 4 / \ 2 9 / \… Read More »

Given a stream of characters and we have to find first non repeating character each time a character is inserted to the stream. Examples: Input… Read More »

Round I 1.Implement expiry cache system : every page in cache have id and expiry time (TTL of few seconds). After page expires it behaves… Read More »