Cognizant Software Analyst Interview Questions and Answers

Q1. Hr is one in which they will check ur mental strength in the interview.
Add your answer
Q2. What is ur weakness and strength.
Add your answer
Q3. Tell abt ur previous company.
Add your answer

Round duration - 60 minutes
Round difficulty - Hard

It consist three coding questions based on dsa like tree, graph and vectors maximum connection question i remember of graph.

Q1. 
Merge Intervals Problem Statement
You are provided with 'N' intervals, each containing two integers denoting the start time and end time of the interval.
Your task is to merge all overlapping intervals a...read more
Ans. 
Merge overlapping intervals and return sorted list of merged intervals by start time.
• Iterate through intervals and merge overlapping ones

• Sort merged intervals by start time

• Return the sorted list of merged intervals
Answered by AI
Add your answer
Q2. 
Bottom View of Binary Tree
Given a binary tree, determine and return its bottom view when viewed from left to right. Assume that each child of a node is positioned at a 45-degree angle from its parent.
N...read more
Ans. 
Given a binary tree, determine and return its bottom view when viewed from left to right.
• Traverse the binary tree level by level and keep track of the horizontal distance and depth of each node

• For each horizontal distance, keep track of the node with the maximum depth

• Return the nodes in the bottom view from left to right
Answered by AI
Add your answer
Q3. 
DFS Traversal Problem Statement
Given an undirected and disconnected graph G(V, E), where V is the number of vertices and E is the number of edges, the connections between vertices are provided in the 'GR...read more
Ans. 
DFS traversal problem on an undirected and disconnected graph to find connected components.
• Use Depth First Search (DFS) algorithm to traverse the graph and find connected components.

• Maintain a visited array to keep track of visited vertices.

• For each unvisited vertex, perform DFS to explore all connected vertices and form a connected component.

• Repeat the process until all vertices are visited and print the connected com...read more
Answered by AI
Add your answer

Round duration - 55 minutes
Round difficulty - Medium

It was a interview both hr plus technical
Questions were asked on:
Explain your PROJECTS? 
State merits demerits of PROJECT? 
Can it be scaled?
Normal oops concepts and mongodb.