Leetcode 1004 | Maximum consecutive ones III | 16th from LC 75 | 90 days SE prep

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

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

  • @jatinshrivastava4231
    @jatinshrivastava4231 3 месяца назад

    Thank you very much.. great explanation.

  • @yuvakpatel1599
    @yuvakpatel1599 18 дней назад

    Thank you so much sir

  • @dayashankarlakhotia4943
    @dayashankarlakhotia4943 10 месяцев назад +1

    public longestOnes(int[]nums,int k){
    int ans=0;
    for(int l=0,r=0;r

  • @jaydoshi6824
    @jaydoshi6824 6 месяцев назад

    BHAI BOHOT SAHI PADHA LETE HO AAP 😃😀LOVE FROM AHMEDABAD 🧡🧡

  • @zainulabdin-h7r
    @zainulabdin-h7r 8 месяцев назад

    thanks teacher

  • @utkarshsinghchouhan8819
    @utkarshsinghchouhan8819 9 месяцев назад +1

    Sir aap conecpt ko dimag me bilkul ghusa dete ho 🫡

  • @mayankshakya9200
    @mayankshakya9200 10 месяцев назад

    Sir agar ye sliding window padna hai specially to kaha se padu aapne is topic ko nahi padaya hai aapke dsa level me

    • @Pepcoding
      @Pepcoding  10 месяцев назад

      Level2 ke hashmap heap ke question mei ye trick dikh jaegi. Common hai.

    • @utkarshsinghchouhan8819
      @utkarshsinghchouhan8819 7 месяцев назад

      Level 2 Hashmap and heap sir called the technique "Acquire and Release strategy"

  • @AkashiansTrader
    @AkashiansTrader 7 месяцев назад

    Thanks 🙏 sir