Filter interviews by
I appeared for an interview before Feb 2021.
Its the beginning step and easy to crack
Top trending discussions
posted on 29 Jul 2022
I applied via Naukri.com and was interviewed in Jun 2022. There was 1 interview round.
Authentication is the process of verifying the identity of a user, while authorization is the process of granting access to specific resources.
Authentication confirms the identity of a user through credentials such as username and password.
Authorization determines what resources a user can access based on their role or permissions.
Examples of authentication include logging into a website or entering a PIN at an ATM.
Exa...
Inheritance is a concept in object-oriented programming where a class inherits attributes and methods from another class.
Allows a class to inherit properties and behaviors from another class
Promotes code reusability and reduces redundancy
Creates a parent-child relationship between classes
Derived class can access public and protected members of the base class
Example: Class 'Car' can inherit from class 'Vehicle' to reuse
I applied via Walk-in and was interviewed in Sep 2021. There were 5 interview rounds.
posted on 10 Nov 2015
I appeared for an interview before Oct 2020.
Round duration - 40 minutes
Round difficulty - Medium
Asked about time complexity of algorithm, puzzles, DBMS, cutting edge technologies etc. What are indexes?
Given an array of integers ARR
of size N, consisting of 0s and 1s, you need to select a sub-array and flip its bits. Your task is to return the maximum count of 1s that can b...
Given an array of 0s and 1s, find the maximum count of 1s by flipping a sub-array at most once.
Iterate through the array and keep track of the maximum count of 1s obtained by flipping a sub-array.
Consider flipping a sub-array from index i to j and calculate the count of 1s in the resulting array.
Return the maximum count of 1s obtained by flipping a sub-array at most once.
Round duration - 20 minutes
Round difficulty - Medium
Asked 1 standard algorithm
You are provided with a 2-dimensional matrix having N
rows and M
columns, containing only 1s (land) and 0s (water). Your goal is to determine the number of islands in t...
Count the number of islands in a 2D matrix of 1s and 0s.
Iterate through the matrix and perform depth-first search (DFS) to find connected 1s.
Mark visited cells to avoid redundant traversal.
Increment island count whenever a new island is encountered.
Tip 1 : prepare for competitive programming
Tip 2 : know about standard algorithm
Tip 3 : must be good with dbms
Tip 1 : must have projects, which you can explain to them
Tip 2 : have things on resume, that you are totally certain about.
posted on 22 Sep 2021
I applied via Company Website and was interviewed in Mar 2021. There were 5 interview rounds.
posted on 22 Jan 2023
I applied via Campus Placement and was interviewed in Jul 2022. There were 4 interview rounds.
Aptitude+coding was asked. Consider this as the very important selection criteria
Design test . Its very likely to be easy
posted on 30 Oct 2023
I applied via Campus Placement and was interviewed in Sep 2023. There were 2 interview rounds.
Easy and good English passage reading
Senior Consultant
191
salaries
| ₹8.1 L/yr - ₹30 L/yr |
Consultant
142
salaries
| ₹3.8 L/yr - ₹15 L/yr |
Lead Consultant
105
salaries
| ₹11.9 L/yr - ₹28 L/yr |
Pega Developer
39
salaries
| ₹4 L/yr - ₹15 L/yr |
Business Architect
38
salaries
| ₹10 L/yr - ₹16.5 L/yr |
Tekwissen
Softenger
XcelServ Solutions
Damco Solutions