VP R&D @ Bizzabo
Codes and manages engineering at Bizzabo
Blogs at berzniz.com
Interviewed ~80 developers in the past year
I am going to share practical tips & secrets
Our task is to REDUCE THE RISK of hiring you
(it's a mutual task)
A conversation with the purpose of finding a mutual fit
Pssss… can you keep a secret?
“In principle, it’s simple. You’re looking for people who are Smart, and Get things done.”
Read our website before coming to the interview
Come on time, smile and be energetic
“Describe a time where team work was required to complete a task”
“Describe how you learned a new skill”
“Describe a situation when you overcame something difficult”
Side projects and web apps you've created
We're looking for passionate people, with fire in their eyes
Saying
“I don’t know”
is better than explaining things you know nothing about
Repeat the question
“So you want me to find the string that appears the most in the array?”
Ask questions
“May I use temporary variables?”
We want to see your thought process
Start with the most naive and simple solution that works, communicate it and move to a better one
Draw arrays, show progress, debug it on paper
// Sum an array
[1, 2, 3, 4].reduce((sum, x) => (x + sum), 0)
Draw the loop, step by step
| x | sum | x + sum |
|---|---|---|
| 1 | + 0 | = 1 |
| 2 | + 1 | = 3 |
| 3 | + 3 | = 6 |
| 4 | + 6 | = 10 |
Re-write your solution, do not submit your drafts
Use clear handwriting, indentation, good variable names
function reverse(string) {
return string
.split('')
.reverse()
.join('');
}To evaluate your solution learn about complexity and the Big O notation
// O(1)
obj.Hello = 'Shalom'
obj.Hello === 'Shalom'
// O(n)
for (...) {}
// Also O(n) because O(n+n) = O(2n) = O(n)
for (...) {}
for (...) {}
// O(n^2)
for (...) {
for (...) {}
}
// O(n*log(n))
arr.sort()
Let us know. We value your honesty!
Write a function that gets an array of strings and returns the string with the most occurrences.
// Example:
// For ['Blue', 'Green', 'Red', 'Green', 'Yellow']
// it should return 'Green'
How would you reverse a Linked List?
Please write the code to do so
Write code that shuffles an array
// Example:
// For [1, 2, 3, 4, 5] it might shuffle it this way:
//
// [4, 1, 5, 3, 2]
Can it be done "in place"? without using another array/object?
Not my favorite, but people seem to keep asking them
"How many golf balls can fit in a school bus?"
"How many times a day does a clock’s hands overlap?"
berzniz@gmail.com