Filters

---

Topics

  Advanced Algorithms

  Dynamic Programming

  Depth-first Search

  Breadth-first Search

  Data Structures

  Graph

  Heap

  Hash Table

+ 26 more

---

Company

Snapdeal

Amazon

MAQ Software

Flipkart

Samsung

Visa

eBay

Apple

Facebook

ShareChat

+ 15 more

---

Difficulty

Hard

Moderate

Easy

Problem Title

Difficulty

Avg Time to solve

Attempted

Alien dictionary

59

Hard

46 mins

187

Bipartite Graph

18

Moderate

50 mins

167

Roots of the tree having minimum height

12

Moderate

25 mins

56

Course Schedule

13

Easy

15 mins

119

Course Schedule II

5

Hard

50 mins

91

Number of squareful arrays

3

Hard

50 mins

49

Rooms

1

Moderate

30 mins

93

Evaluate Division

0

Moderate

15 mins

64

Clone Graph

9

Moderate

25 mins

89

Count Strongly Connected Components (Kosaraju’s Algorithm)

3

Hard

40 mins

65

Possible Bipartition

6

Moderate

20 mins

36

Find the City With the Smallest Number of Neighbors at a Threshold Distance

2

Moderate

15 mins

75

Regions Cut By Slashes

0

Moderate

30 mins

18

Reconstruct Itinerary

3

Moderate

15 mins

28

Validate Binary Tree Nodes

3

Moderate

15 mins

34

Redundant Connection - I

3

Moderate

15 mins

51

Ninja and his Courses

6

Hard

50 mins

8

Shortest alternate colored path

4

Moderate

20 mins

52

Path With Maximum Probability

2

Moderate

25 mins

21

Sort Integers by Factor Value

0

Moderate

30 mins

35

Number of Connected Computers.

5

Moderate

10 mins

45

Valid Pairing of Numbers

1

Hard

50 mins

14

Ninja's Gift

1

Hard

45 mins

26

Ninja And Flowers

1

Moderate

10 mins

18

Path to the nearest service station

1

Moderate

15 mins

33

Alien dictionary NEW

Hard

59 upvotes

Bipartite Graph NEW

Moderate

18 upvotes

Roots of the tree having minimum height NEW

Moderate

12 upvotes

Course Schedule NEW

Easy

13 upvotes

Course Schedule II NEW

Hard

5 upvotes

Number of squareful arrays NEW

Hard

3 upvotes

Rooms NEW

Moderate

1 upvote

Evaluate Division NEW

Moderate

0 upvotes

Clone Graph NEW

Moderate

9 upvotes

Count Strongly Connected Components (Kosaraju’s Algorithm) NEW

Hard

3 upvotes

Possible Bipartition NEW

Moderate

6 upvotes

Find the City With the Smallest Number of Neighbors at a Threshold Distance NEW

Moderate

2 upvotes

Regions Cut By Slashes NEW

Moderate

0 upvotes

Reconstruct Itinerary NEW

Moderate

3 upvotes

Validate Binary Tree Nodes NEW

Moderate

3 upvotes

Redundant Connection - I NEW

Moderate

3 upvotes

Ninja and his Courses NEW

Hard

6 upvotes

Shortest alternate colored path NEW

Moderate

4 upvotes

Path With Maximum Probability NEW

Moderate

2 upvotes

Sort Integers by Factor Value NEW

Moderate

0 upvotes

Number of Connected Computers. NEW

Moderate

5 upvotes

Valid Pairing of Numbers NEW

Hard

1 upvote

Ninja's Gift NEW

Hard

1 upvote

Ninja And Flowers NEW

Moderate

1 upvote

Path to the nearest service station NEW

Moderate

1 upvote

Page of 2

Take a look at the top graphs interview questions asked in interviews of top tech companies like Amazon, Google, Microsoft, and more only on CodeStudio. Start Practicing now!