How to ACTUALLY Master Data Structures FAST (with real coding examples)
HTML-код
- Опубликовано: 5 фев 2025
- 🦄 Pre-Order Kotlin Course here: 🦄 www.coderatlas...
📚[DATA STRUCTURES & ALGOS]📚 -- this is great for interview prep!
🎙️ neetcode.io/?u...
🌎[LEARN TO CODE w/ UDEMY] 🌎 -- this is great for beginners!
🎙️Java for Beginners: rb.gy/psyn3
🎙️Python For Beginners: rb.gy/4b5k6
🎙️JavaScript for Beginners: rb.gy/pna2q
🎙️Software Development Life Cycle: rb.gy/bg67h
🎙️Software Engineering 101: rb.gy/weu5l
📒 [ZERO TO MASTERY] 📒 -- this is great to level up your skills!
🎙️Courses: links.zerotoma...
🎙️Choose a CAREER Path: links.zerotoma...
🎙️Become a PYTHON Developer: links.zerotoma...
🎙️Become an AI Engineer: links.zerotoma...
🎙️ Become a REACT Developer: links.zerotoma...
🎙️Become a BLOCKCHAIN Developer: links.zerotoma...
📧[CONTACT]📧
🎙️1:1 Career Coaching!!! calendly.com/d...
📒 Business Email: poojadutt.tech@gmail.com
📚 Instagram: / fivefootraveler
👾 Discord: nas.io/pooja-d...
📒 Email List [JOIN NOW]: form.jotform.c...
*some links may be affiliate links*
📚 Learn Data Structures and Algorithms FAST: neetcode.io/?📚
🎉How to Learn Algorithms (up next) -> ruclips.net/video/F7sPauKsZXw/видео.html 🎉
Started and i am loving it alreadyy.
yes
yrr hindi m bta doo kya ho jayega
expired 😞
@@GagandeepSingh-db8eh the discount is only for the first 20 people unfortunately :/ but you can still check out neetcode!
00:22 - Data Structure
00:41 - Array
03:40 - Linked List
06:04 - Hash Map
09:27 - Stack
11:26 - Queues
12:30 - Tree
Stack is Last in, first out (LIFO). Queue is first in, first out (FIFO).
This is really well done! I love the focus on concepts rather than just the “big-Oh” times. And the examples made it pretty clear on when they’re useful, so this was awesome!
Thanks so much! I appreciate the kind words 😀
Outstanding video @PoojaDutt!!!! By far, one of the best explanations of some of the common DSA's used in code on YT! Keep it up!!!
Thanks so much! I really appreciate that 😀
This is easily the best intro to DSA that i've ever seen. Great video Pooja!!
And the sponsor isn't bad either 😉
Thanks so much!! 🎉 haha, can’t argue with that - the sponsor is pretty cool 😎
This video was really well-produced and you used really great analogies in very approachable ways. Good work!
Thanks so much! 😀
the way she explained certain topics with ease 🤧
That's frustrating now 😂😂😂😂
@@sk-kr1uy cz u can't catch up with every helpful info she has provided. yea kinda frustrating i must say 🤣🤣🤣
I have learnt a lot in last 15 minutes, than those tons of class room lectures. Thank you and God bless!
WoW i haven't seen anyone explain Data structures so smooth , great work keep it up
Awesome, wish I had a lecturer like you in my college. We just got a mini DSA pack in this, thanks for the video. It would be great we get a whole DSA Playlist from you 🙏
Same here
AP GP Best Hindi Explanation in India 💯 💯🎯🎯🎯
ruclips.net/p/PLlCpcDWq4nK-cVs4QsgmQ4rSn6l6sHumg&si=HbXzQSceUGIoqOjT
@@mktan-1223AP GP Best Hindi Explanation in India 💯 💯🎯🎯🎯
ruclips.net/p/PLlCpcDWq4nK-cVs4QsgmQ4rSn6l6sHumg&si=HbXzQSceUGIoqOjT
Great high level overview of most common ds. Nice for refreshing and understang at a basic level.
Simplicity is everything! Thank you this was a great video.
Glad you liked it!!
AP GP Best Hindi Explanation in India 💯 💯🎯🎯🎯
ruclips.net/p/PLlCpcDWq4nK-cVs4QsgmQ4rSn6l6sHumg&si=HbXzQSceUGIoqOjT
A really great introduction to DSA, with examples.
Thank you!
No problem, glad it was helpful!!
AP GP Best Hindi Explanation in India 💯 💯🎯🎯🎯
ruclips.net/p/PLlCpcDWq4nK-cVs4QsgmQ4rSn6l6sHumg&si=HbXzQSceUGIoqOjT
Man this is kind of lesson one needs truly, the principles of the data Structures were explained so clearly. Thank youu :)
Why 0's and 1's means
It represents +5 and -5 volt ...
Its like giving power and stopping power to the conductor....so in that way a set of 0s and 1s represents plus and 0
...0001 represents the bits
In javascript "arrays" are done with Typed Array magic class where you can only store numbers (they can be resizable).
And Array is actually a resizable "struct" (? or buffer I guess) of pointers that point each to their data, so the data of the whole Array is sparsely stored in memory.
You can also just make a binary ArrayBuffer and interpret it however you like.
I was finding it harder to understand DS until I came across your video. Thank you for using such amazing daily life example to visualize all the concept.
amazing course ...u revised me all datastracture majors that i learnt in university
Amazing video Pooja!! I was fascinated by your analogies and examples really improved my understanding of the data structures. I am definitely checking out your video on algorithms next. Cheers!
I'd like to note that "linked list" is kind of an umbrella term and nothing is stopping you from linking the nodes in it with 2 or 15 neighbours (though you might be running into graph or tree territory), creating vastly different performance considerations.
thanks learning for my day is from you. FYI : FIFO is mentioned as FEFO in the Queue chapter
Very good video, in case it hasn't been mentioned the reason 0 index is the default is because it allow you to do modular arithmetic on the indices. If you've ever had the pain of trying to do modular arithmetic on a base 1 language, first I'm sorry, second you will understand exactly why 0 is the default.
rThankyou!! A clear, well produced video is so refreshing !
Love your videos! The animation and editing looks so good, and the content is so helpful.
time 0:51 "the array size is fixed when it is created." this depends on the language you use in java Yes in javaScript No
This is so helpful! Thank you. Can you do more videos like this ?
How you easily pronounced the word 06:50😵💫😵💫😵💫.
Btw it was really very helpful because no one explains in this easy way, they are trying to make it harder stuff. So thank you so much for this wonderful content.
How beautifully and simply you've explained ☺ Amazing video Pooja👍
Wow!
This video is really helpful !
Thank you soo much for making this kind of Introductory videos 🙏😁
omg thank you so much!!!! didn't know that learning DSA was fun until now
Thank you Pooja.
You made it so simple that's readily absorbed!
❤
An ArrayList is actually an array and the size is fixed, but we don't handle the resizing or ... The collection interface is handling it.
Woah, thank you so much!!!! I am currently taking DSA in school. This is a blessing.
This is such a creative video! xD thank you! I understand data structure more now
Outstanding video, thank you so much for your explanation. Keep it up.
Excellent video, your real dictionary paper atlas cover cracked me up!
I Revised entire dataStructures in just 15min from this video .... thankyou miss @PoojaDutt🙂
4:51 no renaldo is harmed in this video 😂...by the way great introduction to DSA
Great video! could you please explain difference between Data Structures and Collections? I am confused.
You make it seem so easy - great video !
Awww thank you!!
that's a problem, right ?🤣
Ther'es a reason why array indexing starts with 0, not a rule.
can u cover graph and DP?
BTW: this video was very informative
6:51:- I can say "Ventriculocisternostomy", but I struggle with "is". Excellent video.
You did a great job.. 🎉I had to rewind, 😮you were goin too fast for me... I heard Michael Jordan and Garnett then, Insert, temp then link list 🤔😬😅😂
Under the hood, ArrayList uses an array. This means that removing and inserting items has a large overhead from shifting all the other items around. For that reason, we should look to avoid this method if possible.
AP GP Best Hindi Explanation in India 💯 💯🎯🎯🎯
ruclips.net/p/PLlCpcDWq4nK-cVs4QsgmQ4rSn6l6sHumg&si=HbXzQSceUGIoqOjT
The array starts with 0 is because the index is an offset inside the array. If you need to access the very first element your offset should be 0.
great introduction wowww, the examples were so helpful in order to understand the concepts, thank youuu so much!
Array is a tiny container or huge.. important characteristic can't be skipped is its of SAME TYPE
It's a crucial phase for your channel's growth Pooja, try decreasing ads.
I have learned so much by listening to your views.
Stunned by the simplicity of this video. A perfect video to start with! Kudos!
Thanks so much!!
@@PoojaDutt wanna post this on linkedin, but couldn't find you, would you please help?
@@KrishNamaste my linkedin is listed in the description of the channel (-:
@@KrishNamaste www.linkedin.com/mwlite/in/pooja-dutt-635b76a9
@@PoojaDutt thank you.
Thats how I learned it. You gotta make real life examples of it. I used actual file folders to break down the different search algorithms
Pooja, I hit the subscribe button right after watching this video. Thanks for helping me understand data structures, I've been struggling to understand them for a while now.
Wow loved this video! I made a career change to software development and I've a lot of stuff to learn, I'm working as a junior and I want to learn more about data structures and algorithms to get to the next level. This video is great introduction thanks❤
So glad the video was helpful! 😀
my man "Renaldo" is the linked list goat 😭
LEFO???? Last In First Out, LIFO!
holy... FEFO... i'm bailing.
I did it, I learned what an array is!
Thank you so much for this video, you explained everything so well and I appreciate the examples!
So glad it was helpful 😀
You just blown my mind after watching this you are miracle lady
Hello, Love your video!! Btw, what kind of theme do you use in your code editor? It looks so pretty!!
Great video, thanks a lot, and thanks for all the links. Best regards
I know why starting from 0 because it reduce one minus operation calculation each time when we finding index location of index find by base address and index*size of element but this index is come by relative index for find relative index we perform operations indexe - lower index, hear if lower index is 0 than we not need this - calculation because of this we start with 0
It was really helpful and what a great way to explain.
I quickly understood the examples, because of the 'plates'. Thank you.
Glad it was easy to understand 😀
Im a seasoned SWE and all i can say is real solid!
Thanks a lot✨
It really helped me🌸🌸🌸
It was an amazing video, I would like to know more on how you edited the video. Liked all of it.
To be honest, I would give this video thousands of likes.
Ahh thank you!
Give one more... Ie 1001.... Logically that gives like to this video 😂
This is a very good lecture ma'am, Can you please tech us the whole DSA ?
So much too learn with all the different programming languages, but this video has made things a little clearer when it comes to Data structures and Algorithm.
Thanks for the informative video!
AP GP Best Hindi Explanation in India 💯 💯🎯🎯🎯
ruclips.net/p/PLlCpcDWq4nK-cVs4QsgmQ4rSn6l6sHumg&si=HbXzQSceUGIoqOjT
can you please make a full playlist in data structures and algorithms
Omg you are so good in explaining these topics.
Hi Pooja Dutt. I mentioned earlier in the wrong video to please make a video reviewing the zero to mastery bootcamp. Please I will like to see this review to know if I should or I shouldn't go for this bootcamp.
Very useful information, specially for beginners 👏👏
Thanks!! Glad you liked it 😀
This just changed my life.
one thing i would like to add that indexing is not just a rule it is the distance of the element from the first element so the distance between first and first element is zero hence it is the way it is!
Very helpful video pooja thank u so much 😊😊😊
More people are using apps during the interview, like Coding Interview Champ to get the answers and then explain the solution to the interviewer, wondering how the success rate really is
Yo did great with setting examples with those items. Keep it up
Basic knowledge acquired 🤝
Me panicking because I have DSA Class this coming fall 2023, and then seeing this. Thank you 🙏🏾. I love that you used Ghana 🇬🇭! That’s weee I was born!
Edit: Like if you feel the same way too.
You’ve got this!!!
damn you actually explained linked list better than my prof i did not understand it back then
Most CS degrees take two semesters of data structure courses
Wow great job 👍
This is the best foundation to become pro 💯. Kudos to pooja🙌
Thank You Pooja 🙏🙏🙌🙌
😮 thank you so much 👍👍
You just earned a subscriber, this was really helpful
Loved that you made video so fast after discussion about dsa in last friday discord session🎉❤
Ahh you noticed!! 😀
@@PoojaDutt ah well I was there that day
I love you sis for making this video 🙏🙏
hey ur vedio is soo clear i just stated following u now i request u to please put one vedio which cover all the topics of c++ for revision purpose pls dii its a humble request
@PoojaDutt. shut up fake accounts
thanks for such a clear explanation
girl it's fun to learn with you😉
Oh wow, I am from Ghana, and currently studying in India.😊
Wow, this video is amazing!😲 Your programming skills are truly impressive.
Thank you! I appreciate the kind words 😀
So..
First In First Out -> FIFO
Last In First Out -> LIFO
They're acronyms. There's no LEFO/FEFO. It's just that when some people pronounce the acronyms as a word, they make the 'I' sound like 'ee' rather than 'eye'
Also, I don't think many list implementations are using just singly linked lists these days. But I've also never written a line of Java, so I don't know.
It's also important to note that a family tree isn't actually a very good analog of a computer science tree. Generally CS trees have the constraint that any given node only has one parent, otherwise you get the more general data structure, a graph.
One more nit: a tree is not at all like a hashmap. Hash maps use a hashing function to determine a slot to store entries and then a secondary data structure to handle collisions. In fact, a hash map might end up being built of many trees! Trees are, rather, more general cases of lists in which a node can have any number of children, but may only have one parent.
I agree..think uve not learnt the fundamentals properly
what about FILO and LILO
jk
Great video! Super informative :D
Awesome explanations ! Thanks ! ❤❤
No problem!!
1:12 Please correct me if I'm wrong because I don't have formal training in CS. I just kinda learn bits and pieces as I dicked around with coding.
This is how I imagined it when I learned about pointers and addresses. If a guy name Bob has a home at an address, then the person living one house over is Bob's 1st neighbor, the person living 2 houses over is Bob's 2nd neighbor, etc. In a way, Bob is his 0-th neighbor. I thought that computers dealt with arrays in the same way. It will find an address in its memory to be a home for the 1st number in the array, then it will house the 2nd number as the 1st neighboring address, then the 3rd number as the 2nd neighboring address, etc.