Course Scheduling - Amazon Top Interview Questions


Problem Statement :


You are given a two-dimensional integer list courses representing an adjacency list where courses[i] is the list of prerequisite courses needed to take course i.

Return whether it's possible to take all courses.

Constraints

n, m ≤ 250 where n and m are the number of rows and columns in matrix.

Example 1

Input

courses = [
    [1],
    [],
    [0]
]

Output

True

Explanation

We can take course 1, then course 0, and then course 2



Solution :



title-img




                        Solution in C++ :

bool solve(vector<vector<int>>& courses) {
    int n = courses.size();
    vector<int> indeg(n + 1, 0);

    // populate indegree
    for (int u = 0; u < n; u++) {
        for (int v : courses[u]) {
            indeg[v]++;
        }
    }
    // push all nodes with zero indegree
    queue<int> q;
    for (int i = 0; i < n; i++) {
        if (!indeg[i]) q.push(i);
    }

    // edge case
    if (q.size() == 0) return false;

    // topo sort
    vector<int> order;
    while (!q.empty()) {
        int u = q.front();
        order.push_back(u);
        q.pop();
        for (int v : courses[u]) {
            if (--indeg[v] == 0) {
                q.push(v);
            }
        }
    }
    // if there's no cycle topo order will have n nodes in it
    return order.size() == n;
}
                    




                        Solution in Python : 
                            
class Solution:
    def solve(self, courses):
        # Initialize list of indegrees for each vertex
        indegrees = [0] * len(courses)

        # Populate the indegrees by going through the adjacency list
        for adj in courses:
            for dest in adj:
                indegrees[dest] += 1

        # Similarly to a classical BFS, we take advantage of a double-ended queue
        # The queue contains all elements which have indegree == 0
        queue = deque([i for i in range(len(indegrees)) if indegrees[i] == 0])

        while queue:
            for _ in range(len(queue)):
                source = queue.popleft()

                # Go through neighbours and remove that edge, insert in queue if
                # queue condition is verified -> indegree == 0
                for elem in courses[source]:
                    indegrees[elem] -= 1
                    if indegrees[elem] == 0:
                        queue.append(elem)

        # Ensure that all the indegrees have been correctly removed
        return all(indegree == 0 for indegree in indegrees)
                    


View More Similar Problems

Swap Nodes [Algo]

A binary tree is a tree which is characterized by one of the following properties: It can be empty (null). It contains a root node only. It contains a root node with a left subtree, a right subtree, or both. These subtrees are also binary trees. In-order traversal is performed as Traverse the left subtree. Visit root. Traverse the right subtree. For this in-order traversal, start from

View Solution →

Kitty's Calculations on a Tree

Kitty has a tree, T , consisting of n nodes where each node is uniquely labeled from 1 to n . Her friend Alex gave her q sets, where each set contains k distinct nodes. Kitty needs to calculate the following expression on each set: where: { u ,v } denotes an unordered pair of nodes belonging to the set. dist(u , v) denotes the number of edges on the unique (shortest) path between nodes a

View Solution →

Is This a Binary Search Tree?

For the purposes of this challenge, we define a binary tree to be a binary search tree with the following ordering requirements: The data value of every node in a node's left subtree is less than the data value of that node. The data value of every node in a node's right subtree is greater than the data value of that node. Given the root node of a binary tree, can you determine if it's also a

View Solution →

Square-Ten Tree

The square-ten tree decomposition of an array is defined as follows: The lowest () level of the square-ten tree consists of single array elements in their natural order. The level (starting from ) of the square-ten tree consists of subsequent array subsegments of length in their natural order. Thus, the level contains subsegments of length , the level contains subsegments of length , the

View Solution →

Balanced Forest

Greg has a tree of nodes containing integer data. He wants to insert a node with some non-zero integer value somewhere into the tree. His goal is to be able to cut two edges and have the values of each of the three new trees sum to the same amount. This is called a balanced forest. Being frugal, the data value he inserts should be minimal. Determine the minimal amount that a new node can have to a

View Solution →

Jenny's Subtrees

Jenny loves experimenting with trees. Her favorite tree has n nodes connected by n - 1 edges, and each edge is ` unit in length. She wants to cut a subtree (i.e., a connected part of the original tree) of radius r from this tree by performing the following two steps: 1. Choose a node, x , from the tree. 2. Cut a subtree consisting of all nodes which are not further than r units from node x .

View Solution →