[Java] Leetcode 19/203 Linked List Deletion [Fast & Slow Pointers #2]

preview_player
Показать описание
In this video, I'm going to show you how to solve Leetcode 19/203 Linked List Deletion which is related to Fast & Slow Pointers.

Here’s a quick rundown of what you’re about to learn:

⭐️ Course Contents ⭐️
(0:00​​) Leetcode 19. Remove Nth Node From End of List
(4:06) Leetcode 203. Remove Linked List Elements

In the end, you’ll have a really good understanding on how to solve Leetcode 19/203 Linked List Deletion and questions that are similar to this Fast & Slow Pointers.

Now, if you want to get good at Fast & Slow Pointers, please checkout my Fast & Slow Pointers playlist.

Рекомендации по теме
Комментарии
Автор

Thanks man!! it was very clean and easy approach

Adalbert
Автор

I have implemented this in my rest framwork url mapping.. its cool!!

BrittanyAlanaWoods
Автор

I have a question about why you need to return head at the end of the function?

bessie
Автор

Thanks, but I got a problem that mine complexity is not good as yours well my code is the same as yours. XD

Jack-qvgu
Автор

Thank you for your video! I think it might helpful to add "Remove Linked List Elements" to the title of the video to make it appear in more related searches

lishayang
Автор

Thanks man!! it was very clean and easy approach

Agathe
welcome to shbcf.ru