Filter interviews by
The question is asking to calculate the number of hops an elevator needs to travel between floors.
Calculate the difference between the starting floor and the destination floor
Divide the difference by the maximum number of floors the elevator can travel in one hop
Round up the result to get the number of hops needed
Transactions in Spring Boot manage database transactions in a declarative way.
Spring Boot uses @Transactional annotation to mark a method as transactional.
Transactions can be managed at class level or method level.
Rollback can be configured based on specific exceptions.
Example: @Transactional(propagation = Propagation.REQUIRED, rollbackFor = Exception.class)
I applied via LinkedIn and was interviewed in Jun 2024. There were 2 interview rounds.
Loop through the linked list to find and remove a specific node
Start at the head of the linked list and iterate through each node
Check if the current node matches the one to be removed
If found, update the pointers to skip over the node and remove it
Continue until the end of the list is reached
Find all triplets in an array of integers without duplicates
Iterate through the array and for each element, find all pairs that sum up to the negative of that element
Use a set to store the seen elements to avoid duplicates
Time complexity can be improved to O(n^2) by sorting the array first
Basic Datastructures and ALgo questions medium to hard level
Iterate through the matrix to find the largest square of 1s
Iterate through each cell in the matrix
For each cell, check if it is part of a square of 1s by checking the cells to the right, below, and diagonally right-down
Keep track of the size of the largest square found
I applied via Approached by Company and was interviewed in Apr 2024. There was 1 interview round.
To find all square matrices in a given matrix, iterate through each cell as the top left corner of a potential square matrix and check if all elements within the square are the same.
Iterate through each cell in the matrix as the top left corner of a potential square matrix
For each cell, check if all elements within the square formed by the cell are the same
If all elements are the same, consider it as a square matrix
Get interview-ready with Top Freshworks Interview Questions
I applied via Approached by Company and was interviewed in Aug 2022. There were 4 interview rounds.
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
I was interviewed in Dec 2021.
Round duration - 60 Minutes
Round difficulty - Medium
Two DSA Problems:
Explain anyone Design pattern you used
It was a recruitment drive happened on Saturday
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...
Given a string input of length 'n', your task is to determine the length of the longest substring that contains no repeating characters.
A substri...
Round duration - 60 Minutes
Round difficulty - Medium
2 Coding questions. Expected to write in 1 hr
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...
Given a number x
and an exponent n
, compute xn
. Accept x
and n
as input from the user, and display the result.
You can assume that 00 = 1
.
Two integers...
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
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...
Round duration - 60 Minutes
Round difficulty - Easy
Director round
Tip 1 : Medium Level DSA - Trees, Arrays, Strings
Tip 2 : High Level Design - Start with basic system then P1 Requirements
Tip 3 : Practice writing code. Online Coding round will be there
Tip 1 : Keep it small. Only projects, Tech stacks, achievements
Tip 2 : Write those Tech stacks and projects in which you are expert
I applied via Approached by Company and was interviewed before May 2023. There was 1 interview round.
It covers easy to medium programming using basic data structures like hash, stack, linked list etc
Hacker rank exam, 2 DSA coding questions
I applied via Referral and was interviewed in Jun 2021. There were 4 interview rounds.
based on 7 interviews
1 Interview rounds
based on 32 reviews
Rating in categories
Senior Software Engineer
296
salaries
| ₹10.6 L/yr - ₹36 L/yr |
fresher
261
salaries
| ₹1 L/yr - ₹5.5 L/yr |
Software Engineer
183
salaries
| ₹6.8 L/yr - ₹16 L/yr |
Lead Software Engineer
177
salaries
| ₹17.2 L/yr - ₹50 L/yr |
Product Specialist
113
salaries
| ₹5 L/yr - ₹10.4 L/yr |
Zoho
Salesforce
LTIMindtree
TCS