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

Non-overlapping Intervals

MediumIntervals

Remove minimum intervals for non-overlap...

O(n log n) / O(1)
Google, Facebook
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

Insert Interval

HardIntervals

Insert interval into sorted list...

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

Meeting Rooms II

MediumIntervals

Minimum conference rooms needed...

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

Merge Intervals

#56
MediumIntervals

Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals...

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