Sharechat | Interview Experience | SDE-2

sharechat logo
sharechat
SDE-2
May 8, 20255 reads

Summary

I attended a single round for an SDE-2 position at Sharechat focusing on Data Structures and Algorithms. I successfully solved one problem, 'Cheapest Flights Within K Stops,' with an optimal approach, but struggled with a modified version of 'Non-decreasing Array'. I am sharing my experience and the questions I encountered to assist the LeetCode community, despite not knowing the outcome of my interview.

Full Experience

I got a call from a recruiter.

let's keep it simple and straight-forward.

Round-1 : Problem Solving & DSA

i was asked 2 questions -

  1. https://leetcode.com/problems/cheapest-flights-within-k-stops/description/

-> I solved it with optimal TC i.e. O(E) using queue. (this took almost 40 minutes as he asked me to write running code and asked me to implement UTs.)

  1. Modification of this - https://leetcode.com/problems/non-decreasing-array/description/

-> question was to make it strictly decreasing by changing atmost 1 element (i couldn't solve this one i was thinking loud and discussing and in last 5 minutes i was writing code and time went up and he asked me to stop.)

***Even if i got rejected i wanted to post the questions because LC discuss section is where i look forward to for my upcoming interviews and now it's time to give back***.

***So please upvote this and help others if you find it useful***

sad-thumbs-up-cat.3.meme.webp

Interview Questions (2)

Q1
Cheapest Flights Within K Stops
Data Structures & Algorithms

I was asked to solve the problem 'Cheapest Flights Within K Stops'.

Q2
Modify to Strictly Decreasing Array with At Most One Change
Data Structures & Algorithms

This was a modification of the LeetCode problem 'Non-decreasing Array'. The question was to make it strictly decreasing by changing at most 1 element.

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!