Remove Nth Node From End of List ❤️ | Leetcode DSA Linked List Solution Playlist Hindi Hello World

[@ankitgaur7428]

bro tum bahut badia dsa padate ho better then all youtubers.

[@aishwarya8078]

Bhaiya kya samjhaya hai aapne... literally hats off 🙌 slow and fast pointer ka concept.....ekdum clear ho gaya

[@HelloWorldbyprince]

thanks a lot dear Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@abhijeetsingh8310]

Love and respect from Ramgarh 🚩end to end following your instructions my friend from Delhi suggested your playlist Bagal mein chhoda Shahar mein dindora wala haal h

[@amitkumarthakur6937]

after watching this vides, it help me a lot and in middle i tried myself and in first attempt i solev it and finally it accepted thanks a lots ur motivation to solve by urself work on me

[@techykushwaha6848]

Bhaiya Bahut bahut bahut badiya samjhaya aapne, mukembo khush hua🙌🔥

[@uditpanjiyar3203]

i have solved almost correct except the edge case must watch explanation ❤❤

[@actionworld7009]

The main problem of most of the student is, they can solve problem, and can build logic also but they can't tell that logic to computer, even they know c++ and other language if they know how to talk with computer, then problem become easy to solve.

[@sourabhpal9422]

Really bhaiya aapne bahut easy way se samjhaya. Thank you

[@HelloWorldbyprince]

keep learning like this and keep sharing my channel

[@aadityasinghrana8245]

thanks for the video bhaiya ji.... u r great !! please keep on going .... love u bhaiya aka guru ji ! 🙏🙏🙏

[@MohitArya-j3n]

bhaiya aagya samj me

[@ravilpatel7301]

ListNode *temp = head; int count = 0; while(temp!=NULL){ temp=temp->next; count++; } temp = head; for(int i=1;inext; } if(count-n==0){ return head->next; } if(temp->next!=NULL){ temp->next = temp->next->next; return head; }else{ return NULL; }

[@creative505]

Really it's logic very helpful.

[@HelloWorldbyprince]

Keep watching

[@sushmajha3432]

thank u bhaiya

[@shraddhapotekar7482]

Tysm😊

[@salmaniproductions1104]

2nd approach bhaiyaa: ListNode* temp = head; int size=0; while(temp->next!=NULL){ temp=temp->next; size++; } if(size==n){ return head->next; }

[@incubus8492]

maza agaya bhaiya

[@Manikaushaki]

ListNode* fast, *slow; fast = slow = head; for(int i=0; inext; ListNode* temp = head; if(!fast){ head = head->next; delete temp; return head; } while(fast->next){ fast = fast->next; slow = slow->next; } temp = slow->next; slow->next = temp->next; delete temp; return head;

[@sidranaeem7334]

mere ko samjh aa gya

[@HelloWorldbyprince]

nice bro

[@impulsivedamon]

smj gya

[@googlebaba4045]

dhanewad bhaiya

[@HelloWorldbyprince]

keep learning yaar Please, share this channel in your college, groups, or LinkedIn bcoz it's cost nothing to you 😀

[@theengineerguy_]

Thank you Prince bhai🎉

[@HelloWorldbyprince]

thanks kaish bro

[@amritpandey815]

class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { ListNode* temp =head; int count=0; if(temp == NULL)return head; while(temp!=NULL) { temp=temp->next; count++; } temp=head; int deleteEle=count-n-1; if(count==n) { return head->next; } while(deleteEle!=0 && temp!=NULL) { temp=temp->next; deleteEle--; } if(temp!=NULL) { temp->next=temp->next->next; } else { return NULL; } return head; } }; Thanks for uploading wonderful series of linked list

[@HelloWorldbyprince]

amazing works good 👏

[@amritpandey815]

@@HelloWorldbyprince Thank you bhaiya

[@prakritiagrawal198]

Good explaination👍

[@HelloWorldbyprince]

Thank you 😃

[@neelpunia2541]

great playlist, prince bhai , eagerly waiting for dp playlist ❤❤

[@HelloWorldbyprince]

Very soon

[@siddheshsurve6608]

Best video

[@faizaniit]

awesome question brother

[@HelloWorldbyprince]

keep doing hard working

[@baladimirputin708]

I am Also Prince Kumar

[@mddanish2016]

Thanks bhaiya 😍

[@HelloWorldbyprince]

Keep learning bro

[@salmaniproductions1104]

thnk you so much sir

[@HelloWorldbyprince]

Most welcome

[@prakashnandan7337]

Thank you so much Bhaiya

[@HelloWorldbyprince]

Always welcome

[@AdityaSingh-wg3tv]

