Quince Interview Questions, Process, and Tips

Q1. Sliding window based question : maximum sum of distinct subarray with length k
Ans. 
Find maximum sum of distinct subarray with length k using sliding window technique.
• Use a sliding window of size k to iterate through the array

• Keep track of the sum of elements within the window

• Maintain a set to keep track of distinct elements in the window

• Slide the window by removing the leftmost element and adding the rightmost element

• Update the maximum sum as you iterate through the array
Answered by AI
Add your answer

Q1. 1. SOLID principles 2. Max chunks to make sorted Leetcode 3. SQL query to find second highest salary 4. Event driven architecture 5. Locking mechanisms in transactions
Add your answer

Interviewer was from BarRaiser.
Interview was for 1 hour.
Topics - Backtracking, React performance optimisation, Convert a number into "hh:mm:ss" format, Optimise css, fonts, etc.

Q1. This was a coding test, I was asked a deque question. Easy to medium question.
Add your answer

Q1. This was an LLD round, and I was asked to design a meeting room system.
Add your answer

Q1. This was a bar raiser round, was asked to design google meet.
Add your answer