This repository contains programming questions based on Heaps.
- Implement a Heap
- Heapify algorithm
- Heap Sort: https://www.geeksforgeeks.org/heap-sort/
- Kth Smallest/Largest element in Array
- Merge 2 Max Heaps:https://practice.geeksforgeeks.org/problems/merge-two-binary-max-heap0144/1
- Check if tree is a heap: https://practice.geeksforgeeks.org/problems/is-binary-tree-heap/1
- Minimum Cost of Ropes: https://practice.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1
- Convert BST into Min-heap: https://www.codingninjas.com/studio/problems/convert-bst-to-min-heap_920498
- Kth Largest Sum Sub-array: https://practice.geeksforgeeks.org/problems/k-th-largest-sum-contiguous-subarray/1
- Merge K sorted Arrays:https://practice.geeksforgeeks.org/problems/merge-k-sorted-arrays/1
- Merge K sorted Linked List:https://leetcode.com/problems/merge-k-sorted-lists/
- Smallest Range in K List: https://leetcode.com/problems/smallest-range-covering-elements-from-k-lists/
- Median in a Stream Problem using Heap: https://leetcode.com/problems/find-median-from-data-stream/
- Reorganise String: https://leetcode.com/problems/reorganize-string/
Trie:
- Insert/Search/Delete In Trie
- Longest common Prefix https://leetcode.com/problems/longest-common-prefix/
- Replace Words https://leetcode.com/problems/replace-words/
- Implement Trie (Prefix Tree) https://leetcode.com/problems/implement-trie-prefix-tree/
- Implement Phone Directory https://practice.geeksforgeeks.org/problems/phone-directory4628/1