## Flattening a linked list | Set 2

Given a linked list where every node represents a linked list and contains two pointers of its type: Pointer to next node in the main… Read More »

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

Given a linked list where every node represents a linked list and contains two pointers of its type: Pointer to next node in the main… Read More »

Given an integer N denoting number of jobs and a matrix ranges[] consisting of a range [start day, end day] for each job within which… Read More »

Given a positive integer M and two arrays arr[] and value[] of N and K positive integers respectively, the task is to add every element… Read More »

Given an array of N elements which denotes the array representation of binary heap, the task is to find the leaf nodes of this binary… Read More »

Given N items with weights W[0..n-1], values V[0..n-1] and a knapsack with capacity C, select the items such that: The sum of weights taken into… Read More »

A Min Heap is a Complete Binary Tree in which the children nodes have a higher value (lesser priority) than the parent nodes, i.e., any… Read More »

Given an array arr[] of N elements, the task is to perform the following operation: Pick the two largest element from the array and remove… Read More »

A data structure is a particular way of organizing data in a computer so that it can be used effectively. In this article, the real-time… Read More »

Given an array of integers arr[], the task is to find the remaining element in the array after performing the following operations: In each turn,… Read More »

Given an array arr size N, the task is to print the final array value remaining in the array when the maximum and second maximum… Read More »

The std::is_heap() function in C++ Standard Template Library is used to check whether a given range of elements forms Max Heap or not. It returns… Read More »

Given an array arr[] of N integers and an integer K, our task is to find the length of the longest subarray such that for… Read More »

Given an array arr[] and an integer K, the task is to find the number of merge operation required such that all the elements of… Read More »

Given an integer N, the task is to find the minimum cost to merge all the numbers from 1 to N where the cost of… Read More »

It is a binary tree that has following properties:- (1) Every key in the right sub-tree of a node is greater than the key stored… Read More »