Freshworks Software Engineer Interview Questions and Answers

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.

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.

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.

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

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.