Algorithm Designex07e2_iss
Increasing Sequence Sum
345a90fa-23d1-4871-b5d9-6c0223339f93.cppC++
1// Loading code...Selected Submission
100 / 100
0.017s
1524 KB
BacktrackImplementation
Time Comp.
O(branching factor ^ depth)
Space Comp.
O(depth)
Readability
5/10
"The code uses recursion to find all possible combinations of numbers that sum up to 'n', starting from 1. This is a classic backtracking approach where the function explores different paths and reverts when a path doesn't lead to a solution."
History
| Attempt | Points | Time ↓ |
|---|---|---|
| Try #6 | 100 | 4/16/2025 |
| Try #5 | 100 | 4/13/2025 |
| Try #4 | 100 | 4/13/2025 |
| Try #3 | 0 | 4/13/2025 |
| Try #2 | 100 | 4/13/2025 |
| Try #1 | 100 | 4/13/2025 |