AppliedAIPrep logoAppliedAI/Prep
← SQL & Data Engineering / 44
hardSnowflakeDatabricksGoogle

Find shortest paths and detect cycles in a graph stored as edges, using a recursive CTE.

An org-chart recursion walks a tree, but a general graph has multiple paths and back-edges. The signal is accumulating the visited path to prune cycles and ranking paths by cost to get the shortest one.

Updated Aug 2026 · Grounded in real Applied AI Engineer interview loops and written to a senior-engineer editorial bar.

An org-chart recursion walks a tree, but a general graph has multiple paths and back-edges. The signal is accumulating the visited path to prune cycles and ranking paths by cost to get the shortest one.

Unlock the other 750 answers · ₹2,000 / $25Your progress and mastery stay saved · 6 months · one payment · no auto-renew
UP NEXT ON YOUR JOURNEY
Next in this trackYou have a wide table with one column per month. How do you unpivot it into tidy (key, month, value) rows?Next in this trackExplain the difference between RANGE and ROWS window frames, and when named windows help.Next in this trackWalk me through reading an EXPLAIN ANALYZE plan to find why a query is slow.
DISCUSSION · 0

No comments yet — be the first to share your approach.