{"type":"video","version":"1.0","html":"<iframe src=\"https://www.loom.com/embed/7ced9b9924df4f589204766d18f35518\" frameborder=\"0\" width=\"1280\" height=\"960\" webkitallowfullscreen mozallowfullscreen allowfullscreen></iframe>","height":960,"width":1280,"provider_name":"Loom","provider_url":"https://www.loom.com","thumbnail_height":960,"thumbnail_width":1280,"thumbnail_url":"https://cdn.loom.com/sessions/thumbnails/7ced9b9924df4f589204766d18f35518-1719560008860.gif","duration":292.517,"title":" leet code(64) Maximum Path Sum","description":"In this video, I explain how to solve the 64th problem, the maximum path sum problem, using dynamic programming. We work with a matrix of M rows and N columns, moving from the top left to the bottom right corner by only moving right or down. I provide step-by-step guidance on initializing arrays, calculating values, and reaching the final sum. Viewers are instructed to focus on minimizing the sum to complete the matrix successfully."}