Procol Interview Questions, Process, and Tips

Q1. Why do you want to join procol?
Add your answer
Q2. What if you are not selected here?
Add your answer
Q3. Do you want to become an entrepreneur?
Add your answer

Related to business growth and a template to increase sales

Reason for this role, what do you think is the way to move forward in this role.

Q1. Generic profile matching
Add your answer
Q2. Do you have any other offers
Ans. 
Yes, I have received offers from other companies.
• I have received offers from Company A and Company B.

• I am currently in the final stages of interviews with Company C.

• I am considering all offers before making a decision.
Answered by AI
Add your answer

Q1. More to do with past experience and process know how
Add your answer

Q1. Overall scope for me in the organisation (which in reality wasn't there)
Add your answer

Round duration - 90 Minutes
Round difficulty - Medium

The test consists of 2 sections: MCQ’s and 3 coding questions. It was a 90 minutes test, which could be started anytime between the time window of 2 hrs (In my case window was open from 4 PM to 6 PM). The test was proctored and any suspicious activity would have cancelled our test.

Q1. 
Game of Dominoes Problem Statement
Rafiq loves to play with piles of dominoes, especially when they are of equal heights. His father gifted him 'N' piles of dominoes, each with a positive number of stacke...read more
Ans. Brute Force
Let's reduce our question to a fixed array instead of every subarray of size ‘K’ and try to find an answer specific to that array/list ‘height’, so we could do the same thing for each window, now, as mentioned in the hint, we need to calculate the sum of absolute difference of every element from its median, so after getting the new array, next step would be to calculate the cost of that window, so first we w...read more
Answered Anonymously
Add your answer
Q2. 
String Ka Khel Problem Statement
Ninja is creating a new game ‘String Ka Khel’ for his gaming shop. In this game, players are given ‘N’ strings. The objective is to find the maximum length of strings that...read more
Ans. Brute Approach
• We have to find out all the possible permutations by satisfying the given condition. For this, we make another helper function that also takes into count the index. So starting from the first index of our vector we have to go to the last index.
• So for checking all the permutations, we run a loop that swaps the element of the vector array so we get all the possible permutations and for every permutation, we...read more
Answered Anonymously
Add your answer
Q3. 
Minimum Operations to Equalize Array
Given an integer array ARR of length N where ARR[i] = (2*i + 1), determine the minimum number of operations required to make all the elements of ARR equal. In a single...read more
Ans. Brute Force
• The idea behind this approach is we have to calculate the average of all the elements of the array ‘ARR’ because the sum of all elements of the array always remains constant.
• So calculating the average will help us to virtually divide the elements into two halves around the average i.e left and the right. So calculating the answer for the left half only will be our required answer. It is because in one operat...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

It was a 60 minutes video call round held on Google Meet.The Interviewer was very helpful.

Q1. 
Power of a Number Problem
You are given two integers, X and N. Your task is to compute the value of X raised to the power of N (i.e., X^N).
Input:
The first line contains an integer T, the number of tes...read more
Ans. Recursion
The approach is to recursively call the recursive function for X and N - 1 and multiplying the value returned by the recursive function with X.
As X ^ N is same as X * (X ^ (N - 1)).
 
Approach :
 
• First, let's say the recursive function is ‘POW(X, N)’ having ‘X’ and ‘N’ as arguments.
• The base case for the recursive function will be for N = 0 to return the value 1. As X ^ 0 = 1 and for X = 0 to return the ...read more
Answered Anonymously
Add your answer
Q2. 
Implement Stack with Linked List
Your task is to implement a Stack data structure using a Singly Linked List.
Explanation:
Create a class named Stack which supports the following operations, each in O(1...read more
Ans. Best Approach
1. Maintain a linked list. Keep track of its head, and size at all times, and update them accordingly whenever a new operation is performed.
2. Following is the way we can implement all functions of the stack using linked list:
   1. First, initialize a head node, and the size of the list as NULL and 0 respectively.
   2. Then for push function, insert new elements at the head of the list, i.e. the new element will become the ...read more
Answered Anonymously
Add your answer
Q3. 
Pair Sum Problem Statement
You are given an integer array 'ARR' of size 'N' and an integer 'S'. Your task is to find and return a list of all pairs of elements where each sum of a pair equals 'S'.
Note:
...read more
Ans. Brute Force
• Initialize a list to store our results.
• For each element in the array 'ARR[i]', check if ('ARR[i]' + ‘ARR[j]’), equals to given sum or not, where ‘i’ < ‘j’ < ‘N’.
• If the condition matches, add the pair('ARR[i]', ‘ARR[j]’) to the list. Sort the list of pairs as per the given output format and return this list.
Space Complexity: O(1)Explanation:
O(1).
 
Constant extra space is required.
Time Complexity: O...read more
Answered Anonymously
Add your answer

Round duration - 60 Minutes
Round difficulty - Medium

Q1. 
Search in Infinite Sorted 0-1 Array Problem Statement
You are provided with an infinite sorted array that consists exclusively of 0s followed by 1s. Your task is to determine the index of the first occurr...read more
Ans. Linear Search
The simplest approach would be to start from the beginning, i.e. index 0, and check if there’s a 1 at this index. If yes, then we have found the first occurrence of 1. Else, we check for the next index.
Space Complexity: O(1)Explanation:
O(1), as no extra space is required.
Time Complexity: OtherExplanation:
O(X), where X is the index of the first occurrence of 1.
 
We search X indices before arriving at ...read more
Answered Anonymously
Add your answer