2976. Minimum Cost to Convert String I | Leetcode Daily (POTD) 27 July 2024 | Java | Hindi | graphs

[@gouravbarnwal]

Thank you for the explaination.

[@algorithmsbyaditi]

Keep watching !

[@kristoshivam1709]

The way you explain the concept is Marvellous🎉. Ma'am i am watching your each video and basically I am learning from you so thank you ma'am 🥰

[@algorithmsbyaditi]

Thank youu !

[@ShubhamPatil-ig9qe]

Good explanation. But, I think we don't require that for loop which makes the diagonal or same value char zero. As anyway we are skipping it in final calculation. Also, instead of >= that condition should be == Integer.MAX_VALUE

[@algorithmsbyaditi]

@@ShubhamPatil-ig9qe good observations indeed !

[@QuadbTech]

Good one !

[@animeshchourasia9374]

good