Longest Substring Without Repeating Characters | Leet code 3 | Theory explained + Python code

Поделиться
HTML-код
  • Опубликовано: 15 янв 2025

Комментарии • 16

  • @JumaleAbdi-tu3zh
    @JumaleAbdi-tu3zh 6 месяцев назад

    Bro this is brilliant
    I struggled with this question for days and now I got the logic. Your explanations are just phenomenal, thank you

  • @prasantainment3001
    @prasantainment3001 3 года назад +3

    you explained this problem better than most of them

  • @jahirraihanjoy3466
    @jahirraihanjoy3466 3 года назад +5

    i was not looking for solution . Actually i wanted to understand the logic behind this Algorithm.
    Thanks dude for your help.
    Trust me i've watched 2 -3 videos to understand the logic but by your's one i get it very clearly.
    Thanks again :).

  • @anupamasingh9858
    @anupamasingh9858 3 года назад +1

    This was so easy to understand! Thank you :)

  • @nk19087
    @nk19087 2 года назад

    this was truly so well explained! Thank you!!

  • @ramizrizwan3057
    @ramizrizwan3057 2 года назад

    This is so helpful- thank you

  • @vikasviki7490
    @vikasviki7490 4 года назад +1

    You Rock Buddy.

  • @ishayadav001
    @ishayadav001 4 года назад +1

    Great video!!

  • @stunning-computer-99
    @stunning-computer-99 2 года назад

    amazing explanation.

  • @MynamedidntFitDonkey
    @MynamedidntFitDonkey 2 года назад

    nice bro

  • @duchieuvn8358
    @duchieuvn8358 2 года назад

    good work, thank you bro

  • @PriyaAmar848
    @PriyaAmar848 3 года назад

    Very nice explanation . Keep doing more videos

  • @gauravpatil7977
    @gauravpatil7977 3 года назад

    explained very well bro! can u tell me how to come up with solutions of these kind of complex problems?

  • @MarlonCuna
    @MarlonCuna 2 года назад

    what a goat