i
Magic Edtech
Filter interviews by
I applied via Naukri.com and was interviewed in Jul 2024. There were 2 interview rounds.
I applied via Naukri.com
Dependency injection in Laravel is a technique to manage class dependencies and improve code flexibility.
Dependency injection allows for easier testing and maintenance of code.
It involves passing dependencies to a class through its constructor or method parameters.
Laravel's container class manages the dependencies and resolves them when needed.
Example: injecting a database connection into a repository class.
Can also us...
To find the second largest number in a column in MySQL, you can use the ORDER BY and LIMIT clauses.
Write a SELECT statement to retrieve the column values in descending order using ORDER BY.
Use the LIMIT clause to limit the result set to the second row.
The value in the second row will be the second largest number in the column.
Magic Edtech is an innovative educational technology company.
Magic Edtech develops interactive learning platforms and tools.
They use advanced technologies like AI, AR, and VR to enhance the learning experience.
Their products include virtual classrooms, adaptive learning systems, and educational games.
Magic Edtech focuses on personalized learning and data-driven insights.
They collaborate with schools, universities, and
Top trending discussions
I applied via Naukri.com and was interviewed before Jan 2021. There were 2 interview rounds.
I applied via Naukri.com and was interviewed in Apr 2021. There was 1 interview round.
I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.
I applied via Recruitment Consulltant and was interviewed before Oct 2021. There were 3 interview rounds.
They will ask you simple programs to check your logical abilities.
posted on 16 Apr 2021
I applied via Referral and was interviewed in Oct 2020. There was 1 interview round.
posted on 16 Apr 2021
Implement merge sort and find kth largest element in an array.
Merge sort is a divide and conquer algorithm that recursively divides the array into two halves, sorts them and then merges them.
Kth largest element can be found using quick select algorithm or by sorting the array and returning the kth element from the end.
Merge sort has a time complexity of O(nlogn) and space complexity of O(n).
Quick select has a time comp...
I applied via LinkedIn and was interviewed before Jun 2021. There were 5 interview rounds.
Its a simple hackathon MCQ questions based on your skills.
I appeared for an interview in Aug 2020.
Remove duplicate entries from array of strings using JavaScript
Use Set to remove duplicates
Convert Set back to array
Use spread operator to convert Set to array
Determines if words in given array are anagram or not using JS
Create a function that takes an array of strings as input
Loop through the array and sort each string alphabetically
Compare the sorted strings to check if they are equal
Return true if all strings are anagrams, else false
based on 1 interview
Interview experience
based on 16 reviews
Rating in categories
Senior Software Engineer
145
salaries
| ₹6 L/yr - ₹18 L/yr |
Consultant
143
salaries
| ₹5.9 L/yr - ₹22.8 L/yr |
Software Engineer
133
salaries
| ₹3.7 L/yr - ₹14 L/yr |
Lead Consultant
128
salaries
| ₹9 L/yr - ₹33 L/yr |
Softwaretest Engineer
118
salaries
| ₹1 L/yr - ₹7 L/yr |
Xoriant
Photon Interactive
CitiusTech
Iris Software