Quince SDE-2 Interview Experience

quince logo
quince
· SDE-2
July 23, 2025 · 76 reads

Summary

I interviewed for an SDE-2 position at Quince and went through three rounds: a screening round, a DSA round, and an LLD round. Despite successfully coding the moving strategy for the LLD problem, I was ultimately rejected.

Full Experience

Round 1 - Screening Round by HireHunch. 1 DSA question and a high level discussion of an LLD problem. (Dont remember the problems)

Round 2 - DSA round. 2 DSA questions. 1 Easy and 1 Medium Question. Question 1 - 2D Array based question. Need to find the count of towers on the basis of adjacent towers. Simple iteration was needed.

Question 2 - https://leetcode.com/problems/longest-substring-without-repeating-characters/description/

Round 3 - LLD Round

Design an elevator system. Was given problem statement, around how internal and external requests should be served.

Struggled a bit on how to serve the requests, chose wrong data structure for keeping the list of requests, corrected it on hints. Was then asked to code the moving strategy. Was able to code it according to the constraints of the problem.

Verdict - Rejected.

Interview Questions (3)

1.

Count Towers based on Adjacent Towers

Data Structures & Algorithms·Easy

A 2D Array based question where I needed to find the count of towers based on their adjacent towers. A simple iteration approach was sufficient.

2.

Longest Substring Without Repeating Characters

Data Structures & Algorithms·Medium

Given a string s, find the length of the longest substring without repeating characters.

3.

Design an Elevator System

System Design

Design an elevator system. The problem statement focused on how internal and external requests should be served. I struggled a bit on how to serve the requests, initially choosing the wrong data structure for keeping the list of requests, but corrected it with hints. I was then asked to code the moving strategy and was able to do so according to the constraints of the problem.

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!