Dynamic Programming In Data Structures - Study Mode
[#71] What is the space complexity of the above implementation of Wagner-Fischer algorithm where "m" and "n" are the lengths of the two strings?
Correct Answer
(C) O(mn)
[#72] Consider the 2×3 matrix {{1,2,3},{1,2,3}}. What is the sum of elements of the maximum sum rectangle?
Correct Answer
(C) 12
[#73] In which of the following cases, it is not possible to have two subsets with equal sum?
Correct Answer
(C) When the sum of elements is odd
[#74] Which of the following numbers is the 6th Catalan number?
Correct Answer
(D) 42
[#75] There are n dice with f faces. The faces are numbered from 1 to f. What is the maximum possible sum that can be obtained when the n dice are rolled together?
Correct Answer
(D) n*f