Rotate List | Leetcode 61 | Linked List | Day-11

Sdílet
Vložit
  • čas přidán 10. 03. 2022
  • Time Complexity : O(n)
    Space Complexity : O(1)
    Problem Link : leetcode.com/problems/rotate-...
    C++ Code Link : github.com/Ayu-99/Data-Struct...
    Python Code Link: github.com/Ayu-99/Data-Struct...
    Java Code Link : github.com/Ayu-99/Data-Struct...
    Please like, share and subscribe if you found the video useful. Feel free to ask in comments section if you have any doubts. :)
    #DataStructuresAndAlgorithms
    #RotateList
    #interviewpreparation
    Rotate List solution
    Rotate List Leetcode
    Rotate List C++
    Rotate List Java
    Rotate List Python
    🔥🔥🔥🔥👇👇👇
    Join telegram channel for more updates on placement preparation : t.me/AyushiSharmaDiscussionGroup
    Checkout the series: 🔥🔥🔥
    👉Interview Experiences : • Interview Experiences
    👉 Array: • Arrays
    👉 Linked List : • Linked List
    👉 Heap : • Heap
    👉 Recursion : • Recursion
    👉 Stack and Queue : • Stack And Queue
    👉 Greedy : • Greedy
    👉 Dynamic Programming : • Dynamic Programming
    👉 Leetcode contests : • Leetcode contests
    👉 Leetcode June Challenge : • Leetcode June Challenge
    👉 Leetcode July Challenge : • Leetcode July Challenge
    LIKE | SHARE | SUBSCRIBE 🔥🔥😊

Komentáře • 48

  • @codemachine7381
    @codemachine7381 Před rokem +2

    By learning through ur channel, I've cleared Adobe internship.
    Thanks a lot diiii❤❤

  • @vardhamanmodi3615
    @vardhamanmodi3615 Před 6 měsíci

    Amazing explanation. Thank you very much Ayushi Sharma Ji.

  • @karanjitsinghrandhawa445
    @karanjitsinghrandhawa445 Před 2 lety +2

    Helpful
    Keep going
    Aap bohot acha kar rhe ho sach mein
    Bhagwan ji aapko duniya ki saari khushiyan de in the coming months

  • @shreyasnaphad3284
    @shreyasnaphad3284 Před 2 lety +1

    Amazing explanation as always! Fortunately found out about this channel a few days ago. I will be watching every video along with new ones. Tremendous!

    • @AyushiSharmaDSA
      @AyushiSharmaDSA  Před 2 lety +1

      Thank you so much Shreyas, 🥺😊

    • @FindARandom
      @FindARandom Před rokem

      @@AyushiSharmaDSA that's great sister i love your explanation ofcourse DNA matters (brahman)

  • @ashishverma4822
    @ashishverma4822 Před rokem

    Thank you so much didi.... finally smjh aa gaya

  • @vatsalkudecha2746
    @vatsalkudecha2746 Před 2 lety

    Really! Worth waiting for this video...Thank you.

  • @vinay2957
    @vinay2957 Před měsícem

    amazing content

  • @asmitswarnakar7551
    @asmitswarnakar7551 Před 9 měsíci

    Thanks di , bohot koshis k baad bhi nehi ho raha tha , thank you so much ❤

  • @akb3689
    @akb3689 Před 2 lety +1

    Keep going 🔥🔥🔥
    I hope this will help me for my placements

  • @rajdave7357
    @rajdave7357 Před 2 lety

    Thanks a lot for this explanation

  • @manojgmanojg9600
    @manojgmanojg9600 Před rokem

    Amazing Explanation.

  • @mohit8299
    @mohit8299 Před 2 lety

    Liking video before watching 💥

  • @amitsinha806
    @amitsinha806 Před 2 lety +1

    I am appreciate your work .👍👍👍👍👍

  • @ChandraShekhar-by3cd
    @ChandraShekhar-by3cd Před 2 lety +1

    First Like, First comment .😊😊

  • @decadewgame9802
    @decadewgame9802 Před 2 lety

    Hey can you tell me which software are you using for drawing and explanation?

    • @AyushiSharmaDSA
      @AyushiSharmaDSA  Před 2 lety

      Microsoft whiteboard for drawing, obs studio for screen recording, filmora for editing

  • @vanisai2299
    @vanisai2299 Před 2 lety

    Di can u pls explain the for loop like for(auto i=0;i2->3->4->5->NULL

    • @AyushiSharmaDSA
      @AyushiSharmaDSA  Před 2 lety +1

      Hi Vani,
      Lets take linkedlist 1->2->3->4->5, so here len = 5 and lets say k = 2
      then after first while loop, tail will be at 5.
      and 5->next we will change to 1, so 5->next = 1
      then comes the for loop, so it will run 3 times, i = 0, 1, 2 as(i < (len-k) -> i < 3)
      so, in first iteration, i=0, tail will move from 5 and will come to 1,
      in second iteration, i=1, tail will move from 1 and will come to 2,
      in third iteration, i=2, tail will move from 2 and will come to 3,
      I hope its clear :)

  • @starbawa5587
    @starbawa5587 Před 2 lety

    Are you a final year student 😀?

  • @sadashivshinde9150
    @sadashivshinde9150 Před 2 lety

    why is len=1

  • @shivamnegi7552
    @shivamnegi7552 Před 2 lety

    kal video kyu ni ayi :( wait krte rehgye :(

    • @AyushiSharmaDSA
      @AyushiSharmaDSA  Před 2 lety

      Hi Shivam, sorry, but kal ki problem pe pehle video bnayi hui thi, 🙂

    • @AyushiSharmaDSA
      @AyushiSharmaDSA  Před 2 lety

      Isiliye dubara nhi bnayi

    • @shivamnegi7552
      @shivamnegi7552 Před 2 lety

      @@AyushiSharmaDSAye batana chahiye tha na :( iske liye yt shorts nikal dete :) engagement bhi badh jata .. huehue #hacks

    • @AyushiSharmaDSA
      @AyushiSharmaDSA  Před 2 lety +1

      @@shivamnegi7552 acha😅

  • @spardha-yug
    @spardha-yug Před rokem

    This video is not up to the mark.
    Here we can clearly see, you are lacking knowledge (as far as this problem is concerned).
    However, your other videos are unbeatable. As the member of your channel I will be pointing out any flaws I found . Please take it constructively to get better to best.
    Thanks a ton.