Given any type of a list, finding the mid point feels very natural and fundamental. Determining the middle point of a linked list can be a bit tricky as we only have access to the head node. Watch this video to understand how we can use the hare and tortoise algorithm to find the middle of a linked list efficiently. All along with animations and a dry-run of code in JAVA.
Chapters:
00:00 - Intro
- Problem Statement and test-cases
- Straight forward approach
- Hare and tortoise algorithm
- Dry-run of Code
- Final Thoughts
📚 Links to topics I talk about in the video:
Array Data Structure:
Linked Lists:
Traversing a Linked List:
📘 A text based explanation is available at: studyalgorithm...
Code on Github: github.com/nik...
Test-cases on Github: github.com/nik...
📖 Reference Books:
Starting Learn to Code: amzn.to/36pU0JO
Favorite book to understand algorithms: amzn.to/39w3YLS
Favorite book for data structures: amzn.to/3oAVBTk
Get started for interview preparation: amzn.to/39ysbkJ
🔗 To see more videos like this, you can show your support on: www.buymeacoff...
🎥 My Recording Gear:
Recording Light: amzn.to/3pAqh8O
Microphone: amzn.to/2MCX7qU
Recording Camera: amzn.to/3alg9Ky
Tablet to sketch and draw: amzn.to/3pM6Bi4
Surface Pen: amzn.to/3pv6tTs
Laptop to edit videos: amzn.to/2LYpMqn
💻 Get Social 💻
Follow on Facebook at: / studyalgos
Follow on Twitter at: / studyalgorithms
Follow on Tumblr at: / studyalgos
Subscribe to RSS feeds: studyalgorithm...
Join fan mail: eepurl.com/g9Dadv
#leetcode #programming #interview
10 сен 2024
