## Pairing Heap

Pairing Heap is like a simplified form Fibonacci Heap. It also maintains the property of min heap which is parent value is less than its… Read More »

- Max Heap in Python
- Real-time application of Data Structures
- Min Heap in Python
- Flattening a linked list | Set 2
- Find Non-overlapping intervals among a given set of intervals
- Maximum CPU Load from the given list of jobs
- Sorting algorithm visualization : Heap Sort
- Maximum Possible Rating of a Coding Contest
- Sum and product of K smallest and largest Fibonacci numbers in the array
- Minimum cost to merge numbers from 1 to N
- Array value by repeatedly replacing max 2 elements with their absolute difference
- Longest subarray with absolute difference between elements less than or equal to K using Heaps
- Count of pairs from arrays A and B such that element in A is greater than element in B at that index
- std::is_heap( ) in C++ with Examples
- Weak Heap
- Last element remaining by deleting two largest elements and replacing by their absolute difference if they are unequal
- Reduce the array to atmost one element by the given operations
- 0/1 Knapsack using Least Count Branch and Bound
- Merge first two minimum elements of the array until all the elements are greater than K
- Complexity analysis of various operations of Binary Min Heap
- Check if Array elements can be maximized upto M by adding all elements from another array
- Maximize jobs that can be completed under given constraint
- Print all the leaf nodes of Binary Heap

Pairing Heap is like a simplified form Fibonacci Heap. It also maintains the property of min heap which is parent value is less than its… Read More »

Given a string str consisting of lowercase alphabets and an integer K, you can perform the following operations on str Initialize an empty string X… Read More »

A data structure is a particular way of organizing data in a computer so that it can be used effectively. The idea is to reduce… Read More »

Given an array of integers. The task is to rearrange elements of the array such that no two adjacent elements in the array are same.… Read More »

Given an unsorted array with both positive and negative elements including 0. The task is to find the smallest positive number missing from the array… Read More »

Given an array arr[] of N integers and an integer X, the task is to find the maximum possible sub-array sum after applying at most… Read More »

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 and two numbers x and k, find k closest values to x. Examples: Input : arr[] = {10, 2, 14, 4,… 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,… Read More »