PERSOLKELLY IT Associate Interview Questions and Answers

Q1. Easy question on arrays
Add your answer
Q2. Easy question on arrays and trees
Add your answer

Simple aptitude questions, quantitative and qualitative questions

1 medium coding question. Preferably write in Java. Add commands to explain your code along with time and space complexity

Q1. Interview round where ask about general DSA questions, SQL along with practical questions.
Add your answer
Q2. A variant of bubble sort
Ans. 
Cocktail sort is a variant of bubble sort that sorts in both directions.
• Also known as bidirectional bubble sort or shaker sort.

• It starts with the first element and compares it with the next one, swapping if necessary.

• Then it moves to the last element and compares it with the previous one, swapping if necessary.

• It continues until no more swaps are needed.

• It is more efficient than bubble sort for large lists with many ou
Answered by AI
Add your answer

Round duration - 50 minutes
Round difficulty - Medium

It was virtual 1st round with aptitude and computer science related questions and the other was the programming question for which they were given 30 min to solve and available languages are C,C++,Java and Python.

Q1. 
Ninja and Alternating Largest Problem Statement
Ninja is given a sequence of numbers and needs to rearrange them so that every second element is greater than its neighbors on both sides.
Example:
Input:
...read more
Ans. 
The task is to rearrange the given array such that every second element is greater than its left and right element.
• Read the number of test cases

• For each test case, read the number of elements in the array and the array elements

• Iterate through the array and swap elements at odd indices with their adjacent elements if necessary

• Check if the rearranged array satisfies the conditions and print 1 if it does, else print 0
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Medium

It was around 1PM when this round started. It was taken by 2 developers working in the company. Initially I was a bit nervous but both ther interviewers are flexible. It went well with some discussions and questions.

Q1. 
Longest Common Prefix After Rotation
You are given two strings 'A' and 'B'. While string 'A' is constant, you may apply any number of left shift operations to string 'B'.
Explanation:
Your task is to calcu...read more
Ans. 
The question asks to find the minimum number of left shift operations required to obtain the longest common prefix of two given strings.
• Perform left shift operations on string B to find the longest common prefix with string A

• Count the number of left shift operations required to obtain the longest common prefix

• Return the minimum number of left shift operations for each test case
Answered by AI
Add your answer

Round duration - 30 minutes
Round difficulty - Medium

This was the final and technical round. It happened in between 7-7.30 pm. This interview was taken by senior member in the company.

Q1. 
Sub Sort Problem Statement
You are given an integer array ARR. Determine the length of the shortest contiguous subarray which, when sorted in ascending order, results in the entire array being sorted in a...read more
Ans. 
The question asks to find the length of the shortest contiguous subarray that needs to be sorted in order to sort the whole array.
• Iterate through the array and find the first element that is out of order from the left side.

• Iterate through the array and find the first element that is out of order from the right side.

• Find the minimum and maximum element within the subarray from the above steps.

• Expand the subarray from bo...read more
Answered by AI
Add your answer