## Find the largest multiple of 3 | Set 1 (Using Queue)

Given an array of non-negative integers. Find the largest multiple of 3 that can be formed from array elements. For example, if the input array… Read More »

- Minimize the maximum difference between adjacent elements in an array
- Real-time application of Data Structures
- Priority queue of pairs in C++ with ordering by first and second element
- Priority Queue of Vectors in C++ STL with Examples
- Find the K closest points to origin using Priority Queue
- Queue of Pairs in C++ STL with Examples
- Design a Queue data structure to get minimum or maximum in O(1) time
- Important functions of STL Components in C++
- Implementing Water Supply Problem using Breadth First Search
- What is a Webcrawler and where is it used?
- Boundary Level order traversal of a Binary Tree
- Diamond Tree
- Minimum circular rotations to obtain a given numeric string by avoiding a set of given strings
- Longest subarray whose elements can be made equal by maximum K increments
- Length of Smallest Subsequence such that sum of elements is greater than equal to K
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Static and Dynamic data structures in Java with Examples
- Print all Exponential Levels of a Binary Tree
- CPU Scheduling in Operating Systems using priority queue with gantt chart
- Check if cells numbered 1 to K in a grid can be connected after removal of atmost one blocked cell
- Minimum difference between maximum and minimum value of Array with given Operations
- Minimum possible modifications in the matrix to reach destination
- Append the elements of queue in mirror-inverse order
- Maximum absolute difference between any two level sum in a Binary Tree
- Clockwise Triangular traversal of a Binary Tree
- Find integral points with minimum distance from given set of integers using BFS
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Minimum Cost using Dijkstra by reducing cost of an Edge
- Different Types of Queues and its Applications
- Nth positive number whose absolute difference of adjacent digits is at most 1

Given an array of non-negative integers. Find the largest multiple of 3 that can be formed from array elements. For example, if the input array… Read More »

How to implement LRU caching scheme? What data structures should be used? We are given total possible page numbers that can be referred. We are… Read More »

Given a Binary Tree, write a function to check whether the given Binary Tree is Complete Binary Tree or not. A complete binary tree is… Read More »

Breadth First Traversal (or Search) for a graph is similar to Breadth First Traversal of a tree (See method 2 of this post). The only… Read More »

Given an array and an integer K, find the maximum for each and every contiguous subarray of size k. Examples : Input: arr[] = {1,… Read More »

Queue is used when things don’t have to be processed immediately, but have to be processed in First In First Out order like Breadth First… Read More »

The problem is opposite of this post. We are given a stack data structure with push and pop operations, the task is to implement a… Read More »

Write a function to print spiral order traversal of a tree. For below tree, function should print 1, 2, 3, 4, 5, 6, 7. Recommended:… Read More »

Level order traversal of a tree is breadth first traversal for the tree. Level order traversal of the above tree is 1 2 3 4… Read More »