This is the best video of LinkedList I have ever encountered. Have always struggled with LinkedList but this was phenomenal. Hats off to your explanation🎉
Mam please keep your speed little slow while teaching the concept.. because for the first time it is going over head for me.. otherwise concept wise it was excellent
Hey Ramya. u r getting confused in pointer and data in nodes. These are 2 different things . Nodes have data and pointer. Here it says data is duplicate , pointer can point to next node with no cyclic dependency
No you can't Naresh. Because u have created a new node but it's yet not linked to any linklist. Hence first u have to add it to the linked list then only u can move tail to next. If u directly do this then u will loose your tail pointer. It will start pointing to anywhere in memory which is not linked to any node in linked list.
@@CodeDecode Thank you for the reply.. You mean Node also have internal implementation i.e the tail pointer which will take the tail value which we are adding? Is Node a predefined class?
Hi . Great video . The same question was asked to me in L-1 round in Morgan Stanley . Please upload more videos on Linkedlist and arraylist Questions.
Thanks Yogita. Sure we will upload them 👍🙂
Could you please let me know other coding questions which were asked in further rounds
Mam! I have been following your videos since a month and a half and I got placed recently as a Full Stack Developer. Many Many thanks to you😇
Many congratulations Afreen. 🎉🎉🎊🎊well deserved 👏👏👏👏keep learning keep shining ⭐✨⭐✨
This is the best video of LinkedList I have ever encountered. Have always struggled with LinkedList but this was phenomenal. Hats off to your explanation🎉
Thanks Nidhi. Keep learning keep shining girl ❤️🌟🌟
Thanks maam. You are making me interview ready. The same question was asked me at oracle and adobe.
Thanks Akash 🙂👍
Hi
Your vedios are very very useful for me to understand concepts and understand the concepts... Really great work.... Appreciate your effort
Thanks 😊👍👍
Great work and Good video. Thanks for providing this kind of tutorial.👍
These videos are helpful even for experience .Please also upload basic tree question asked in interviews
Thanks Pranjal. Sure🙂👍
These videos are really very helpful to crack interviews. Thank you
Thanks Santhosh 🙂👍
Eagerly waits for ur video. .🤗🤗
Thanks varun
In my new organization I'm started learning microservies so urs videos are helping me lot thanks..
Thanks Varun. Glad to hear this. Is there any thing else you need in the playlist which we should cover
@@CodeDecode defienetly I'll let you know.. right now previous videos helping me .to do things
Plz share more such videos
Thank you for your efforts
Sure Nishant 🙂👍
Tq so much madam love u so much ur vedeos are helping a lot tq a lot .
Thanks Vignesh 🙂👍
Great 👍👍. Thank you mam.
🙂🙂👍👍
Thank you mam..thank you so much 👍👍👍👍👍
you're welcome tulsi
You explained very nicely and clearly but speed is high :)
Sure Nilesh. Wil try to reduce speed in upcoming videos 👍
Great explaination
Thanks swapnil
Great 👍👍. Thank you mam. Please create few more videos on linked list like complete reversal, reversing two nodes at time, queues,etc.
Nice topics Sourabh. Sure we will create a video on these 🙂👍
Why only 199 like you deserve more than 1m like
Thanks Neha🙂
Hi just one question, if there are 100 nodes, is this still valid? Since middle node should be 51 isn't it?
Mam please keep your speed little slow while teaching the concept.. because for the first time it is going over head for me.. otherwise concept wise it was excellent
Sure Yatin
Long time didnt hear from you...
Hey, we put video every week man. Please press bell icon so that we don't miss any new uploads 🙂👍
Pls do few more videos on LinkedList...
Sure Nagendra 🙂👍
LinkedList allows duplicates so if two nodes having same data means its cyclic??
Hey Ramya. u r getting confused in pointer and data in nodes. These are 2 different things . Nodes have data and pointer. Here it says data is duplicate , pointer can point to next node with no cyclic dependency
For the same program I tried inserting same data as 1 in first node nd again 1 in second node.. Getting output as cycle detection at node 1
Can you check pointers Ramya. M sure you messed up with pointers
in else condition in addNodes method
instead of
tail.next = new_Node;
tail=tail.next;
can we assign directly like this
tail = new_node;
No you can't Naresh. Because u have created a new node but it's yet not linked to any linklist. Hence first u have to add it to the linked list then only u can move tail to next. If u directly do this then u will loose your tail pointer. It will start pointing to anywhere in memory which is not linked to any node in linked list.
@@CodeDecode Thank you for the reply.. You mean Node also have internal implementation i.e the tail pointer which will take the tail value which we are adding? Is Node a predefined class?
very helpful video . want you to cover more data structure questions like Btree
Sure Nidhi. We will do that🙂👍
who is the other instructor mam?
Please start with graph problems
Sure 👍🙂
Please go some slow u are telling very fast
Sure gayathri 🙂👍