Filter interviews by
I applied via LinkedIn and was interviewed before Jun 2022. There were 3 interview rounds.
Basics programs likes pallindrome or reverse string or matrix questions
I applied via Recruitment Consultant and was interviewed in Apr 2021. There were 3 interview rounds.
I applied via Recruitment Consultant and was interviewed in Aug 2021. There was 1 interview round.
I applied via Job Fair
Quants , Verbal , Sql , 2 coding ques
2 coding ques were asked - valid par and linkedlist loop
I applied via Referral and was interviewed in Jul 2022. There were 2 interview rounds.
posted on 21 Mar 2023
I applied via Approached by Company and was interviewed before Mar 2022. There were 4 interview rounds.
Just a basic question related to codes
I appeared for an interview in Sep 2020.
Round duration - 150 minutes
Round difficulty - Medium
In this round, there were 4 sections of MCQs, along with two coding questions. It lasted for 2.5 hours in which the camera was on along with the microphone on the platform AMCAT. One coding question was of hard difficulty level of graph and another was of medium level difficulty question of dynamic programming. MCQ part was quite easy with a timer, on each sub part and can be easily solved.
Given a connected, undirected, and acyclic graph where some nodes are marked and a positive integer 'K'. Your task is to return the count of nodes such that...
Count nodes within K-distance from marked nodes in a connected, undirected, acyclic graph.
Create an adjacency list to represent the graph.
Use BFS to traverse the graph and calculate distances from marked nodes.
Keep track of visited nodes and distances to avoid revisiting nodes.
Return the count of nodes with distances less than 'K' from all marked nodes.
Handle edge cases like empty graph or marked nodes.
Given an infinite supply of coins of each denomination from a list, determine the total number of distinct ways to make a change for a specified value. If making the change isn't ...
Given coin denominations and a target value, find the total number of ways to make change.
Use dynamic programming to keep track of the number of ways to make change for each value up to the target value.
Iterate through each denomination and update the number of ways to make change for each value.
Handle base cases such as making change for 0 value.
Consider all possible combinations of denominations to make change for th
Round duration - 30 minutes
Round difficulty - Medium
There were around 40 people shortlisted after round 1, for the interview, round, in the morning PPT was held, after which the interviews were scheduled, for 30 minutes till 6 pm in the evening,
my interview was at 4.30 pm
Interviewer was straight forward, and direct in approach, and did not waste even a single second of his or mine. Sharp after 30 minutes the interview was ended.
through out the interview, he was friendly, and just observing.
Firstly, 3 coding questions, were asked, then 2 concepts of java and 1 concept of data structures was asked.
the question related to java were, demon thread and platform independence. In data structures, I was asked to give brief intro regarding the AVL trees.
Given a sorted array or list of integers with size N and an integer X, you need to determine how many times X appears in the array/list.
The first line of t...
Count occurrences of a given integer in a sorted array.
Use binary search to find the first and last occurrence of X in the array.
Calculate the count by subtracting the indices of the last and first occurrences.
Handle cases where X is not present in the array.
Given a sequence of numbers, denoted as ARR
, your task is to return a sorted sequence of ARR
in non-descending order using the Merge Sort algorithm.
The Merge Sort...
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
Divide the input array into two halves recursively until each part has a size of '1'.
Merge the sorted arrays to return one fully sorted array.
Time complexity of Merge Sort is O(n log n).
Your task is to implement a Stack data structure using a Singly Linked List.
Create a class named Stack
which supports the following operations, each in O(1...
Implement a Stack data structure using a Singly Linked List with operations in O(1) time.
Create a class named Stack with getSize, isEmpty, push, pop, and getTop methods.
Use a Singly Linked List to store the elements of the stack.
Ensure each operation runs in O(1) time complexity.
Handle edge cases like empty stack appropriately.
Example: For input '5 3 10 5 1 2 4', the output should be '10 1 false'.
Round duration - 15 minutes
Round difficulty - Easy
The interview was scheduled at 4.30 pm again, and due to network issue, my audio was not clear to the interviewer, but the interviewer was highly cooperating, he called me over phone to take the interview, and video was on through the zoom meet only.
The interview was like a discussion from both ends, which went very satisfying for me as a candidate and the interviewer too.
Before the interview in the morning, we were given the topics on which we had to write 100 words.
Tip 1 : Solve all the question with Microsoft, Amazon tags on geeksforgeeks.
Tip 2 : Never give up during the interview, rather just keep trying whether you reach the solution or not.
Tip 3 : Be confident, this is the most important requirement.
Tip 1 : Claim the things, that you have done in actual by your own.
Tip 2 : Never write any false information on the resume, always get it verified with your mates.
I applied via Company Website and was interviewed in Feb 2024. There was 1 interview round.
I applied via Naukri.com and was interviewed in Aug 2023. There were 3 interview rounds.
based on 1 interview
Interview experience
based on 21 reviews
Rating in categories
Senior Software Engineer
835
salaries
| ₹4.4 L/yr - ₹17.8 L/yr |
Software Engineer
400
salaries
| ₹2.2 L/yr - ₹7.5 L/yr |
Senior Software Developer
320
salaries
| ₹6 L/yr - ₹20.6 L/yr |
Softwaretest Engineer
285
salaries
| ₹3 L/yr - ₹9.7 L/yr |
Senior Test Engineer
199
salaries
| ₹3 L/yr - ₹11 L/yr |
ITC Infotech
3i Infotech
Sify Technologies
Microland