PharmEasy | SDE1 | Bangalore | July 2021 [Reject]
- Result
- Rejected
- Location
- Bangalore
- Experience
- 2 years
- Posted
- 3 Jul 2021
Summary
I interviewed for an SDE1 position at PharmEasy in Bangalore in July 2021, which unfortunately resulted in a rejection after two technical rounds. The first round went smoothly with multiple DSA problems, but the second round's system design experience was challenging due to poor interviewer communication and a subsequent mismatch in feedback.
How it went
I had an interview for an SDE1 position at PharmEasy in July 2021 in Bangalore. I currently work as an SDE1 in a SaaS-based start-up and have 2 years of experience.
1st Technical round (1 hour):
This round consisted of three problems:
- Designing an LRU-based caching system with a capacity 'n'.
- Finding the missing number in an unsorted array of size 'n' with elements less than or equal to 'n'. For example, in [2,4,3,5], 1 is missing.
- Finding the next number in a series, given an unsorted array of size 'n' containing consecutive numbers. For example, for [4,3,6,5], the output should be 7.
2nd Technical round (1.5 hours):
The second round focused on system design.
- I was asked to design a Low-Level Design (LLD) for a file sharing system.
About an hour after the interview, I received a call from HR informing me of my rejection. When I asked for feedback, I was told that caching and long polling were missing from my design—features that the interviewer had told me were not needed! It was quite frustrating, as I even had to call HR during the interview because the panel member had muted himself and wasn't responding.
Questions asked (4)
- 01
Design LRU Cache
Data Structures & Algorithms · Medium
Design and implement an LRU (Least Recently Used) cache with a specified capacity 'n'.
- 02
Find Missing Number in Array
Data Structures & Algorithms · Easy
Given an unsorted array of size 'n' containing 'n-1' distinct numbers from the range [1, n], find the single missing number. For example, if the input is [2,4,3,5], the missing number is 1.
- 03
Find Next Number in Consecutive Series
Data Structures & Algorithms · Easy
Given an unsorted array of size 'n' containing 'n' consecutive numbers (with one number possibly missing if n-1), find the next number in that sequence. For example, if the array is [4,3,6,5], the output should be 7.
- 04
LLD for File Sharing System
System Design · Medium
Design a Low-Level Design (LLD) for a file sharing system. Focus on component design and interactions.