Cognizant Big Data Analyst Interview Questions and Answers

Round duration - 180 minutes
Round difficulty - Easy

Q1. 
Buy and Sell Stock - III Problem Statement
Given an array prices where the i^th element represents the price of a stock on the i^th day, your task is to determine the maximum profit that can be achieved at ...read more
Ans. 
Determine the maximum profit that can be achieved by selling stocks with at most two transactions.
• Iterate through the array and calculate the maximum profit that can be achieved by selling at each day.

• Keep track of the maximum profit that can be achieved after the first transaction and the maximum profit that can be achieved after the second transaction.

• Return the maximum profit that can be achieved after the second tr...read more
Answered by AI
View 1 more answer
Q2. 
Pairwise Sum of Hamming Distance
Given an array ARR containing N integers, your task is to calculate the total sum of the Hamming Distance for all possible pairs of elements in the array.
Hamming Distanc...read more
Ans. 
Calculate the total sum of Hamming Distance for all possible pairs of elements in an array.
• Iterate through all pairs of elements in the array

• Calculate the Hamming Distance between each pair of elements

• Sum up all the calculated Hamming Distances
Answered by AI
Add your answer

Round duration - 30 minnutes
Round difficulty - Hard

Q1. 
Next Greater Element Problem Statement
Given a list of integers of size N, your task is to determine the Next Greater Element (NGE) for every element. The Next Greater Element for an element X is the firs...read more
Ans. 
The task is to find the next greater element for each element in a list of integers.
• Iterate through the list of integers from right to left.

• Use a stack to keep track of elements whose next greater element is yet to be found.

• Pop elements from the stack until a greater element is found or the stack is empty.

• Assign the next greater element to the current element or -1 if no greater element is found.

• Return the list of next...read more
Answered by AI
View 1 more answer
Q2. 
Left View of a Binary Tree Problem Statement
Given a binary tree, your task is to print the left view of the tree.
Example:
Input:
The input will be in level order form, with node values separated by a...read more
Ans. 
Print the left view of a binary tree given in level order form.
• Traverse the tree level by level and print the first node of each level

• Use a queue to keep track of nodes at each level

• Handle null nodes by using a placeholder value like -1
Answered by AI
Add your answer

Round duration - 10 minutes
Round difficulty - Medium