0 votes 0 votes What do you suggest to do about big matrix multiplications questions in dynamic programming,because they take long time to get solved.Should we solve those questions in gate or we should leave them?I need advice on this.Please help me ou Algorithms algorithms dynamic-programming + – amitqy asked Aug 20, 2018 • retagged Jun 23, 2022 by makhdoom ghaya amitqy 307 views answer comment Share Follow See 1 comment See all 1 1 comment reply Rishav Kumar Singh commented Aug 21, 2018 reply Follow Share amitqy do you mean matrix chain multiplications? if yes then, Don't worry about that they will not ask question that you can't solve in less than 3 min. If you see recent previous year questions they are not interested in getting final result, they just want to know you can visualise it or not. In case they would ask then number of Matrices would be small and easy to analyse. By the way, You have to do practice for that. 2 votes 2 votes Please log in or register to add a comment.
0 votes 0 votes I suggest using the Dynamic Programming approach rather than the Brute Force approach because DP is kind of like bulletproof technique and works for all problems. Also, BF can be very confusing. You need some practice to master DP. AkashChandraGupta answered Aug 18, 2019 AkashChandraGupta comment Share Follow See all 0 reply Please log in or register to add a comment.
