Park Plus Assistant Manager Interview Questions and Answers

Coding questions around android

Q1. Data structures questions
Add your answer
Q2. Binary sort in array
Ans. 
Binary sort is a search algorithm that finds the position of a target value within a sorted array.
• Binary sort works by repeatedly dividing the array in half and narrowing down the search range.

• It is more efficient than linear search for large arrays.

• Example: Sorting an array of strings alphabetically using binary sort.
Answered by AI
Add your answer
Q3. Android intent and broadcasts
Add your answer

Q1. Tell me about yourself
Add your answer

Q1. What are the important things in production
Ans. 
Key aspects in production include efficiency, quality control, cost management, and continuous improvement.
• Efficiency: Streamlining processes to maximize output with minimal resources

• Quality control: Ensuring products meet standards and specifications

• Cost management: Monitoring expenses and optimizing resources to reduce production costs

• Continuous improvement: Implementing strategies to enhance productivity and quality
Answered by AI
Add your answer

Q1. Sql join questions
Add your answer
Q2. Python decorartors
Add your answer

Round duration - 90 minutes
Round difficulty - Hard

Timing was late evening . Platform was good.

Q1. 
Largest Cycle in Maze Problem Statement
Given a maze represented by 'N' cells numbered from 0 to N-1, and an array arr of 'N' integers where arr[i] denotes the cell number that can be reached from the 'i'...read more
Ans. 
Identify the length of the largest cycle in a maze represented by cells and an array of integers.
• Iterate through each cell and find the cycle length using DFS or Floyd's Tortoise and Hare algorithm.

• Keep track of visited cells to avoid infinite loops.

• Return the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer

Round duration - 90 minutes
Round difficulty - Medium

The coding round was 90 minutes with 2 question and the difficulty was mid-range and both were graph question

Q1. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from start to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Explore all possible directions (up, down, left, right) from each cell.

• Add the current direction to the path and recursively explore further.

• When reaching the destination, add the path to the list of valid paths.
Answered by AI
Add your answer

3 Graph Questions Were asked of difficulty medium to hard.

Hackathon round which revolved around multithreading

Hard questions of graph and dp.

It was good and tough

They have their own coding platform. The questions are basically from tree.

Tree of space question

Q1. Previous round question solution
Add your answer
Q2. System design was asked.
Add your answer