3303. Find the Occurrence of First Almost Equal Substring (Leetcode Hard)

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

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

  • @Algorithmist
    @Algorithmist  Месяц назад

    Were you able to get them to almost be right?

  • @winoal
    @winoal Месяц назад

    Hi, thank you for the great explanation on Rabin-Karp. May i ask how do you determine what value to use for the modulo? Too small a modulo leads to incorrect hash matches but i am not sure how big my modulo can go. Thank you.

    • @Algorithmist
      @Algorithmist  Месяц назад

      Basically the tradeoff is more time and space, so there's no right answers, but just what you need it for

  • @Niku-c6z
    @Niku-c6z Месяц назад

    Hello I don't know how to do this and I'm in 12th grade can I get in good company without good college's/University.. And how should I start learning this by starting and by starting i mean starting

    • @Algorithmist
      @Algorithmist  Месяц назад +1

      If it's what you're passionate about you can start early.. but who knows what happens in 4-5 years