PowerSchool India Software Engineer II Interview Questions and Answers

Q1. Basic Questions based on pervious project
Add your answer

Q1. Lifecycle methods
Add your answer

Q1. Project details and how to tackle challenges and bugs efficiently
Add your answer

DS algo questions with about 3 questions in topic like graph, strings ,arrays

Q1. DS algo question on LinkedIn list
Add your answer
Q2. DS algo question on graph
Add your answer

1 hours aptitude test

Questions on arrays and string

Q1. Questions on DSA
Add your answer

Q1. Behavioral questions
Add your answer

Q1. Java, java script,html,css
Add your answer

Q1. JbeiuJNEKA DIOAJSD
Add your answer

There was 4 question based on string and array

Q1. Mostly questions was asked based on javascript, HTML, css and Linux
Add your answer

Q1. This was also technical round
Add your answer

Q1. Basics of js and react
Add your answer
Q2. What are closures and give an example
Ans. 
Closures are functions that have access to 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 has access to the outer function's variables.

• They can access variables from the outer function even after the outer function has returned.

• Closures are commonly used in event handlers and callbacks in JavaScript.
Answered by AI
Add your answer
Q3. What is event loop and features of es5
Ans. 
Event loop is a mechanism that allows JavaScript to perform non-blocking operations by handling asynchronous events.
• Event loop is responsible for executing code, collecting and processing events, and executing queued sub-tasks.

• ES5 features include strict mode, JSON object, Array methods like forEach, map, filter, and reduce, and Object.create method.

• ES5 also introduced new methods for manipulating strings, such as trim
Answered by AI
Add your answer

Q1. General management round and past experience
Add your answer

2.5 Hours 2 Coding que and sql query and topin tech platform

Q1. Based on boolean matrix
Add your answer
Q2. Find k closest node of given given node in a BST.
Ans. 
Find k closest nodes to a given node in a BST.
• Perform an inorder traversal of the BST to get a sorted list of nodes.

• Use a priority queue to keep track of the k closest nodes based on their absolute difference with the target node.

• Populate the priority queue with the first k nodes from the inorder traversal.

• For each subsequent node, calculate its absolute difference with the target node and compare it with the top eleme...read more
Answered by AI
Add your answer