Sharechat | Interview Experience | SDE-2
- Posted
- 8 May 2025
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.
How it went
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 -
-> 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.)
- 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***

Questions asked (2)
- 01
Cheapest Flights Within K Stops
Data Structures & Algorithms
Open the problemI was asked to solve the problem 'Cheapest Flights Within K Stops'.
- 02
Modify to Strictly Decreasing Array with At Most One Change
Data Structures & Algorithms
Open the problemThis was a modification of the LeetCode problem 'Non-decreasing Array'. The question was to make it strictly decreasing by changing at most 1 element.