Freshworks Graduate Trainee Interview Questions, Process, and Tips

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

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

Round duration - 60 minutes
Round difficulty - Medium

Q1. 
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays ARR1 and ARR2 of size M and N, respectively, merge them into ARR1 as one sorted array. Assume that ARR1 has a size of M + N to hol...read more
Ans. 
I have used the merge logic that is used in merge sort algorithm.
Answered Anonymously
Add your answer
Q2. 
Valid Parentheses Problem Statement
Given a string 'STR' consisting solely of the characters “{”, “}”, “(”, “)”, “[” and “]”, determine if the parentheses are balanced.
Input:
The first line contains an...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 Anonymously
Add your answer
Q3. 
Reverse Integer Problem Statement
Given a 32-bit signed integer N, your task is to return the reversed integer. If reversing the integer causes overflow, return -1.
Input:
The first line contains an int...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 Anonymously
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Round duration - 45 minutes
Round difficulty - Easy

Q1. 
Deepest Left Leaf Node Problem Statement
You are provided with a binary tree consisting of 'N' nodes. Your goal is to identify the deepest leaf node that is a left child of some node within the given bina...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 Anonymously
Add your answer
Q2. 
Sub Sort Problem Statement
You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...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 Anonymously
Add your answer

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. Your task is to invert this binary tree, making sure to adhere to the following guidelines:
• The given leaf node beco...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 Anonymously
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.