Get started
Start with DSA Fundamentals
Programming Fundamentals
Back to modulesModule 11 · 0/39
Module 11
Heaps
0/398229
Medium Problems0/19
- 1Kth Largest Element in an ArrayEasy
- 1Height of a Binary TreeMed.
- 2Kth Smallest Element in an ArrayEasy
- 2Check if Binary Tree is BalancedMed.
- 3Sort K-Sorted ArrayEasy
- 3Diameter of Binary TreeMed.
- 4K Most Frequent ElementsMed.
- 4Maximum Path Sum in Binary TreeHard
- 5Replace Elements by RankEasy
- 5Check if Two Trees are IdenticalMed.
- 6Task SchedulerMed.
- 6Symmetric Binary TreeMed.
- 7Hand of StraightsMed.
- 7Zig-Zag TraversalEasy
- 8Boundary TraversalMed.
- 9Vertical Order TraversalEasy
- 10Top View of Binary TreeEasy
- 11Bottom View of Binary TreeMed.
- 12Right & Left View of Binary TreeMed.
Hard Problems0/20
- 1Merge M Sorted ListsHard
- 1Root to Node Path in Binary TreeMed.
- 2Connect Ropes to Minimize CostMed.
- 2Lowest Common Ancestor (LCA)Med.
- 3Kth Largest Element in a StreamEasy
- 3Maximum Width of Binary TreeMed.
- 4Maximum Sum CombinationMed.
- 4Check for Children Sum PropertyHard
- 5Find Median from Data StreamHard
- 5Print all Nodes at a Distance of KMed.
- 6Design TwitterMed.
- 6Minimum Time to Burn Binary TreeHard
- 7Count Total Nodes in a Complete Binary TreeMed.
- 8Requirements to Construct a Unique Binary TreeMed.
- 9Construct Binary Tree from Inorder and PreorderHard
- 10Construct Binary Tree from Inorder and PostorderHard
- 11Serialize and Deserialize Binary TreeHard
- 12Morris Preorder TraversalMed.
- 13Morris Inorder TraversalMed.
- 14Flatten Binary Tree to Linked ListHard