2017 Coding Interview Crunch: Day 21

Kalvin T. Lam
Aug 24, 2017 · 2 min read

Date: August 23

Subject: Math, Cycle Detection

Time committed: 3

Problems tackled: Happy Number, Reverse Integer, Bulb Switcher, Palindrome Number

General comments:

  • I’m feeling good about this. One more day (tomorrow) until my first legit interview of the fall season. I’m stoked. I feel more prepared than ever, and I’ll be ready to give it my all. I’m glad I got the chance to review a lot of concepts that I was rusty on, and I’m glad I was able to reinforce a lot of the things that I thought I knew (but then I really didn’t…).
  • Tomorrow is the day before the interview, so I think I may focus on less Algo-y stuff and more on general interviewing things (behavioral, web, servers, etc.). After the JS interview, I’ll reflect on how my preparation has gone so far and then recoup for the next stage (the TS onsite!).

Read for next time:

  • Floyd’s Cycle Detection Algorithm (really read up on this, brush up on linked lists as well)
  • Solution for Happy Number
  • Abstract class vs Interface
  • Inheritance vs Polymorphism
  • OOP!
  • Topological sort!
)
Kalvin T. Lam

Written by

http://kalvinlam.com/

Welcome to a place where words matter. On Medium, smart voices and original ideas take center stage - with no ads in sight. Watch
Follow all the topics you care about, and we’ll deliver the best stories for you to your homepage and inbox. Explore
Get unlimited access to the best stories on Medium — and support writers while you’re at it. Just $5/month. Upgrade