## 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 »

- Priority Queue in Python
- Microsoft Interview experience | Set 178 (On-Campus Internship for IDC)
- FIFO (First-In-First-Out) approach in Programming
- Level order traversal in spiral form | Using one stack and one queue
- Print all nodes between two given levels in Binary Tree
- Zig Zag Level order traversal of a tree using single queue
- Minimum number of given operations required to make two strings equal
- Array implementation of queue (Simple)
- Check if N is divisible by a number which is composed of the digits from the set {A, B}
- Check if Queue Elements are pairwise consecutive
- Find maximum vertical sum in binary tree
- K-th Greatest Element in a Max-Heap
- Check if Queue Elements are pairwise consecutive | Set-2
- Sudo Placement[1.3] | Final Destination
- Nth number made up of odd digits only
- String after processing backspace characters
- Difference between a Static Queue and a Singly Linked List
- Canonical Huffman Coding
- Bank Of America (BA Continuum India Pvt. Ltd.) Campus Recruitment
- Maximum length of rod for Q-th person

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 »