Coders Crushby Napplied AI

Data Structures & Algorithms

100+ curated problems from top tech interviews

AllArrays & HashingTwo PointersSliding WindowStack & QueueBinary SearchLinked ListsTreesTriesHeap / Priority QueueGraphsDynamic ProgrammingBacktrackingGreedyIntervalsMath & GeometryBit Manipulation

4 problems found

Find Median from Data Stream

HardHeap / Priority Queue

Find median with streaming numbers...

O(log n) / O(n)
Google, Amazon
Coders Crushby Napplied AI

The ultimate interview preparation platform. Master System Design, DSA, and tackle community challenges to crush your FAANG interviews.

Looking for jobs? Visit Napplied AI Jobs Search Agent

System Design

  • All Problems
  • Easy
  • Hard

DSA

  • All Problems
  • Dynamic Programming
  • Graphs

More

  • Problems Arena
  • Growth Paths
  • My Crush

Coders Crush by Napplied AI - Tech Interview & Coding Should Be Effortless

Merge k Sorted Lists

HardHeap / Priority Queue

Merge k sorted linked lists...

O(n log n) / O(n)
Google, Amazon

Kth Largest Element

MediumHeap / Priority Queue

Find kth largest element...

O(n*log k) / O(k)
Google, Amazon

Reorganize String

MediumHeap / Priority Queue

Reorganize string by frequency...

O(n*log n) / O(n)
Google, Amazon