Filter interviews by
Be the first one to contribute and help others!
I applied via Campus Placement and was interviewed before Sep 2021. There were 5 interview rounds.
1. One question was given to be solved in 1 hour. Question was medium level based on strings.
1. 3 questions were given out of which any 2 needed to be solved. 1 question related to Database design and query, 2 questions related to DSA, both DSA questions were medium-hard type based on Dynamic programming and graph.
I solved one Dynamic programming question and Database question.
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
This test consists of two coding questions and some MCQ regarding computer fundamentals.
Kevin has two packs of cards. The first pack contains N cards, and the second contains M cards. Each card has an integer written on it. Determine two results: the tot...
Find total distinct card types and common card types between two packs of cards.
Create a set to store distinct card types when combining both packs.
Iterate through each pack and add card types to the set.
Find the intersection of card types between the two packs to get common card types.
Given an array of integers arr
, where arr[i]
represents the number of pages in the i-th
book, and an integer m
representing the number of students, allocate all the books ...
Allocate books to students in a way that minimizes the maximum number of pages assigned to a student.
Iterate through all possible allocations of books to students.
Calculate the maximum number of pages assigned to a student for each allocation.
Return the minimum of these maximums as the result.
Round duration - 40 minutes
Round difficulty - Easy
It was a technical round that is based on DSA and computer fundamentals.
Given a singly linked list of integers, return the head of the reversed linked list.
Initial linked list: 1 -> 2 -> 3 -> 4 -> NULL
Reversed link...
Reverse a singly linked list of integers and return the head of the reversed linked list.
Iterate through the linked list and reverse the pointers to point to the previous node instead of the next node.
Use three pointers - prev, current, and next to reverse the linked list in O(N) time and O(1) space complexity.
Update the head of the reversed linked list as the last node encountered during the reversal process.
Given an integer array arr
of size 'N' containing only 0s, 1s, and 2s, write an algorithm to sort the array.
The first line contains an integer 'T' representing the n...
Sort an array of 0s, 1s, and 2s in linear time complexity.
Use three pointers to keep track of 0s, 1s, and 2s while traversing the array.
Swap elements based on the values encountered to sort the array in-place.
Time complexity should be O(N) and space complexity should be O(1).
Tip 1 : If you are not able to complete something in-depth, clearly mention that to the interviewer.
Tip 2 : Practice DSA well.
Tip 3 : Try to think analytically and more logically,Your thinking skills matters a lot.
Tip 1 : Try to mention max no of projects
Tip 2 : DO not fake in your resume.
I applied via Approached by Company and was interviewed before Jun 2021. There were 3 interview rounds.
This is a case study round, you would be given 3 question out of which you will need to solve any 2.
Two question are algoritm based around designing datastructure and matrix problem
One question will be based om designing Database for a given requirement.
I applied via Campus Placement and was interviewed before Nov 2020. There was 1 interview round.
Program to calculate factorial
Use a loop to multiply the numbers from 1 to n
Handle edge cases like 0 and negative numbers
Use recursion for a more elegant solution
I applied via LinkedIn and was interviewed in Nov 2020. There was 1 interview round.
I applied via Naukri.com and was interviewed in Nov 2020. There was 1 interview round.
Answering questions related to REST API, Spring MVC, Spring Boot, abstract class, and interfaces.
REST API is a set of rules for building web services. It uses HTTP methods to access resources.
Spring MVC is a framework for building web applications using the Model-View-Controller architecture.
Spring Boot is a framework for building standalone, production-grade Spring-based applications.
An abstract class is a class that ...
I applied via Naukri.com and was interviewed in Apr 2020. There was 1 interview round.
Synchronous means happening at the same time, while asynchronous means not happening at the same time.
Synchronous operations occur in real-time, while asynchronous operations can be delayed or queued.
Synchronous operations block the program until they are completed, while asynchronous operations allow the program to continue running.
Examples of synchronous operations include function calls and loops, while examples of ...
CTE and temp table usage in SQL
Use CTE for recursive queries and complex subqueries
Use temp tables for large data sets and complex queries
CTE is more efficient for small data sets
Temp tables can be indexed for faster performance
Consider the scope and lifespan of the data when choosing between CTE and temp table
I appeared for an interview before Sep 2020.
based on 1 interview
Interview experience
based on 6 reviews
Rating in categories
Senior Associate
16.1k
salaries
| ₹8 L/yr - ₹30.2 L/yr |
Associate
13.7k
salaries
| ₹4.8 L/yr - ₹15.9 L/yr |
Manager
7k
salaries
| ₹14 L/yr - ₹45 L/yr |
Senior Consultant
4.5k
salaries
| ₹9 L/yr - ₹33 L/yr |
Associate2
4.4k
salaries
| ₹4.7 L/yr - ₹17.6 L/yr |
Deloitte
Ernst & Young
Accenture
TCS