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. 
Reverse a singly linked list of integers and return the head of the reversed linked list.
• Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.

• Use three pointers to keep track of the current, previous, and next nodes while reversing the linked list.

• Update the head of the reversed linked list as the last node encountered during the reversal process.
Answered by AI
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. 
The task is to identify all distinct triplets within an array that sum up to a specified number.
• Iterate through the array and use nested loops to find all possible triplets.

• Check if the sum of the triplet equals the specified number.

• Print the valid triplets or return -1 if no triplet exists.
Answered by AI
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. 
Find the node where two linked lists merge, return -1 if no merging occurs.
• Traverse both lists to find their lengths and the difference in lengths

• Move the pointer of the longer list by the difference in lengths

• Traverse both lists simultaneously until they meet at the merging node
Answered by AI
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. 
Find duplicates in an array of integers within a specified range.
• Iterate through the array and keep track of the count of each element using a hashmap.

• Identify elements with count greater than 1 as duplicates.

• Return the duplicate elements as the output.

• Handle edge cases like empty array or no duplicates found.
Answered by AI
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. 
Remove nodes with specific value from a singly linked list.
• Traverse the linked list and remove nodes with value equal to 'K'.

• Update the references of the previous node to skip the removed node.

• Handle edge cases like removing the head node or multiple nodes with the same value.

• Return the modified linked list after removal.
Answered by AI
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. 
Sort a Singly Linked List based on actual values instead of absolute values.
• Traverse the linked list and store the values in an array.

• Sort the array based on actual values.

• Update the linked list with the sorted values.
Answered by AI
Add your answer