This project is for finding the largest square submatrix, that all of whose all entries are 0 inside a big matrix. You need to use both methods, Brute Force & Dynamic Programming.
Please see the attachment for more details.
Hi there, I do Java programming and algorithms. I went through the sub-matrix requirements in the document and I would like to do this project if given the opportunity. Let me know if you are interested.
12 freelancers are bidding on average $128 for this job
Hi Dear. I am very interesting in your job. I am a java developer and I have good algorithm. I am sure I can do your job and can do your job well. plz, discuss with me about your job.
I am sure any random developer can solve problem and write code but I can write optimize and clean code which make me best fit for this project if you don't like work will give money back.