Interview Bootcamp
Ask Author
Back to course home

0% completed

Vote For New Content

DFS and BFS solutions since they only included BFS solution

Trang Luong

Mar 3, 2025

0

10

0

Mar 3, 2025

Please fix test case: 7 [[6, 4], [6, 2], [5, 3], [5, 4], [3, 0], [3, 1], [3, 2], [4, 1]]

makarand.h

Nov 17, 2024

1

16

0

Dec 4, 2024

Please fix test case

Tobby Lie

Sep 9, 2024

0

23

0

Sep 9, 2024

Please fix the test case

sujay.gunjal

Oct 2, 2023

1

38

1

Oct 9, 2023

Code fails with this case

zaid

Sep 23, 2023

2

40

1

Oct 9, 2023

This article can be extended by elaborating that BFS and DFS are both viable solutions for the problem

Mikhail Putilov

May 20, 2023

0

32

0

May 20, 2023

I'm confused on the line:inDegree.put(i,0);graph.put(i, new ArrayList());what ex...

Matthew Espinoza

Oct 24, 2022

0

6

1

Oct 24, 2022

Is [6, 5, 3, 4, 0, 2, 1] also a valid sort output for example 3?

wuinko

Jun 10, 2022

0

22

1

Jun 11, 2022

It's not clear to me why this is indicative of a cycle in the graph: if (sort...

Mike Palarz

Mar 3, 2022

0

25

2

Mar 3, 2022

Is this Kahn's algorithm?

Tyler DeSouza

Feb 19, 2022

0

42

1

May 14, 2022