freshworks logo
Freshworks· Senior Software Engineer Backend

Freshworks | Senior Software Engineer Backend | Reject

Posted
22 Jan 2026
348 reads

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):

You can open any online compiler of your choice. Make sure your code should execute.

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)

  1. 01

    Remove Duplicates from Sorted Array II

    Data Structures & Algorithms · Medium

    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.

    Open the problem
  2. 02

    Reverse Linked List II

    Data Structures & Algorithms · Medium

    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.

    Open the problem

Know someone preparing? Send it to them:WhatsAppLinkedInX

Interviewed at Freshworks recently?

Write up your rounds while you still remember the questions. It helps the next person more than you would think.

Share your experience
Discussion 0

Questions for the author, or how your own interview compared.

Join the discussion

Sign in with Google to comment or ask the author a question.

No comments yet

Be the first to share your thoughts and start the discussion!