Park+ interview experience Real time questions & tips from candidates to crack your interview
QA Intern
Park+
3 rounds | 7 Coding
problems
Selected Interview preparation journey
Journey
I applied for Quality Assurance intern at Park+ during April 2022 and interviewed for 3 rounds. There was 1 online test, then one technical round followed by a final HR round.
Application story
I applied through my LinkedIn. The first round was an online test based on logical reasoning, DI, and a few moderate-level DSA questions. The next round was a technical round with one of the engineering managers of the company. Then there was the final HR round.
Why selected/rejected for the role?
I had interned in various fields before, and my interest matched the job requirements. Therefore, I was selected.
Preparation
Duration: 1 month
Topics: SQL, Data structures, OOPs, Python, Automation
Tip 1 : Be confident about the things you mention in your resume as the interviewer asks majorly from your resume
Tip 2 : Make sure you have basic knowledge of Python and SQL
Application process
Where: Linkedin
Eligibility: No criteria
Tip 1: Don't write fake experiences as the interviewer thoroughly reviews your resume.
Tip 2: Having previous internships can help.
Interview rounds
01
Round
Easy
Online Coding Interview
Duration90 minutes
Interview date1 Apr 2022
Coding problem4
The first round was an online test based on logical reasoning and DI, plus a few moderate-level DSA questions.
1. Find Peak Element
Easy
15m average time
85% success
0/40
Asked in companies
You are given an array 'arr' of length 'n'. Find the index(0-based) of a peak element in the array. If there are multiple peak numbers, return the index of any peak number.
Peak element is defined as that element that is greater than both of its neighbors. If 'arr[i]' is the peak element, 'arr[i - 1]' < 'arr[i]' and 'arr[i + 1]' < 'arr[i]'.
Assume 'arr[-1]' and 'arr[n]' as negative infinity.
Note:
1. There are no 2 adjacent elements having same value (as mentioned in the constraints).
2. Do not print anything, just return the index of the peak element (0 - indexed).
3. 'True'/'False' will be printed depending on whether your answer is correct or not.
Example:
Input: 'arr' = [1, 8, 1, 5, 3]
Output: 3
Explanation: There are two possible answers. Both 8 and 5 are peak elements, so the correct answers are their positions, 1 and 3.
Problem approach
// A C++ program to find a peak element
#include
using namespace std;
// Find the peak element in the array
int findPeak(int arr[], int n)
{
// first or last element is peak element
if (n == 1)
return 0;
if (arr[0] >= arr[1])
return 0;
if (arr[n - 1] >= arr[n - 2])
return n - 1;
// check for every other element
for (int i = 1; i < n - 1; i++) {
// check if the neighbors are smaller
if (arr[i] >= arr[i - 1] && arr[i] >= arr[i + 1])
return i;
}
}
// Driver Code
int main()
{
int arr[] = { 1, 3, 20, 4, 1, 0 };
int n = sizeof(arr) / sizeof(arr[0]);
cout << "Index of a peak point is " << findPeak(arr, n);
return 0;
}
// This code is contributed by Aditya Kumar (adityakumar129)
2. Reverse The Array
Easy
15m average time
85% success
0/40
Asked in companies
Given an array/list 'ARR' of integers and a position ‘M’. You have to reverse the array after that position.
Example:
We have an array ARR = {1, 2, 3, 4, 5, 6} and M = 3 , considering 0
based indexing so the subarray {5, 6} will be reversed and our
output array will be {1, 2, 3, 4, 6, 5}.
Problem approach
// Iterative C++ program to reverse an array
#include
using namespace std;
/* Function to reverse arr[] from start to end*/
void rvereseArray(int arr[], int start, int end)
{
while (start < end)
{
int temp = arr[start];
arr[start] = arr[end];
arr[end] = temp;
start++;
end--;
}
}
/* Utility function to print an array */
void printArray(int arr[], int size)
{
for (int i = 0; i < size; i++)
cout << arr[i] << " ";
cout << endl;
}
/* Driver function to test above functions */
int main()
{
int arr[] = {1, 2, 3, 4, 5, 6};
int n = sizeof(arr) / sizeof(arr[0]);
// To print original array
printArray(arr, n);
// Function calling
rvereseArray(arr, 0, n-1);
cout << "Reversed array is" << endl;
// To print the Reversed array
printArray(arr, n);
return 0;
}
3. Puzzle
If few people can complete a set of work in these hours, how much time would these many people take to complete the task at double speed
4. Puzzle
RQP, ONM, _, IHG, FED, find the missing letters.
Problem approach
Ans : LKJ
02
Round
Medium
Video Call
Duration30 minutes
Interview date4 Apr 2022
Coding problem2
1. SQL Queries
Second Highest Salary. (Practice)
2. Valid Parentheses
Easy
10m average time
80% success
0/40
Asked in companies
You're given a string 'S' consisting of "{", "}", "(", ")", "[" and "]" .
Return true if the given string 'S' is balanced, else return false.
For example:
'S' = "{}()".
There is always an opening brace before a closing brace i.e. '{' before '}', '(' before ').
So the 'S' is Balanced.
03
Round
Easy
HR Round
Duration20 minutes
Interview date15 Apr 2022
Coding problem1
It was a telephonic HR round discussing the stipend, work hours, company policies and other HR details.
1. Basic HR Questions
Introduce yourself
What do you know about the work culture here in Park+?
What are your strengths and weaknesses?
Where do you see yourself in 5 years?
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
QA Engineer
3 rounds | 6 problems
Interviewed by Park+
Selected 
1224 views
0 comments
0 upvotes
SDE - 1
4 rounds | 6 problems
Interviewed by Park+
Selected 1571 views
1 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Park+
Selected 1159 views
0 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Park+
Rejected
474 views
0 comments
0 upvotes