GUYS A SMALL UPDATE IN LAST QUES. IF K=4, ANSWER MUST BE: 4->3->2->1->5->6 *, as we have rotate K nodes only. So what y'all can do is: Node* check = head; int len = 0; while(check!=NULL){ check = check->next; len++; if(len==k) break; } if(len
here I am again on this video, after forgetting everything what i learnt 1 year before in April 2023.... Guys plz don't take any break during DSA journey, you will forget everything, and phir se track pr aane ke liye bhi bahot himmat aur mehnat lagti hai!🙏🙏🙏!(17 May 2024)
1:10:50 Thanks to you i was able to do it in less than 15 min void solve(Node* &head) { Node* temp = head; while(temp != NULL) { Node* dele = temp; dele = dele->next; temp->next = dele->next; free(dele); temp = temp->next; } }
Please mam don't compromise the quality of content we are following from the 1st now you sumup all these contents in one series please sir try to cover all the topics we are following from the starting.
mam apne dynamic memory allocation padhaye bina pura linked list padha diya bina dynamic memory allocation k kisi ko kuch samajh nhi ayga ki kya chl rha hai
bhai me recommend krunga ki tum double pointers aur pass by reference ache se sikh lo aur dynamic memory allocation aur oops codeHelp se sikh lena@@neverstoplearning3451
Humare college ke DSA ke professor sikhate toh kuch nahi hai lekin agar DSA ka program likhte nhi aaya toh attendance kaat dete hai. Nahi toh basic se start karta tha. Professor ne toh OOPS bhi nahi padhaya, Stack and Queue ke baad sidha Linked List sikhaya voh bhi ussi ko pata kya bag bag karte rehta hai. Nice lecture.
Ma'am there is one thing for sure that because of this One shot thing the practice question have not been provided on the site and also The playlist for C++ course has not been updated yet. I have been trying to reach out for this for days now and haven't received some solution. And the assignments which are on the site are even not granting us access so please get it checked and do upload assignments so that we could practice regularly.
was searching for a good explanation found this, i took 3 days to properly watch and make codes on my own. Gotta say this really helped thank you so much.
Plz provide 1 hr lecture topic wise , don't do that sum up in one lecture Till 47 lectures content is top class but now quality has been compromised 😕😕
Yess mam we want a next some videos of binary tree, heap, graph, greedy algo and some other important topics of DSA plss mam I would highly recommend pls add some next videos. Thank you so much for deep explaination❤️💯
Please make a video on TCS NQT 2023 test. How to prepare? What to read? Where to practice? How much coding is required? What is the smart way to practice test within short time?
bhai line by line explain to kardo likhte time code .. line 18 mei kyu kia hai aisa ye sab kaun btaega?? ye to wohi smajh skta hai jisne 2-4 baar pehle se padha ho ye topic.
40:00 if you have not insert any element into head and your head is NULL and you are trying to do same as she did you will get error so instead of doing that add this on insertAtTail() if(head == NULL) head = new_node; and put everything along temp inside else ,,, reason :: she inserted element while teaching insertAtHead so her head was not NULL...
1:28:38 - exactly same code for deleteAlternateNodes is showing segmentation fault in vs code (in pw labs) , i have checked the code but it is same , it is now showing segmentation fault on removing curr_node != Null from while condition ... Anyone ..? who can help...?
Java mai jese 5 hours ki interview questions upload kiye ho bas c++ mai vi usi questions ko chod ke baki Jo leet Code mai linkedlist ki questions hai us upar eka video bana dije mama
40:00 if you have not insert any element into head and your head is NULL and you are trying to do same as she did you will get error so instead of doing that add this on insertAtTail() if(head == NULL) head = new_node; and put everything along temp inside else ,,, reason :: she inserted element while teaching insertAtHead so her head was not NULL...
@@ramanshrivastava1407 6 mahine kaha tha naa. DSA yaar ek baar karna chahiye lekin shaanti se. Ek accha course banane m 1-1.5 year lag jayega lekin wo for the ages rehna chahiye. Ye patience naa students mein hai na teachers mein hai. Toh ab yehi mediocre content se kaam chalana pahdega
maam your teaching way is not at all good infect raghav sir is better than you I am not demotivating,but you should improve you way of teaching maam.Hope you Understand😊
BHAIYA ME AAPKI SAARI VIDEOS SE STUDY KRTI HU...AND MOBILE ME PRACTICE KRTI HU... I CAN'T AFFORD LAPTOP I REQUEST PW TEAM TO OFFER LAPTOPS TO NEEDY STUDENTS 😞
was struggling with LL for more than a week..but came across this best lecture on LL❤❤..now pretty confident for exams....thank you maam❤❤
For supporting team i would highly recommend to please add the all videos of the c++ DSA foundation course in playlist❤
😢
@@manishdet0189 what happens bhaiya.
its already there
1:55:27 Leetcode(206) - Reversing a linked list
Ma'am your way of teaching is just brilliant.
GUYS A SMALL UPDATE IN LAST QUES.
IF K=4, ANSWER MUST BE: 4->3->2->1->5->6 *, as we have rotate K nodes only.
So what y'all can do is:
Node* check = head;
int len = 0;
while(check!=NULL){
check = check->next;
len++;
if(len==k) break;
}
if(len
I got this finally!! Linked List is HARD to learn but its interesting to do operations on it .... many many Thanks to Urvi mam !!😇❣
here I am again on this video, after forgetting everything what i learnt 1 year before in April 2023.... Guys plz don't take any break during DSA journey, you will forget everything, and phir se track pr aane ke liye bhi bahot himmat aur mehnat lagti hai!🙏🙏🙏!(17 May 2024)
your way of teaching is just brilliant. Harder the topic easier you make for us. Thanks a lot for this quality content.
iske notes h aapke pass agr h to pls share kr dijiye
nice work on explaining the whole thing, your's is the first video where i did not get confused after watching it
1:10:50
Thanks to you i was able to do it in less than 15 min
void solve(Node* &head) {
Node* temp = head;
while(temp != NULL) {
Node* dele = temp;
dele = dele->next;
temp->next = dele->next;
free(dele);
temp = temp->next;
}
}
best video for linked list in youtube❤❤❤❤
Thankyou you mam for teaching dsa in easily ❤
you r really the best!!!! I have searched almost all the platforms and I got one or the other prblm u r the best among all !!! Thank you💗
Thanks a lot mem👍...your explanation is very helpful to me....
One of the best lectures on the linked list I have ever come across.
I highly appreciate you.
The way of teaching is very effective.
Thanks a lot mam for giving us such an amazing lecture which helps us to learn about this topic from depth
Well explained. I was struggling to understand LL . but after watching this session it clear my all doubts.
very Impressive ! I really enjoyed learning from your videos.
Please mam don't compromise the quality of content we are following from the 1st now you sumup all these contents in one series please sir try to cover all the topics we are following from the starting.
smooth....very grateful to u mam😍😍😍
mam apne dynamic memory allocation padhaye bina pura linked list padha diya
bina dynamic memory allocation k kisi ko kuch samajh nhi ayga ki kya chl rha hai
Hii bhai vo kaha se sikhe ?? Muje ye pointers kaise use kiye is tarike se ye nahi samaj aaya itna pointers pata hai par itna deep me nahi samaj aaya
bhai me recommend krunga ki tum double pointers aur pass by reference ache se sikh lo
aur dynamic memory allocation aur oops codeHelp se sikh lena@@neverstoplearning3451
Humare college ke DSA ke professor sikhate toh kuch nahi hai lekin agar DSA ka program likhte nhi aaya toh attendance kaat dete hai. Nahi toh basic se start karta tha. Professor ne toh OOPS bhi nahi padhaya, Stack and Queue ke baad sidha Linked List sikhaya voh bhi ussi ko pata kya bag bag karte rehta hai. Nice lecture.
last question is a leetcode hard version Actually maam taught it soo easily
Where shall I find pdf of this lecture?
What is the base case for reversing k nodes In last recursive code?
2:43:50
mam genuinly u r so gud ...its my first tym comin to ur channel nd for sure not the last..
The link for notes is not working
Hello, thanks for the wonderful explanation. Can you plz provide with the notes and code of the playlist for the learning purpose. Thanks
thank you
Newhead will be passing means new head will be returning that's why we are using node *????
Please make the notes accessible
We can't access them it shows some errors...
Can u provide me notes?
thanks a lot
Mam the notes is not accessible kindly if you provide the notes link for this link list chapter
Ma'am there is one thing for sure that because of this One shot thing the practice question have not been provided on the site and also The playlist for C++ course has not been updated yet. I have been trying to reach out for this for days now and haven't received some solution. And the assignments which are on the site are even not granting us access so please get it checked and do upload assignments so that we could practice regularly.
My fav DS is BST!!
Feeling Blessed Thank You MAM🤩
need some correction in the last problem for ex [1,2,3,4,5] and k=3 output should be [3,2,1,4,5] but it is returning [3,2,1,5,4]
was searching for a good explanation found this, i took 3 days to properly watch and make codes on my own. Gotta say this really helped thank you so much.
31:35 head ka pointer change karne kai liye head = new_node; kiya hai
maam apki tree data structure ka playlist hai?
Thank you mam ❤❤
Plz provide 1 hr lecture topic wise , don't do that sum up in one lecture
Till 47 lectures content is top class but now quality has been compromised 😕😕
anyone please confirm or tell me if i am wrong can we declare the function as a part of node class (public)??
and not write it outside the function
Mam i can't find notes of this lecture
Yess mam we want a next some videos of binary tree, heap, graph, greedy algo and some other important topics of DSA plss mam I would highly recommend pls add some next videos. Thank you so much for deep explaination❤️💯
where do you get the notes of these?
@@rishitdas5228 pw.skills website
maam aaap thoda dryrun karke bhi dekhaeye tab samagh aayega
Please make a video on TCS NQT 2023 test.
How to prepare?
What to read?
Where to practice?
How much coding is required?
What is the smart way to practice test within short time?
it will gives me an errror while i accessing Notes
8:57
Didi Thanks 🥰
lots of respect from Pakistan maam
1:27:51 But why not current->next = temp->next??? 🚨⚠️
Guys.. pls tell me how can I get the notes of this lecture and all previous lectures
pls share the code mam
can you run translation
great
hello ma'am , can you provide us this code
what is the use of arrow in coding???
It is used as a pointer
one word for you -"thank you"
Arigato Guzaimasu will be more suitable 😊
JO AATA THA VO BHI BHUL GAYA 👍
Bhaag yaha sai
Aaj pw ka app and PW skills ki site nhi chl rhi
2:20:53
2:45:16 ❤❤❤
But in the function insertAtHead it gives an error can't convert node*to int in assignment new_node = head
New_node->next =head
mujhe pata hai kyo aaya
kth node qt atime wala samagh nahi aaya raghav sir ko bolao woo badeya samjhate hai
41:58
Mam mujhe plz reply karo
Mai decode batch login nhi ho raha h
Maine subscribe ker liya h please
Batch update ho raha h kya🙏
Can anyone send me this video's codes please ??
bhai line by line explain to kardo likhte time code .. line 18 mei kyu kia hai aisa ye sab kaun btaega?? ye to wohi smajh skta hai jisne 2-4 baar pehle se padha ho ye topic.
maam bas apna padha rhi hain , isme itne sare cheezen hain jo pehle ke lectures me shi se explain bhi nhi kra
Mam please upload video regularly
mam please upload the notes of the lecture
Please continue java dsa series it's been more than a month but no video uploaded yet
40:00 if you have not insert any element into head and your head is NULL and you are trying to do same as she did you will get error so instead of doing that add this on insertAtTail() if(head == NULL) head = new_node; and put everything along temp inside else ,,, reason :: she inserted element while teaching insertAtHead so her head was not NULL...
1:28:38 - exactly same code for deleteAlternateNodes is showing segmentation fault in vs code (in pw labs) , i have checked the code but it is same , it is now showing segmentation fault on removing curr_node != Null from while condition ...
Anyone ..? who can help...?
void deletealternative(Node* &head){
Node* temp=head;
while(temp->next!=NULL){ //1->2->3->4->null
Node *garbage=temp->next;
temp->next=temp->next->next;
free(garbage);
temp=temp->next;
}
} Try this in your compiler, its working fine if even no. of elements are in list.
Sir main kal se pw skill mein log in nhi kar pa Raha hoon.
Mere video backlog increase ho raha hai please resolve my problem.
Java mai jese 5 hours ki interview questions upload kiye ho bas c++ mai vi usi questions ko chod ke baki Jo leet Code mai linkedlist ki questions hai us upar eka video bana dije mama
While inserting a node at last in an empty node at 40:43 the code is not working in vs code
40:00 if you have not insert any element into head and your head is NULL and you are trying to do same as she did you will get error so instead of doing that add this on insertAtTail() if(head == NULL) head = new_node; and put everything along temp inside else ,,, reason :: she inserted element while teaching insertAtHead so her head was not NULL...
mam please video regular upload ki geya
ma'am made a movie on linked list😆😆
Long Time awaited🥱🙏
Aur kitne topic bache hai🤯
tree , graph , stacks , queue etc
Bhay DSA hai.
Data structures
1. Array
2. Linked List
3. Stack
4. Queue
5. Binary Tree
6. Special Trees
7. Graph
8. Heap
9. Tries
10. Miscellaneous
Algorithm
1. Divide and Conquer
2. Greedy Method
3. Branch and Bound
4. Backtracking
5. String Algorithm and KMP matching
6. Graph Algorithms
7. Miscellaneous.
Har kisi ka 3-4 ghante ka video banna chahiye approx.
@@godson200 bhot time lgega bhai kyuki video bhut slow upload ho rhi hai
@@ramanshrivastava1407 6 mahine kaha tha naa.
DSA yaar ek baar karna chahiye lekin shaanti se.
Ek accha course banane m 1-1.5 year lag jayega lekin wo for the ages rehna chahiye.
Ye patience naa students mein hai na teachers mein hai.
Toh ab yehi mediocre content se kaam chalana pahdega
@@godson200 🙏🙏offline soch rha hu ab
notes?
Awesome
mam inseartAtTail () function
give me error
kyo
I know I am late, and I am sorry, but a very Happy Belated Teachers day Team :)
best video
2nd question me segmentation fault ahha raha hai.... Why
mujhe pata hai
source code milega kahi?
kiska hona bata mai deta hu
Good 👍
I am third ...😊
maam your teaching way is not at all good infect raghav sir is better than you I am not demotivating,but you should improve you way of teaching maam.Hope you Understand😊
Int a; a ka data type Int hai. similarly
Node *next; next pointer ka data type Node hai. 👍
it should not be written like Node* next . ❌
what about node* &head?
and what about Node* reverseLinkedList() ???
writing node* &head and node *&head in the parameters are equivalent.
@@sumitsahni5402 and bro what about writing node* as a return type for a function
4th viewer🎉🎉
Good, but pure lecture mein for loop se input Lena toh sikhaya hi nahin gaya
BHAIYA ME AAPKI SAARI VIDEOS SE STUDY KRTI HU...AND MOBILE ME PRACTICE KRTI HU...
I CAN'T AFFORD LAPTOP
I REQUEST PW TEAM TO OFFER LAPTOPS TO NEEDY STUDENTS 😞
I am 2nd
I am first viewer 😃
please itne bade bade lecturee mt do dekhne mai aatma bahar aa jati haii 🙏🙏🙏🙏🙏🙏
I want to marry urvi maam
Kya Umar h beta aapki.
@@godson200 tumse jyada
simp alert
Pin this comment
@@TarunPurohit02 bhaag badk
With all due respect whatever you are teaching is not best practice for coding in DSA.
How can u explain????