SDE-2 sharechat May-2023

sharechat logo
sharechat
SDE-24 yearsRejected
June 17, 20232 reads

Summary

I interviewed for an SDE-2 role at ShareChat in May 2023, undergoing four rounds covering coding, LLD, HLD, and a bar raiser. Despite my experience, I was ultimately rejected, largely due to my performance in the Bar Raiser round, and did not receive detailed feedback.

Full Experience

I recently interviewed for an SDE-2 position at ShareChat in May 2023. I have 4 years of experience and have previously worked in big tech companies. The interview process consisted of four distinct rounds:

  • Hackerearth Test: This was the initial screening.
  • Low-Level Design (LLD) + Problem Solving: Focused on practical design and algorithmic skills.
  • High-Level Design (HLD) (Hiring Manager Round): This round assessed my system design capabilities.
  • Bar Raiser Round: The final and most challenging round.

In the Hackerearth test, I recall one problem being related to LFU Cache design, along with two other problems that are commonly found on LeetCode. For the LLD round, I was asked to design Cricbuzz, and there was also a DSA question where I had to remove a given list of phrases from a sentence, for example, removing `[have apple]` and `[you have]` from the sentence `"i have apple"`.

The Bar Raiser round included two significant DSA problems. One involved sorting 100 petabytes of data with only 2 GB of RAM, a classic external sorting problem. The second was to design a data structure that supports insert, delete, and getRandom operations all in O(1) average time, which I recognized as LeetCode problem 380.

Unfortunately, the verdict was a rejection. I didn't perform well in the Bar Raiser round, which I believe was the primary reason for not moving forward. I didn't receive any detailed feedback about my performance.

Interview Questions (5)

Q1
LFU Cache Design
Data Structures & Algorithms

Design a Least Frequently Used (LFU) cache.

Q2
Design Cricbuzz
System Design

Design the Cricbuzz application.

Q3
Remove Phrases from Sentence
Data Structures & Algorithms

Given a sentence and a list of phrases, remove all occurrences of these phrases from the sentence. For example, if sentence = " i have apple" and phrases = { [have apple] , [you have] }.

Q4
Sort Large Data with Limited Memory
Data Structures & AlgorithmsHard

Design an algorithm to sort 100 petabytes of data using only 2 GB of RAM.

Q5
Design Data Structure with O(1) Insert, Delete, GetRandom
Data Structures & AlgorithmsMedium

Design a data structure that supports insert, delete, and getRandom operations all in O(1) average time.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!