Freshworks | Senior Software Engineer Backend | Reject
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.
Full Experience
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.
Interview Questions (2)
Remove Duplicates from Sorted Array II
Given an integer array nums sorted 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 array nums. More formally, if there are k elements after removing the duplicates, then the first k elements of nums should hold the final result. It does not matter what you leave beyond the first k elements. Return k after placing the final result in the first k slots of nums. Do not allocate extra space for another array. You must do this by modifying the input array in-place with O(1) extra memory.
Reverse Linked List II
Given the head of a singly linked list and two integers left and right where left <= right, reverse the nodes of the list from position left to position right, and return the reversed list.