Freshworks | Senior Software Engineer Backend | Reject
- Posted
- 22 Jan 2026
Summary
I was rejected for the Senior Software Engineer Backend role at Freshworks after struggling with the implementation of two Data Structures & Algorithms problems during the interview. I attribute this difficulty to being out of touch with LeetCode for several months, despite being able to explain my approaches.
How it went
Round 1 (DSA):
- 1) https://leetcode.com/problems/remove-duplicates-from-sorted-array-ii/
- 2) https://leetcode.com/problems/reverse-linked-list-ii/
I was able to explain the approach, but I faced difficulty while implementing it, probably because I’ve been a bit out of touch with LeetCode for the last 5-6 months.
Questions asked (2)
- 01
Remove Duplicates from Sorted Array II
Data Structures & Algorithms · Medium
Open the problemGiven an integer array
numssorted in non-decreasing order, remove the duplicates in-place such that each unique element appears at most twice. The relative order of the elements should be kept the same. Since it is impossible to change the length of the array in some languages, you must instead have the result be placed in the first part of the arraynums. More formally, if there arekelements after removing the duplicates, then the firstkelements ofnumsshould hold the final result. It does not matter what you leave beyond the firstkelements. Returnkafter placing the final result in the firstkslots ofnums. Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory. - 02
Reverse Linked List II
Data Structures & Algorithms · Medium
Open the problemGiven the
headof a singly linked list and two integersleftandrightwhereleft <= right, reverse the nodes of the list from positionleftto positionright, and return the reversed list.