Procol Software Developer Intern Interview Questions and Answers

Compute the value of X raised to the power of N for given integers X and N.

• Read the number of test cases T

• For each test case, read the values of X and N

• Calculate X^N for each test case

• Print the result of X^N for each test case

The minimum number of operations required to make all elements of the given array equal.

• Calculate the target value as the sum of all elements divided by the length of the array.

• Find the absolute difference between each element and the target value to determine the number of operations needed.

• Return the sum of all absolute differences as the minimum number of operations required.

Calculate minimum cost to make consecutive windows of domino piles equal in height.

• Iterate through each window of size K and calculate the minimum cost to make piles equal in height.

• Keep track of the running sum of domino heights in each window.

• For each window, find the median height and calculate the cost to make all piles equal to the median height.

Compute the maximum length of a string that can be formed by joining given strings based on a specific condition.

• Iterate through each string and store the count of strings ending with 'R' and 'B'.

• Check if there are any strings ending with 'R' and 'B' that can be combined to form a longer string.

• Return the maximum length of the string that can be formed or 0 if no combination is possible.

Implement a Stack data structure using a Singly Linked List with operations in O(1) time.

• Create a class named Stack with methods getSize, isEmpty, push, pop, and getTop.

• Use a Singly Linked List to store the elements of the stack.

• Ensure each operation runs in O(1) time complexity.

• Handle edge cases like empty stack appropriately.

• Implement the logic for each operation as specified in the question.

• Test the implementation with sample input and output provided in the question.

Find pairs of elements in an array that sum up to a given value, sorted in a specific order.

• Iterate through the array and for each element, check if the complement exists in a hash set.

• Sort the pairs based on the first element and then the second element.

• Use a hash set to store elements as you iterate through the array to avoid duplicates.

• Return the list of pairs that satisfy the sum condition.