Cognizant interview experience Real time questions & tips from candidates to crack your interview
Programmer Analyst Trainee
Cognizant
2 rounds | 4 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 3 months
Topics: Data Structures, OOPS, DBMS, Algorithms, Any one Programming language
Tip 1 : Do atleast one project
Tip 2 : Prepare for the aptitude.
Application process
Where: Campus
Eligibility: 6.5 CGPA
Tip 1 : Mention atleast one project on resume
Tip 2 : Do not mention false things on resume
Interview rounds
01
Round
Medium
Online Coding Interview
Duration105 minutes
Interview date28 Oct 2020
Coding problem2
Technical + Aptitude Round
1. House Robber
Moderate
26m average time
0/80
Asked in companies
A thief wants to loot houses. He knows the amount of money in each house. He cannot loot two consecutive houses. Find the maximum amount of money he can loot.
2. Top View
Moderate
42m average time
61% success
0/80
Asked in companies
Given a binary tree. Print the Top View of Binary Tree. Print the nodes from left to right order.
Example:
Input:
Output: 2 35 2 10 2
02
Round
Medium
Video Call
Duration35 minutes
Interview date18 Nov 2020
Coding problem2
Technical + HR round
1. Basic HR Questions
Whether there was a gap in my education. If so, why?
Why Cognizant?
Is it alright for me to work from any location?
Can I work any shift?
Problem approach
Tip 1 : Do practice SQL queries
Tip 2 : Do practice DSA easy to medium questions
2. Frequency In A Sorted Array
Easy
15m average time
85% success
0/40
Asked in companies
You are given a sorted array 'ARR' and a number 'X'. Your task is to count the number of occurrences of 'X' in 'ARR'.
Note :
1. If 'X' is not found in the array, return 0.
2. The given array is sorted in non-decreasing order.
Problem approach
Tip 1 : Traverse the given array from start to end. For every element in the array increment the arr[i]%n‘th element by n.
Tip 2 : Now traverse the array again and print all those indexes i for which arr[i]/n is greater than 1. Which guarantees that the number n has been added to that index
Tip 3 : This approach works because all elements are in the range from 0 to n-1 and arr[i] would be greater than n only if a value “i” has appeared more than once.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
To make an AI less repetitive in a long paragraph, you should increase:
Choose another skill to practice
Similar interview experiences
Programmer Analyst Trainee
4 rounds | 6 problems
Interviewed by Cognizant
Selected 
1173 views
0 comments
0 upvotes
Programmer Analyst Trainee
2 rounds | 3 problems
Interviewed by Cognizant
Selected 1408 views
0 comments
0 upvotes
Programmer Analyst Trainee
3 rounds | 7 problems
Interviewed by Cognizant
Selected 925 views
0 comments
0 upvotes
Programmer Analyst Trainee
3 rounds | 8 problems
Interviewed by Cognizant
Selected 772 views
0 comments
0 upvotes
Companies with similar interview experiences
Programmer Analyst Trainee
3 rounds | 4 problems
Interviewed by Newgen Software
Selected 811 views
0 comments
0 upvotes