Park Plus Software Developer Interview Questions, Process, and Tips

Q1. Explain hoisting in js
Ans. 
Hoisting in JavaScript is the behavior where variable and function declarations are moved to the top of their containing scope during the compilation phase.
• Variable declarations are hoisted to the top of their scope, but not their assignments.

• Function declarations are fully hoisted, meaning they can be called before they are declared.

• Hoisting can lead to unexpected behavior if not understood properly.
Answered by AI
Add your answer
Q2. Explain closures in js
Ans. 
Closures in JavaScript allow functions to access variables from their outer scope even after the outer function has finished executing.
• Closures are created when a function is defined within another function and the inner function has access to the outer function's variables.

• Closures can be used to create private variables and functions in JavaScript.

• Closures can also be used to maintain state in asynchronous operations
Answered by AI
Add your answer

Q1. Javascript polyfills
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

Formal Introduction.
Asked About Projects.
Difference between SQL and NoSQL. Pros and Cons. Where should we use SQL and NoSQL.
Given a problem, I have to make a SQL Database structure and then interviewer told me to convert it into NoSQL.
asked coding questions

Q1. Search In Rotated Sorted Array
Aahad and Harshit always have fun by solving problems. Harshit took a sorted array consisting of distinct integers and rotated it clockwise by an unknown amount. For example,...read more
Ans. Brute Force Approach
The idea here is to do a linear approach which apparently is a brute force way to do this.
• Visit every element one by one.
• Check if the current element that you are looking at is the key value that needs to be searched. If the element is found, return the index at which you find it.
• Once all the elements are visited and you don't find the key-value, return -1.
Space Complexity: O(1)Explanation:
O(1)
&nbs...read more
Answered by CodingNinjas
View 1 more answer
Q2. Zigzag Binary Tree Traversal
Given a binary tree, return the zigzag level order traversal of the nodes' values of the given tree. Zigzag traversal means starting from left to right, then right to left ...read more
Ans. Iterative Approach
Our very basic intuition is that we are going to traverse the given binary tree using level order traversal where we just need to modify one thing that for every alternate level we need to reverse the order that level. 
 
Steps are as follows:
 
1. Create an empty queue.
2. For each node, first, the node is visited and then it’s child nodes are added in the queue if they exist(First in first out).
3. ...read more
Answered by CodingNinjas
Add your answer