Park Plus City Head 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. Design Questions to build a scalable micro service
Add your answer
Q2. Salary Discussion
Add your answer

DSA medium leetcode questions - easy to solve

DSA medium 2 questions and core questions 1.5 hrs

Q1. Managerial round and company fit check
Add your answer
Q2. Tell about company
Add your answer
Q3. Why should we hire you?
Add your answer
Q4. Tell something not in your resume
Add your answer
Q5. How would you handle deadlines?
Ans. 
I prioritize tasks, communicate with stakeholders, and adjust resources as needed to meet deadlines.
• Prioritize tasks based on importance and urgency

• Regularly communicate with stakeholders to provide updates and address any issues that may impact deadlines

• Adjust resources or seek help from team members if necessary to meet deadlines
Answered by AI
Add your answer

Increasing triple subsequence, rest is easy hashmap

Q1. Oops Inheritance and Incapsulation
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

Q1. Education details
Add your answer

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