โ† All topics

Learning

IDProblemDifficultySectionSheets
1223Heaps (Theory Video)EasyLearningA2Z
576Implement Min HeapMediumLearningA2Z
571Check if an array represents a min heapMediumLearningA2Z
572Convert Min Heap to Max HeapMediumLearningA2Z
575Implement Max HeapMediumLearningSDE

Medium Problems

IDProblemDifficultySectionSheets
578K-th Largest element in an arrayMediumMedium ProblemsA2Z SDE
2840Kth smallest element in an array [use priority queue]MediumMedium ProblemsA2Z
2409Sort K sorted arrayEasyMedium ProblemsA2Z
569Merge K sorted ListsHardMedium ProblemsA2Z
898Replace Elements by Their RankEasyMedium ProblemsA2Z
1008Task SchedulerMediumMedium ProblemsA2Z
556Hand of StraightsMediumMedium ProblemsA2Z
713Merge K Sorted ArraysMediumMedium ProblemsSDE B75
2839K-th largest element in an unsorted array.MediumMedium ProblemsSDE

Hard Problems

IDProblemDifficultySectionSheets
565Design TwitterMediumHard ProblemsA2Z
755Minimum Cost to Connect SticksMediumHard ProblemsA2Z
2838Kth largest element in a stream of running integersHardHard ProblemsA2Z
568Maximum Sum CombinationHardHard ProblemsA2Z SDE
566Find Median from Data StreamHardHard ProblemsA2Z SDE B75
1018Top K Frequent ElementsMediumHard ProblemsA2Z SDE B75
446Find Median in a StreamMediumHard ProblemsSDE
567Kth largest element in a stream of running integersHardHard ProblemsSDE