CodingModerate
Shortest path in unweighted graph, balanced BST and Kadane's algorithm
Filed under Josh Technology
The question
Find the shortest path in an unweighted graph using BFS, implement a balanced binary search tree, and find the maximum subarray sum using Kadane's algorithm.
No write-up yet. Related questions below have one.
Related Josh Technology questions
Collected from public candidate posts and coding forums. Updated Nov 2026.