this post was submitted on 08 Nov 2024
13 points (100.0% liked)
askchapo
22838 readers
304 users here now
Ask Hexbear is the place to ask and answer ~~thought-provoking~~ questions.
Rules:
-
Posts must ask a question.
-
If the question asked is serious, answer seriously.
-
Questions where you want to learn more about socialism are allowed, but questions in bad faith are not.
-
Try !feedback@hexbear.net if you're having questions about regarding moderation, site policy, the site itself, development, volunteering or the mod team.
founded 4 years ago
MODERATORS
you are viewing a single comment's thread
view the rest of the comments
view the rest of the comments
Copying my comment from that thread:
https://www.crackingthecodinginterview.com/
Not linking to amazon. I got my copy from a thrift store.
Also, to add to this, in my experience it helps to have a few algorithms memorized. I learned Red Black Trees, Bubble Sort, Merge Sort (and why it's always faster than Bubble Sort), and how to write a stack. There are undoubtedly other ones to memorize, too, but these came up a lot in my interviews. They usually will not say, "hey, write a bubble sort real quick", but if you can hammer it out when they ask you to find the smallest item in an array or whatever, they'll be pleased. And when they ask how you could speed it up, swap out bubble sort for merge sort. It's just good info to have in your tool box.
Algs are something I've been really meaning to get back up to speed on. Sometime next year I plan on really tackling ReactJS and all the more advanced JS stuff but this sort of fell into my lap. Thanks for the extra info too.
I for sure had Bubble sort in mind as well as just find smallest number in an array etc. Embarrassingly, Red Black Trees is unfamiliar and I've only heard of Merge so it looks like I should start there.
I've only ever been asked to explain how a Red Black Tree works; I haven't had to implement it. It's important because it's the basis for how operating systems handle paging.
It's honestly the first time I've heard about it. I'll look into it.