Freshworks interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
Freshworks
2 rounds | 4 Coding
problems
Rejected
Interview preparation journey
Preparation
Duration: 3 Months
Topics: Data Structures and Algorithms, Object-Oriented Programming System, Operating system, Database Management System
Try to do Data Structures and Algorithms based questions and firstly attempt it yourself before going to the solution, also try to do it as quickly as you can. Also prepare for theory subjects like Operating system, Database Management System, etc which I prepared through Coding Ninjas subjective notes and they are very accurate and up to mark.
Application process
Where: Campus
Eligibility: Above 7 CGPA
Keep your resume simple and complete. Mention some good level projects, your previous experiences and coding achievements if any.
Interview rounds
01
Round
Easy
Video Call
Duration45 Minutes
Interview date10 Jun 2021
Coding problem2
1. System Design Question
Twitter design
2. Level Order Traversal
Easy
15m average time
85% success
0/40
Asked in companies
You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.
For example:
For the given binary tree
The level order traversal will be {1,2,3,4,5,6,7}.
Problem approach
You have been given a Binary Tree of integers. You are supposed to return the level order traversal of the given tree.
02
Round
Easy
Video Call
Duration45 minutes
Interview date10 Jun 2021
Coding problem2
1. Sort 0 1 2
Easy
22m average time
0/40
Asked in companies
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
Note :
Try to solve the problem in 'Single Scan'. ' Single Scan' refers to iterating over the array/list just once or to put it in other words, you will be visiting each element in the array/list just once.
Problem approach
You have been given an integer array/list(ARR) of size 'N'. It only contains 0s, 1s and 2s. Write a solution to sort this array/list.
2. Third greatest element
Easy
20m average time
80% success
0/40
Asked in companies
Given an array/list 'ARR' of ‘N’ distinct integers, you are supposed to find the third largest element in the given array 'ARR'.
Problem approach
Given an array/list 'ARR' of ‘N’ distinct integers, you are supposed to find the third largest element in the given array 'ARR'.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
5 rounds | 6 problems
Interviewed by Freshworks
Selected 
1081 views
0 comments
0 upvotes
SDE - 1
2 rounds | 6 problems
Interviewed by Freshworks
Selected 1009 views
0 comments
0 upvotes
SDE - 1
4 rounds | 8 problems
Interviewed by Freshworks
Selected 1134 views
0 comments
0 upvotes
SDE - 1
2 rounds | 4 problems
Interviewed by Freshworks
Rejected
730 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114579 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57825 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34961 views
7 comments
0 upvotes