📂
Interview Prep
Ctrlk
  • Introduction
  • Trees
  • Recursion & Backtracking
  • Maths
  • Binary Searching & Sorting
  • Strings
  • BIT Manipulation
  • Two Pointers
  • Arrays
  • Linked List
  • Stacks & Queues
  • HashMap & HashSet & Sliding Window
  • Priority Queue
    • Heap Sort
    • Find K Pairs with Smallest Sums
    • Kth Largest Element in an Array
    • Merge k Sorted Lists
    • Median in a stream of integers
    • N max pair combinations
    • Magician and Chocolates
    • Find the Kth Smallest Sum of a Matrix With Sorted Rows
    • Kth Smallest Element in a Sorted Matrix
    • Smallest Range Covering Elements from K Lists
    • Top K Frequent Words
    • K Closest Points to Origin
    • Sort Integers by The Power Value
    • Minimum Number of Refueling Stops
    • IPO
    • Trapping Rain Water II
    • K-th Smallest Prime Fraction
    • Sliding Window Median
    • Range Sum of Sorted Subarray Sums
    • The Skyline Problem
  • Dynamic Programming
  • Greedy
  • Graphs, BFS & DFS
  • Geometry
  • Merge Sort
  • Segment Trees
  • Most consistent ways of dealing with the series of stock problems
Powered by GitBook
On this page

Priority Queue

Heap SortFind K Pairs with Smallest SumsKth Largest Element in an ArrayMerge k Sorted ListsMedian in a stream of integersN max pair combinationsMagician and ChocolatesFind the Kth Smallest Sum of a Matrix With Sorted RowsKth Smallest Element in a Sorted MatrixSmallest Range Covering Elements from K ListsTop K Frequent WordsK Closest Points to OriginSort Integers by The Power ValueMinimum Number of Refueling StopsIPOTrapping Rain Water IIK-th Smallest Prime FractionSliding Window MedianRange Sum of Sorted Subarray SumsThe Skyline Problem
PreviousRemove minimum elements from either side such that 2*min becomes more than maxNextHeap Sort

Last updated 5 years ago