Big Data Analyst Interview Questions and Answers for Freshers

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 transaction.

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 greater elements.

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

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