Of all the blockers of dynamism, I have known comfort zone to be the deadliest. For it gives us a false hope that the place and position we are in, is perfect. A poison for growth mindset I would say.
Once we stay somewhere for 5+ years, it becomes a home for us. Home is hard to leave. For it renders us with a feeling of fulfillment.
Being a creature of habit, my behavior lately exhibits every sign of a person in comfort zone. I have never been quite fond of change. I am staying in the same flat for the last five years, driving the same car to work through the same route. Every person at the restaurant I visit knows my taste buds and all I have to say is, “The same cuisine I order always, please”. Microsoft has been my home for close to six years now.
This has greatly distanced me from the real world. Silent contemplation in lonely nights on these aspects renders me anxious. The Tech world is changing and so are the requirements. Not having slightest of clue on how the water tastes outside and where I stand, I said yes when an opportunity knocked my door tenth time since my college days.
When it all started?
It was a lazy friday noon. Winds blew hot, burning skin of people it touched. Sitting idle, my eyes alighted on a mail from a recruiter at the company. As usual, I responded that I was content with my work and things were going well for me. She asked me to just have a phone conversation and if things looked fascinating, we could move forward.
I said, “Yes”. After all, what harm could one phone call have done. Must I say, she was very convincing.
1 Informational (35 minutes) + 1 Screening (20 minutes) + 2 Skype (45 minutes each) + 5 F2F onsite rounds
Informational
This was supposed to be just a phone call until it became really interesting. Things like fantastic opportunities, work culture, smart engineers and location preferences were presented. In exchange, I talked about the work I have been doing at Microsoft.
Screening
Being no different from screening rounds of other companies, the focus was mainly to judge if my skills are worth time of their great engineers. Call it a first level of check.
Basic questions to test Algorithmic + Coding + Mathematical skills — Quick sort, Merge sort, Hashing, Powers of 2, Tree traversals etc.
I got a call next day that they can move to the interview process.
Video call – Round #1
The first DP problem on the face gave me sweats I find myself unable to pen in words even today. A simple problem, anyone with decent practice could have solved in 5 minutes.
Count number of ways to divide an array of n balls in k non-empty subsets.
After few failed attempts, I came up with a working recurrence relation:
Number of ways would be:
Put (k – 1) balls in n sunsets and remaining one in any of n sunsets +
Put (k – 1) balls in (n – 1) subsets and remaining one in the empty subset
f(n, k) = f(n, k – 1) * kC1 + f(n – 1, k – 1)
I didn’t do very well in this round as my first few formulae didn’t work and I took few hints to come up with the right solution. However, I was able to write the working code very fast, which turned to my advantage.
The feedback was shared in 2 hours that I exhibited good potential. My coding was fast. But I needed to practice more. Since it was an onsite opportunity, they asked for another round.
Video call – Round #2
A fairly simple problem to find a missing character in two words. They kept on tweaking the problem, adding more constraints and complexity along the way.
I wrote code for three approaches.
Onsite (Finally), phew…
I wasn’t quite sure if I would be able to make to onsite. I was disappointed of my performance and I needed a break to get over frustration. A visit to hometown seemed to be the most logical decision, which I later regretted after wasting thousands of bucks on flight tickets.
One lazy Friday evening in office, when I was doing some code review, my recruiter informed me over call that they can move ahead with the onsite process. I was wildly surprised. She mentioned that she didn’t want me to spend the weekend in worry and hence, shared the happy news as soon as she could.
They booked my flight and hotel tickets. We talked for several days about my travel arrangements, preparation and any queries I had in mind.
The D day
Time flies. The D day arrived sooner than I had anticipated. I landed in the evening, checked in to the hotel, had a lavish dinner and slept like a baby to prep myself for the next big day.
Round #1
In order to avoid last minute rush, especially in a place I had never been before, I arrived an hour early. The lobby was decor’ed with statues of slim geeks in skinny jeans holding mobile phones in their hands, emphasizing the direction the current generation is going and the core focus of the company. Beside me was a digital display with an array of tiles which flipped every couple of seconds showcasing that the company cares about Diversity and Inclusion.
There wasn’t a slightest of fear on what’s gonna happen next. Instead my mind was puzzled with how the tiles were working. Ah! So they have multiple threads delivering the content to the tiles sitting in UI. The threads may never be sitting idle as the text appearing the those tiles as keyboard inputs. Or may be this is an illusion of parallelism as the context switch is so fast.
A guy in his early 30s, wearing a broad smile and a pony hanging on his back broke my reverie.
“Are you Aashish?”, his voice was as fresh as morning dew.
Having done some research about him on LinkedIn, “Yes”, I knew who I was talking to.
“Hi! I am sorry I’m late by 30 seconds. I took a wrong turn. Hope you didn’t have to wait long.”, he smiled, “Let us walk to the interview room, shall we?”. There was a passion in his tone of voice. A passion that I have seen in very few people I have interacted with in my life so far.
We walked in a small meeting room. A white board was walled on the left, a table for 4 positioned in the center and a laptop connected to a projector on the right.
We spent the first few minutes knowing about his background, his work and his team.
“You’ve been given two words A and B. How many minimum concatenations of word A is needed to form subsequence B?”, he explained the problem with one example.
Despite solving few problems on subsequences in the past, I had never heard of this pattern of problem before. It wasn’t a surprise. The company was wildly famous for asking new problems. And if not, they would tweak it to the extent it becomes new.
I started with asking questions to understand the scope of the problem.
“Will the words contain only ASCII characters How long can be the words? Can they fit in one machine? What do we return if no concatenation can make a desired subsequence? etc”
The first approach that popped up my mind was to put all characters of word A in a set and check if it contains every character from word B. Once it’s certain that a solution exists, I played with two pointers pointing to words A and B and wrapping around pointer to word A to the beginning when we fall short of characters. The minimum concatenation is the count of wrapping done.
The time complexity of this solution is O(lenA x lenB).
While the above approach worked fine, the time complexity wasn’t great. I proposed another solution to create a map of characters to their indices (unordered_map<char, list<int>>) in word A. Now instead of linearly looking for a character from word B in A, a binary search in the map would reduce the time complexity to logA. One key point to take care was to make sure we are picking the next index from where we left of and increment the count of minimum concatenation at right time. upper_bound method worked like a charm. The time complexity reduced to O(log(lenA) x lenB).
“Sounds great. Do you want to code it?”, he seemed fine with the approach.
The code was pretty straight forward to write. He took a look at the implementation, went through various corner cases and finally said, “Great, we have 5 more minutes. If you have any question about the company, the team or anything else, fire at me.”
The company being a leader in Scalability, I was curious to know how they dealt with various challenges they faced and learning from it. Work-life balance, company culture, healthy environment, quality of work were other topics we discussed. He wished me good luck for the next round and left.
Round #2
Ralf isn’t a Computer Scientist. But his quote holds true for every aspect of engineering I know of. The beauty of the world lies in design. But we are not here to talk about how Lamborghini design is better than its rivals or why Tesla is winning over the world. Well, not today.
System Design has been a hype for quite long and for all the right reasons. It’s the core of every business & technical strategy and the success behind every company.
I only got time to gulp some water before a guy with notebook in his hand walked in. Bald, mature & experienced look, he seemed like the kind of person people would want to go for seeking expert opinions.
“So how did your first round go?”, he broke the ice.
“It was great”, I said cheerfully.
“Well, that’s rare here. I usually hear responses like, it was okay or I don’t know.”, he said, “Hope it went as good as you said”, he further added.
“Are you aware of what a System Design is.”, he asked, “Have you ever used FaceBook or Yelp checkin system? I want you to design that.”, he continued without waiting for my answer. Guess it was a rhetorical question.
“Before we start, let me tell you that I would most probably not ask you to write any code. So feel free to fire all complex and advanced data Structures that pop in your mind. “
As all design discussions start, I began with understanding the scope of the system. Users would tap on the Add location and it would show the list of 10 nearest location to choose from. The check in status would then be saved on the server. Delivering the status to user’s friends was out of scope. It’s good to have high availability and low latency for good user experience in a system like this. Availability can have an edge over Consistency. If a user doesn’t see a newly added location for sometime, it should be okay.
He wanted me to come up with numbers. It was important, especially when you design something of FB scale. How many people, how many daily active users, how many locations, the size of database, number of machines, network bandwidth etc.
So, there are 2.2 billion users. Let’s say we have 70% (1.5 billion) DAU and 30% of them checkin at least once a day. There can be hot users as well. Let’s worry about them later.
The locations can be anything from coffee shops to hospitals to parks to big shopping complexes. All locations can be stored in a database.
“How many locations do you think there can be?”, he chimed in.
Umm, there are around ‘X’ places in the world and each place can have an average of ‘Y’ locations…
“Don’t you think that it would make more sense to calculate the number of locations based on the world population rather than geographical area?”
Ah, yes! The world population is 7 billion and there can be one location on an average per hundred people. We agreed upon 700 millions locations.
“Which type of database will you use to store the locations? How many machines do you need?”
I calculated the size of data to deal with and explained sharding can be done over LocationId in NoSQL. Calculation of network bandwidth with that data and machine config I was given (128 Gig, Octa core) gave an idea on the number of machines needed. Performance numbers talked by Jeff Dean was of great help.
When the user taps on the search location, latitude and longitude will be send to the server…
“Okay! How would you fetch the 10 nearest locations of a user?”
Well, locations can be added to a Graph in memory and…
“What if there is no node in Graph corresponding to user location? What if a user is standing in the middle of a street?”
Umm… The whole structure can be seen as a 2D plane with four quadrants. Locations can be read from DB and organized in memory in Quad tree. Nodes at each level would be connected through a Linked List. Looking for nearest location would boil down to Quad-nary search based on user location where we discard three children at each level as we narrow down the search. If a node doesn’t have enough locations, we would check its siblings/cousins, maintain a max heap of size 10 and return the result.
“Can you improve it further?”
I think we can use K Dimensional tree as well. Unlike Quad tree, we don’t need to fork exactly in the middle.
“So how does the whole flow look like?”
I drew a high level design on the white board where the user location is sent from client to an Application server. The App server then passes the location to a NearestLocationFinder engine. Result is passed back to user. User checks in. The checkin data is sent to another Application server. Since the checkin data can contain huge bits like images and videos, the App server would put the checkin data in a Message Queue. We would spin off few workers to pick entries from Message Queue and write to a Database. We would need two Load Balancers. One for each Application server.
We further discussed on dealing with SPOF (Single Point of Failure) through replica, pros & cons of Master – Master and Master – Slave models. A caching mechanism in place (something like Memcached) for low latency to display user checkin history.
Forty minutes just flew. As usual, the interview ended up with me asking few questions around Scalability.
Having realized many things that can go wrong in a design of humongous scale, “How often do you calculate these numbers? Are they very accurate?”, I asked in wonder.
“We do work with numbers. But they aren’t always correct. It takes a lot of experience”, he replied, “Good luck with your next interview”, and he left.
Round #3
The interviews so far had been a breeze. Discussing interesting problems is always fascinating and mind boggling.
In no time, the third interviewer walked in, introduced himself, the team he was working on and other cool stuffs.
A simple problem on expression evaluation, except it had a twist on how Compilers work. State Automata quickly struck my mind like a bolt of lightning. I drew few states to parse and switch between the states based on input. He mostly emphasized on why I used Data Structure ‘X’ over ‘Y’. Coding was simple and I had to use map and Stack. That’s the beauty of state machine. Once there is a working diagram, coding doesn’t take much efforts.
“Let’s try to break the code”, he smiled while going through the code.
I looked for every possible corner case that crossed my mind and each one of them seemed to be covered.
“What if one of the numbers is 0?”, he looked at me.
“Damn!”
In the heat of discussing big things, I missed to handle critical divide by zero error. Albeit I fixed it quickly, I think the harm was done.
Lunch break
A person with no expression on his face was waiting outside to take me to lunch. He looked very well acquainted with the environment and the work place, probably because of spending many years there. We quickly rushed to the cafeteria. An array of delicious cuisines, varying from Indian to Italian to Mediterranean to every other I could think of, accompanied with drinks and deserts. I wish it weren’t an interview day and I were there with an empty belly & mind void of any thought.
While taking a stroll in the beautiful campus post lunch, we crossed meditation room, music hall decor’ed with Grand Piano & other instruments, very strange shaped offices fostering creativity. Filled with awe, we entered a room that looked like forest. Trees peeking from the left, tiny waterfall gliding softly in the corner, birds chirping over the branches. In the center was lying a young girl doing something on her laptop. I was amazed and blown away.
Round #4
A glimpse of the amazing campus pushed me to give my best. I met another cool guy who asked a problem on finding nearest favorite city of a user.
“I am not, in particular, looking for a solution. I am looking for ideas”, he added.
I asked few questions to understand the scale at play — How many cities can there be? Can we fit all of them in one machine?
I threw some Algorithm (which I don’t remember) in the beginning. While I was explaining on the board, a variation of Dijkshtra’s popped up my mind which seemed to work well. He was fine with it. I also added some preprocessing to optimize the Algorithm as the cities don’t change very frequently. Writing code took another 5 minutes.
“How often would you preprocess the data?”,he asked.
In the times when there is less load on the server, like once every 24 hours.
“Don’t you think it will hamper accuracy?”.
Yes, it’ll. But not very far. It will help users get data in reasonable time window. User experience matters. The error in system exists even today. Maps wasn’t able to detect the new U turn for weeks.
I was happy and content until he added the twist.
“How would you improve it?”, he smiled.
This was the most optimal solution that crossed my mind there. Luckily while skimming through my FB newsfeed few months back, I watched a video on comparison of Djikshtra’s and heuristics based A* Algorithm.
“We can use some heuristics to scope the search instead of going haywire. I remember reading about A* Algorithm in my graduation days.”, I felt relaxed.
I could see him smiling. It looked like this was what he was looking for.
So if the direction of favorite city of the user lies South, we can bail out the Algo and not explore the North. There can be a possibility that we have a rocky road in the direction we are looking and there is a faster way if we take the opposite direction and use a newly constructed flyover.
“This is a good practical solution. Not everytime we want the perfect accurate result. There is a careful balance between accuracy and latency”, he smiled.
We discussed few other practical approaches, few things on and collection of data and ML.
The best interview of the day, I could feel it from the conversation with him. He was widely impressed.
“So tell me about the things you do at Microsoft. I went through your resume and it was pretty impressive”, he said.
“Microsoft is a great company. Smart people, awesome culture. To be honest, I don’t find anything bad there. If I had, I won’t have stayed 5 years there”, I responded. We discussed some of the work I was doing without violating any NDA.
Round #5 — The final battle
There is a saying, “All is well that ends well”.
No matter what I do, I can’t seem to annihilate those 45 minutes of my life. Rooted deep inside the neurons of my brain, it hurts even today and makes me wonder how I could have done it any better.
DP has always been my nightmare. No matter how many problems I solve, a new one still surprises me.
I was greeted by an Indian guy in the last round. Unlike other interviewers, he, without any talk, rushed to a problem which had some made up story on Cargo, men and packages.
I recognized it in an instant. It was a complex version of famous Painter Partition problem. A fairly difficult problem for people who haven’t practiced DP well. I gave a brute force exponential solution and explained on the white board followed by for-for-for DP solution. I, then with some example, pictured on the board how the table would be filled. He seemed fine with the approach and asked to code.
That’s where things went south. A recursive solution was easier and straight forward. I could have just written the brute force solution I had explained in the beginning and stored the result in a table to optimize. It was a win-win situation. But No! I had to cripple myself to death.
Beaming with confidence, I started writing for-for-for iterative solution and explaining what each line of code was supposed to do along the way. I made critical off-by-one error and another error in calculation where a column was being added the way I didn’t want to. I also felt irritated that even after explaining Algo twice — Once on the white board, later while writing code, he was wasting time in asking things I had already explained. This didn’t happen in any other round and I would never expect it from someone working at a company of that stature.
I, however was able to correct one of the errors and was close to fixing second when he asked me to write the recursion solution. Something I could have done in the first place without suffering any agony.
“Let bygones be bygones”, I sighed, took a deep breath and wrote the perfect working solution in single attempt, all within 3 minutes. I just needed another minute to store the result in a table. But the time was over. If only he had cooperated more, I had performed better.
And as I had guessed, he, without any talk, took me out of the building.
If I do an assessment of my performance, I did good in first, not sure about second, okay in third, great in fourth and not good in fifth. Interview process was a breeze and as smooth as butter. I was pretty impressed with how well organized everything was.
Please feel free to ask any question, except the name of the company 🙂
You may also like:
Copyright © 2019, Aashish Barnwal, All rights reserved.