AmbitionBox
Interview Questions
- Reviews
- Salaries
- Interview Questions
- About Company
- Benefits
- Jobs
- Office Photos
- Community
Add office photos
Filter interviews by
Freshworks Graduate Trainee Interview Questions and Answers
8 Interview questions
Identify and remove duplicates from an array of strings efficiently.
Use a Set to store unique strings. Example: ['apple', 'banana', 'apple'] becomes ['apple', 'banana'].
Iterate through the array and add each string to the Set. Duplicates are automatically ignored.
Convert the Set back to an array if needed. Example: Set(['apple', 'banana']) to ['apple', 'banana'].
Consider using built-in functions like filter() or r...
Optimizing code involves improving efficiency while reducing time and space complexity.
Use efficient algorithms: For example, use QuickSort instead of BubbleSort for sorting arrays.
Reduce space complexity: Use in-place algorithms like Merge Sort to save memory.
Avoid unnecessary computations: Cache results of expensive function calls (memoization).
Choose appropriate data structures: Use HashMaps for quick lookups i...
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 binar...
Identify the deepest left leaf node in a binary tree.
Traverse the binary tree in level order to find the deepest left leaf node.
Keep track of the maximum depth and the value of the deepest left leaf node found so far.
Return the value of the deepest left leaf node at the end.
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 as...
Find the length of the shortest subarray that needs to be sorted to make the entire array sorted in ascending order.
Iterate from left to right to find the first element out of order.
Iterate from right to left to find the last element out of order.
Calculate the length of the subarray between the out of order elements.
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 hold...
Merge two sorted arrays into one sorted array in place.
Iterate from the end of both arrays and compare elements to merge in place
Use two pointers to keep track of the current position in each array
Update the elements in ARR1 from the end to the beginning
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 ...The task is to determine if a given string consisting of parentheses is balanced or not.
Iterate through each character in the string and use a stack to keep track of opening parentheses
If an opening parenthesis is encountered, push it onto the stack
If a closing parenthesis is encountered, check if it matches the top of the stack. If it does, pop the stack, else return 'Not Balanced'
At the end, if the stack is empt...
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 becom...
Invert a binary tree with a given leaf node as the new root, following specific guidelines.
Start by identifying the leaf node provided in the input.
Follow the guidelines to invert the binary tree with the leaf node as the new root.
Ensure that the left child becomes the right child of the new root if available, and the parent becomes the left child.
Implement the inversion process for each test case and output the r...
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 inte...Reverse a 32-bit signed integer and handle overflow cases.
Implement a function to reverse the given integer.
Check for overflow conditions and return -1 if overflow occurs.
Use 32-bit capacity data types only.
Example: For input 123, output should be 321.
Freshworks Graduate Trainee Interview Experiences
7 interviews found
Anonymous
First round is coding round
(1 Question)
- Q1. This round include basic understanding of oops, dbms, and leetcode coding problems.
Selected
I appeared for an interview before Mar 2024.
Hackerrank test - leetcode type questions - easy to medium
Assignment - to submit in Github
(1 Question)
- Q1. Technical q - coding, SQL
(1 Question)
- Q1. Technical q - coding ( to optimise and also the time and space complexity for the same)
- Ans.
Optimizing code involves improving efficiency while reducing time and space complexity.
Use efficient algorithms: For example, use QuickSort instead of BubbleSort for sorting arrays.
Reduce space complexity: Use in-place algorithms like Merge Sort to save memory.
Avoid unnecessary computations: Cache results of expensive function calls (memoization).
Choose appropriate data structures: Use HashMaps for quick lookups instea...
(1 Question)
- Q1. General HR questions
Selected
I appeared for an interview before Apr 2024, where I was asked the following questions.
- Q1. Duplicates in array
- Ans.
Identify and remove duplicates from an array of strings efficiently.
Use a Set to store unique strings. Example: ['apple', 'banana', 'apple'] becomes ['apple', 'banana'].
Iterate through the array and add each string to the Set. Duplicates are automatically ignored.
Convert the Set back to an array if needed. Example: Set(['apple', 'banana']) to ['apple', 'banana'].
Consider using built-in functions like filter() or reduce...
- Q2. Pattern solving
Selected
I appeared for an interview before Mar 2024, where I was asked the following questions.
- Q1. Question on array
- Q2. Question on strings
Selected
I applied via Company Website and was interviewed before Jul 2023. There was 1 interview round.
(1 Question)
- Q1. Strings related question
Interview Preparation Tips
- strings
- Debugging
Selected
I applied via Referral and was interviewed before May 2023. There were 2 interview rounds.
Coding test of easy level questions. 3-4 questions was there.
(1 Question)
- Q1. 1. Give intro. 2.some DSA questions and i answered all. 3.some oops and Basic questions of CsE
I appeared for an interview before May 2021.
(3 Questions)
Round duration - 60 minutes
Round difficulty - Medium
- Q1.
Merge Two Sorted Arrays Problem Statement
Given two sorted integer arrays
ARR1andARR2of size M and N, respectively, merge them intoARR1as one sorted array. Assume thatARR1has a size of M + N to hol... - Ans.
Merge two sorted arrays into one sorted array in place.
Iterate from the end of both arrays and compare elements to merge in place
Use two pointers to keep track of the current position in each array
Update the elements in ARR1 from the end to the beginning
- 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... - Ans.
The task is to determine if a given string consisting of parentheses is balanced or not.
Iterate through each character in the string and use a stack to keep track of opening parentheses
If an opening parenthesis is encountered, push it onto the stack
If a closing parenthesis is encountered, check if it matches the top of the stack. If it does, pop the stack, else return 'Not Balanced'
At the end, if the stack is empty, re...
- 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... - Ans.
Reverse a 32-bit signed integer and handle overflow cases.
Implement a function to reverse the given integer.
Check for overflow conditions and return -1 if overflow occurs.
Use 32-bit capacity data types only.
Example: For input 123, output should be 321.
Round duration - 60 minutes
Round difficulty - Easy
(2 Questions)
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...
- Ans.
Identify the deepest left leaf node in a binary tree.
Traverse the binary tree in level order to find the deepest left leaf node.
Keep track of the maximum depth and the value of the deepest left leaf node found so far.
Return the value of the deepest left leaf node at the end.
- 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... - Ans.
Find the length of the shortest subarray that needs to be sorted to make the entire array sorted in ascending order.
Iterate from left to right to find the first element out of order.
Iterate from right to left to find the last element out of order.
Calculate the length of the subarray between the out of order elements.
(1 Question)
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...
- Ans.
Invert a binary tree with a given leaf node as the new root, following specific guidelines.
Start by identifying the leaf node provided in the input.
Follow the guidelines to invert the binary tree with the leaf node as the new root.
Ensure that the left child becomes the right child of the new root if available, and the parent becomes the left child.
Implement the inversion process for each test case and output the result...
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.
Interview Preparation Tips
Tip 1 : Make sure that you have good understand of data structures, Algorithm and OOPS
Tip 2 : Practice as many problems as you can in any platform that you are comfortable on.
Tip 3 : Have a decent knowledge on SQL, DBMS, OS, computer networks
Tip 1 : Keep your resume short preferably 1 page and make sure its communicating all points
Tip 2 : Add only those thing that you are confident on.
Skills evaluated in this interview
Top trending discussions
Interview questions from similar companies
I applied via Campus Placement and was interviewed in Apr 2024. There were 2 interview rounds.
It was well organised. Friendly staffs and responding.
(2 Questions)
- Q1. Questions from resume
- Q2. Questions from business related things
Interview Preparation Tips
I applied via Approached by Company and was interviewed before Jun 2021. There were 2 interview rounds.
(1 Question)
- Q1. Advantage and disadvantage of framework.
- Ans.
Frameworks provide structure and pre-built components for software development, but can also limit flexibility and require learning curve.
Advantage: Provides structure and pre-built components for faster development
Advantage: Can improve code quality and maintainability
Disadvantage: Can limit flexibility and customization
Disadvantage: Requires learning curve and potential dependency issues
Example: ReactJS provides a fr...
(1 Question)
- Q1. What is Oops? Advantage and disadvantage
- Ans.
Oops stands for Object-Oriented Programming. It is a programming paradigm that uses objects to represent real-world entities.
Advantages: code reusability, modularity, encapsulation, inheritance, polymorphism
Disadvantages: complexity, steep learning curve, performance overhead
Example: creating a class 'Car' with properties like 'make', 'model', and 'year', and methods like 'start_engine' and 'stop_engine'
Interview Preparation Tips
Skills evaluated in this interview
Rohit Kr Shaw
I applied via Naukri.com and was interviewed before Sep 2021. There was 1 interview round.
(1 Question)
- Q1. Basic Oracle Architecture, RAC Setup, Golden Gate Troubleshooting, Data Guard recover, RMAN restoration
Interview Preparation Tips
Freshworks Interview FAQs
Tell us how to improve this page.
Freshworks Interviews By Designations
- Freshworks Senior Software Engineer Interview Questions
- Freshworks Lead Software Engineer Interview Questions
- Freshworks Product Specialist Interview Questions
- Freshworks Graduate Trainee Interview Questions
- Freshworks Onboarding Specialist Interview Questions
- Freshworks Software Engineer Interview Questions
- Freshworks fresher Interview Questions
- Freshworks Business Analyst Interview Questions
- Show more
Interview Questions for Popular Designations
Overall Interview Experience Rating
based on 6 interview experiences
Difficulty level
Duration
Interview Questions from Similar Companies
Freshworks Graduate Trainee Reviews and Ratings
based on 1 review
Rating in categories
|
Senior Software Engineer
379
salaries
|  ₹19.8 L/yr - ₹37 L/yr |
|
fresher
248
salaries
| ₹1.8 L/yr - ₹5.1 L/yr |
|
Software Engineer
236
salaries
| ₹10 L/yr - ₹18 L/yr |
|
Lead Software Engineer
220
salaries
| ₹30.8 L/yr - ₹55 L/yr |
|
Product Specialist
146
salaries
| ₹5 L/yr - ₹11.5 L/yr |
Zoho
Salesforce
Thomson Reuters
Oracle Cerner
- Home >
- Interviews >
- Freshworks Interview Questions
