Freshworks Interview Questions, Process, and Tips

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

Q1. Write a lambda function in python
Ans. 
A lambda function in Python is a small anonymous function defined using the lambda keyword.
• Lambda functions can have any number of arguments, but can only have one expression.

• Syntax: lambda arguments : expression

• Example: lambda x, y : x + y
Answered by AI
Add your answer
Q2. Dbutils in databricks
Ans. 
dbutils is a utility provided by Databricks for interacting with files and directories in the Databricks environment.
• dbutils.fs.ls('/') - list files in root directory

• dbutils.fs.cp('dbfs:/file.txt', 'file.txt') - copy file from DBFS to local file system

• dbutils.fs.mkdirs('dbfs:/new_dir') - create a new directory in DBFS
Answered by AI
Add your answer
Q3. Persist and cache
Add your answer
Q4. What is commit in SQL
Ans. 
A commit in SQL is a command that saves all the changes made in a transaction to the database.
• A commit is used to make all the changes made in a transaction permanent.

• Once a commit is issued, the changes cannot be rolled back.

• It is important to use commit to ensure data integrity and consistency.

• Example: COMMIT; - this command is used to commit the changes in a transaction.
Answered by AI
Add your answer
Q5. Rank and dans_rank
Add your answer

Q1. Loop in a linked list and removing it
Ans. 
Loop through the linked list to find and remove a specific node
• Start at the head of the linked list and iterate through each node

• Check if the current node matches the one to be removed

• If found, update the pointers to skip over the node and remove it

• Continue until the end of the list is reached
Answered by AI
Add your answer
Q2. Triplets in array of integers without duplicates
Ans. 
Find all triplets in an array of integers without duplicates
• Iterate through the array and for each element, find all pairs that sum up to the negative of that element

• Use a set to store the seen elements to avoid duplicates

• Time complexity can be improved to O(n^2) by sorting the array first
Answered by AI
Add your answer

Basic Datastructures and ALgo questions medium to hard level

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

Q1. Find max square in matrix
Ans. 
Iterate through the matrix to find the largest square of 1s
• Iterate through each cell in the matrix

• For each cell, check if it is part of a square of 1s by checking the cells to the right, below, and diagonally right-down

• Keep track of the size of the largest square found
Answered by AI
Add your answer
Q2. Multithreadinh concepts
Add your answer
Q3. Message queue scenarios
Add your answer

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