← Back to Codes
C++
Minimum Path Sum
Finds the path from top left to bottom right in a grid with minimum sum.
min_path_sum.cpp
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
int main() {
cout << "INSTRUCTIONS: Enter dimensions N M, then grid rows." << endl;
int n, m;
cin >> n >> m;
vector<vector<int>> g(n, vector<int>(m));
for (int i = 0; i < n; i++)
for (int j = 0; j < m; j++)
cin >> g[i][j];
for (int i = 1; i < n; i++) g[i][0] += g[i - 1][0];
for (int j = 1; j < m; j++) g[0][j] += g[0][j - 1];
for (int i = 1; i < n; i++)
for (int j = 1; j < m; j++)
g[i][j] += min(g[i - 1][j], g[i][j - 1]);
cout << g[n - 1][m - 1];
}Minimum Path Sum — Free C++, C, Python Code Example
Finds the path from top left to bottom right in a grid with minimum sum. This free code example is available in C++, C, Python and can be copied and run immediately — no account or signup required. Use the language tabs above to switch between implementations.
How to Use This Code
- Select your language — click the language tab (C, Java, C++, or Python) above the code viewer.
- Copy the code — use the copy button in the top-right corner of the code block.
- Run it — paste into a file with the correct extension (.c, .java, .cpp, .py), compile, and run using your terminal or IDE.
- Follow the on-screen instructions in the terminal to provide any required inputs.
Frequently Asked Questions
What does this program do?
Finds the path from top left to bottom right in a grid with minimum sum.
Which languages is it available in?
Available in C++, C, Python. Switch between implementations using the tabs at the top of the code viewer.
How do I run this code?
Copy the code, save it with the right file extension (.c, .java, .cpp, or .py), then compile or run it with your installed compiler or interpreter (GCC, JDK, G++, Python 3).
Is this code free?
Yes — free to view, copy, and use. No account required.