LeetCode 61 | Rotate List | Solution Explained (Java + Whiteboard)

Running Time: O(N)
Space Complexity: O(1)
FOLLOW ME:
Github: github.com/xavierelon1
Github HackerRank Solutions: github.com/XavierElon1/Hacker...
Github Leetcode Solutions: github.com/XavierElon1/LeetCo...
Facebook: / xavier.hollingsworth.3
Instagram: / xavierelon
LinkedIn: / xavier-hollingsworth-5...
Twitter: / elon_xavier

[@lethihue795]

Yeyy!! I got 100% with your solution ^^. Thank u so much, Xavier Elon!

[@HenggaoCai]

I believe your internet speed affects the Leetcode runtime. I ran the same code and got 100%.

[@xavierelon]

Ah that explains it

[@wsrodeczku]

@@xavierelon yep. I also have 100% with your solution :)

[@xavierelon]

Małgosia Sobocińska yayyyy :)

[@amandapanda3750]

Hey would you mind explaining why we need line 21? wouldn't this set the linked list back into a cycle if we set the tail's next node to the head?

[@stevechade7471]

genius solution 👌 assume 👏 ❤❤❤

[@Atharva555]

great approach bruh! but what's with the hair

[@xavierelon]

Lmao I was growing it out at the time