Greedy vs DP, quick sort vs merge sort, DFS vs BFS
Filed under Fidelity Investments
The question
Explain greedy algorithms and dynamic programming, compare quick sort and merge sort efficiency, say when DFS versus BFS (and a stack) is used, and describe level order traversal.
No write-up yet. Related questions below have one.
Related Fidelity Investments questions
Collected from public candidate posts and coding forums. Updated Nov 2026.