Problem 50599. Number Puzzle - 098
Given the following 15-by-15 matrix of numbers, find a 2-by-2 subset matrix whose sum is the smallest. 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
-
Sort a list of complex numbers based on far they are from the origin.
5603 Solvers
-
Return a list sorted by number of occurrences
2753 Solvers
-
Project Euler: Problem 8, Find largest product in a large string of numbers
1079 Solvers
-
1070 Solvers
-
Return fibonacci sequence do not use loop and condition
528 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!