Freshworks Graduate Trainee Interview Questions, Process, and Tips

First round is coding round

Q1. This round include basic understanding of oops, dbms, and leetcode coding problems.
Add your answer

Q1. Strings related question
Add your answer

Coding test of easy level questions. 3-4 questions was there.

Q1. 1. Give intro. 2.some DSA questions and i answered all. 3.some oops and Basic questions of CsE
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

Q1. Merge Two Sorted Arrays
Ninja has been given two sorted integer arrays/lists ‘ARR1’ and ‘ARR2’ of size ‘M’ and ‘N’. Ninja has to merge these sorted arrays/lists into ‘ARR1’ as one sorted array. You may hav...read more
Ans. 
I have used the merge logic that is used in merge sort algorithm.
Answered by CodingNinjas
View 2 more answers
Q2. Valid Parentheses
You're given string ‘STR’ consisting solely of “{“, “}”, “(“, “)”, “[“ and “]” . Determine whether the parentheses are balanced.
Input Format:
The first line contains an Integer &...read more
Ans. 
I had used stack to solve this problem.
Iterated through the array with two condition
1. if its open braces than add that in stack
2. if its closed then validate that peek element in stack
3. if step 2 is false then break the loop and return false. 
4. After the iteration if stack is empty then return true else return false
Answered by CodingNinjas
View 1 more answer
Q3. Reverse Integer
You are given a 32-bit signed integer ‘N’. So, the integer will lie in the range [-2^31, 2^31 - 1]. Your task is to return the reverse of the given integer. If reversing causes overflow, th...read more
Ans. 
Since its online I tried converting the integer to string and reversed that and it passed all the cases. For logical approach refer this article 
Answered by CodingNinjas
View 1 more answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. Backend Assignment
Build a file-based key-value data store that supports the basic CRD (create, read, and delete)operations. This data store is meant to be used as local storage for one single process on on...read more
Ans. 
Tip 1 : store the key value pair in specific format in file, so that while doing CRUD we can able to differentiate the pair stored in file
 
Answered by CodingNinjas
Add your answer

Round duration - 45 minutes
Round difficulty - Easy

Q1. Deepest Left
You are given a binary tree having ‘N’ number of nodes. Your task is to find the deepest leaf node in the given input tree.
Note:
The deepest leaf node is the leaf node which will be the l...read more
Ans. 
Firstly I have two approaches in my mind one is through the recursion and other through BFS. 
Since its straight forward problem I decided to solve this with BFS.

I have used BFS traversal logic and had track of leftmost node in each level once the traversal is completed then leftmostnode contains the result.

1. To do level order traversal in BFS we need to add a null in the queue once after adding the last element i...read more
Answered by CodingNinjas
View 2 more answers
Q2. Sub Sort
You are given an integer array ‘ARR’. You have to find the length of the shortest contiguous subarray such that, if you sort this subarray in ascending order, then the whole array will be sorted i...read more
Ans. 
I couldn’t thing the brute approach for the problem during my interview, but some how managed to get an idea of optimal solution.

The approach that I used was:

1. Have two variable which point start index and end index of array.
2. Now find the first element from start of the array which is less that the previous element. store this index in variable let's say 'startIndex'
3. Now find the first element from end of the arra...read more
Answered by CodingNinjas
View 4 more answers

Round duration - 45 minutes
Round difficulty - Easy

Q1. Invert a Binary Tree
You are provided with a Binary Tree and one of its leaf nodes. You have to invert this binary tree. Inversion must be done by following all the below guidelines:
• The given leaf node...read more
Ans. 
I explained the approach of swaping the child two nodes while traversing each node. The interview was fine with that approach
Answered by CodingNinjas
View 1 more answer
Q2. Minimum cut puzzle
You have got someone working for you for five days and a gold bar to pay him. You must give them a piece of gold at the end of every day. What are the fewest number of cuts to the bar of ...read more
Ans. 
Tip 1 : I used have a habit of learning puzzle when I get bored solving problems during my interview preparation. Luckily that habit helped me here.
 
Answered by CodingNinjas
Add your answer
Q3. SQL Questions
I was Asked to code some basic SQL queries. All them were really simple if you know the basics of SQL.
Ans. 
Tip 1 : Do practice for SQL queries in hacker rank when you find that helps a lot. 
 
Answered by CodingNinjas
Add your answer

Round duration - 30 minutes
Round difficulty - Easy

This Round the HR checks whether you will be good fit for culture code that's followed by the company.

Q1. Basic HR Questions
Tell me about yourself.
How will you learn new coding language if asked to work on that?
Why do you want to join this company?

 
Ans. 
Tip 1 : Try to answer the question by comparing some past situation that you had faced. 
 
Answered by CodingNinjas
Add your answer