Remove Nth Node From End of List | 1 Pass | 2 Pass | Leetcode 19

[@aws_handles]

I watched almost all your videos of Graph concepts as well as Graph Popular interview problems. I admit that no one today can teach like you 🔥

[@surajsidar3280]

I was asked this question in Amazon SDE1. The interviewer asked both solution(2 pass and 1 pass) I am commenting here so that I will see my own comment in the future.

[@adamyasharma_0135]

was looking for a proper reason for slow and fast approach,and as always found it at the best place

[@souravjoshi2293]

Hi MIK, I was able to solve today's gfg potd because of your comparator video you posted few days ago. just wanted to thank and appreciate you

[@adarshjha5126]

Bhaiya if you get some time then please try to make a video on yesterday biweekly problem C ...i did a lot of practice in graphs but still was not able to solve it...😢😢

[@wearevacationuncoverers]

I also couldn't solve :-(

[@codestorywithMIK]

Definitely. Actually I am travelling this weekend. Once I get back home after 2 days, I will upload 🙏

[@oqant0424]

@@codestorywithMIK please upload both 3,4

[@arjunrai8126]

Pls upload​@@codestorywithMIK

[@ugcwithaddi]

Made it simple and easy 👌🏻

[@tutuimam3381]

Amazing explanation ❤❤

[@gui-codes]

Thanks man. you are too good

[@iWontFakeIt]

solved it on my own

[@gauravbanerjee2898]

Thank you so much bhaiya ❤❤

[@dayashankarlakhotia4943]

var RemoveNthFromEnd=function(head,n){ let fast=head,slow=head; for(let i=0;i

[@daniel-so7cv]

bhai konsa college se ho

[@dayashankarlakhotia4943]

purima university Jaipur

[@EB-ot8uu]

awesome as always

[@maheshkeshwala62]

Bro can you please upload question 3 and 4 of leetcode contest every week it will be so helpful

[@pragatigoyal4015]

i dont see deleing in c#, can you please explain if assigning next element automatically release the unwanted object in c#

[@arjunju469]

wil u make the today leetcode contest video ??

[@codestorywithMIK]

Definitely. Actually I am travelling this weekend. Once I get back home after 2 days, I will upload 🙏

[@DevOpskagyaan]

Kitna simple bana dete ho bhai qn ko. Matlab beijjati hojati hai qn ki 😂

[@AdityaGupta-zd5sq]

sir please contest related video banaaiye

[@wearevacationuncoverers]

I also did with one more approach. Reverse the node delete nth node reverse it back class Solution { public: ListNode* reverseList(ListNode* head) { ListNode* prev = nullptr; ListNode* current = head; ListNode* next = nullptr; while (current != nullptr) { next = current->next; current->next = prev; prev = current; current = next; } return prev; } ListNode* removeNthFromEnd(ListNode* head, int n) { if (head == nullptr || n next; } // If the node to be removed is the first node if (prev == nullptr) { head = current->next; } else { prev->next = current->next; } // Reverse the linked list back to its original form head = reverseList(head); return head; } };

[@2110__NishantThakare]

This solution will be 3 pass so not so optimal😊

[@aws_handles]

@@2110__NishantThakarecorrect. Its a 3 pass

[@codeandtalk6]

❤❤❤❤

[@AmanKumar-qz4jz]

bhaiya agar aap live biweekly or weekly leetocode contest solve karoge toh bhut fayda hoga

[@codestorywithMIK]

Definitely. Actually I am travelling this weekend. Once I get back home after 2 days, I will upload 🙏

[@dayashankarlakhotia4943]

if llsize==even then temp ==null&&llsize()==oddthen temp.next==null.

[@coderletscode]

Although i am doing dsa with java but language does not matter for DSA..logic is same but you should continue with java.

[@infinitygaming7192]

bhaiya gfg ka potd le aoo

[@kamranwarsi12b22]

Can we do something like first reverse the list and then traverse , will it work? 🤔

[@wearevacationuncoverers]

yes I did the same. it works. But yeah, I will have to traverse the array multiple times.

[@kamranwarsi12b22]

@@wearevacationuncoverers can you plz share ur code

[@wearevacationuncoverers]

@@kamranwarsi12b22 sure bhai. class Solution { public: ListNode* reverseList(ListNode* head) { ListNode* prev = nullptr; ListNode* current = head; ListNode* next = nullptr; while (current != nullptr) { next = current->next; current->next = prev; prev = current; current = next; } return prev; } ListNode* removeNthFromEnd(ListNode* head, int n) { if (head == nullptr || n next; } // If the node to be removed is the first node if (prev == nullptr) { head = current->next; } else { prev->next = current->next; } // Reverse the linked list back to its original form head = reverseList(head); return head; } };

[@kamranwarsi12b22]

@@wearevacationuncoverers shukriyaa 🙇‍♂️🙇‍♂️

[@DevOpskagyaan]

Wow. Thanks man

[@dayashankarlakhotia4943]

Please change the link of leetcode

[@codestorywithMIK]

Done. Thank you ❤️😇

[@therealsumitshah]

Iss waale problem mei temp != NULL condition kyu chahiye bina uske bhi chal rha hai ye toh. @codestorywithmik