## Nth number made up of odd digits only

Given an integer N, the task is to find the Nth number made up of odd digits (1, 3, 5, 7, 9) only. First few… Read More »

- Breadth First Search or BFS for a Graph
- Level Order Tree Traversal
- Queue using Stacks
- Sliding Window Maximum (Maximum of all subarrays of size k)
- LRU Cache Implementation
- Queue | Set 1 (Introduction and Array Implementation)
- Priority Queue | Set 1 (Introduction)
- Implement Stack using Queues
- Minimum steps to reach target by a Knight | Set 1
- Level order traversal in spiral form
- Queue Interface In Java
- Print Nodes in Top View of Binary Tree
- Minimum time required to rot all oranges
- Queue | Set 2 (Linked List Implementation)
- Connect n ropes with minimum cost
- Circular Queue | Set 1 (Introduction and Array Implementation)
- Find the first circular tour that visits all petrol pumps
- Find the first non-repeating character from a stream of characters
- Length of the longest valid substring
- Deque | Set 1 (Introduction and Applications)
- Applications of Queue Data Structure
- Check if two trees are Mirror
- ZigZag Tree Traversal
- Implement a stack using single queue
- Implementation of Deque using circular array
- Construct Complete Binary Tree from its Linked List Representation
- Queue based approach for first non-repeating character in a stream
- Circular Queue | Set 2 (Circular Linked List Implementation)
- Implement PriorityQueue through Comparator in Java
- Iterative Method to find Height of Binary Tree

Given an integer N, the task is to find the Nth number made up of odd digits (1, 3, 5, 7, 9) only. First few… Read More »

Given three integers N, A and B, the task is to find whether N is divisible by any number that contains only A and B… Read More »

Given a max-heap of size n, find the kth greatest element in the max-heap. Examples: Input : maxHeap = {20, 15, 18, 8, 10, 5,… Read More »

Huffman Coding is a lossless data compression algorithm where each character in the data is assigned a variable length prefix code. The least frequent character… Read More »

Static Queue: A queue is an ordered list of elements. It always works in first in first out(FIFO) fashion. All the elements get inserted at… Read More »

In queue, insertion and deletion happen at the opposite ends, so implementation is not as simple as stack. To implement a queue using array, create… Read More »

Given two strings A and B, both strings contain characters a and b and are of equal lengths. There is one _ (empty space) in… Read More »

Given a string S containing letters and ‘#‘. The ‘#” represents a backspace. The task is to print the new string without ‘#‘. Examples: Input… Read More »

Given a binary tree, print all nodes between two given levels in a binary tree. Print the nodes level wise, i.e., the nodes for any… Read More »

Given a Queue of integers. The task is to check if consecutive elements in the queue are pairwise consecutive. Examples: Input: 1 2 5 6… Read More »

Given a Queue of integers. The task is to check if consecutive elements in the queue are pairwise consecutive. Examples: Input : 1 2 5… 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 »

FIFO is an abbreviation for first in, first out. It is a method for handling data structures where the first element is processed first and… Read More »

Approved Offer. Bank Of America has visited our college for on campus recruitment . The recruitment consisted of 4 Rounds in total. The recruitment was… Read More »

Priority Queue is an extension of the queue with following properties. 1) An element with high priority is dequeued before an element with low priority.… Read More »