Gurudev 🙏🙏 aap aane vaale No1 educator banne vaale ho youtube pr koi baat nhi views kam h leakin yeh he millions mai badal jyege jis tarah ka content aapne banaya hai na yeh na toh kisi paid course mai h or na he kisi youtube channel pr heads off to you 🙏🙏 pls make complete series of DSA 🔥🔥
Amazing Content bhaiya , It will Definitely help us , and please mention type of questions will be asked on this topics too which will build us, thank you bhiaya
we can achieve it in the below way as well in c# if(head==null) return head; if(head.next==null) return head; var last=ReverseList(head.next); head. next.next=head; head.next=null; return last;
very well explained bro, difficulty faces before seeing ur vedio, but after seeing video full cleared, thanks bro keep it up. bro linked list pe jayada se jyada interview question laate rehna, best of luck bro.....
1-> 2-> 3-> 4 suppose this is given linked list just before hitting base condition we are at 3 that is current head is 3 the recursion call return new head as 4 so we do head.next.next = head i.e 1->2-> 3 2
bhai sari playlist me vedio ke wrapper me 1-2-3-4 dal do please same as linkledin to sequence me smjh aayega even in all playlits saree me , wrna pura sequence bigad jata and smjh nahi ata
Lect - 12 completed, sir love♥️ the way you explain each and every concept, please keep creating such wonderful content 💯 your playlist are helping me alot in understanding the topics and improving my skills. Thankyou bhaiya ♥️
ya fir ek kam kar doge ek ya do conceptual vedios playlist of topics me dal do and sequence bnwa do playlist ka vedio k wrapper me number dal ke jaise linklist me kia so we s ee sequence wrna dimag khrab ho jata bhaio. ek ya do introduction vedio dal do , playlist koi bhi pura seuqnece me bna do, existing me change kr ke jese wrapper me numbert dal do
![เปิดบ้าน นาราเครปกระเทย 1 ไร่ ขายขาดทุนหลัก10ล้าน เอามาใช้หนี้!!! l [Nickynachat]](http://i.ytimg.com/vi/0jz84VFWVP4/mqdefault.jpg)
The best LL concepts ever explained on youtube..
Awesome Notebook Explanations! Loving the series!
Glad you like them! Also please share ❤️🔥
Understood the concept well, I have implemented that and got revised.
Please create a recursion series, if possible
Bhaiya full support idhar tk aagya !!!!!!!!!!!!!!!!!!! great video !!!!!!!!!!!!
bhai 5--6 video dekh krr aaya recursive solution ki prr kisi ka smj nhi aaya aur idhr bss bilkul easy lga #OP bro #OP video
finally my code executed for reversing a linked list. Thank you
Bhai sahabbb!!!!!!!!!!!!!!
Next level explanation!!!!!!!!!!!!!!!!!!
just op💙❤
fraz bhai kya mast samjhate ho aap.. Thanks .
badia hai bhai
Bhai Bdhia Smjh aagya
Gurudev 🙏🙏 aap aane vaale No1 educator banne vaale ho youtube pr koi baat nhi views kam h leakin yeh he millions mai badal jyege jis tarah ka content aapne banaya hai na yeh na toh kisi paid course mai h or na he kisi youtube channel pr heads off to you 🙏🙏 pls make complete series of DSA 🔥🔥
Thank you so much ❤️
You hit the right nerve to explain these typical things! Great 👏
The best part was......Recursion named Bechaara!!
bhaiya bhut faadu revision krware aap !!!!! ❤️❤️
lets gooo
Great bhaiya
finally learned the concept
Amazing Content bhaiya , It will Definitely help us , and please mention type of questions will be asked on this topics too which will build us, thank you bhiaya
thanks for the playlist helpful.
Thankyou bhaiya for this session
please make a video on vectors
thanks for wonderful explanation
☺☺
we can achieve it in the below way as well in c#
if(head==null) return head;
if(head.next==null) return head;
var last=ReverseList(head.next);
head. next.next=head;
head.next=null;
return last;
Maza aagya bhai❤️❤️
hustle 100% thankyou sir
Thank you very much. You are a genius.
Wowww this is amazing pls make more videis
Mind blowing
bahut takleef hoti hai jab aap yogya ho aur log aapki yogyata na pehchane bhaiya bhut accha samjaya hai
very well explained bro, difficulty faces before seeing ur vedio, but after seeing video full cleared, thanks bro keep it up. bro linked list pe jayada se jyada interview question laate rehna, best of luck bro.....
Thank you bhaiya 😇
21:18 TRUE THAT..👏👏
Thank you🙏
great explanation of the recursive approach.
Glad you liked it!
please make a recursion series it would be great please make one
Yes sure
Please make it in English version 👍
Thank You so much sir❤
Completed this lecture😊
Most welcome 😊 .
great, learned a lot from this series
Thanks for the efforts!!
Bhaiya please time complexity ka video banao specially backtracking and recursion questions ke liye...
hatsoff! sir
bhai aise hi series bas tough ones p bna do 1 liknklist 2 trtee 3 graph smjh aayega
Love you bhaiya 😍
❤️❤️ Keep sharing and coding
recursion series please!!!!
Thank You So Much Bhaiya❤
Completed this lecture😊
Amazing work. Next part will be out soon.
bhaiyaa recursion pr series le hi aao bhaiyaa
bro your explaination is nice but i have a doubt, In recursion method u wrote head->next=NULL but while back tracking how this null moves.
1-> 2-> 3-> 4 suppose this is given linked list
just before hitting base condition we are at 3 that is current head is 3
the recursion call return new head as 4
so we do head.next.next = head i.e 1->2-> 3 2
RECURSIVE SOL WITHOUT BACKTRACKING
class Solution {
public ListNode reverseList(ListNode head) {
return reverse(head, null);
}
private ListNode reverse(ListNode cur, ListNode prev){
if(cur == null)
return prev;
ListNode temp = cur.next;
cur.next = prev;
return reverse(temp, cur);
}
}
nice
best explanation 😃
Thanks for your comments Nadeem
@@mohammadfraz you deserve it bhaiya
bhaiya please make a series of graph
and array
🙏🙏🙏🙏
fraz bhai kya hum p++ , c++ & n++ nhi kr skte ?
bhaiya please start tree series before dp pls bhaiya
thanks so much
welcome Kunal
nice explaination bhaiya😇
Thanks Iklaq, share krdena
If int is allocated 2 bits in the system, what will be the output of 12
good content
Thanks a lot
bhaiya recursion next !!!!!!! 🥺🥺🥺
Reach++🔥
bhaiya pls recurrsion pe series bana loooooooooooooooooooooooooooooooooooooooooooooo
How you write this in your ipad can you show you in one video please
ep 10 done
great video ! What tool / tablet are you using to draw the picture ?
ipad and apple pencil
bhai sari playlist me vedio ke wrapper me 1-2-3-4 dal do please same as linkledin to sequence me smjh aayega even in all playlits saree me , wrna pura sequence bigad jata and smjh nahi ata
watching at 4:51 AM :)
Lect - 12 completed, sir love♥️ the way you explain each and every concept, please keep creating such wonderful content 💯 your playlist are helping me alot in understanding the topics and improving my skills.
Thankyou bhaiya ♥️
Bhaiya recursive Aproach samjh me nhi aya head next next wala nhi aya samjh me ...?
completed.
Will give more soon
👍
💥💗
Keep going bro! 🔥
Thanks, keep supporting 🔥❤️
@@mohammadfraz Definitely bhai 💙
RECURSIVE SOLUTION WITHOUT BACKTRACKING
class Solution {
public ListNode reverseList(ListNode head) {
return reverse(head, null);
}
private ListNode reverse(ListNode cur, ListNode prev){
if(cur == null)
return prev;
ListNode temp = cur.next;
cur.next = prev;
return reverse(temp, cur);
}
}
11:50
bhai me
current, current->next me confuse ho jaata hu har baar....
Please make videos in English 👍
😍😍😍
Please make videos using JAVA
There isnt much difference
recursion ulta kaise kr raha h linkedlist koi smj dega
'
reach ++
ya fir ek kam kar doge ek ya do conceptual vedios playlist of topics me dal do and sequence bnwa do playlist ka vedio k wrapper me number dal ke jaise linklist me kia so we s ee sequence wrna dimag khrab ho jata bhaio. ek ya do introduction vedio dal do , playlist koi bhi pura seuqnece me bna do, existing me change kr ke jese wrapper me numbert dal do
Fraz >>>> Striver
🤣🤣🤣nice joke iam not hater of faraz but stiver's teaching ,method is far better than whole indian coder community
Using recursion, my code took 0 ms.
fraz bro....extremely dissappointed...none of ur codes are running on leetcode...sorry
Keep practicing and don't get demotivated.
I came up with 4 video previously on this concept.... finally got the perfect video to understand this concept ❤️... superb 🤌🏻