All DSA
Interview Guide

Heaps

0%
Coding
Theory

  • High Five

    Junior

  • Kth Largest Element in a Stream

    Junior

  • Take Gifts From the Richest Pile

    Junior

  • Bank Teller Simulation

    Mid

  • Efficient Token Frequency Counting

    Mid

  • Frequency and Distance Top-K Points

    Mid

  • K Closest Points to Origin

    Mid

  • Merge k Sorted Arrays

    Mid

  • Merge Sorted Streams

    Mid

  • Min-Heap Node Filtering

    Mid

  • Minimal Window Spanning Arrays

    Mid

  • Minimum Cost to Connect Sticks

    Mid

  • Number of Orders in the Backlog

    Mid

  • Single-Threaded CPU

    Mid

  • Single-Threaded CPU with Priority

    Mid

  • Smallest Range Covering Elements from K Lists

    Mid

  • Sum of K Farthest Items

    Mid

  • Top 3 Most Frequent API Calls

    Mid

  • Top K Customers by Transaction Volume

    Mid

  • Top K Frequent Elements (with Distance Tie-break)

    Mid

  • Top K Frequent Elements in a Log File

    Mid

  • Top K Frequent Operations

    Mid

  • Top K Highest Numbers in a Stream

    Mid

  • Top N Frequent Errors

    Mid

  • User Activity Tracker

    Mid

  • Find Median from Data Stream

    Senior

  • Maximal Score After Applying K Operations

    Senior

  • Meeting Rooms III

    Senior

  • Minimum Cost to Hire K Workers

    Senior

  • Sliding Window Median

    Senior

  • The Skyline Problem

    Senior

  • Top K Frequent Elements in a Stream

    Senior

  • Top K Frequent Elements with Time Range

    Senior

  • Trapping Rain Water II

    Senior

  • Union Iterator - Merge K Sorted Iterators

    Senior

  • Zero Array Transformation III

    Senior