ListNode* removeNthFromEnd(ListNode* head, int n) { int c=0; ListNode* cur=head; if(cur->next==NULL) return NULL; while(cur){ c++; cur=cur->next; } if(c==n){ head=head->next; } else{ ListNode*prev=head; for(int i=0;inext; } prev->next=prev->next->next; } return head; }

[@HelloWorldbyprince]

nice work

[@abhaytomar6288]

class Solution { private: int countListNodes(ListNode*n) { int cnt=0; while(n!=NULL) { n=n->next; cnt++; } return cnt; } public: ListNode* removeNthFromEnd(ListNode* head, int n) { ListNode* current = head; int cnt =countListNodes(head); if(cnt == n) { return head->next; } int desiredNode = cnt-n-1; while(desiredNode--) { current = current->next; } ListNode* temp = current->next; current->next = current->next->next; delete temp; return head; } }; Bhaiya i really want to thank you for that i had watched 4-5 playlist of linked list before but even though could not much understand the fundaments of it. But by watching your videos the way you explained it really cleared all my gaps in the fundamentals of Linked List . And Now i am find myself in a position where i am quite comfortable in solving questions 😊.

[@HelloWorldbyprince]

waooo

[@djpsn7094]

Great explained 🙌

[@HelloWorldbyprince]

Glad you liked it

[@Vegeta-ew2bq]

Great vid!😀

[@HelloWorldbyprince]

Thanks a lot

[@saini.mayank]

thanks bhai, but DP series

[@HelloWorldbyprince]

welcome bro soon upload

[@Student-q7n]

approach 1 ListNode* removeNthFromEnd(ListNode* head, int n) { if(head==NULL || nnext; count++ ; } curr=head ; ListNode* prev=NULL ; int x=count-n; if(x==0){ curr=head; head=curr->next; return head ; } while(x--){ prev=curr; curr=curr ->next; } if(curr==NULL) return head ; prev->next=curr->next; delete(curr); return head ; }

[@dharmeshgohil9375]

awesome

[@HelloWorldbyprince]

Thanks

[@dummy7330]

int count=0; while(temp!=NULL){ count++; temp=temp->next; } int m=count-n+1; if(count==NULL){ return 0; }

[@mahimatolani813]

I have one question that in this other way also we are just first pointing fast node till n place and then with 1 traversal we are doing in naïve approach as well first we calculate size and then in traversal we delete the node from end anyhow both ways are using 2 traversals. Please correct me if I am wrong.

[@namanmishra5683]

Sir could you please make a video on null pointer error thrown by leetcode 😭

[@yashpaunikar671]

13:47 slow ka next ya head ka next kyo return kiya sir...? if return slow ya head krenge to kya hoga

[@Gangehum]

sir please make video on array

[@HelloWorldbyprince]

sure brother

[@bhuvandahal421]

class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { if(!head->next) return nullptr; int sz = 2; ListNode* ptr = head->next->next; while(ptr) { ++sz; ptr = ptr->next; } int t = sz - n; ptr = head; if(t == 0) { head = head->next; delete ptr; return head; } while(t != 1) { --t; ptr = ptr->next; } ListNode* temp = ptr->next; ptr->next = temp->next; delete temp; return head; } };

[@prakashnandan7337]

Apporach 1 if(head == NULL){ return head; } ListNode* temp = head; int k=0; while(temp != NULL){ k++; temp=temp->next; } if(n == k){ return head->next; } int count =1; ListNode* curr = head; while(count < k-n && curr != NULL){ curr=curr->next; count++; } if(curr->next != NULL){ curr->next=curr->next->next; } else{ return NULL; } return head;

[@ShreyaSingh-gm1pk]

