Profound Edutech Software Engineer Trainee Interview Questions and Answers

Q1. DS and algorithm questions
Add your answer

Q1. IOS /Skillset questions some tricky questions
Add your answer

Q1. Personality and Compensation discussion
Add your answer

Round duration - 60 Minutes
Round difficulty - Easy

It was an coding round

Q1. 
The Skyline Problem
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette when viewed from a distance. Each building is ...read more
Ans. 
Compute the skyline of given rectangular buildings in a 2D city, eliminating hidden lines and forming the outer contour of the silhouette.
• Iterate through the buildings and create a list of critical points (x, y) where the height changes.

• Sort the critical points based on x-coordinate and process them to form the skyline.

• Merge consecutive horizontal segments of equal height into one to ensure no duplicates.

• Return the fin...read more
Answered by AI
Add your answer
Q2. 
Rat in a Maze Problem Statement
You need to determine all possible paths for a rat starting at position (0, 0) in a square maze to reach its destination at (N-1, N-1). The maze is represented as an N*N ma...read more
Ans. 
Find all possible paths for a rat in a maze from source to destination.
• Use backtracking to explore all possible paths in the maze.

• Keep track of visited cells to avoid revisiting them.

• Recursively try moving in all directions (up, down, left, right) until reaching the destination.

• Return a list of strings representing valid paths sorted in alphabetical order.
Answered by AI
Add your answer

Round duration - 30 Minutes
Round difficulty - Easy

It was an HR round with some general questions. it was just for formality.

Q1. Polyfills and Logical
Add your answer
Q2. List in react and the input box
Ans. 
Answer on how to list in react and the input box
• Use the map function to create a list in React

• Use the state to store the input value

• Use onChange event to update the state when the input value changes

• Use onSubmit event to handle the form submission
Answered by AI
Add your answer

Q1. Data structures
Add your answer

Q1. System Design fundamentals
Add your answer

Q1. System Design questions
Add your answer

Q1. What do you think about the negative news going around the company
Add your answer

Q1. Why join this company
Add your answer

Q1. What is react, diff between react and angular, deep copy shallow copy, hoisting, diff between props and state
Ans. 
React is a JavaScript library for building user interfaces. It is different from Angular in various ways.
• React is a library while Angular is a framework

• React uses virtual DOM while Angular uses real DOM

• React is more flexible and easier to learn than Angular

• Deep copy creates a new object with the same values while shallow copy creates a new reference to the same object

• Hoisting is a JavaScript mechanism where variables a...read more
Answered by AI
Add your answer
Q2. Implement custom hooks and array flat method
Ans. 
Implement custom hooks and array flat method
• Custom hooks are reusable functions that allow you to extract component logic into reusable functions

• Array flat method is used to flatten an array of nested arrays into a single array

• To implement custom hooks, create a function that uses the useState and useEffect hooks

• To implement array flat method, use the reduce method to flatten the array
Answered by AI
Add your answer

Q1. Check if string is palindrome
View 1 more answer

Two dynamic programming challenges at the hard level on LeetCode and 10 medium-level SQL challenge.

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