Algorithms and Data Structures Tutorial - Full Course for Beginners
video description
Date: 2022-03-14
Related videos
Comments and reviews: 10
Mark
You are right ma'am! your explanation is easy to follow up for every beginner's, after much tutorial online I decided to give investor Emilia a try of $500 in less than two weeks she was able to make a profit of $5000,999. ever since then my life have been better afterwards, I'm grateful at all your financial information and education.
reply
You are right ma'am! your explanation is easy to follow up for every beginner's, after much tutorial online I decided to give investor Emilia a try of $500 in less than two weeks she was able to make a profit of $5000,999. ever since then my life have been better afterwards, I'm grateful at all your financial information and education.
reply
jai
Hey sir , i have a real world problem - I have a set of no. ,Which is group in 4 column and 30 rows - I have this kind of 100+ set .
I need to determine which particular set no. Is matching with other set .
Which particular row no. Is matching with other set no. Or in particular intervals. Etc
reply
Hey sir , i have a real world problem - I have a set of no. ,Which is group in 4 column and 30 rows - I have this kind of 100+ set .
I need to determine which particular set no. Is matching with other set .
Which particular row no. Is matching with other set no. Or in particular intervals. Etc
reply
Kid
How do I find the javascript equivalents to the codes written in python? Such as for the linked list. I am trying to follow along and translate but get stuck when trying to find an equivalent for the __repr__ function. In some cases, it seems that it isn't even needed in js.
reply
How do I find the javascript equivalents to the codes written in python? Such as for the linked list. I am trying to follow along and translate but get stuck when trying to find an equivalent for the __repr__ function. In some cases, it seems that it isn't even needed in js.
reply
1nvisibleYouth
Graduated with computer science degree, currently I have 2 years working experience of software development in machine learning and web application backend, but still look back to this to keep learning and improving
reply
Graduated with computer science degree, currently I have 2 years working experience of software development in machine learning and web application backend, but still look back to this to keep learning and improving
reply
StudiousPanda
Thanks alot for the video, learnt alot from it!
Just something that's bugging me: at 2:53:06, I think there's a small error for line 80. It should be -current = current.next_node-
That aside, thanks again!
reply
Thanks alot for the video, learnt alot from it!
Just something that's bugging me: at 2:53:06, I think there's a small error for line 80. It should be -current = current.next_node-
That aside, thanks again!
reply
Saleh
Hi, I-m student in uni and I-m studying computer science and I really struggling with coding. I don-t how to code specifically in python. Is there any way to improve my skill on coding.
reply
Hi, I-m student in uni and I-m studying computer science and I really struggling with coding. I don-t how to code specifically in python. Is there any way to improve my skill on coding.
reply
Joshua
Just 12 minutes in and I'm already blown off by the simplistic strategy applied in communicating what is mostly seen as a complex part of programming.
Kudos guys! -
reply
Just 12 minutes in and I'm already blown off by the simplistic strategy applied in communicating what is mostly seen as a complex part of programming.
Kudos guys! -
reply
Random
I believe at 1:38:00 you might have made a mistake, the length of the list is 4 and the midpoint is 2, which is probably why the editor chose 7 instead of 6.
reply
I believe at 1:38:00 you might have made a mistake, the length of the list is 4 and the midpoint is 2, which is probably why the editor chose 7 instead of 6.
reply
iburry
You really need to explain exactly how the split (divide) part of the merge sort is O(log n), because it is not at all clear to me that it is.
reply
You really need to explain exactly how the split (divide) part of the merge sort is O(log n), because it is not at all clear to me that it is.
reply
Sabu
getting
TypeError: unsupported operand type(s) for +: 'NoneType' and 'int' error
for
mid = (size // 2)
on linked merge sort part
reply
getting
TypeError: unsupported operand type(s) for +: 'NoneType' and 'int' error
for
mid = (size // 2)
on linked merge sort part
reply
Add a review, comment
Other channel videos
