Filter interviews by
I appeared for an interview before Sep 2020.
Round duration - 100 Minutes
Round difficulty - Hard
**Criteria:
8 CPI or Above (only CSE, MnC). All students irrespective of history of backlogs or current backlogs were considered if they satisfied the CPI criteria.
It was first round..
This round was the Online test which was around 1 Hour 40 Minutes long(don't remember exact time).
Timing from 19:00 to 20:40
Environement was comfortable.
Hackerrank is a good platform for online tests.
All questions were new for me, So cant give any links.
Given an integer array ARR
of size N
and an integer K
, determine the minimum number of elements that need to be removed so that the difference between the maximum and mi...
Find the minimum number of elements to remove from an array to satisfy a given condition.
Calculate the initial difference between the maximum and minimum elements in the array.
Iterate through the array and remove elements to minimize the difference.
Return the count of elements removed as the answer.
You are given the initial health of a king represented by an integer N
. Your task is to determine the minimum number of stabs required to reduce the king's health ...
Calculate the minimum number of stabs required to kill the king by reducing his health to zero.
Iterate through each test case and calculate the minimum number of stabs required based on the given operations.
For each test case, keep reducing the king's health using the first or second type of stab until it reaches zero.
Consider the constraints provided to optimize the solution and handle edge cases.
Example: For input 10...
In a city with ‘N’ junctions and ‘M’ bi-directional roads, each junction is connected to other junctions with specified travel times. No road connects a junction to itself, ...
The problem involves finding the minimum time to travel from a source junction to a destination junction in a city with specified travel times and green light periods.
Input consists of the number of test cases, number of junctions and roads, green light periods, road connections with travel times, and source/destination junctions.
Output should be the minimum time needed from source to destination, or -1 if destination ...
Round duration - 75 Minutes
Round difficulty - Medium
This was an Online F2F Technical Round conducted on zoom. Interviewer shared codepad link and you were asked to code and pass sample test case given by interviewer. Only one question(coding) was asked(More follow questions).
Interviewer was really helpful..
Assume you initially have an empty array called ARR
. You are required to return the updated array after executing Q
number of queries on this array.
There are two types of que...
Implement a function to update an array based on XOR queries.
Create an empty array to store the elements.
Iterate through each query and update the array accordingly.
Use bitwise XOR operation to update the elements.
Ensure to handle both types of queries - insert and XOR.
Return the updated array after all queries are processed.
Round duration - 90 Miinutes
Round difficulty - Medium
Again pattern was same(Zoom video call and I was asked to code and 1 question was there(+Follow up)).
Timing was afternoon time around 13:00
You are given an integer 'N' and two strings S
and R
, each having the size N
. Determine if you can scramble string S
to obtain string R
using specified operations.
Your ...
Given two strings of the same length, determine if one can be scrambled to obtain the other using specified operations.
Check if the two strings are equal, if so return true.
Check if the characters in both strings are the same, if not return false.
Try all possible ways of splitting and scrambling the first string to match the second string.
Round duration - 60 Minutes
Round difficulty - Easy
It was a zoom video call.
In starting 5 minutes, interviewer tried to make me comfortable with him..
Tip 1 : Do Complete Interview Bit, Puzzles and some questions from LeetCode
Tip 2 : Do 2 or 3 projects. Projects using different technologies are preffered.
Tip 3 : Give Practice Contests on Codeforces, Codechef. These help you to clear coding rounds which are useful for shortlisting for interview..
Tip 1 : Never put anything on resume that you are not comfortable with.. Because if interviewer just start with that topic and you are not comfortable, this create bad impression on interviewer.
Tip 2 : Have 2 or 3 projects on different technologies.
Tip 3 : Put 2 or 3 college time achievement. (can be Competitive programming or Academic performance)
Top trending discussions
I applied via Naukri.com and was interviewed before Sep 2021. There were 6 interview rounds.
1 hr time limit. Some technical mathematical question, english grammar related, genral knowledge.
After clearing apti, they will assign machine test. 1 hr time limite.
I applied via Other and was interviewed in May 2021. There was 1 interview round.
Sorting array of strings without using inbuilt function.
Implement bubble sort algorithm
Compare adjacent elements and swap if necessary
Repeat until no swaps are needed
I appeared for an interview before Jan 2016.
I appeared for an interview before Sep 2020.
Round duration - 7 days
Round difficulty - Easy
Web Development, Databases
Round duration - 60 minutes
Round difficulty - Medium
This was the final round and was a telephonic interview.
Design a data structure that effectively stores a key-value mapping and performs specific operations in constant time.
Your data stru...
Design a data structure implementing HashMap with constant time operations like INSERT, DELETE, SEARCH, GET, GET_SIZE, IS_EMPTY.
Use a combination of hash table and linked list to achieve constant time operations.
For INSERT and UPDATE, hash the key to get the index and store the (key, value) pair in the linked list at that index.
For DELETE, SEARCH, and GET, hash the key to find the index, then traverse the linked list a...
You are provided with two arbitrary binary trees. Determine if both trees are isomorphic.
Two binary trees are considered isomorphic if one tree can be tr...
Determine if two binary trees are isomorphic by swapping left and right subtrees.
Check if both trees are empty, return 'yes' if they are
Perform the swap operation on any node at any level
Compare the structures of both trees after swapping to determine isomorphism
Tip 1 : Practice Data Structures and Algorithms from websites like leetcode,geeksforgeeks etc.
Tip 2 : Learn one skill — be it web development, android development, or Machine Learning, make some projects on it. Don’t try to learn everything, pick 1 thing, and master it.
Tip 3 : Study computer fundamentals — DBMS, Operating Systems, OOPs, Computer Networks before your interviews.
Tip 1 : Keep it simple and concise.
Tip 2 : Include some personal projects
I applied via Walk-in and was interviewed before Jan 2021. There were 4 interview rounds.
I applied via Company Website and was interviewed before Dec 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed in Oct 2023. There were 3 interview rounds.
Data structures were there for both the questions. Linked list and tree questions where asked
Long coding high level
I applied via Campus Placement and was interviewed before Aug 2023. There were 2 interview rounds.
Standard question on linked list and tres
Long coding test for system test lld
Customer Success Engineer
66
salaries
| ₹7.4 L/yr - ₹20.5 L/yr |
Software Engineer
55
salaries
| ₹20 L/yr - ₹62.5 L/yr |
Senior Customer Success Engineer
37
salaries
| ₹13 L/yr - ₹31 L/yr |
Software Developer
19
salaries
| ₹25 L/yr - ₹51 L/yr |
Sde1
14
salaries
| ₹24 L/yr - ₹46 L/yr |
Celebal Technologies
NoBrokerHOOD
Duck Creek Technologies
FinThrive