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

Q1. Find the palindromes in a string
Ans. 
Identify and extract all palindromic substrings from a given string.
• A palindrome reads the same forwards and backwards. Example: 'racecar'.

• Iterate through each substring of the string and check if it's a palindrome.

• Use two pointers to compare characters from both ends towards the center.

• Consider edge cases like single characters and empty strings.

• Example input: 'madam arora teaches malayalam' -> Output: ['madam', 'a
Answered by AI
Add your answer
Q2. How to reverse a linkedlist
Ans. 
Reversing a linked list involves changing the direction of its pointers to reverse the order of nodes.
• 1. Initialize three pointers: prev (null), current (head), and next (null).

• 2. Iterate through the list: while current is not null, do the following:

• - Store the next node: next = current.next.

• - Reverse the current node's pointer: current.next = prev.

• - Move prev and current one step forward: prev = current; curr...read more
Answered by AI
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. 
Implement a function to find square root of a number with specified decimal precision.
• Implement a function that takes two integers N and D as input and returns the square root of N with precision up to D decimal places.

• Ensure that the discrepancy between the computed result and the correct value is less than 10^(-D).

• Handle multiple test cases efficiently within the given constraints.

• Consider using mathematical algorith...read more
Answered by AI
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. 
Find the length of the longest substring with unique characters in a given string.
• Use a sliding window approach to keep track of the longest substring without repeating characters.

• Use a hashmap to store the index of each character in the string.

• Update the start index of the window when a repeating character is encountered.

• Calculate the maximum length of the window as you iterate through the string.

• Return the maximum le
Answered by AI
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. 
Perform vertical order traversal of a binary tree based on decreasing 'Y' coordinates.
• Implement a function to perform vertical order traversal of a binary tree

• Nodes are added in order from top to bottom based on decreasing 'Y' coordinates

• Handle cases where two nodes have the same position by adding the node that appears first on the left
Answered by AI
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. 
Calculate x raised to the power of n, accepting x and n as input and displaying the result.
• Accept two integers x and n as input

• Compute x^n and display the result

• Handle special case 0^0 = 1

• Ensure x is between 0 and 8, and n is between 0 and 9
Answered by AI
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. 
Convert a given string into a zig-zag pattern on a specified number of rows and output the result row-wise.
• Iterate through the string and place characters in the zig-zag pattern based on the row number

• Keep track of the direction of movement (up or down) to determine the row placement

• Combine characters from each row to get the final result
Answered by AI
Add your answer
Q2. Can you describe the architecture of your current project?
Ans. 
The architecture of our current project is a microservices-based system with a combination of RESTful APIs and message queues.
• Utilizes microservices architecture for scalability and flexibility

• Uses RESTful APIs for communication between services

• Incorporates message queues for asynchronous processing

• Each microservice is responsible for a specific domain or functionality

• Data is stored in a combination of relational and N
Answered by AI
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