Freshworks Senior Software Engineer Interview Questions, Process, and Tips

DSA medium level questions

Q1. JS based questions, event loop
Add your answer
Q2. Tricky questions based on output - JS concepts
Add your answer

Q1. Machine Coding round on JS, Html, Css
Add your answer
Q2. Questions on performance optimization, security
Add your answer

Basic DSA leet code.

Hacker rank evaluation with three questions

Q1. Android fundamentals
Add your answer
Q2. Lifecycle methods and synchronization
Add your answer

Q1. Comparator based problem solving
Add your answer
Q2. Binary tree based Hashmap question
Add your answer

Q1. Usual behavior fit questions
Add your answer

Q1. Coding round with senior software engineer
Add your answer

Q1. Resume based discussion with lead software engineer
Add your answer

Q1. Resume based and coding round with hiring manager
Add your answer

Q1. Cross team resume based and coding round with a staff engineer
Add your answer

Q1. Attitude and culture fit
Add your answer

Write a program that solves sudoku

Q1. How do you build a tiny URL Application?
Ans. 
A tiny URL application is built by generating short aliases for long URLs, storing them in a database, and redirecting users to the original URL when the alias is accessed.
• Generate a unique short alias for each long URL

• Store the alias and corresponding long URL in a database

• Implement a redirect mechanism to redirect users from the alias to the original URL

• Handle edge cases like duplicate URLs, expired aliases, and inva
Answered by AI
Add your answer

Round duration - 75 Minutes
Round difficulty - Medium

Q1. 
Triplets with Given Sum Problem
Given an array or list ARR consisting of N integers, your task is to identify all distinct triplets within the array that sum up to a specified number K.
Explanation:
A t...read more
Ans. 
Done this in O(N^2), interviewer was satisfied, he asked to modify the solution for returning triplets that sums to atleast N (instead of exact 0)
Answered Anonymously
Add your answer
Q2. 
K-th Largest Number in a BST
Given a binary search tree (BST) consisting of integers and containing 'N' nodes, your task is to find and return the K-th largest element in this BST.
If there is no K-th la...read more
Ans. Inorder Traversal
We can store all the elements of the BST in ascending order in an array/list with the help of one inorder traversal. We can then return the K-th largest element from it.
 
The algorithm will be-
• In each recursive call, we will-
  • Recurse over the left subtree.
  • Insert the data associated with the current node in an array/list.
  • Recurse over the right subtree.
• If the number of nodes is less than ‘K’ we return...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. Can you design a database schema for a support ticketing system, such as Freshdesk?
Ans. 
Tip 1 : choose index properly
Tip 2 : ask about scale of the system
Answered Anonymously
Add your answer
Q2. 
Count Ways to Reach the N-th Stair Problem Statement
You are provided with a number of stairs, and initially, you are located at the 0th stair. You need to reach the Nth stair, and you can climb one or tw...read more
Ans. Brute Force
One basic approach is to explore all possible steps which can be climbed with either taking one step or two steps. So at every step, we have two options to climb the stairs either we can climb with one step, or we can climb with two steps. So the number of ways  can be recursively defined as :
countDistinctWayToClimbStair ( currStep, N ) = countDistinctWayToClimbStair ( currStep+1, N ) + countDistinctWay...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. Can you design the Low-Level Design (LLD) and High-Level Design (HLD) for a system like BookMyShow?
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

This was hiring manager round

Round duration - 20 Minutes
Round difficulty - Easy

This was culture fit round

Very basic problem solving round

Q1. Medium level DSA problem solving round
Add your answer