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

PorkrollPosadist@hexbear.net

replaceable@hexbear.net

VILenin@hexbear.net

EmmaGoldman@hexbear.net

SexUnderSocialism@hexbear.net

ZoomeristLeninist@hexbear.net

khizuo@hexbear.net

Sulvor@hexbear.net

Coding Challenges to Practice (hexbear.net)

submitted 2 months ago by roux@hexbear.net to c/askchapo@hexbear.net

6 comments fedilink hide all child comments

cross-posted from: https://hexbear.net/post/3855446

So I have an interview coming up sometime in the next 2 weeks and I have to do a few coding and SQL problems as part of it. I wanna start practicing now because I've gotten a bit rusty on algs and such. Does anyone have any suggestions on like array sorts and such to work on or like code golf sites to use? I have Leetcode pulled up and will be working a bit through that today but I just wanna get in as much practice as I can leading up to the interview. I donno when the interview will be but I just heard through the grapevine that there will be one.

I've been working on my own webdev stuff but the most I've had to touch JavaScript for is basically conditionals and loops, so I feel like I've fallen down on the other stuff a bit.

TIA

you are viewing a single comment's thread
view the rest of the comments

[–] roux@hexbear.net 4 points 2 months ago (1 children)

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.

[–] propter_hog@hexbear.net 5 points 2 months ago (1 children)

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.

[–] roux@hexbear.net 4 points 2 months ago

It's honestly the first time I've heard about it. I'll look into it.