Algorithm Designa66_q1a_day_cover
Day Cover
7259ba3e-3ec4-4d2b-ba4c-dafe55a84ed7.cppC++
1// Loading code...Selected Submission
65 / 100
1.6s
1572 KB
Backtrack
Time Comp.
O(2^n)
Space Comp.
O(n)
Readability
4/10
"The code uses a recursive approach to explore all possible combinations of students to find the minimum number of students needed to cover all days. This is a classic backtracking problem, as it explores a search space by trying different choices and undoing them if they don't lead to a solution."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #10 | 65 | 2/3/2025 |
| Try #9 | 0 | 2/3/2025 |
| Try #8 | 65 | 2/3/2025 |
| Try #7 | 65 | 2/3/2025 |
| Try #6 | 65 | 2/3/2025 |
| Try #5 | 0 | 2/3/2025 |
| Try #4 | 65 | 2/3/2025 |
| Try #3 | 65 | 2/1/2025 |
| Try #2 | 65 | 2/1/2025 |
| Try #1 | 65 | 2/1/2025 |