Park Plus Assistant Manager Interview Questions and Answers

Q1. Introduction and Work Experience
Add your answer

A Presentation on certain concepts.

Q1. Role related technical questions
Add your answer

Q1. Cultural Fitment related questions.
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.

• Handle self-cycles and cells with no exit by checking arr[i] = i and arr[i] = -1 respectively.

• Output the length of the largest cycle found or -1 if no cycles exist.
Answered by AI
Add your answer
Q2. 
Ninja and the Maze Problem Statement
Ninja is stuck in a maze represented as a 2D grid. He can move in four directions (Up, Down, Left, Right) until he hits a wall ('1'). Once stopped, he can choose a new...read more
Ans. 
Determine if Ninja can reach the destination in a maze by moving in four directions until hitting a wall.
• Create a function to traverse the maze using depth-first search or breadth-first search.

• Keep track of visited cells to avoid infinite loops.

• Return 'True' if destination is reachable, 'False' otherwise.
Answered by AI
Add your answer

Easy to medium, can solve with leetcode medium

Q1. Number of islands count
Ans. 
Count the number of islands in a grid of '1's and '0's
• Iterate through the grid and for each '1' encountered, perform a depth-first search to mark all connected '1's as visited

• Increment the island count for each new island found

• Ensure to handle boundary cases and check for visited nodes
Answered by AI
Add your answer
Q2. First and last index of a particular element in an array
Ans. 
Find the first and last index of a specific element in an array of strings.
• Iterate through the array and keep track of the index of the first and last occurrence of the element.

• Return the first and last index once the iteration is complete.

• Example: Array ['apple', 'banana', 'apple', 'orange'], element 'apple' - First index: 0, Last index: 2.
Answered by AI
Add your answer

Leecode medium level question

Leetcode Hard level Question

Q1. This is cto round asked some interview questions
Add your answer

Computer Fundamentals

Q1. Flatten a binary tree
Ans. 
Flatten a binary tree by converting it into a linked list in-place.
• Use a recursive approach to flatten the binary tree.

• Traverse the tree in a pre-order manner and keep track of the previous node.

• Set the left child of each node to null and the right child to the next node in the linked list.

• Example: Input: 1 -> 2 -> 5 -> 3 -> 4 -> null, Output: 1 -> null -> 2 -> null -> 3 -> null -> 4 -> null -> 5 -> null
Answered by AI
Add your answer

Q1. Questions about python, Sql, Basic coding questions
Add your answer

Q1. How will you handle exceptions in django framework. it was basic discussion round with the cto
Add your answer