Freshworks Software Developer Interview Questions, Process, and Tips

Round duration - 90 minutes
Round difficulty - Hard

They gave around 7 days of time for attending the test.
It had 4 coding questions out of which I solved 2 fully and 2 partially. 
Questions were medium-hard and based on DSA.

Q1. 
Find the Third Greatest Element
Given an array 'ARR' of 'N' distinct integers, determine the third largest element in the array.
Input:
The first line contains a single integer 'T' representing the numb...read more
Ans. Sorting Based Approach
The idea is to sort the array in non-decreasing order, and then return the third element from the back of the array.
 
The steps are as follows :
1. Sort the array in non-decreasing order.
2. Return the third element from the back of the array.
Space Complexity: O(logn)Explanation:
O(1)
 
We are not using any extra space. Thus, the overall space complexity will be O(1).
Time Complexity: O(nlogn)Explan...read more
Answered Anonymously
Add your answer
Q2. 
Wildcard Pattern Matching Problem Statement
Implement a wildcard pattern matching algorithm to determine if a given wildcard pattern matches a text string completely.
The wildcard pattern may include the...read more
Ans. Brute Force
We will try to explore all the possibilities using the recursion.
 
Let’s say we have a recursive function ‘REC’ who has two arguments IDX and IDY where IDX represents the index in the text string and IDY represents the index in pattern string and its return type is boolean. Initially, we will call the rec with IDX =  N and IDY = M where N is the size of the text string and M is the size of the patte...read more
Answered Anonymously
Add your answer
Q3. 
Detect and Remove Loop in Linked List
For a given singly linked list, identify if a loop exists and remove it, adjusting the linked list in place. Return the modified linked list.
Expected Complexity:
A...read more
Ans. Outer And Inner Loop
We are going to have two loops outer-loop and inner-loop 
1. Maintain a count of the number of nodes visited in outer loop.
2. For every node of the outer-loop, start the inner loop from the head and maintain a  prev node to store the previous node of the current outer loop node.
3. If the inner-loop visits the node next to the outer-loop node, then a cycle exist,we will simply set the prev node's nex...read more
Answered Anonymously
Add your answer
Q4. 
Longest Common Subsequence Problem Statement
Given two strings STR1 and STR2, determine the length of their longest common subsequence.
A subsequence is a sequence that can be derived from another sequen...read more
Ans. Recursive Brute Force
The basic idea of this approach is to break the original problem into sub-problems. Let us assume we want to find the length of the longest common subsequence of “STR1” and “STR2” whose length is ‘N’ and ‘M’ respectively. 
 
Now, let us define a recursive function 
 
LCS(Int I, int J, string STR1, string STR2)
Which returns the length of the longest common subsequence of string STR1...read more
Answered Anonymously
Add your answer

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