
How can modulo be used? How can division?.What improvements can be made to the code?.Here are some things to discuss with the applicant. Once we talk about the validity of the output, we will proceed to talk about The “If/else ladder” and concatenation examples atĪre representative of the type of solutions I will usually get from Javaĭevelopers, which is obviously similar to the I will ignore these problems depending on the later results. Variations where the user starts at 0, ends at 101, or prints the number on each Have them do that so the output is a little easier to read. If the applicant has not separated the output with newlines, I will typically She is done, we talk about whether the program works. We mayĪlso discuss implementation details and tradeoffs. If the number is a multiple of 3 and 5, print FizzBuzzĭuring implementation, I will answer any questions the applicant asks.If the number is a multiple of 5, print Buzz.If the number is a multiple of 3, print Fizz.Implement FizzBuzz for the numbers 1 through 100. Here are the instructions as I’d typically give them: For this part of the interview, I just want to see that the taskĬan be done. Will use a laptop loaded with some mainstream languages like Java, node, Ruby,Īnd Python. If the user has brought a laptop, she can use it otherwise, she (Yes, someone has just Googled the solution for FizzBuzz before.)

I amįine with the applicant using any language and any online resources to complete I consider implementing the letter of the exercise to be just a warm up. I think it is critical to discuss both high-level and low-level aspects I see the test as an avenue for detailed discussion about code, which can beīypassed if the applicant has already provided some sort of portfolio we canĭiscuss.


If you are interested in the debate here are some links: 1, 2, 3 Useful method for interviewing, but I personally like to use it in the interviews There are those who debate whether this or any programming test is a fair or Is commonly used as a programming exercise.
