2684. Maximum Number of Moves in a Grid | Leetcode Daily (POTD) 29 Oct 2024 | Java

[@gurveersingh5967]

Nice explanation, keep doing the good work Aditi

[@algorithmsbyaditi]

Thank you, I will.

[@QuadbTech]

You make every problem look easy!

[@algorithmsbyaditi]

Thanks, I'm trying!

[@harishbehera7812]

thanx for the solution. radhe radhe

[@algorithmsbyaditi]

Glad it was helpful!

[@Real_Gangsta-q8h]

Wonderful ! Please explain the brute force approach also . Help me with it . I am not able to build approach on my own.

[@algorithmsbyaditi]

This problem follows a particular pattern of dp problems, a similar problem is 120. Triangle on leetcode. Explore all possible cases and store answers in the dp array to avoid computation for overlapping subcases.

[@Real_Gangsta-q8h]

@@algorithmsbyaditi Thanks a ton. Aditi.

[@vemanasumanth4358]

Nice explanation Radhe Radhe

[@algorithmsbyaditi]

Thanks.

[@Omkar-fv1eg]

Please explain time and space complexities in the end of every approach, Thank you!!

[@algorithmsbyaditi]

Will improve, Thanks.

[@sivatejaysn]

brute force tak theek hai but dp thoda explain kijiye. aur time complexity aur space complexity bhi boliye

[@algorithmsbyaditi]

Will improve, Thanks.

[@sibiranganath]

it'll be really helpful for us if u make videos in english *and your channel can get even more views which you deserve*

[@algorithmsbyaditi]

Thanks for the suggestion, I'll keep it in mind!

[@Sumanth2803]

"Ma'am, in the next video, could you please explain how to participate in a LeetCode contest?"

[@algorithmsbyaditi]

I will try to create a video on this soon. Thanks.

[@meetshujah]

its hard in dark.mode to read