LinkedIn | From constant rejections to an offer | SSE
- Result
- Offer
- Experience
- 5.5 years
- Posted
- 11 Dec 2024
Summary
After enduring a challenging period of rejections from several top companies, I successfully secured a Software Staff Engineer (SSE) offer from LinkedIn. This experience reinforced the importance of persistence and a relaxed mindset during the interview process, ultimately leading to a rewarding outcome.
How it went
After facing constant rejections from March this year from companies like Amazon, Google, Microsoft, Uber, Meta, Stripe, and Atlassian, I had zero expectations for the LinkedIn interview. I realized I wasn't handling rejections well and decided to take a month-long vacation to reset. I returned with a fresh perspective, deciding to just put in the effort without worrying about the outcome. Luck certainly played a role in me getting this offer before the year ended. I approached the LinkedIn interviews with a very relaxed mindset.
Here’s how my interview process unfolded:
Round 1 - Technical Phone Screen
This round involved two coding questions. The first was the classic Maximum Subarray Sum (Kadane’s Algorithm), with no modifications. The second was a tree-based data structure question, but unfortunately, I don't recall the exact problem. I received a strong hire verdict for this round.
Onsites - Round 1 DSA
I was given two questions in this round. One was very similar to K Closest Points to Origin on LeetCode. The second was a hard array question that I also can't recall. I managed to solve the first, but for the second, I could only discuss my approach as I ran out of time.
Onsites - Round 2 DSA
This was the most challenging round for me, featuring two hard questions. The interviewer was very kind and extended the time by 15 minutes. The first question was exactly Sliding Window Maximum, which I was somehow able to implement. The second question was quite challenging: finding the top k elements after multiplying values from two arrays (e.g., arr1 = [1, 2, 5, 9], arr2 = [1, 3, 4, 6]). The interviewer explicitly stated that the brute-force approach of multiplying all pairs was not expected. I could only discuss my approach before time ran out.
Onsites - Round 3 Host Leader
This was a typical hiring manager round, focusing on my experience and motivations. It went quite well.
Onsites - Round 4 Technical Communication
In this round, I was asked to explain the most challenging project I had worked on. I articulated the complexities and my solutions effectively, and this round also went very smoothly.
Onsites - Round 5 System Design
The system design problem was to design a Top K system to gather exceptions from different services and display the top K exceptions within a 24-hour window. I discussed various architectural approaches and data pipelines, and I felt this round went pretty well too.
I was ultimately selected and will update compensation details soon. I hope my experience helps others facing rejections; persistence is truly underrated, and sometimes, a bit of luck plays its part.
Questions asked (6)
- 01
Maximum Subarray Sum
Data Structures & Algorithms · Medium
Given an integer array
nums, find the contiguous subarray (containing at least one number) which has the largest sum and return its sum. The problem was exactly the same as the standard Kadane's Algorithm problem with no modifications. - 02
K Closest Points to Origin
Data Structures & Algorithms · Medium
Open the problemGiven an array of
pointswherepoints[i] = [xi, yi]represents a point on the X-Y plane and an integerk, return thekclosest points to the origin(0, 0). - 03
Sliding Window Maximum
Data Structures & Algorithms · Hard
Open the problemYou are given an array of integers
nums, there is a sliding window of sizekwhich is moving from the very left of the array to the very right. You can only see theknumbers in the window. Each time the sliding window moves right by one position. Return the sliding window maximum. - 04
Top K Elements from Product of Two Arrays
Data Structures & Algorithms · Hard
Given two arrays,
arr1andarr2, find the topkelements from the list of all possible products where each product is formed by multiplying one element fromarr1and one element fromarr2. The brute force approach of multiplying all pairs and then finding top K is not expected. For example, ifarr1 = [1, 2, 5, 9]andarr2 = [1, 3, 4, 6], find the topkproducts. - 05
Discuss Most Challenging Project
Behavioral
Describe and explain the most challenging project you have worked on, including the problems faced and how you overcame them.
- 06
Design Top K Exception Monitoring System
System Design · Hard
Design a system to gather exceptions from various services and display the top K most frequent exceptions within a 24-hour time window. I discussed different architectural approaches and data pipelines.
How they prepared
My preparation involved solving approximately 900 LeetCode questions over time. Despite facing many rejections previously, for this particular interview, I approached it with a relaxed mindset, focusing on putting in effort without undue stress about the outcome, which I believe contributed to my success.