René's URL Explorer Experiment

{"@context":"https://schema.org","@type":"Code","url":"https://leetcodejavascript.com/solutions/reconstruct-itinerary","name":"#332 - Reconstruct Itinerary - LeetCode JavaScript Solutions","description":"You are given a list of airline tickets where tickets[i] = [fromi, toi] represent the departure and the arrival airports of one flight. Reco...","programmingLanguage":"JavaScript","codeRepository":"https://github.com/JoshCrozier/leetcode-javascript","codeSampleType":"JavaScript","text":"/**\n * @param {string[][]} tickets\n * @return {string[]}\n */\nvar findItinerary = function(tickets) {\n const graph = new Map();\n const itinerary = [];\n\n for (const [from, to] of tickets) {\n if (!graph.has(from)) {\n graph.set(from, []);\n }\n graph.get(from).push(to);\n }\n\n for (const [_, destinations] of graph) {\n destinations.sort().reverse();\n }\n\n dfs('JFK');\n\n return itinerary.reverse();\n\n function dfs(airport) {\n while (graph.has(airport) && graph.get(airport).length) {\n dfs(graph.get(airport).pop());\n }\n itinerary.push(airport);\n }\n};","keywords":"LeetCode 332, #332 - Reconstruct Itinerary, Hard, JavaScript solution","learningResourceType":"Code","isAccessibleForFree":true,"educationalLevel":"intermediate","interactivityType":"mixed"}