Filter interviews by
I appeared for an interview in Mar 2025, where I was asked the following questions.
The '<>' in 'List<> Employees' denotes generics in Java, specifying the type of elements in the list.
Generics provide type safety by allowing you to specify the type of objects stored in a collection.
Example: List<String> names allows only String objects, preventing runtime errors.
Without '<>', List employees would be a raw type, leading to unchecked warnings and potential ClassCastException.
Java memory management involves various types of memory areas for efficient data handling and garbage collection.
Heap Memory: Used for dynamic memory allocation. Example: Objects created using 'new'.
Stack Memory: Stores method calls and local variables. Example: Primitive data types.
Method Area: Stores class structures like metadata, constants, and static variables.
Program Counter Register: Keeps track of the currently...
Top trending discussions
I applied via Approached by Company and was interviewed before Mar 2021. There were 4 interview rounds.
DSA
About Social changes
I applied via Naukri.com and was interviewed before Sep 2020. There were 3 interview rounds.
Company policies and locations
Our company has strict policies regarding data privacy and security
We have multiple locations across the country and internationally
Each location has its own set of policies and procedures
Employees are expected to adhere to all company policies regardless of location
I appeared for an interview before Sep 2020.
Round duration - 90 minutes
Round difficulty - Medium
We were supposed to give test in any time between 3 PM to 9 PM.
You are located at point ‘A’, the top-left corner of an M x N matrix, and your target is point ‘B’, the bottom-right corner of the same matrix. Your task is to calcula...
The problem involves finding the total number of unique paths from the top-left to bottom-right cell of a matrix by moving only right or down.
Use dynamic programming to solve the problem efficiently.
Create a 2D array to store the number of unique paths at each cell.
Initialize the first row and first column with 1 as there is only one way to reach them.
For each cell (i, j), the number of unique paths is the sum of paths...
We are provided with a tree containing 'N' nodes, numbered from 0 to N-1. The objective is to determine the total number of nodes within each subtree of the provided tree. Speci...
Given a tree with N nodes, find the number of elements in each subtree rooted at every node.
Traverse the tree using Depth First Search (DFS) to calculate subtree sizes for each node.
Use an array to store subtree sizes for each node, starting with leaf nodes having size 1.
The subtree size of a node is the sum of subtree sizes of its children plus 1 for the node itself.
Round duration - 120 minutes
Round difficulty - Medium
Pair Programming Interview( this round is similar to machine coding round) it started around 11 AM
Focus Areas: Problem solving and implementation of extensions.
The pair coding round is focused on OOPS concepts. You are paired with a TWer for this round. They let you code first for an hour and in the next hour they review your code and suggest changes which would improve the code structure, readability and make it modular and reusable and functional.
Ninja stands at the start of a wooden bridge over a river. Some segments of the bridge are damaged. The undamaged segments, marked as 'safe', are listed in an array S...
Check if Ninja can cross the river by jumping from one safe segment to another based on given constraints.
Iterate through the 'SAFE' array and check if Ninja can make the required jumps to reach the last safe segment.
Ensure that the next jump is either 'X' - 1, 'X', or 'X' + 1 units from the previous jump.
Return 'true' if Ninja can successfully cross the river, otherwise return 'false'.
Round duration - 120 minutes
Round difficulty - Medium
Students who were shortlisted from Pair Programming round was selected for this round around 3 PM. In this round there were two interviewer.
You are given the head node of a singly linked list. Your task is to return a pointer pointing to the middle of the linked list.
If there is an odd number of elements, return the ...
Return the middle element of a singly linked list, or the one farther from the head if there are even elements.
Traverse the linked list with two pointers, one moving twice as fast as the other
When the fast pointer reaches the end, the slow pointer will be at the middle
Return the element pointed to by the slow pointer
Tip 1 : Have good grasp on OOPS since they have a round named Pair Programming round which is focused upon this.
Tip 2 : Write clean, modular and functional code.
Tip 3 : Practice Data Structures and Algorithms
Tip 4 : You should know breadth and depth of whatever is mentioned in your resume.
Tip 5 : Be loud and clear.
Tip 1 : Make single page resume.
Tip 2 : Mention relevant things on resume.
Tip 3 : Do not put any false things on resume. Projects, internships you are mentioning be ready to answer questions related to it regarding what you solved, idea, databases, design.
Tip 4 : Contribute in open source, participate in hackathons.
posted on 28 Nov 2021
I applied via Naukri.com and was interviewed in Oct 2021. There was 1 interview round.
Na not applicable for this thing
posted on 9 Mar 2022
posted on 24 Jun 2022
ASP.NET is a web application framework developed by Microsoft to build dynamic web pages and applications.
ASP.NET is used to create web applications and websites
It supports multiple programming languages like C#, VB.NET, etc.
Filters in ASP.NET are used to intercept and modify HTTP requests and responses
Filters can be used for authentication, logging, caching, etc.
Web API is a framework for building HTTP services that can be consumed by a variety of clients.
Web API is a part of the ASP.NET framework
It allows developers to build RESTful services
It can be used to create APIs for web applications built using MVC
Web API can return data in various formats such as JSON, XML, etc.
It supports HTTP verbs such as GET, POST, PUT, DELETE, etc.
I appeared for an interview before Dec 2023.
Such a nice experience
Such a nice experience
based on 1 interview experience
Difficulty level
Duration
based on 2 reviews
Rating in categories
Senior Software Engineer
500
salaries
| ₹4.7 L/yr - ₹18 L/yr |
Senior Analyst
349
salaries
| ₹4.8 L/yr - ₹16.1 L/yr |
System Specialist
267
salaries
| ₹8 L/yr - ₹25.8 L/yr |
Software Engineer
256
salaries
| ₹3 L/yr - ₹8.3 L/yr |
Business Analyst
208
salaries
| ₹4.6 L/yr - ₹19 L/yr |
Synechron
Movate
Sopra Steria
NCR Corporation