i
MASAI School
Filter interviews by
I appeared for an interview before Mar 2024, where I was asked the following questions.
Basic Aptitude test
Coding Round is little tough.
I applied via Approached by Company and was interviewed before Apr 2023. There were 2 interview rounds.
They will give you problem to solve
Machine coding round
Top trending discussions
I applied via Campus Placement and was interviewed in Aug 2022. There were 4 interview rounds.
2 coding questions with aptitude question(logical aptitude and quantitative aptitude)
This was a Machine Coding. We need to design a system and then they will check our design by running test cases. It was 2.5 hrs long.
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
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...
I applied via Referral and was interviewed before Oct 2023. There were 3 interview rounds.
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.
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.
Create a student support system
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
I appeared for an interview in Nov 2020.
Round duration - 60 minutes
Round difficulty - Easy
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...
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...
Your task is to sort a sequence of numbers stored in the array ‘ARR’ in non-descending order using the Merge Sort algorithm.
Merge Sort is a divide-an...
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]
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...
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...
Tip 1 : Practice Atleast 250 Questions
Tip 2 : Do atleast 2 projects
Tip 1 : Have some projects on resume.
Tip 2 : Do not put false things on resume.
Basic coding and MySQL queries. Like Types of join, having and where difference etc.
I applied via Referral and was interviewed in Jul 2024. There were 3 interview rounds.
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
based on 3 interviews
Interview experience
based on 10 reviews
Rating in categories
Operations Manager
40
salaries
| ₹5 L/yr - ₹13 L/yr |
Full Stack Web Developer
29
salaries
| ₹1 L/yr - ₹8 L/yr |
Data Analyst
18
salaries
| ₹4.2 L/yr - ₹8.5 L/yr |
Full Stack Developer
17
salaries
| ₹1 L/yr - ₹8 L/yr |
Software Engineer
16
salaries
| ₹5 L/yr - ₹10 L/yr |
FastInfo
Testbook.com
Lido Learning
Acadecraft