Feynman Technique: Data Structure- Queues

Key Takeaways

let's use the findan technique to learn data structures really well really fast first let's choose a data structure to start out with let's pick a q I got to spend time actually learning it and for that I'm going to pick this Geeks for geeks article now I'm going to FaceTime one of my friends and explain it to them Q is a first in first out ordering system it can use an array or link list as a backing structure and it's really useful for breath for search algorithms at this point if I get stuck or confused I go back to the source material and try to learn again the last step I think is the most important one I'm going to talk to my buddy again and explain in simpler terms and use analogies think of a queue when you're at the grocery store in line the person who's at the front of the line they'll get process first they'll be able to check out first the last person gets checked out last first in first out cues in simple terms so try this and follow her more