Timeline for Optimizing Dijkstra on grid Python (Microsoft Interview)
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Mar 26, 2021 at 9:00 | history | tweeted | twitter.com/StackCodeReview/status/1375371967017127941 | ||
| Mar 25, 2021 at 12:00 | history | bumped | CommunityBot | This question has answers that may be good or bad; the system has marked it active so that they can be reviewed. | |
| Feb 23, 2021 at 11:26 | history | edited | Shubham Prashar | CC BY-SA 4.0 | added 43 characters in body |
| Feb 23, 2021 at 5:54 | history | edited | Shubham Prashar | CC BY-SA 4.0 | added 166 characters in body |
| Feb 22, 2021 at 20:59 | answer | added | apilat | timeline score: 1 | |
| Feb 22, 2021 at 20:54 | comment | added | RootTwo | I believe this solution is O(n^4). minimumVertex() is O(n^2) and it is called n^2 times in the nested loops in minimumCostPath(). Try using a heap to keep track of the minimum vertex. | |
| Feb 22, 2021 at 12:56 | history | edited | Shubham Prashar | CC BY-SA 4.0 | edited title |
| Feb 22, 2021 at 12:50 | review | First posts | |||
| Feb 22, 2021 at 13:01 | |||||
| Feb 22, 2021 at 12:43 | history | asked | Shubham Prashar | CC BY-SA 4.0 |