Filter interviews by
Basic logical & resoning questions
I applied via Job Portal and was interviewed before Apr 2021. There was 1 interview round.
Solid principles are a set of design principles for writing maintainable and scalable code in C#.
Single Responsibility Principle (SRP) - a class should have only one reason to change
Open/Closed Principle (OCP) - a class should be open for extension but closed for modification
Liskov Substitution Principle (LSP) - derived classes should be substitutable for their base classes
Interface Segregation Principle (ISP) - client...
I applied via Campus Placement and was interviewed before Jul 2020. There were 4 interview rounds.
The project involved designing and implementing a new network infrastructure for a large corporation.
Conducted a thorough analysis of the existing network infrastructure
Designed a new network architecture that met the company's needs
Implemented the new network infrastructure with minimal disruption to business operations
Tested and optimized the new network to ensure optimal performance
Provided ongoing support and maint
I applied via Naukri.com and was interviewed in Jul 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I applied via Campus Placement and was interviewed before Jun 2020. There were 3 interview rounds.
I was interviewed before Jun 2021.
Round duration - 180 minutes
Round difficulty - Easy
It was an mcq + coding round. There were aptitude and ouput based question in mcq. And coding questions were easy
Given an integer array 'ARR' of size 'N' containing numbers from 0 to (N - 2). Each number appears at least once, and there is one number that appears twice. Yo...
Find the duplicate number in an array of integers from 0 to (N-2).
Iterate through the array and keep track of the frequency of each number using a hashmap.
Return the number with a frequency greater than 1 as the duplicate number.
Time complexity can be optimized to O(N) using Floyd's Tortoise and Hare algorithm.
You are provided with a string S
and an array of integers A
of size M
. Your task is to perform M
operations on the string as specified by the indices in array A
...
Given a string and an array of indices, reverse substrings based on the indices to obtain the final string.
Iterate through the array of indices and reverse the substrings accordingly
Ensure the range specified by each index is non-empty
Return the final string after all operations are completed
Round duration - 60 Minutes
Round difficulty - Easy
It was technical + hr round. there were 2 people as interviewer. They stated from intro and asked some basic puzzles and hr questions. After that they asked about my projects, technologies and some ds algo and dbms questions.
Tip 1 : Practice aptitude
Tip 2 : Focus on practicing coding
Tip 3 : Learn from mistakes
Tip 1 : Mention some projects that you have done
Tip 2 : Try to have skills that are required for the role
I applied via Campus Placement and was interviewed before Jul 2020. There were 3 interview rounds.
I applied via Referral and was interviewed before Mar 2021. There were 2 interview rounds.
Very easy
I applied via Company Website and was interviewed in Oct 2018. There was 0 interview round.
based on 1 interview
Interview experience
Consultant
7.7k
salaries
| ₹0 L/yr - ₹0 L/yr |
Assistant Manager
6.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Associate Consultant
4.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Analyst
3.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Manager
2.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Cognizant
PwC
Capgemini