MASAI School Software Developer Interview Questions and Answers

Q1. What is OOPS concepts.
Ans. 
OOPS concepts refer to Object-Oriented Programming principles like inheritance, encapsulation, polymorphism, and abstraction.
• Inheritance: Allows a class to inherit properties and behavior from another class.

• Encapsulation: Bundling data and methods that operate on the data into a single unit.

• Polymorphism: Ability to present the same interface for different data types.

• Abstraction: Hiding the complex implementation detail
Answered by AI
Add your answer
Q2. What is PDO and uses in PHP.
Ans. 
PDO stands for PHP Data Objects, a database access layer providing a uniform method of access to multiple databases.
• PDO is a PHP extension that provides a data-access abstraction layer.

• It supports multiple database systems like MySQL, PostgreSQL, SQLite, etc.

• PDO helps prevent SQL injection attacks by using prepared statements.

• It allows for error handling and supports transactions.

• Example: $pdo = new PDO('mysql:host=loc...read more
Answered by AI
Add your answer

Q1. Find duplicates in an array
Ans. 
Use a hash set to find duplicates in an array of strings.
• Create a hash set to store unique elements.

• Iterate through the array and check if the element is already in the hash set.

• If it is, then it is a duplicate. If not, add it to the hash set.
Answered by AI
Add your answer
Q2. Find single duplicate element in an array where contents of the array are length of array - 1
Ans. 
Find the single duplicate element in an array of strings with length n-1.
• Iterate through the array and use a HashSet to keep track of elements seen so far.

• If an element is already in the HashSet, that is the duplicate element.

• Return the duplicate element once found.
Answered by AI
Add your answer

Create a student support system

Q1. Design an order and payments system for an EdTech company
Ans. 
Design an order and payments system for an EdTech company
• Allow users to browse and select courses

• Implement a shopping cart for users to add courses

• Integrate payment gateways for secure transactions

• Provide order confirmation and receipt to users

• Allow users to track their order status
Answered by AI
Add your answer

Round duration - 60 minutes
Round difficulty - Easy

Q1. 
Path Queries Problem Statement
Consider a weighted, undirected graph with 'V' vertices numbered from 1 to 'V' and 'E' bidirectional edges. You are tasked with handling 'Q' queries. For each query, you are...read more
Ans. 
Implement a function to find the shortest distance between two vertices in a weighted, undirected graph.
• Use Dijkstra's algorithm to find the shortest path between the given vertices.

• Create a graph data structure to represent the weighted, undirected graph.

• Handle cases where no path exists between the given vertices by returning -1.

• Optimize the algorithm to handle multiple queries efficiently.

• Consider edge cases such as...read more
Answered by AI
Add your answer
Q2. 
Merge Sort Algorithm Problem Statement
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Explanation:
Merge Sort is a divide-an...read more
Ans. 
Implement Merge Sort algorithm to sort a sequence of numbers in non-descending order.
• Divide the input array into two halves recursively

• Sort the two halves separately

• Merge the sorted halves to produce a fully sorted array

• Time complexity of Merge Sort is O(n log n)

• Example: Input - [5, 2, 9, 1, 5], Output - [1, 2, 5, 5, 9]
Answered by AI
Add your answer
Q3. 
Rat in a Maze: All Paths Problem
You are provided with an N * N maze where a rat is positioned at starting cell MAZE[0][0]. The goal is to determine and print all possible paths that the rat can take to r...read more
Ans. 
Given an N * N maze with binary values, find and print all possible paths for a rat to reach the destination cell.
• Use backtracking to explore all possible paths from the starting cell to the destination cell.

• At each cell, check if it is a valid move (within bounds and not blocked), then recursively explore all four directions.

• Keep track of the path taken so far and mark the cells accordingly.

• Once the destination cell i...read more
Answered by AI
Add your answer

Basic coding and MySQL queries. Like Types of join, having and where difference etc.

Q1. Salary Discussion.
Add your answer

Q1. About Myself in details
Add your answer
Q2. Past internships and work experiences
Add your answer

Q1. Primary keys, Unique key
Add your answer
Q2. Usage advantages and disadvantages of Indexing
Add your answer

SQL- 1 departments with no users
2 dept_id and their respective no. of users

DSA1: Most frequent no. in an array
DSA2: Zero Sum subarray exists

Hard test dsa question practice more leetcode

Q1. Dsa question Array Powershell scripting Cpp Python
Add your answer