Simplified Blackjack: JavaScript Interview with a Google Engineer

preview_player
Показать описание
In this JavaScript mock interview, a Google engineer asks the interviewee to solve a Simplified Blackjack problem, where they must determine the number of ways the dealer can bust. This problem is targeted toward the L4 level.

TIMESTAMPS
00:00 Introduction
01:20 Target Setting
02:22 Coding Rounds at Google
04:14 Explaining Blackjack and Understanding the Rules
07:04 Problem Starts
08:37 Planning Solution with Template
17:05 Coding Begins
20:45 Time and Space Complexity
33:55 Coding Continues
42:35 Calculate the Percentage Chance a Dealer Would Bust
46:08 Feedback
Рекомендации по теме
Комментарии
Автор

Regrettably, our editor didn't capture the drawings made during time and space complexity portion of this mock interview as it was conducted prior to our new whiteboard feature. That being said, we have still decided to publish this replay as the overwhelming majority of the content contains useful insights into what a real Google interview is like. We also hope you can enjoy this unique problem that deviates from the normal leetcode-style problem.

interviewingio