Freshworks Interview Questions, Process, and Tips

Round duration - 60 Minutes
Round difficulty - Easy

Q1. 
Level Order Traversal Problem Statement
Given a binary tree of integers, return the level order traversal of the binary tree.
Input:
The first line contains an integer 'T', representing the number of te...read more
Ans. Breadth First Search
In the level order traversal, we will be using queue data structure which has the property FIRST IN FIRST OUT that’s why which nodes come first in current level the children of that node will also come first for the next level. So, we visit all the nodes one by one of the current level and push into the queue so that when we will be complete with the current level, then we can start exploring nodes ...read more
Answered Anonymously
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Q1. What is a deadlock in DBMS, and can you explain the concepts of join and query?
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. Design a system for Twitter, outlining the key components and architecture involved.
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Maximum Subarray Sum Queries
You are provided with an array of ‘N’ integers and ‘Q’ queries. Each query requires calculating the maximum subarray sum in a specified range of the array.
Input:
The first ...read more
Ans. Brute Force Approach
The key idea is to process the queries as asked. Forgiven ‘l’ and ‘r’  we need to find the maximum sub-array sum from ‘l’ to ‘r’. For this, we can use the Kadane algorithm. To know more about the Kadane algorithm refer to this:-
https://cp-algorithms.com/others/maximum_average_segment.html
Space Complexity: O(1)Explanation:
O(1)
 
 We are using constant space to solve this.
Time Complexity...read more
Answered Anonymously
Add your answer
Q2. 
Sort 0 1 2 Problem Statement
Given an integer array arr of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
Input:
The first line contains an integer 'T' representing the n...read more
Ans. Sorting
Use any good sorting algorithm like Merge Sort, Quick Sort or inbuilt sorting function of different languages.
• Sort the Array and just return.
Space Complexity: O(1)Explanation:
O(1), As we are using constant space.
Time Complexity: O(nlogn)Explanation:
O(N*log(N)), where ‘N’ is the size of the array.
We are using inbuilt sort algorithm which has Overall Time Complexity O(N*log(N))
Answered Anonymously
Add your answer

Round duration - 20 Minutes
Round difficulty - Medium