How should I practice Course Schedule?

Start by reading the full statement, solve the visible examples, then compare the pattern against related Amazon online assessment problems in FastPrep.

Is Course Schedule associated with Amazon?

FastPrep tags this as a Amazon coding interview or online assessment practice problem when the problem catalog has that company context.

FastPrep

Problem · Graph

Course Schedule

● MediumAmazonONSITE INTERVIEW

See Amazon hiring insights

Source note: This problem is backed by a real Amazon onsite interview report. The report named Course Schedule and discussed graph modeling, topological sorting, and cycle detection, but it did not say whether the requested result was feasibility or an ordering and did not include a function interface, examples, or constraints. This judged version uses the feasibility form, so the core task match is about 85%.

The problem statement continues

Pro

Examples

01 · Example 1

numCourses = 2
prerequisites = [[1,0]]
return = true

Original screenshot from the interview report

Pro

FastPrep Pro

Reported in 1 Amazon interview this week

Unlock the full problem

Full problem statement and constraints
1 more worked example, explained
Guided hints and editorial
Run your code on real test cases

$9/month

Pro subscription, billed yearly — or $19 month-to-month. Cancel anytime.

Free plan — 2 of 2 free unlocks used this week

CodePython 3

import heapq
from collections import defaultdict
 
class Solution:
    def solve(self, values, queries):
        # Build the adjacency structure
        n = len(values)
        graph = defaultdict(list)
        for u, v in queries:
            graph[u].append(v)
 
        best = [float("inf")] * n
        heap = [(0, 0)]
        while heap:
            cost, node = heapq.heappop(heap)
            if cost > best[node]:
                continue

Run and Submit unlock with Pro