class Solution { public ListNode removeNthFromEnd(ListNode head, int n) { int count=0; ListNode curr=head; if(curr.next==null) return null; while(curr!=null){ count++; curr=curr.next; } if(count==n){ head=head.next; } else{ ListNode prev=head; for(int i=0;i

[@amanbhaisare5058]

C++ Solution ListNode* removeNthFromEnd(ListNode* head, int n) { if(head == NULL && head -> next == NULL) return head; ListNode* curr = head; int len=0; while(curr!=NULL){ curr = curr -> next; len++; } curr = head; int m = len - n ; cout

[@Everyday_smarter]

class Solution { public: int i=0; int m=0; ListNode* found; void dis(ListNode* head) { if(head==NULL) { return; } dis(head->next); i++; if(i==m) { found=head; //return; } // cout

[@Everyday_smarter]

so in if we have n==1 then in wrost case we have to go it's previous node and then delete it otherwise in all other cases we don't have to do that

[@niteshk0487]

My own approac #someting else✔ class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { if(head == NULL && head->next == NULL) return NULL; int count = 0; ListNode *temp = head; while(temp != NULL) { count++; temp = temp->next; } if(count == n) return head->next; temp = head; count = count-1; while(count > n) { temp =temp->next; count--; } temp->next = temp->next->next; return head; } };

[@HelloWorldbyprince]

Amazing Nitesh keep growing

[@akashkumarverma1969]

Bhaiya Mai 1st Approch Try Kr rha but jab main ye line ptrr->next=ptrr->next->next; likh rha Jisko delte krna ha uske phle aur uske baad wale ko connect krne ke liye Phir Usi Pos pe Runtime Error De rha Baki maine sara Code May be sahi LIKha ha ListNode* removeNthFromEnd(ListNode* head, int n) { if(head==NULL)return head; ListNode* ptr=head; int c=0; while(ptr!=NULL) { ptr=ptr->next; c++; } if(n==c) { ListNode*t=head->next; delete head; return t; } int s=c-n+1; int i=0; ListNode* ptrr=head; while(inext; i++; } ListNode* temp=ptrr->next; delete temp; ptrr->next=ptrr->next->next; return head; }

[@prakashnandan7337]

check for prev->next is NOT NULL if(head == NULL){ return head; } ListNode* temp = head; int k=0; while(temp != NULL){ k++; temp=temp->next; } if(n == k){ return head->next; } int count =1; ListNode* curr = head; while(count < k-n && curr != NULL){ curr=curr->next; count++; } if(curr->next != NULL){ curr->next=curr->next->next; } else{ return NULL; } return head;

[@masumali8356]

if(head == NULL){ return head; } ListNode* temp = head; int k=0; while(temp != NULL){ k++; temp=temp->next; } if(n == k){ return head->next; } int count =1; ListNode* curr = head; while(count < k-n && curr != NULL){ curr=curr->next; count++; } if(curr->next != NULL){ curr->next=curr->next->next; } else{ return NULL; } return head;

[@HelloWorldbyprince]

nice work

[@amitkumarthakur6937]

ListNode* temp=head; ListNode* temp2=head; if(head->next==nullptr) return nullptr; int count =0; while(temp){ count++; temp=temp->next; } if(count==n) return head->next; int x=count-n; for(int i=1; inext=temp2->next->next; } else{ temp2=temp2->next; } } return head;

[@krushnapatil9196]

W

[@amanbhaisare5058]

Khudse attempt kiya tha bhaiya

[@HelloWorldbyprince]

nice

[@astkh4381]

thank you for video. Could you please help me understand when does the element in dummy gets updated? All I see is fast and slow move forward but it is not clear to me how assigning slow.next=slow.next.next affects the actual dummy list

[@shivendrasingh2527]

bhaiya what is the issue with my approach. it is showing error. class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { ListNode *curr=head;int count=0; if(curr==NULL) { return head; } while(curr!=NULL) { count++; curr=curr->next; } if(count==n) { head=head->next; } curr=head; count=0; while(curr) { if(count==n) { curr->next=curr->next->next; } curr=curr->next; count++; } return head; } };

[@VivekPathak-ds2do]

Bhaiya explaination dekhne k baad code dekhne ki jarurat nhi padi.

[@adityarout1276]

First Approach Code : ListNode *dummyNode=new ListNode; dummyNode->next=head; ListNode *temp=head; int size=1; while(temp->next!=NULL){ temp=temp->next; size++; } int pos=size-n+1; int cnt=1; if(size==n){ return head->next; } ListNode *prev=dummyNode; ListNode *curr=head; ListNode *next=head->next; while(cnt!=pos){ next=next->next; curr=curr->next; prev=prev->next; ++cnt; } prev->next=next; curr->next=NULL; return dummyNode->next;

[@HelloWorldbyprince]

nice bro keep it up

[@leisuretime4198]

bhaiya please bta dijiye kk isme runtime error kyu aa rha hai ?? class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { ListNode* count_ptr=head; ListNode* temp=head; int count=0; while(count_ptr){ count_ptr=count_ptr->next; count++; } if(count==n)return head->next; int siz=count-n-1; while(count--){ temp=temp->next;} temp->next=temp->next->next; return head; } };

[@harshitgoel4257]

Use siz in while loop instead of count

[@leisuretime4198]

class Solution { public: ListNode* removeNthFromEnd(ListNode* head, int n) { ListNode* temp=head; int count=1; while(temp!=NULL){ temp=temp->next; count++; } int nn=count-n;//from beginning if(nn==1) return head->next; ListNode* t=head; nn=nn-1;//3 while(nn>1){ t=t->next; nn--; } t->next=t->next->next; return head; } }; Completed in the first attempt this time.

[@leisuretime4198]

@@harshitgoel4257

[@keluthsanjeevkumar3074]

thanks bhayya