Freshworks Senior Software Engineer Interview Questions and Answers

Basic DS question like dutch flag problem.

Q1. Implement debounce function
Ans. 
Debounce function delays the execution of a function until after a specified amount of time has passed since the last time it was invoked.
• Create a function that takes a function and a delay time as parameters

• Use setTimeout to delay the execution of the function

• Use clearTimeout to reset the timer if the function is invoked again within the delay time
Answered by AI
Add your answer
Q2. Closure based questions.
Add your answer

Two questions asked:
1. Partition equal sum
2. find length largest region boolean matrix

Q1. Immediate higher number to right
Ans. 
The immediate higher number to the right of each element in an array
• Iterate through the array from right to left

• For each element, compare it with the elements to its right to find the immediate higher number

• Store the immediate higher number in a new array
Answered by AI
Add your answer
Q2. Count pair whose sum is perfect square.
Ans. 
Count pairs in an array whose sum is a perfect square.
• Iterate through the array and calculate the sum of each pair.

• Check if the sum is a perfect square using a function.

• Increment a counter if the sum is a perfect square.

• Return the final count of pairs.
Answered by AI
Add your answer
Q3. Parking lot LLD
Ans. 
Design a parking lot system to manage parking spaces, vehicles, and payment processing.
• Define classes: ParkingLot, ParkingSpace, Vehicle, and Payment.

• ParkingLot should manage multiple ParkingSpaces and track available spots.

• ParkingSpace can be of different types: Compact, Regular, and Handicapped.

• Vehicle class can include attributes like license plate, size, and type.

• Implement methods for parking, retrieving vehicles, ...read more
Answered by AI
Add your answer
Q4. E Commerce HLD and LLD
Add your answer
Q5. Kth largest number in BST
Ans. 
To find the Kth largest number in a Binary Search Tree (BST), we can perform an in-order traversal and keep track of the Kth largest element.
• Perform an in-order traversal of the BST to get the elements in non-decreasing order.

• Keep track of the Kth largest element while traversing the BST.

• Return the Kth largest element once found.
Answered by AI
Add your answer

Q1. First round they ask all basic to advanced level questions in JavaScript like closure, factory function, scoping, hoisting, object oriented programming.
Add your answer
Q2. In the second round, the interviewer requested that I write a Pub/Sub class entirely in JavaScript and implement autocomplete functionality in JavaScript as well.
Add your answer