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

Поділитися
Вставка
  • Опубліковано 3 лис 2024

КОМЕНТАРІ • 8

  • @gouravbarnwal
    @gouravbarnwal 3 місяці тому +1

    Thank you for the explaination.

  • @kristoshivam1709
    @kristoshivam1709 3 місяці тому +1

    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 🥰

  • @QuadbTech
    @QuadbTech 3 місяці тому

    Good one !

  • @ShubhamPatil-ig9qe
    @ShubhamPatil-ig9qe 3 місяці тому +1

    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

  • @animeshchourasia9374
    @animeshchourasia9374 3 місяці тому

    good