i
Cognizant
Proud winner of ABECA 2024 - AmbitionBox Employee Choice Awards
Filter interviews by
Clear (1)
I was interviewed in Dec 2020.
Round duration - 120 Minutes
Round difficulty - Medium
We have aptitude, reasoning and verbal.
Given an array consisting of 'N' positive integers where each integer is either 0, 1, or 2, your task is to sort the given array in non-decreasing order.
Each input st...
Sort an array of positive integers (0, 1, 2) in non-decreasing order.
Iterate through the array and count the occurrences of 0, 1, and 2.
Update the array with the counts of each element in non-decreasing order.
Print the sorted array for each test case.
Round duration - 60 minutes
Round difficulty - Easy
Advanced Coding round
Given a square chessboard of size 'N x N', determine the minimum number of moves a Knight requires to reach a specified target position from its initial position...
Calculate minimum steps for a Knight to reach target position on a chessboard.
Use BFS algorithm to find shortest path from Knight's starting position to target position.
Consider all possible moves of the Knight on the chessboard.
Keep track of visited positions to avoid revisiting them.
Return the minimum number of moves required for the Knight to reach the target position.
Round duration - 60 Minutes
Round difficulty - Medium
I got the link a day before and my interview was scheduled at 6Pm.
Given an infinite supply of coins of varying denominations, determine the total number of ways to make change for a specified value using these coins. If it's not possible to make...
The task is to find the total number of ways to make change for a specified value using given denominations.
Create a dynamic programming table to store the number of ways to make change for each value up to the target value.
Iterate through each denomination and update the table accordingly.
The final answer will be the value in the table at the target value.
Consider edge cases like when the target value is 0 or when the...
Tip 1 : confidence is most important.
Tip 2 : explaining projects plays a key role.
Tip 1 : you should be very clear what you have written in your resume.
Tip 2 : projects should be very clear
I applied via Campus Placement and was interviewed in May 2021. There were 4 interview rounds.
To find if the 5th bit of a number is set or cleared.
Use bitwise AND operator with 0b10000 to check if the 5th bit is set or cleared.
If the result is 0, the 5th bit is cleared. If it is greater than 0, the 5th bit is set.
Example: num & 0b10000 == 0 means 5th bit is cleared in num.
based on 3 interviews
2 Interview rounds
Associate
71.9k
salaries
| ₹0 L/yr - ₹0 L/yr |
Programmer Analyst
55.5k
salaries
| ₹0 L/yr - ₹0 L/yr |
Senior Associate
48.7k
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