Friday, 14 December 2018

Dynamic programming problem

Given a binary matrix, find out the maximum size square sub-matrix with all 1s.
For example, consider the below binary matrix.
maximum-size-square-sub-matrix-with-all-1s
Please suggest solution to this in comment section.
at

No comments:

Post a Comment

Subscribe to: Post Comments (Atom)

Dynamic programming problem

Given a binary matrix, find out the maximum size square sub-matrix with all 1s. For example, consider the below binary matrix. Please...

  • Getline Function
    #include <iostream> #include<string> using namespace std; int main() {    string s;    getline(cin,s);    cout<<s...