Hello and welcome to the interview endgame. Today we’ll be taking a look at writing fizzBuzz in binary. Tech interviews continue to get more and more difficult, which led me to think what is the endgame, where do we reach a point where “ok, this is enough”

Data Structure and Algorithm questions are common in Technical Interviews. I believe they are a good way to test a baseline for a candidate, but I do believe there are limits to the levels of questions that should be asked. Additionally, if I’m applying for a Web Dev position, there should also be position-specific questions, not just a pure reliance on DS and Algos.

This led me to think, instead of 6 round interviews, save me some time and just ask me to write fizzBuzz in binary because I won’t be able to answer it. Then I got to thinking could I answer it?

Now the video has come to life, I attempted to do this in an interview-style setting where I wouldn’t have access to any external resources, all I have access to is a whiteboard, a keyboard to type 0’s and 1’s, and my memory.

Thank you so much for watching, check out Dev Dog Daily to frontend related topics. We cover, HTML, CSS, JavaScript, React, and Vue.js.

Chapters:
0:00 - Why am I doing fizzBuzz in Binary?
1:51 - The Setup
4:08 - Challenge Begins - Function Declaration
9:41 - Name the function fizzBuzz
14:16 - Add Parameter named n
17:59 - Declare res variable
26:24 - Create a For Loop
42:30 - Declare an str variable inside of the loop
50:27 - Condition if i is divisible by 3
1:04:51 - Condition if i is divisible by 5
1:19:18 - Check if the str is empty
1:29:09 - Add str to res
1:36:34 - Close the For Loop
1:38:10 - Return the res Array
1:43:28 - Add Closing Bracket to Function
1:44:30 - Convert our Code and Test