Flight Itinerary Sequel - Amazon Top Interview Questions


Problem Statement :


You are given a list of flights that were taken, represented as origin to destination airport pairs. Given that this list was shuffled, find all the airports that were visited in the correct order. If there's more than one valid itinerary, return the lexicographically smallest ones first.

Note: airports may be visited twice.

Example 1

Input

flights = [
    ["YYZ", "SEA"],
    ["JFK", "YYZ"],
    ["SEA", "JFK"]
]

Output

["JFK", "YYZ", "SEA", "JFK"]

Explanation

The three airports form a cycle so there's multiple answers but "JFK" is the lexicographically smallest answer.


Solution :



title-img 




                        Solution in C++ :

vector<string> solve(vector<vector<string>>& flights) {
    map<string, set<string>> graph;
    map<string, int> ind;
    for (auto& v : flights) {
        graph[v[0]].insert(v[1]);
        ind[v[1]]++;
        ind[v[0]];
    }

    set<pair<string, string>> used_edge;
    vector<string> ans;

    function<bool(const string&)> dfs = [&](const string& node) -> bool {
        ans.push_back(node);
        if (used_edge.size() == flights.size()) return true;
        for (auto& s : graph[node]) {
            if (used_edge.count({node, s})) continue;
            used_edge.insert({node, s});
            if (dfs(s)) return true;
            used_edge.erase({node, s});
        }
        ans.pop_back();
        return false;
    };

    bool check = false;
    for (auto& p : ind) {
        if (p.second == 0) {
            dfs(p.first);
            check = true;
            break;
        }
    }
    if (!check) {
        for (auto it = graph.begin(); it != graph.end(); it++)
            if (dfs(it->first)) break;
    }

    return ans;
}
                    




                        Solution in Python : 
                            
class Solution:
    def solve(self, flights):
        graph = defaultdict(list)
        degree = defaultdict(int)  # + in  - out

        for u, v in flights:
            graph[u].append(v)
            degree[u] -= 1
            degree[v] += 1

        for outgoing in graph.values():
            outgoing.sort(reverse=True)

        res = []
        path_start = min(degree, key=degree.__getitem__)
        circuit_start = min(graph)

        def dfs(u, graph):  # Hierholzer
            while graph[u]:
                v = graph[u].pop()
                dfs(v, graph)

            res.append(u)

        if degree[path_start] == -1:  # eulerian path ?
            dfs(path_start, graph)
        else:  # eulerian circuit
            dfs(circuit_start, graph)

        return res[::-1]


View More Similar Problems

Subsequence Weighting

A subsequence of a sequence is a sequence which is obtained by deleting zero or more elements from the sequence. You are given a sequence A in which every element is a pair of integers i.e A = [(a1, w1), (a2, w2),..., (aN, wN)]. For a subseqence B = [(b1, v1), (b2, v2), ...., (bM, vM)] of the given sequence : We call it increasing if for every i (1 <= i < M ) , bi < bi+1. Weight(B) =

View Solution →

Kindergarten Adventures

Meera teaches a class of n students, and every day in her classroom is an adventure. Today is drawing day! The students are sitting around a round table, and they are numbered from 1 to n in the clockwise direction. This means that the students are numbered 1, 2, 3, . . . , n-1, n, and students 1 and n are sitting next to each other. After letting the students draw for a certain period of ti

View Solution →

Mr. X and His Shots

A cricket match is going to be held. The field is represented by a 1D plane. A cricketer, Mr. X has N favorite shots. Each shot has a particular range. The range of the ith shot is from Ai to Bi. That means his favorite shot can be anywhere in this range. Each player on the opposite team can field only in a particular range. Player i can field from Ci to Di. You are given the N favorite shots of M

View Solution →

Jim and the Skyscrapers

Jim has invented a new flying object called HZ42. HZ42 is like a broom and can only fly horizontally, independent of the environment. One day, Jim started his flight from Dubai's highest skyscraper, traveled some distance and landed on another skyscraper of same height! So much fun! But unfortunately, new skyscrapers have been built recently. Let us describe the problem in one dimensional space

View Solution →

Palindromic Subsets

Consider a lowercase English alphabetic letter character denoted by c. A shift operation on some c turns it into the next letter in the alphabet. For example, and ,shift(a) = b , shift(e) = f, shift(z) = a . Given a zero-indexed string, s, of n lowercase letters, perform q queries on s where each query takes one of the following two forms: 1 i j t: All letters in the inclusive range from i t

View Solution →

Counting On a Tree

Taylor loves trees, and this new challenge has him stumped! Consider a tree, t, consisting of n nodes. Each node is numbered from 1 to n, and each node i has an integer, ci, attached to it. A query on tree t takes the form w x y z. To process a query, you must print the count of ordered pairs of integers ( i , j ) such that the following four conditions are all satisfied: the path from n

View Solution →