Skip to content

Category Archives: Heap

Given an array arr[] of N integers from 1 to N. The task is to perform the following operations N – 1 times.   Select two… Read More
Given an unsorted array arr[] and two numbers X and K, the task is to find K closest values to X in arr[]. Examples:  Input:… Read More
Given an array of N elements. The task is to build a Binary Heap from the given array. The heap can be either Max Heap… Read More
Deletion in Heap Given a Binary Heap and an element present in the given Heap. The task is to delete an element from this Heap.  … Read More
Given N elements, you can remove any two elements from the list, note their sum, and add the sum to the list. Repeat these steps… Read More
I applied to TIAA through college internship process. Round 1: Online Test The test was conducted on CoCubes platform. The test consisted of aptitude and… Read More
Uniform-Cost Search is a variant of Dijikstra’s algorithm. Here, instead of inserting all vertices into a priority queue, we insert only source, then one by… Read More
Given a weighted undirected connected graph with N nodes and M edges. Some of the nodes are marked as good. The task is to find… Read More
Given k sorted arrays of possibly different sizes, find m-th smallest value in the merged array.Examples:   Input: m = 5 arr[][] = { {1, 3},… Read More
Given a binary tree and an integer b representing budget. The task is to find the count of maximum number of leaf nodes that can… 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
Given a min-heap of size n, find the kth least element in the min-heap.  Examples: Input : {10, 50, 40, 75, 60, 65, 45} k… Read More
A max-heap is a complete binary tree in which the value in each internal node is greater than or equal to the values in the… Read More
A double ended priority queue supports operations of both max heap (a max priority queue) and min heap (a min priority queue). The following operations… 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

Start Your Coding Journey Now!