Forgive me for the ignorance (I'm a front end dev), but can someone explain to me why this made it to the front page of hacker news when there are already many resources for learning data structures?<p>I feel like I could just go through the docs for for java / kotlin collections lib and cracking the code interview, and get a good understanding of DS / algos. What would this offer beyond that?<p>(this is a genuine question, btw, no sarcasm, there is something here that is resonating with other folks, but not me and I would like to know what that is)
Here's an interesting resource for those who like it formal: <a href="https://people.mpi-inf.mpg.de/~mehlhorn/ftp/Mehlhorn-Sanders-Toolbox.pdf" rel="nofollow">https://people.mpi-inf.mpg.de/~mehlhorn/ftp/Mehlhorn-Sanders...</a>
Wow, good for them teaching software engineering, and A++++ for the Ousterhout book <<a href="https://www.amazon.com/Philosophy-Software-Design-John-Ousterhout/dp/1732102201" rel="nofollow">https://www.amazon.com/Philosophy-Software-Design-John-Ouste...</a>>; I wish everyone would read it
If you like this, I strongly encourage you to also check out Harvard’s CS50. Lectures are all on YouTube. <a href="https://cs50.harvard.edu" rel="nofollow">https://cs50.harvard.edu</a>
Here's my question:<p>This seems wonderful for 2010.<p>It's 2023. We have 3B1B, SoME, Python Tutor (which now does many languages), and various types of fairly smart tools to support kids as they're coding (e.g. Jupyter/Pluto-notebook style system, ones like Khan Academy, and ones with a split pane).<p>Has this progress been applied to algorithms? If not, why not?
I have to appreciate the intelligence of top notch CS school students. I once took the equivalent class in CMU and couldn't even complete the first assignment. Forgot which one but the last problem is too hard for me.<p>Then I realized I better just study whatever I'm interested in and go back to algo if needed.
Oh man that brings back nostalgia from my 1997/98 student days. CS61B was okay. But I still have nightmares from CS61A which was taught in Scheme back then. I've hated recursions and using an ((excessive amount) of brackets) ever since.
how does it compare to princetons algorithms part 1 course: <a href="https://www.coursera.org/learn/algorithms-part1" rel="nofollow">https://www.coursera.org/learn/algorithms-part1</a>
I can't believe they still teach red-black trees. The complexity distracts so much from learning. Both AVL and weight-balanced trees are simpler to implement and easier to understand.
Has anyone had any success using course pages like this for guiding their FAANG interview prep? thinking about trying some of these projects to refresh my brain for an upcoming interview.