Longest Repeating Character Replacement (LeetCode 424) | Single iteration | Sliding Window

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

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

  • @siddharthaarora4351
    @siddharthaarora4351 17 дней назад +1

    surely the best teaching style.
    5

  • @BruceWayne-lm6xt
    @BruceWayne-lm6xt 8 дней назад

    best teaching style
    awesome

  • @aviral18ak
    @aviral18ak 2 месяца назад

    haha solving 150 LC questions, you uploaded it at right time, appreciate the efforts, I mostly see only your explanations and no one else, bcz your approach is awesome, please be consistent and make more LC solutions

  • @arnabdaw2587
    @arnabdaw2587 4 дня назад

    One doubt when we are reducing the window size inside the '"if block" , do we need not to update the maxfreq ??

  • @saikrishnapechetti8382
    @saikrishnapechetti8382 2 месяца назад

    Nice Explanation❤

  • @unknownman1
    @unknownman1 2 месяца назад

    Thanks!

  • @deepakkumar-sk4kj
    @deepakkumar-sk4kj 2 месяца назад

    Please do make video for this problem : Longest Substring Without Repeating Characters( leetcode 3)

    • @nikoo28
      @nikoo28  2 месяца назад +1

      sure..I will add it to my pipeline

  • @ooobhaiii07
    @ooobhaiii07 2 месяца назад

    Hii Nikhil sir, Its always intresting to solve data structure problems with ur guidance , but what struct my mind is what are the possible projects tat can be done using dsa ?? please let me know it would be a alot helpful for my placements :)
    Thank you so much 😸

  • @souvikchatterjee7400
    @souvikchatterjee7400 2 месяца назад

    I have one doubt.
    When window size was 5 and max frequency was 2, number of iterations was 5-2=3 which was greater than k which is 2. Why we didn't reduce the window ?

  • @ak-vk6gl
    @ak-vk6gl 2 месяца назад

    please can you make a Playlist hash table

    • @nikoo28
      @nikoo28  2 месяца назад +1

      will do