Solve ANY Linked List question using these 3 simple techniques...

This video discusses three programming techniques that can be applied to Linked List questions. Use these techniques in your algorithms to quickly and easily solve most questions. In addition, an example is provided that uses all three techniques to effectively solve a medium level Linked List problem.

Please comment down below what topic we should cover next!

Chapters:
0:00 Introduction
0:12 Lead-Lag
1:02 Fast-Slow
2:29 LL Reversal
3:42 Palindrome
6:59 Outro

[ryanyoung]

I was about to leetcode some linked list programs and watched this to review and this is the best algorithms video I have ever seen and it's not even close.

[eitanjoseph]

Clearly the best Linked List video of all time

[iezioaudi]

Short, Concise and to the point!
Thank you!!

[mhbx]

BigThanks for the outstanding ideas <3

[shadowperson]

Great Video!!! What’s the new channel 👀

[rfmmike]

Great video bro but quick question. I'm an incoming freshman next semester and took an online python course during my senior year. I struggled and currently struggle to retain a lot of info and I'm trying to practice leetcode/neetcode daily to keep myself fresh. Do you suggest watching vids like yours or certain topics then trying questions or neetcodes or is there another way I should approach retaining concepts I've learned?

[hswumwf]

00:02 Solve any linked list question with three simple techniques.
01:03 Using the fast-slow technique with two pointers to traverse a linked list at different speeds
02:10 Key techniques for handling Linked List questions
03:17 Techniques to reverse linked list nodes and determine palindrome
04:16 Use fast-slow pointers to find the midpoint and reverse the second half of the linked list for efficient palindrome checking.
05:15 Using lead lag to check for palindrome in a linked list
06:17 Three techniques for solving any linked list problem
07:16 Asking for feedback on new video format and potential topics to cover

[hswumwf]

00:02 Solve any linked list question with three simple techniques.
01:03 Using the fast-slow technique with two pointers to traverse a linked list at different speeds
02:10 Key techniques for handling Linked List questions
03:17 Techniques to reverse linked list nodes and determine palindrome
04:16 Use fast-slow pointers to find the midpoint and reverse the second half of the linked list for efficient palindrome checking.
05:15 Using lead lag to check for palindrome in a linked list
06:17 Three techniques for solving any linked list problem

[SpeaksYourWord]

To check palindrome Is it not more efficient to initialize two pointers at the head and the tail and move them in opposite directions until they point to the same address. And just compare the compare the data?

[abhivarma]

What about in place reversal of linked list ?

[wpbkcyr]

in your palindrome example, your fast pointer shouldve moved 3 iterations because on ur video fast is still not null and fast.next is still not null, thus your fast pointer must be at the null node right after the last node

[yogeshdharya]

Great content brother !😊 This gave me the much needed head start for the Linked List questions, and I think if the situation is correct we can use these techniques in other DSA questions too . Thank u so much😇. I had to like it and m a new subscriber too