Problem
Given an N x N matrix (2 ≤ N ≤ 6), starting from the top-left cell (0,0), you can only move right or down. Find the maximum path sum to (N-1,N-1) using recursion.
Input format
Input
input.txt
- First line: N - Next N lines: N integers per line
Output format
Output
output.txt
- The maximum path sum
Example
input
2 1 2 3 4
output
8
💬 Discussion
Loading...💬
No comments yet. Be the first to start the discussion!
💻 No output yet.
Click Run in the editor to execute your code with the custom input.
Sample cases (from the problem)
Sample Case 1
Input
2 1 2 3 4
Expected output
8
Solve it your way first
Community solutions unlock after you submit a passing solution. Don't peek.
Ready to solve this challenge?
Create a free account to write code, submit solutions, and track your progress.
⌨️ Keyboard Shortcuts
Code Editor
Run Code
Ctrl
Enter
Submit Code
Ctrl
Shift
Enter
Format Code
Shift
Alt
F
Toggle Comment
Ctrl
/
Undo
Ctrl
Z
Redo
Ctrl
Y
Navigation
Global Search
/
Show Shortcuts
?
Close Modal
Esc