Find Minimum Time to Reach Last Room I & II || Dijkstra's Algorithm || Leetcode Weekly Contest 422

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

КОМЕНТАРІ • 4

  • @malavipande6693
    @malavipande6693 5 днів тому

    Hey Hi.,
    Thank You for the video
    From the morning I am literally searching for good explanation approaches for these 2 problem.
    Like I have a doubt in the problem they mentioned that "Two rooms are adjacent if they share a common wall, either horizontally or vertically."
    You haven't talk about this need some clarity on this.
    In addition to that I have a small suggestion
    1. I get what your saying but it would be even more good if you took 2 more examples while explaining
    2. as Dijkstra's Algorithm relate graph problems you can also mention this as well.
    3. explain while writing the code.
    Thank You !!

    • @U-DAY
      @U-DAY  5 днів тому +1

      @@malavipande6693 yeah sure thank you for the suggestions definitely I'll try to implement in my next videos

  • @vijayyyyyyyy6yyyyyyyy
    @vijayyyyyyyy6yyyyyyyy 4 дні тому

    can i use recursion + memo?

    • @U-DAY
      @U-DAY  4 дні тому

      @@vijayyyyyyyy6yyyyyyyy no it's not possible