The dynamic programming implementation of the maximum sum rectangle problem uses which of the following algorithm?
(a) Hirschberg’s algorithm
(b) Needleman-Wunsch algorithm
(c) Kadane’s algorithm
(d) Wagner Fischer algorithm
I have been asked this question at a job interview.
Question is taken from Maximum Sum Rectangle in a 2D Matrix topic in portion Dynamic Programming of Data Structures & Algorithms II