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

10 problems found

Alien Dictionary

HardGraphs

Order characters from alien dictionary...

O(n) / O(1)
Google, Facebook

Number of Connected Components

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

MediumGraphs

Count connected components...

O(n+e) / O(n)
Google, Facebook

Network Delay Time

MediumGraphs

Time for all nodes to receive signal...

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

Cheapest Flights Within K Stops

MediumGraphs

Shortest path with at most k stops...

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

Surrounded Regions

MediumGraphs

Flip surrounded regions...

O(m*n) / O(m*n)
Google, Facebook

Clone Graph

MediumGraphs

Deep copy undirected graph...

O(n+e) / O(n)
Google, Amazon

Graph Valid Tree

MediumGraphs

Check if graph is valid tree...

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

Number of Islands

#200
MediumGraphs

Given an m x n 2D binary grid grid which represents a map of '1's (land) and '0's (water), return the number of islands. An island is surrounded by wa...

O(V + E) / O(V)
Google, Amazon

Course Schedule

#207
MediumGraphs

There are a total of numCourses courses you have to take. Some courses may have prerequisites. Given the total number of courses and a list of prerequ...

O(V + E) / O(V + E)
Google, Amazon

Word Ladder

#127
HardGraphs

A transformation sequence from beginWord to endWord using dictionary wordList is a sequence where every adjacent pair of words differs by a single let...

O(M² * N) / O(M * N)
Google, Amazon