May God reward you with an abundance of every blessing and grant you whatever good that you desire and protect you and your family. You helped me ease the stress of learning. Your explanation is on point.
This is the best video of linked list in the youtube ma'am, ("Thank you so much"**100="for you") I was searching this from so many days but could not find the way you explained anywhere.😊
Hi Mam i'm a new subscriber to your channel..I didn't understand this concept for a long time. I saw almost every videos in youtube about this concept but I didn't get anything..Truly thank you mam😊..Now i feel like i can answer any questions from this topic..Keep doing videos like this mam..
You are amazing! i searched many videos for this kind of theory and coding explanation, but yours is the best ! very clear and easily understood! Thanks a lot. is there any way we can sponsor you? or guru dhakshina? Godbless you.
This was the best series of explanation on linkedlist ever period. I was not getting this linkedlist during my whole undergad you saved me. you are the real guru. thanks for such fantastic lecture, keep on posting more videos for ds like reversing a linkedlist which is very much asked & more concepts like dynamic programming & all. I had quick question while deleting the node from beginning pointing the head to new node the value in head should be 1010 why have you written 1074? As 1074 is reference of next node. Correct me if I am wrong.
@Amylya's Academy - I have some doubt in the node being added at a given position. I believe the order of steps that go into adding newly created element has to follow the below steps (code wise):
Thank you for this playlist. Your video are simple and very easy to understand. Also I don't think anyone has mentioned it, but you have a cute accent.
Your explanation just on key point as well as taking care of the concept. what a great way you are delivering the concept have added your playlist and I am on 11th video
Can someone please clear this up? At 5:19 she refers to the "head" in two places. First, the square that just says "head", and then the block that contains the "data 10 and reference 1010". Which is it? My understanding is that the head is actually an empty data location. It just contains a reference to the first element containing data. Thanks.
yes at 5:19 i was explaining about inserting new node at the beginning of the linked list and at that time head will point to new node because new node is the first node of linked list now.
At 11:43 the head contains 1010 address of node 2 I think but instead you write 1074 which is the address of node 3 in this scenario we will be deleting 2 nodes I think.. Correct me if I'm wrong but what I understand until now based on that I think this is wrong may be mistaken.. If I'm mistaken correct me so I can learn something new also..
You are right, actually the reference would be 1010... i think by mistake she pointed to 1074... if we want to delete two nodes , then that is correct...
To build a house, the construction team levels a squared plot of land. You are given an array ground where ground[i] is a square i height in meters. Per one operation constructors lower or raise the square i by one meter. Determine the minimum number of operations to completely level the entire land plot. Input: ground - integer array, 0
Good explanation, But if I want to delete a data inbetween a link list First I need to make that data.next to null and then I should link previous data to next to the deleted data. You missed the first Operation. If the data.next is not equal to null means it also has the address of the next node therefore it acts as a head of a newly linked list "It's my theory I want to know it's correct or Wrong"...
I am not able to get below code, can you please help me on this. class Node: def __init__(self, value, next=None): self.value = value self.next = next L = Node("a", Node("b", Node("c", Node("d")))) print(L.next.next.next.value)
first node1 will be created with value d and next as None. then node2 will be created with value as c and its next as reference of d c---->d then create node3 with value as b b--->c---->d then next node a--->b--->c---->d now if you print L.value it will print a, L.next is reference of b L.next.next means reference of c L.next.next.next means reference of d And because you are printing its value we will get output as d.
May God reward you with an abundance of every blessing and grant you whatever good that you desire and protect you and your family. You helped me ease the stress of learning. Your explanation is on point.
This is the best video of linked list in the youtube ma'am, ("Thank you so much"**100="for you") I was searching this from so many days but could not find the way you explained anywhere.😊
Hi Mam i'm a new subscriber to your channel..I didn't understand this concept for a long time. I saw almost every videos in youtube about this concept but I didn't get anything..Truly thank you mam😊..Now i feel like i can answer any questions from this topic..Keep doing videos like this mam..
You are amazing! i searched many videos for this kind of theory and coding explanation, but yours is the best ! very clear and easily understood! Thanks a lot. is there any way we can sponsor you? or guru dhakshina? Godbless you.
Thank you so much :)
Your Blessings and support is guru dakshina for us :)
Mam...thanks alot for your lectures in datastructures..please upload more...almost a whole class of us are waiting for it..
As soon as possible :)
This was the best series of explanation on linkedlist ever period. I was not getting this linkedlist during my whole undergad you saved me. you are the real guru. thanks for such fantastic lecture, keep on posting more videos for ds like reversing a linkedlist which is very much asked & more concepts like dynamic programming & all. I had quick question while deleting the node from beginning pointing the head to new node the value in head should be 1010 why have you written 1074? As 1074 is reference of next node. Correct me if I am wrong.
Thank you so much :)
In head we will store the reference of first node, not the value :)
@@AmulsAcademy yaa reference of 1st. Node is 1010 siis not 1074 right?.. You have written 1074.....
@@AmulsAcademy MISTAKE IN 11:40
Best video of the decade
Precise and clear explanation.. Appreciate your good work
Thanks a lot :)
really i am saying that thank you , i don't now anything in thing in python after seeing u r videos i scored my sem A+ grade thank you lot mam❤❤❤❤❤
Wow congratulations 😊
Glad to hear that ❤️
@Amylya's Academy - I have some doubt in the node being added at a given position. I believe the order of steps that go into adding newly created element has to follow the below steps (code wise):
Thank you for this playlist. Your video are simple and very easy to understand. Also I don't think anyone has mentioned it, but you have a cute accent.
11:19 but we want store the address 1010 to head instead of 1074
A very good explanation..!!
Please do make more videos covering entire DS
Sure I will :)
This is superb explanation..! Keep going : )
Thanks a lot 😊
Your explanation just on key point as well as taking care of the concept.
what a great way you are delivering the concept
have added your playlist and I am on 11th video
I want to see the face behind these amazing videos yr seriously you are great
Can someone please clear this up? At 5:19 she refers to the "head" in two places. First, the square that just says "head", and then the block that contains the "data 10 and reference 1010". Which is it? My understanding is that the head is actually an empty data location. It just contains a reference to the first element containing data. Thanks.
yes at 5:19 i was explaining about inserting new node at the beginning of the linked list and at that time head will point to new node because new node is the first node of linked list now.
Super awesome explanation and voice clarity
Thank you so much :)
I just fall in love with you,
You are making my dreams come true. Thanks
Your tutorials are just clear, easy to understand .
Congregations Madam
Dii your videos are amazing and clear , I love your explanation. Dii please can you make videos on Big O Notation, 2D Array and Matrix. :)
Thank you so much :)
Ma'am Really blessed by ur videos...😍🤗💯
Thanks ma'am for making the video on linked list
My pleasure 😊
1. Does the head consume memory or is it an imaginary container.
2. Can we traverse/move backward in a singly linked list.
1. yes head consumes memory it is a variable stores the address of first node.
2. You can reverse singly linked list :)
@@AmulsAcademy When you say, one can reverse the singly Linked List? are you suggesting to use the deque? can you please clarify?
Thank you soo much... Its really Too Help Full.....👌👏👍
Thank you 😊
At 11:43 the head contains 1010 address of node 2 I think but instead you write 1074 which is the address of node 3 in this scenario we will be deleting 2 nodes I think.. Correct me if I'm wrong but what I understand until now based on that I think this is wrong may be mistaken..
If I'm mistaken correct me so I can learn something new also..
You are right, actually the reference would be 1010... i think by mistake she pointed to 1074... if we want to delete two nodes , then that is correct...
very nice and clear explanation... but it can be confusing for those who are new
Thank you :)
If you watch all the videos on linked list then you will understand better I think :)
Nice explanation very much helpful mam🙆🙆
You explain better than my teacher
Thank you :)
To build a house, the construction team levels a squared plot of land. You are given an array ground where ground[i] is a square i height in meters.
Per one operation constructors lower or raise the square i by one meter. Determine the minimum number of operations to completely level the entire land plot.
Input:
ground - integer array, 0
Good explanation, But if I want to delete a data inbetween a link list First I need to make that data.next to null and then I should link previous data to next to the deleted data. You missed the first Operation. If the data.next is not equal to null means it also has the address of the next node therefore it acts as a head of a newly linked list
"It's my theory I want to know it's correct or Wrong"...
I didn’t get you can you elaborate please :)
I found ur videos as just best on internet, although i hv some doubts lyk, is it worth to dsa with python language??? Somebody plssss help!!!
With DSA ,we can apply with any language ,just there is slight edge to them who learn DSA with JAVA or C++
GOD BLESS YOU !!!!
upload trees and graphs concepts as soon as possible
Sure :)
Great 👍
Great Mam
I am not able to get below code, can you please help me on this.
class Node:
def __init__(self, value, next=None):
self.value = value
self.next = next
L = Node("a", Node("b", Node("c", Node("d"))))
print(L.next.next.next.value)
first node1 will be created with value d and next as None.
then node2 will be created with value as c and its next as reference of d
c---->d
then create node3 with value as b
b--->c---->d
then next node
a--->b--->c---->d
now if you print L.value it will print a, L.next is reference of b
L.next.next means reference of c
L.next.next.next means reference of d
And because you are printing its value we will get output as d.
@@AmulsAcademy Thank you, is this also called nested function?
This is for c program or python?
For python
Superb
Thank you 😊
when ur upload remaining videos mam
Soon :)
amazing
enable the subtitle option
👍
👍
👍
👍
👍
👍
👍
👍
Thank you 😊
why you dot' reply on anyone's comment ,,
Hello
Sorry for the late reply :)
Add a paypal or something for if someone finds it useful and benefits them and want to donate
Noted 😊❤️
didi hindi me bhi padhaya kriye
Hii
Hello :)
The concept of insertion between two nodes isn't correct.
V
Worst Explanation for the Linked List !! very unprofessional delivery, especially adding the beginning part. Sister totally lost it.
Osm explanation