PowerSchool India Software Engineer Interview Questions and Answers

There were 3 coding questions, all of them were medium level difficulty. Typically people who solved 2 questions correctly were shortlisted for the interview rounds.

Q1. Rainwater trapped question and some optimisations, after that some additional changes to the question were added.
Add your answer
Q2. Print zigzag matrix
Ans. 
Prints a zigzag matrix
• Create a 2D array with the desired number of rows and columns

• Use nested loops to iterate through the array

• Alternate the direction of iteration to create the zigzag pattern

• Print the elements of the array in the desired format
Answered by AI
Add your answer

Q1. Explain about projects in deep and some questions related to that.
Add your answer
Q2. Find a subset of an array having a target sum.
Ans. 
Given an array of strings, find a subset that adds up to a target sum.
• Use a recursive approach to explore all possible subsets

• Start with an empty subset and add elements one by one

• Keep track of the current sum and check if it matches the target sum

• If the sum exceeds the target, backtrack and remove elements

• Return the subset if found, otherwise return an empty subset
Answered by AI
Add your answer

Q1. Tell me a thing in which earlier you struggled and after some rigorous practice and dedication you excelled.
Add your answer
Q2. Explain a moment in life where you showcased your leadership and collaborative skills.
Add your answer

Q1. Explain about Event loop
Ans. 
Event loop is a mechanism that allows for asynchronous programming by handling events and callbacks.
• Event loop is responsible for handling and executing events and callbacks in a non-blocking manner.

• It continuously checks the event queue and processes events one by one.

• Event loop is commonly used in JavaScript for handling asynchronous operations like setTimeout, setInterval, and AJAX requests.
Answered by AI
Add your answer

Ask to create a database design and API for a todo list app

Q1. Why do you want to join Byjus
Add your answer

There was 2 coding question
One was easy One was very Difficult
20 MCQ question from Operating system and DBMS

Q1. First question was binary search in unsorted arrays So here i have asked about sorting algorithms all sorting algorithms must be clear
Add your answer
Q2. Second question was to find longest consecutive subarray.
Ans. 
Find the longest consecutive subarray.
• Iterate through the array and keep track of the current subarray length.

• Update the maximum length as you iterate.

• Reset the current subarray length when a non-consecutive element is encountered.
Answered by AI
Add your answer

Q1. OOPS related question Heap insertion deletion question Hashing Spanning tree
Add your answer
Q2. Minimum Spanning tree Implementation of MST
Ans. 
Minimum Spanning Tree (MST) is a tree that connects all vertices in a graph with minimum total edge weight.
• MST can be found using Prim's algorithm or Kruskal's algorithm.

• Prim's algorithm starts with a single vertex and adds the closest vertex to the tree until all vertices are included.

• Kruskal's algorithm starts with the edges with the lowest weight and adds them to the tree as long as they don't create a cycle.

• MST has...read more
Answered by AI
Add your answer