## Maximum Possible Rating of a Coding Contest

Given two arrays of positive integer Point[], Upvote[] of size N and a value K (1 <= K <= N). The task is to choose… 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 two arrays of positive integer Point[], Upvote[] of size N and a value K (1 <= K <= N). The task is to choose… Read More »

Given N set of time intervals, the task is to find the intervals which don’t overlap with the given set of intervals. Examples: Input: interval… Read More »

Given an integer K and an array arr[] containing N integers, the task is to find the sum and product of K smallest and K… Read More »

Given an array of jobs with different time requirements, where each job consists of start time, end time and CPU load. The task is to… Read More »

Given two arrays A[] and B[] of size N, the task is to count the maximum number of pairs, where each pair contains one from… 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 Min-Heap is a complete binary tree in which the value in each internal node is smaller than or equal to the values in the… Read More »

Given a directed graph with N nodes and E edges where the weight of each of the edge is > 1, also given a source… Read More »

Given an array seats[] where seat[i] is the number of vacant seats in the ith row in a stadium for a cricket match. There are… Read More »

Given an integer N and an array seats[] where N is the number of people standing in a line to buy a movie ticket and… Read More »

Given an array arr[] of N integers and two integers M and K. The task is to check if the product of the K largest… Read More »

Given two sorted arrays, we need to merge them with O(1) extra space into a sorted array, when N is the size of the first… Read More »

Given an array arr[] consisting of the cost of toys and an integer K depicting the amount of money available to purchase toys. The task… Read More »

Read here for Shortest Job First Scheduling algorithm for same arrival times. Shortest job first (SJF) or shortest job next, is a scheduling policy that… Read More »

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 »