Title: Day-23 q1 Minimum falling path sum · Issue #446 · SnowScriptWinterOfCode/LeetCode_Q · GitHub
Open Graph Title: Day-23 q1 Minimum falling path sum · Issue #446 · SnowScriptWinterOfCode/LeetCode_Q
X Title: Day-23 q1 Minimum falling path sum · Issue #446 · SnowScriptWinterOfCode/LeetCode_Q
Description: Minimum Falling Path Sum Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. A falling path starts at any element in the first row and chooses the element in the next row that is either dir...
Open Graph Description: Minimum Falling Path Sum Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. A falling path starts at any element in the first row and chooses the el...
X Description: Minimum Falling Path Sum Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. A falling path starts at any element in the first row and chooses the el...
Opengraph URL: https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/446
X: @github
Domain: github.com
{"@context":"https://schema.org","@type":"DiscussionForumPosting","headline":"Day-23 q1 Minimum falling path sum ","articleBody":"# Minimum Falling Path Sum\r\n\r\nGiven an n x n array of integers `matrix`, return the minimum sum of any falling path through matrix. \r\nA falling path starts at any element in the first row and chooses the element in the next row that is either directly below or diagonally left/right.\r\nSpecifically, the next element from position (row, col) will be (row + 1, col - 1), (row + 1, col), or (row + 1, col + 1). \r\n\r\n## Example 1:\r\n\r\n \r\n`Input`: matrix = [[2,1,3],[6,5,4],[7,8,9]] \r\n`Output`: 13 \r\n`Explanation`: There are two falling paths with a minimum sum as shown. \r\n\r\n## Example 2: \r\n\r\n \r\n\r\n`Input`: matrix = [[-19,57],[-40,-5]] \r\n`Output`: -59 \r\n`Explanation`: The falling path with a minimum sum is shown. \r\n\r\n ## Constraints:\r\n\r\n- n == matrix.length == matrix[i].length \r\n- 1 \u003c= n \u003c= 100 \r\n- -100 \u003c= matrix[i][j] \u003c= 100 ","author":{"url":"https://github.com/SonaVarshney","@type":"Person","name":"SonaVarshney"},"datePublished":"2024-01-19T14:06:03Z","url":"https://github.com/SnowScriptWinterOfCode/LeetCode_Q/issues/446"}
| react-profiling | 0 |
| react-import-map | react,react-dom,react-dom/client,react-dom/profiling,react-is,react/compiler-runtime,react/jsx-dev-runtime,react/jsx-runtime,scheduler@b8488ee2c322 |
| route-pattern | /_view_fragments/issues/show/:user_id/:repository/:id/issue_layout(.:format) |
| route-controller | voltron_issues_fragments |
| route-action | issue_layout |
| fetch-nonce | v2:64439406-edd6-4f41-7a3a-4d112ce65be0 |
| current-catalog-service-hash | 81bb79d38c15960b92d99bca9288a9108c7a47b18f2423d0f6438c5b7bcd2114 |
| request-id | C262:3C2A9A:7C0616:A0BCAF:6AFFCECD |
| html-safe-nonce | 4f9c33c05ac97b8153a105283e084fb766980afb74b1e41aad83f837f9f334d9 |
| visitor-payload | eyJyZWZlcnJlciI6IiIsInJlcXVlc3RfaWQiOiJDMjYyOjNDMkE5QTo3QzA2MTY6QTBCQ0FGOjZBRkZDRUNEIiwidmlzaXRvcl9pZCI6IjY3NzgzMDEyNjA3NDAxNTMwMzciLCJyZWdpb25fZWRnZSI6ImlhZCIsInJlZ2lvbl9yZW5kZXIiOiJpYWQifQ== |
| visitor-hmac | e5206c4b6e378a5f0241851a9ffa086c40f796521ef5a51ef615a970069d4b85 |
| hovercard-subject-tag | issue:2090641623 |
| github-keyboard-shortcuts | repository,issues,copilot |
| google-site-verification | Apib7-x98H0j5cPqHWwSMm6dNU4GmODRoqxLiDzdx9I |
| octolytics-url | https://collector.github.com/github/collect |
| analytics-location | / |
| fb:app_id | 1401488693436528 |
| apple-itunes-app | app-id=1477376905, app-argument=https://github.com/_view_fragments/issues/show/SnowScriptWinterOfCode/LeetCode_Q/446/issue_layout |
| twitter:image | https://opengraph.githubassets.com/1f198fdb56e7eeb1c00b58cf95d75c3249309525365055fe7847188494543484/SnowScriptWinterOfCode/LeetCode_Q/issues/446 |
| twitter:card | summary_large_image |
| og:image | https://opengraph.githubassets.com/1f198fdb56e7eeb1c00b58cf95d75c3249309525365055fe7847188494543484/SnowScriptWinterOfCode/LeetCode_Q/issues/446 |
| og:image:alt | Minimum Falling Path Sum Given an n x n array of integers matrix, return the minimum sum of any falling path through matrix. A falling path starts at any element in the first row and chooses the el... |
| og:image:width | 1200 |
| og:image:height | 600 |
| og:site_name | GitHub |
| og:type | object |
| og:author:username | SonaVarshney |
| hostname | github.com |
| expected-hostname | github.com |
| None | 0a0d8686a27478df474dd7415776a7a080cde8838b3cd92ea7601187572e5729 |
| turbo-cache-control | no-preview |
| go-import | github.com/SnowScriptWinterOfCode/LeetCode_Q git https://github.com/SnowScriptWinterOfCode/LeetCode_Q.git |
| octolytics-dimension-user_id | 154897622 |
| octolytics-dimension-user_login | SnowScriptWinterOfCode |
| octolytics-dimension-repository_id | 735947375 |
| octolytics-dimension-repository_nwo | SnowScriptWinterOfCode/LeetCode_Q |
| octolytics-dimension-repository_public | true |
| octolytics-dimension-repository_is_fork | false |
| octolytics-dimension-repository_network_root_id | 735947375 |
| octolytics-dimension-repository_network_root_nwo | SnowScriptWinterOfCode/LeetCode_Q |
| turbo-body-classes | logged-out env-production page-responsive |
| disable-turbo | false |
| browser-stats-url | https://api.github.com/_private/browser/stats |
| browser-errors-url | https://api.github.com/_private/browser/errors |
| release | 16a11879678aaf97e2a42c33ee70830aa084fa37 |
| ui-target | full |
| theme-color | #1e2327 |
| color-scheme | light dark |
| react-app-name | issues |
Links:
Viewport: width=device-width