Rotate List | Leetcode 61 | Linked List | Day-11
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 🔥🔥😊
By learning through ur channel, I've cleared Adobe internship.
Thanks a lot diiii❤❤
Congratulations 🥳
Happy for you 🧡🧡
Amazing explanation. Thank you very much Ayushi Sharma Ji.
Welcome Vardhaman :)
Helpful
Keep going
Aap bohot acha kar rhe ho sach mein
Bhagwan ji aapko duniya ki saari khushiyan de in the coming months
Thank you so much Karanjit :)
Means a lot
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!
Thank you so much Shreyas, 🥺😊
@@AyushiSharmaDSA that's great sister i love your explanation ofcourse DNA matters (brahman)
Thank you so much didi.... finally smjh aa gaya
Wlcm Ashish, glad it was helpful 🤗
Really! Worth waiting for this video...Thank you.
Welcome Vatsal :)
Glad it was helpful
amazing content
thank you vinay :)
Thanks di , bohot koshis k baad bhi nehi ho raha tha , thank you so much ❤
welcome, glad it was helpful :)
Keep going 🔥🔥🔥
I hope this will help me for my placements
Thanks Amit :)
Thanks a lot for this explanation
Welcome Raj, glad it was helpful :)
Amazing Explanation.
Thanks Manoj 🤗
Liking video before watching 💥
Thanks Mohit :)
I am appreciate your work .👍👍👍👍👍
Thank you so much Amit :)
@@AyushiSharmaDSA Are you doing job at Walmart??
First Like, First comment .😊😊
🙌🏻🙌🏻😊😊
@@AyushiSharmaDSA 😊😊
Hey can you tell me which software are you using for drawing and explanation?
Microsoft whiteboard for drawing, obs studio for screen recording, filmora for editing
Di can u pls explain the for loop like for(auto i=0;i2->3->4->5->NULL
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 :)
Are you a final year student 😀?
No, I am working professional
why is len=1
as we are starting from head, so one node is already there :)
@@AyushiSharmaDSA but list can be empty right?
@@sadashivshinde9150 yes that we are checking in starting, if head is null
@@AyushiSharmaDSA ohh missed that Thanks
kal video kyu ni ayi :( wait krte rehgye :(
Hi Shivam, sorry, but kal ki problem pe pehle video bnayi hui thi, 🙂
Isiliye dubara nhi bnayi
@@AyushiSharmaDSAye batana chahiye tha na :( iske liye yt shorts nikal dete :) engagement bhi badh jata .. huehue #hacks
@@shivamnegi7552 acha😅
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.