Campus Paths
Given an undirected graph of rooms and paths, count how many rooms can be reached from room 1.
Open problemProblems
Build problem-solving habits with topic filters, difficulty levels, visible examples, and an online code workspace.
Choose a Python Foundations, coding practice, or PCEP review path and work through problems in order.
Difficulty
Showing 5 of 30 problems
Clear filtersGiven an undirected graph of rooms and paths, count how many rooms can be reached from room 1.
Open problemGiven module study times and readiness values, choose modules whose total time is at most `T` and maximize total readiness.
Open problemGiven start and end times for workshops, determine the maximum number happening at the same time. End times are exclusive.
Open problemGiven daily practice minutes and a window size `k`, find the maximum total practice minutes over any consecutive `k` days.
Open problemGiven scores and a threshold `t`, count how many scores are at least `t`.
Open problem