Freshworks Lead Software Engineer Interview Questions, Process, and Tips

Q1. LinkedList, Tress
Add your answer

Q1. System Design concepts and case study
Add your answer

Q1. Implement hashmap in java
Ans. 
Implementing hashmap in Java
• Create an array of linked lists to store key-value pairs

• Hash the key to get the index of the array

• Insert the key-value pair at the index in the linked list

• Handle collisions by chaining

• Implement methods like put(), get(), remove()

• Use generics to allow any type of key-value pairs
Answered by AI
Add your answer

Q1. Design round related to chat application
Add your answer

Q1. Design round, system design general questions
Add your answer

Q1. General discussions about team and tech stack
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Two DSA Problems:
 Explain anyone Design pattern you used
It was a recruitment drive happened on Saturday

Q1. 
Square Root with Decimal Precision Problem Statement
You are provided with two integers, 'N' and 'D'. Your objective is to determine the square root of the number 'N' with a precision up to 'D' decimal pl...read more
Ans. Bruteforce
• We will find the integer part and decimal part of the answer separately.
• First, we will find an integral part.
• We will declare the answer variable where we will store the answer.
• Your answer could be between 1 and N so we will iterate through all the numbers from 1 to N.
  • Let’s say we are currently at number i.
  • If i ^ 2 = N then i is the exact answer so we will return i.
  • If i ^ 2 < N then i could be a possible an...read more
Answered Anonymously
Add your answer
Q2. 
Longest Unique Substring Problem Statement
Given a string input of length 'n', your task is to determine the length of the longest substring that contains no repeating characters.
Explanation:
A substri...read more
Ans. All Substring Approach
• Create all the substrings of the string.
• For every substring, check if it consists of unique characters.
• To check if the substring has duplicate characters, we will use a HashSet. We will iterate through all the characters in the string and put them into the set one by one. Before putting one character, we check if the set already contains it. If it does, the substring doesn't contain unique charact...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

2 Coding questions. Expected to write in 1 hr

Q1. 
Vertical Order Traversal Problem Statement
You are given a binary tree, and the task is to perform a vertical order traversal of the values of the nodes in the tree.
For a node at position ('X', 'Y'), th...read more
Ans. Efficient Approach
The intuition is to find the breadth of the tree first so that we can beforehand know the maximum horizontal distance and minimum horizontal distance of a node from the root node. We can use the absolute value of minimum horizontal distance as an offset. Now we can use an array/list visited to store the visited nodes where ith element will store the node at (i - offset”) distance horizontally from the...read more
Answered Anonymously
Add your answer
Q2. 
Power Calculation Problem Statement
Given a number x and an exponent n, compute xn. Accept x and n as input from the user, and display the result.
Note:
You can assume that 00 = 1.
Input:
Two integers...read more
Ans. Using while() loop
Take input in two variable x and n. Create a variable ans and initialize it to 1
Run a while loop till n > 0. In each iteration mutilply your ans with x. Finally print ans.
Space Complexity: O(1)Explanation: Time Complexity: O(1)Explanation:
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a high level round. Checking what are different components and how they interact

Round duration - 60 Minutes
Round difficulty - Easy

This was the managerial round. It was about technical skills evaluation

Q1. 
Zig-Zag Conversion Problem Statement
You are given a string S and an integer ROW. Your task is to convert the string into a zig-zag pattern on a given number of rows. After the conversion, output the stri...read more
Ans. Pattern Formation
Consider the case where the number of rows is equal to 10, and everything has a 0 based indexing. In that case, the input string's indexes form the given pattern:
Here Step-2 involves passing through the lower part of the zig-zag, and Step-1 involves passing the upper part of the zig-zag.
 
Using some pattern recognition we can find all the indices that lie in a particular row. Let’s say we need to f...read more
Answered Anonymously
Add your answer
Q2. Can you describe the architecture of your current project?
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Director round

It covers easy to medium programming using basic data structures like hash, stack, linked list etc