Problem 50594. Number Puzzle - 097
Given the following 15-by-15 matrix of numbers, find a 2-by-2 subset matrix whose sum is the highest. Please provide your answer in the form of [row_start row_end column_start column_end]. For example, if your answer is the higlighted region in the figure, then you will present it as [13 14 3 4].
Solution Stats
Solution Comments
Show commentsProblem Recent Solvers20
Suggested Problems
-
17466 Solvers
-
1878 Solvers
-
Sum of diagonal of a square matrix
1555 Solvers
-
1260 Solvers
-
Converts numbers into characters
1212 Solvers
More from this Author180
Problem Tags
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!