Pocket Gems Interview Question: Find all paths from beginning node to end node (Dijkstra's Algorithm) | Glassdoor

Skip to content Skip to footer

Notifications

Loading...

employer cover photo

Pocket Gems

Pocket Gems Software Engineer interview

Pocket Gems interview question

Software Engineer Interview

Find all paths from beginning node to end node (Dijkstra's Algorithm)

Interview Answer

Anonymous

Aug 11, 2016

You should use DFS with backtracking instead

Related searches: Pocket Gems reviews | Pocket Gems jobs | Pocket Gems salaries | Pocket Gems benefits

Pocket Gems interviews