## Queue Interface In Java

The Queue interface is available in java.util package and extends the Collection interface. The queue collection is used to hold the elements about to be… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Priority Queue of Vectors in C++ STL with Examples
- Queue of Pairs in C++ STL with Examples
- Level order traversal in spiral form | Using Deque
- Minimum cost to reach from the top-left to the bottom-right corner of a matrix
- Implementing Water Supply Problem using Breadth First Search
- Boundary Level order traversal of a Binary Tree
- Diamond Tree
- What is a Webcrawler and where is it used?
- Print all Exponential Levels of a Binary Tree
- Priority queue of pairs in C++ with ordering by first and second element
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Design a Queue data structure to get minimum or maximum in O(1) time
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- CPU Scheduling in Operating Systems using priority queue with gantt chart
- Append the elements of queue in mirror-inverse order
- Clockwise Triangular traversal of a Binary Tree
- Find the K closest points to origin using Priority Queue
- Print Nth Stepping or Autobiographical number
- Minimum difference between maximum and minimum value of Array with given Operations
- Minimum cost to traverse from one index to another in the String
- Find integral points with minimum distance from given set of integers using BFS
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Static and Dynamic data structures in Java with Examples
- Print all K-sum levels in a Binary Tree
- Minimum possible modifications in the matrix to reach destination
- Nth positive number whose absolute difference of adjacent digits is at most 1
- Print all Palindromic Levels Of a Binary Tree
- Print updated levels of each node of a Complete Binary Tree based on difference in weights of subtrees

The Queue interface is available in java.util package and extends the Collection interface. The queue collection is used to hold the elements about to be… Read More »

Given two Binary Trees, write a function that returns true if two trees are mirror of each other, else false. For example, the function should… Read More »

1. Written Round : 1) 30 Aptitude questions(30 min). 2) 2-Coding questions(30 min). 2-a) Write an algorithm for dutch national flag problem 2-b) Write an… Read More »

Round 1 (Coding round): 1) Range [L, R] is given. Need to find what is the maximum repeating digit in prime numbers between L and… Read More »

Given an expression with only ‘}’ and ‘{‘. The expression may not be balanced. Find minimum number of bracket reversals to make the expression balanced.… Read More »

Recently Microsoft visited our campus for recruitment and following is my interview experience. MCQ Round- 15 MCQ questions from C , C++ , java (1… Read More »

Given a string consisting of opening and closing parenthesis, find length of the longest valid parenthesis substring. Examples: Input : ((() Output : 2 Explanation… Read More »

Recently walmart labs came to our campus for campus recruitment. Here is my interview experience: Round 1 (MCQ + Coding Questions) This round was conducted… Read More »

First round (Written) : 1. 4 Android questions: a) What’s Recyclerview? Describe all components of Recyclerview with all callbacks and the benefits of Recyclerview. b)… Read More »

Walmart Labs Interview Experience – On campus 1st round (Online Test) It was an online test of 90 minutes and was conducted on Hackerearth. It… Read More »

Given a matrix of dimension m*n where each cell in the matrix can have values 0, 1 or 2 which has the following meaning: 0:… Read More »

Written MCQ There were 20 multiple choice questions to be done in 30 minutes time and most of the technical questions were from geeksquiz ,… Read More »

1st Round : (2 hrs) 1. Implement LRU Cache, 2. Implement your own Blocking Queue. 3. Questions on Collections , a. How AtomicInteger works b.… Read More »

Top view of a binary tree is the set of nodes visible when the tree is viewed from the top. Given a binary tree, print… Read More »

Deque or Double Ended Queue is a generalized version of Queue data structure that allows insert and delete at both ends. Operations on Deque: Mainly… Read More »