## Stack and Queue in Python using queue Module

A simple python List can act as queue and stack as well. Queue mechanism is used widely and for many purposes in daily life. A… Read More »

- Iterative Method To Print Left View of a Binary Tree
- Iterative Letter Combinations of a Phone Number
- Difference between Stack and Queue Data Structures
- Minimum distance to the corner of a grid from source
- Sum of nodes in bottom view of Binary Tree
- Minimum steps required to reach the end of a matrix | Set 2
- Rearrange numbers in an array such that no two adjacent numbers are same
- Smallest multiple of N formed using the given set of digits
- Sort the Queue using Recursion
- Density of Binary Tree using Level Order Traversal
- LRU Approximation (Second Chance Algorithm)
- Print all the nodes except the leftmost node in every level of the given binary tree
- Iterative approach to check if a Binary Tree is Perfect
- Introduction to Data Structures | 10 most commonly used Data Structures
- Find the sum of leafs at maximum level
- Print the final string when minimum value strings get concatenated in every operation
- Reverse tree path using Queue
- Minimum operations required to make every element greater than or equal to K
- Print even positioned nodes of even levels in level order of the given binary tree

A simple python List can act as queue and stack as well. Queue mechanism is used widely and for many purposes in daily life. A… Read More »

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 »