i
Cognizant
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
I was interviewed in Oct 2021.
Round duration - 180 Minutes
Round difficulty - Easy
The first round was based on algorithms, pseudo-codes, 2-3 questions from DBMS and CN, 3 coding questions, and 3 DBMS queries.
Ninja has strategically formed a team to combat enemies in his city. Each ninja in the team has a specific range of attack, and the team has successfully acquired the att...
Minimize Hamming distance between two arrays by swapping elements at allowed indices.
Iterate through allowed swaps and swap elements in ninja array accordingly.
Calculate Hamming distance between ninja and enemies arrays after swaps.
Return the minimum Hamming distance obtained.
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.
Use Depth First Search (DFS) or Breadth First Search (BFS) to traverse the matrix and identify connected groups of 1s.
Maintain a visited array to keep track of visited cells to avoid revisiting them.
Increment the island count each time a new island is encountered.
Consider all eight possible directions for connectivity between cells.
Handle edge cases like out of bo
Round duration - 45 minutes
Round difficulty - Medium
It was a TR+HR round .
The interviewer started with “Tell me about yourself”. Then he asked some Java fundamental questions then he sked me the lifecycle of Software development. In HR round I was asked about what I know about Cognizant why I want to join this particular company, Am i okay with relocation, How can I contribute to companies growth etc.
Calculate the Nth term in the Fibonacci sequence, where the sequence is defined as follows: F(n) = F(n-1) + F(n-2)
, with initial conditions F(1) = F(2) = 1
.
Calculate the Nth Fibonacci number efficiently using dynamic programming.
Use dynamic programming to store and reuse previously calculated Fibonacci numbers.
Start with base cases F(1) and F(2) as 1, then calculate subsequent Fibonacci numbers.
Optimize the solution to avoid redundant calculations by storing intermediate results.
Time complexity can be reduced to O(N) using dynamic programming.
Example: For N = 5, the 5th F
Tip 1 : Practice Atleast 250 Questions Leetcode
Tip 2 : For DSA questions in interviews, start explaining from the brute force approach and then move to the optimal one. Convey your thought process to the interviewers, so that they can help you out if you get stuck.
Tip 3 : Do not write anything that you are not confident of in resume
Tip 4 : Do atleast 2 projects
Tip 1 : Try to include at least one development project in your resume.
Tip 2 : Interviewer will ask anything from your resume so be prepared for it.
Tip 3 : Don't mention some random projects which you are not sure about or copied from Google or somewhere else.
I applied via Campus Placement and was interviewed before Apr 2023. There were 3 interview rounds.
Maths puzzles english
Basic codes like prime numbers and reverse the number
I applied via Company Website and was interviewed in Jul 2022. There was 1 interview round.
Virtual function is a function in base class that is overridden in derived class.
Virtual functions allow polymorphism in C++
They are declared using the virtual keyword
They are resolved at runtime based on the object type
Virtual functions can be overridden in derived classes
They are used to achieve runtime polymorphism
What people are saying about Cognizant
Coding and objective questions
Cognizant interview questions for designations
I applied via Naukri.com and was interviewed before Oct 2022. There was 1 interview round.
Get interview-ready with Top Cognizant Interview Questions
I applied via Company Website and was interviewed in Dec 2021. There were 5 interview rounds.
I prefer using a language that is efficient and has strong support for data structures and algorithms.
Languages like C++, Java, and Python are good choices for complex algorithms
C++ has strong support for data structures and is efficient in terms of memory and speed
Java has a vast library of data structures and algorithms and is easy to read and maintain
Python has a simple syntax and is great for prototyping and testin...
I applied via Company Website and was interviewed in May 2022. There were 3 interview rounds.
Programming in java
Any apptitude
I applied via Naukri.com and was interviewed before Oct 2022. There were 2 interview rounds.
Middle ware is software that acts as a bridge between different applications or systems, allowing them to communicate and share data.
Middle ware facilitates communication between different software applications or systems
It acts as a bridge, allowing applications to share data and functionality
Examples include message brokers like RabbitMQ, integration platforms like MuleSoft, and API gateways like Kong
Programming using collections involves using data structures to store and manipulate groups of related objects.
Collections provide a way to organize and manage data efficiently
Common collections include arrays, lists, sets, and maps
Collections can be used to perform operations such as sorting, filtering, and searching
Examples of collection-based programming include iterating through a list of items and adding or removi
I applied via Recruitment Consultant and was interviewed in Sep 2021. There was 1 interview round.
The duration of Cognizant Software Developer interview process can vary, but typically it takes about less than 2 weeks to complete.
based on 108 interviews
5 Interview rounds
based on 473 reviews
Rating in categories
Associate
72.2k
salaries
| ₹0 L/yr - ₹0 L/yr |
Programmer Analyst
55.6k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
48.8k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Processing Executive
28.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Technical Lead
17.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
TCS
Infosys
Wipro
Accenture