Cognizant interview experience Real time questions & tips from candidates to crack your interview

Project Engineer

Cognizant
upvote
share-icon
3 rounds | 5 Coding problems

Interview preparation journey

expand-icon
Preparation
Duration: 3 months
Topics: Computer Networks, Operating Systems, Data Structures, Algorithms, OOPS
Tip
Tip

Tip 1 : Practice DSA on daily basis
Tip 2 : Prepare at least two good projects

Application process
Where: Campus
Eligibility: No Backlogs
Resume Tip
Resume tip

Tip 1 : Add projects on resume
Tip 2 : Only add skills that you are comfortable with

Interview rounds

01
Round
Easy
Online Coding Test
Duration50 minutes
Interview date14 Dec 2022
Coding problem2

First Technical round

1. Left View Of Binary Tree

Moderate
30m average time
60% success
0/80
Asked in companies
MicrosoftGeeksforGeeksBNY Mellon

You have been given a Binary Tree of 'n' nodes, where the nodes have integer values



Example :
If the input tree is as depicted in the picture: 

alt text

The Left View of the tree will be:  2 35 2 
Try solving now

2. Longest Common Subsequence

Moderate
0/80
Asked in companies
AmazonVisaRed Hat

You have been given two Strings “STR1” and “STR2” of characters. Your task is to find the length of the longest common subsequence.

A String ‘a’ is a subsequence of a String ‘b’ if ‘a’ can be obtained from ‘b’ by deletion of several (possibly, zero or all) characters. A common subsequence of two Strings is a subsequence that is common to both Strings.

Try solving now
02
Round
Easy
Video Call
Duration40 minutes
Interview date19 Dec 2022
Coding problem2

Technical round number 2.

1. DBMS Questions

What are acid properties?
What is data encapsulation?
What is inheritance?
What do you understand by normalisation?

2. Bridges In A Graph

Moderate
25m average time
65% success
0/80
Asked in companies
CIS - Cyber InfrastructureOlaSamsung

Given an undirected graph of V vertices and E edges. Your task is to find all the bridges in the given undirected graph. A bridge in any graph is defined as an edge which, when removed, makes the graph disconnected (or more precisely, increases the number of connected components in the graph).

For Example :

If the given graph is :

graph

Then the edge between 0 and 4 is the bridge because if the edge between 0 and 4 is removed, then there will be no path left to reach from 0 to 4.and makes the graph disconnected, and increases the number of connected components.

Note :

There are no self-loops(an edge connecting the vertex to itself) in the given graph.

There are no parallel edges i.e no two vertices are directly connected by more than 1 edge.
Try solving now
03
Round
Easy
HR Round
Duration20 minutes
Interview date25 Dec 2022
Coding problem1

HR Round

1. Basic HR Questions

What is you best quality according to you?
What do you know about the work ethics here in cognizant?
Why should we hire you?
Are you willing to relocate

Problem approach

Tip 1 : Just don't lie they can caught you if you will try to lie

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
company logo
SDE - 1
2 rounds | 5 problems
Interviewed by Cognizant
1746 views
1 comments
0 upvotes
company logo
SDE - 2
3 rounds | 5 problems
Interviewed by Cognizant
1063 views
0 comments
0 upvotes
company logo
Program Analyst
2 rounds | 6 problems
Interviewed by Cognizant
604 views
0 comments
0 upvotes
company logo
Programmer Analyst Trainee
3 rounds | 8 problems
Interviewed by Cognizant
773 views
0 comments
0 upvotes