Freshworks Software Engineer Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Medium

three coding questions , no mcq, 1 hr limit

Q1. 
Reverse Linked List Problem Statement
Given a singly linked list of integers, return the head of the reversed linked list.
Example:
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...read more
Ans. Brute Force
The brute force approach is to use recursion. First, we reach the end of the Linked List recursively and at last node, we return the last node, which becomes the new head of the partially reversed Linked List. While coming back from each recursion call we add the current node in the current recursion call to the last node of the partially reversed Linked List and assign the current node to null.
 
Steps:
&...read more
Answered Anonymously
Add your answer
Q2. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
sort the list in ascending order then find the complement after that do a two pointer approach with a front and rear pointer to find the target value and add the numbers result vector and ensure there are no duplicates by: check if the the number is already in our list, if so move the pointers
Answered Anonymously
Add your answer
Q3. 
Intersection of Linked List Problem
You are provided with two singly linked lists containing integers, where both lists converge at some node belonging to a third linked list.
Your task is to determine t...read more
Ans. Brute Force
• For each node in the first list, traverse the entire second list
• Check if any node in the second list coincides with the first list
  • If it does, return that node’s data
  • If it doesn’t, return -1
Space Complexity: O(1)Explanation:
O(1)
 
Since we only use constant space.
Time Complexity: O(m*n) - For 2d arraysExplanation:
O(N * M), where N and M are the lengths of the first and second linked lists respectively.&n...read more
Answered Anonymously
Add your answer

Round duration - 45 Minutes
Round difficulty - Medium

1st they asked area of interest like frontend or backend. I said backend 
Then thy asked a array based question followed by a linked list. 
Then he asked some computer fundametals.

Q1. 
Find Duplicates in an Array
Given an array ARR of size 'N', where each integer is in the range from 0 to N - 1, identify all elements that appear more than once.
Return the duplicate elements in any orde...read more
Ans. 
If the number is visited it is turned negative
If the visited number is negative that means it has been already visited(duplicate) and hence added to the list.
Since the array values are from 1 to n therefore the 1 is subtracted from the array values at the time of indexing.
Answered Anonymously
Add your answer
Q2. 
Remove Nodes with Specific Value from Linked List
You are provided with a singly linked list consisting of integer values and an integer 'K'. Your task is to eliminate all nodes from the linked list that ...read more
Ans. 
basic idea is to have two pointers, one for previous node and one for current, if current node.val == val
we want to set our previous.next to current.next.
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

mainly focused on dsa , dbms and working of an API

Q1. 
Sort Linked List Based on Actual Values
Given a Singly Linked List of integers that are sorted based on their absolute values, the task is to sort the linked list based on the actual values.
The absolute...read more
Ans. 
Use 2 pointers: fast and slow to divide the list into 2 sublist: list1 and list2 and make sure list1 is equal to or is longer than list2.
The key is the condition of while loop while(fast.next!=null && fast.next.next!=null). After this while loop slow will be at the position of the end of list1.
sort list1 and list2
merge list1 and list2
Answered Anonymously
Add your answer