Coders Crushby Napplied AI

Data Structures & Algorithms

100+ curated problems from top tech interviews

AllArrays & HashingTwo PointersSliding Window
Coders Crushby Napplied AI

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

System Design

  • All Problems
  • Easy
  • Hard

DSA

  • All Problems
  • Dynamic Programming
  • Graphs

More

  • Problems Arena
  • Growth Paths
  • AI Discovery

Coders Crush by Napplied AI - Built for engineers preparing for FAANG/MAANG interviews

Stack & Queue
Binary Search
Linked Lists
Trees
Tries
Heap / Priority Queue
Graphs
Dynamic Programming
Backtracking
Greedy
Intervals
Math & Geometry
Bit Manipulation

1 problems found

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(n)
Google, Amazon