1. Data Structure and Algorithm Mastery

    • Buy now
    • Learn more
    • Discussions
  2. Arrays

    • Arrays Basics
  3. Binary Search

    • Binary Search Introduction
    • Binary Search Application
  4. LinkedList

    • Linked List Implementation and Operations
    • Linked List Reverse in groups
  5. Hashing

    • Hashing
  6. Heaps

    • Heap tree implementation
    • Median in a stream
  7. Stacks And Queues

    • Stacks Introduction
    • Sum Subarray Ranges
    • Queues
  8. Sliding Window

    • Sliding window Intro
    • Sliding window Advanced
  9. Graphs and trees

    • Basics for Graph and Tree
    • Binary Tree
    • BFS on Graph
    • Topological sorting
    • BFS On Grid
    • Union Find and MST
    • Dijkstra On Graph
    • Minimum Cost to Reach Destination in Time
    • Topological Sorting with DFS
  10. Backtracking

    • Backtracking Inclusion Exclusion
    • Rat in a Maze
  11. Dynamic programming

    • Dynamic Programming Inclusion exclusion
    • Matrix chain multiplication
    • Arithmetic Slices
  12. Trie

    • Trie Operations and Applications
  13. Intervals

    • Merge and Insert Intervals
  14. Greedy

    • Greedy approch
  15. Special Topics

    • Segment Tree
    • KMP
  1. Products
  2. Course
  3. Section
  4. Lesson

Heap tree implementation

  1. Data Structure and Algorithm Mastery

    • Buy now
    • Learn more
    • Discussions
  2. Arrays

    • Arrays Basics
  3. Binary Search

    • Binary Search Introduction
    • Binary Search Application
  4. LinkedList

    • Linked List Implementation and Operations
    • Linked List Reverse in groups
  5. Hashing

    • Hashing
  6. Heaps

    • Heap tree implementation
    • Median in a stream
  7. Stacks And Queues

    • Stacks Introduction
    • Sum Subarray Ranges
    • Queues
  8. Sliding Window

    • Sliding window Intro
    • Sliding window Advanced
  9. Graphs and trees

    • Basics for Graph and Tree
    • Binary Tree
    • BFS on Graph
    • Topological sorting
    • BFS On Grid
    • Union Find and MST
    • Dijkstra On Graph
    • Minimum Cost to Reach Destination in Time
    • Topological Sorting with DFS
  10. Backtracking

    • Backtracking Inclusion Exclusion
    • Rat in a Maze
  11. Dynamic programming

    • Dynamic Programming Inclusion exclusion
    • Matrix chain multiplication
    • Arithmetic Slices
  12. Trie

    • Trie Operations and Applications
  13. Intervals

    • Merge and Insert Intervals
  14. Greedy

    • Greedy approch
  15. Special Topics

    • Segment Tree
    • KMP

Sort an Array - https://leetcode.com/problems/sort-an-array/description/

Solution - https://leetcode.com/problems/sort-an-array/solutions/5130465/readable-and-moduler-heap-implmentation/ 

Minimum Cost of ropes - https://www.geeksforgeeks.org/problems/minimum-cost-of-ropes-1587115620/1

Kth Largest Element in an Array - https://leetcode.com/problems/kth-largest-element-in-an-array/description/

Solution - https://leetcode.com/problems/kth-largest-element-in-an-array/solutions/5130478/heap-to-maintain-top-k-elements/

Top K Frequent Elements - https://leetcode.com/problems/top-k-frequent-elements/description/

Solution - https://leetcode.com/problems/top-k-frequent-elements/submissions/1860404256