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 Solvers23
Suggested Problems
-
How to find the position of an element in a vector without using the find function
2809 Solvers
-
Back to basics 11 - Max Integer
807 Solvers
-
Find the sides of an isosceles triangle when given its area and height from its base to apex
2132 Solvers
-
Spot the First Occurrence of 5
431 Solvers
-
21 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!