Upload Button Icon Add office photos
Premium Employer

i

This company page is being actively managed by Magic Edtech Team. If you also belong to the team, you can get access from here

Magic Edtech Verified Tick

Compare button icon Compare button icon Compare

Filter interviews by

Magic Edtech Software Developer Interview Questions and Answers

Updated 2 Dec 2024

Magic Edtech Software Developer Interview Experiences

5 interviews found

Interview experience
5
Excellent
Difficulty level
-
Process Duration
-
Result
-
Round 1 - HR 

(5 Questions)

  • Q1. Tell me about
  • Q2. Your self they are asking
  • Q3. What is your weakness
  • Q4. Any questions ask for me
  • Q5. All the best future
Round 2 - Coding Test 

Coding for international

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Aptitude Test 

1hr duration was given for test purpose.

Software Developer Interview Questions Asked at Other Companies

asked in Amazon
Q1. Maximum Subarray Sum Problem Statement Given an array of integers ... read more
asked in Amazon
Q2. Minimum Number of Platforms Needed Problem Statement You are give ... read more
asked in Rakuten
Q3. Merge Two Sorted Arrays Problem Statement Given two sorted intege ... read more
asked in Cognizant
Q4. Nth Fibonacci Number Problem Statement Calculate the Nth term in ... read more
Q5. Find Duplicate in Array Problem Statement You are provided with a ... read more
Interview experience
4
Good
Difficulty level
-
Process Duration
Less than 2 weeks
Result
-

I applied via Naukri.com and was interviewed in Nov 2023. There were 2 interview rounds.

Round 1 - Coding Test 

Coding test consists of easy to medium difficulty problems.

Round 2 - Technical 

(1 Question)

  • Q1. HashMap in java
  • Ans. 

    HashMap in Java is a data structure that stores key-value pairs and allows for fast retrieval of values based on keys.

    • HashMap is part of the Java Collections framework.

    • It uses hashing to store key-value pairs, allowing for O(1) retrieval time on average.

    • Keys in a HashMap must be unique, but values can be duplicated.

    • Example: HashMap map = new HashMap<>(); map.put("key1", 1); int value = map.get("key1");

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Best place to work

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Selected Selected

I applied via Recruitment Consulltant and was interviewed before Sep 2023. There were 3 interview rounds.

Round 1 - Coding Test 

Basic coding questions

Round 2 - Technical 

(2 Questions)

  • Q1. Question about current project.
  • Q2. Basic Java, spring questions
Round 3 - HR 

(1 Question)

  • Q1. Basic HR questions

Magic Edtech interview questions for designations

 Senior Software Developer

 (1)

 Software Tester

 (1)

 Software Engineer

 (1)

 Java Developer

 (1)

 Associate Software Engineer

 (3)

 Senior Software Engineer

 (2)

 Application Software Engineer

 (1)

 Software Testing Engineer

 (1)

Interview experience
2
Poor
Difficulty level
Easy
Process Duration
Less than 2 weeks
Result
No response

I applied via Campus Placement and was interviewed before Oct 2022. There were 4 interview rounds.

Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Aptitude Test 

Basic Aptitude questions were there which I think anyone can clear.

Round 3 - Coding Test 

2 easy level programming questions were asked.

Round 4 - HR 

(1 Question)

  • Q1. Introduction, background, interest, vision.

Interview questions from similar companies

I appeared for an interview before Mar 2021.

Round 1 - Coding Test 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

21 students were shortlisted from the 1st MCQ round and in this round we were asked to write the codes (function only) of 3 questions in 1 hour time.

  • Q1. 

    Rotting Oranges Problem Statement

    You are given a grid containing oranges where each cell of the grid can contain one of the three integer values:

    • 0 - representing an empty cell
    • 1 - representing a fre...
  • Ans. 

    Find the minimum time required to rot all fresh oranges in a grid.

    • Use Breadth First Search (BFS) to simulate the rotting process

    • Track the time taken to rot all oranges and return -1 if any fresh oranges remain

    • Handle edge cases like no fresh oranges or all oranges already rotten

    • Consider using a queue to efficiently process adjacent oranges

  • Answered by AI
  • Q2. 

    Majority Element Problem Statement

    Given an array/list 'ARR' consisting of 'N' integers, your task is to find the majority element in the array. If there is no majority element present, return -1.

    Exampl...

  • Ans. 

    Find the majority element in an array, return -1 if no majority element exists.

    • Iterate through the array and keep track of the count of each element using a hashmap.

    • Check if any element's count is greater than floor(N/2) to determine the majority element.

    • Return the majority element or -1 if no majority element exists.

  • Answered by AI
  • Q3. 

    Maximum Path Sum Between Two Leaves Problem Description

    You are provided with a non-empty binary tree in which each node contains a non-negative integer value. Your task is to find and return the maximum ...

  • Ans. 

    Find the maximum path sum between two leaf nodes in a binary tree.

    • Traverse the tree to find the maximum path sum between two leaf nodes.

    • Keep track of the maximum sum found so far.

    • Consider all possible paths between leaf nodes.

    • Handle cases where the tree has only a single leaf node.

    • Implement a recursive function to calculate the maximum path sum.

  • Answered by AI
Round 2 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Medium

This was a technical round with DSA based questions.

  • Q1. 

    N-th Node From The End Problem Statement

    You are given a Singly Linked List of integers. The task is to find the N-th node from the end of the list.

    Example:

    Input:
    If the given list is (1 -> -2 -&g...
  • Ans. 

    Find the N-th node from the end of a Singly Linked List of integers.

    • Traverse the list to find the length L of the list.

    • Calculate the position of the N-th node from the beginning as L - N + 1.

    • Traverse the list again to reach the calculated position and return the node's value.

  • Answered by AI
  • Q2. 

    LCA of Binary Tree Problem Statement

    You are given a binary tree consisting of distinct integers and two nodes, X and Y. Your task is to find and return the Lowest Common Ancestor (LCA) of these two nodes...

  • Ans. 

    Find the Lowest Common Ancestor (LCA) of two nodes in a binary tree.

    • Traverse the binary tree to find the paths from the root to nodes X and Y.

    • Compare the paths to find the last common node, which is the LCA.

    • Handle cases where one node is an ancestor of the other or when one node is the LCA itself.

  • Answered by AI
  • Q3. 

    Reverse Words in a String: Problem Statement

    You are given a string of length N. Your task is to reverse the string word by word. The input may contain multiple spaces between words and may have leading o...

  • Ans. 

    Reverse words in a string while handling leading/trailing spaces and multiple spaces between words.

    • Split the input string by spaces to get individual words

    • Reverse the list of words

    • Join the reversed words with a single space in between

    • Handle leading/trailing spaces by stripping them before and after reversing

  • Answered by AI
Round 3 - Face to Face 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical Interview round with questions based on DSA

  • Q1. 

    Minimum Time To Solve The Problems

    Given 'N' subjects, each containing a certain number of problems, and 'K' friends, assign subjects to friends such that each subject goes to exactly one friend, maintain...

  • Ans. 

    Assign subjects to friends to minimize maximum workload, find minimum time for most loaded friend.

    • Sort subjects in descending order

    • Assign subjects to friends one by one until all subjects are assigned

    • The maximum workload will be the sum of problems assigned to the friend with the most problems

    • Return the maximum workload as the minimum time required

  • Answered by AI
  • Q2. What is grammar in the context of compiler design?
  • Ans. 

    Grammar in compiler design defines the syntax and structure of a programming language.

    • Grammar specifies the rules for forming valid statements in a programming language.

    • It consists of a set of production rules that define how valid programs can be constructed.

    • There are different types of grammars such as context-free grammar, regular grammar, etc.

    • Example: In C programming language, the grammar specifies that a for loop...

  • Answered by AI
  • Q3. What is a token in compiler design?
  • Ans. 

    A token in compiler design is a basic unit of syntax that the compiler can understand and process.

    • Tokens are the smallest units of a program that are meaningful to the compiler.

    • Examples of tokens include keywords, identifiers, operators, and punctuation symbols.

    • Tokens are generated by the lexical analysis phase of the compiler.

    • Tokens are used by the parser to build the abstract syntax tree of the program.

  • Answered by AI
Round 4 - Video Call 

(3 Questions)

Round duration - 60 minutes
Round difficulty - Easy

Technical round with questions on DSA and Compiler Design mainly. He told me that you’ll be having your final HR round in some time. I knew that I was going well because he seemed to be quite satisfied with my answers.

  • Q1. 

    Sum Root to Leaf Numbers

    You are given an arbitrary binary tree consisting of N nodes, each associated with an integer value from 1 to 9. Each root-to-leaf path can be considered a number formed by concat...

  • Ans. 

    Find the total sum of all root to leaf paths in a binary tree formed by concatenating node values.

    • Traverse the binary tree from root to leaf nodes, keeping track of the current path sum

    • Add the current path sum to the total sum when reaching a leaf node

    • Use modulo (10^9 + 7) to handle large outputs

  • Answered by AI
  • Q2. What is a regular language?
  • Ans. 

    A regular language is a language that can be recognized by a finite automaton.

    • Regular languages can be described by regular expressions.

    • Regular languages are closed under union, concatenation, and Kleene star operations.

    • Examples of regular languages include the set of all strings over an alphabet that contain an even number of 'a's.

  • Answered by AI
  • Q3. What are NP and NP-Hard problems?
  • Ans. 

    NP problems are decision problems that can be verified in polynomial time, while NP-Hard problems are at least as hard as the hardest problems in NP.

    • NP problems can be verified in polynomial time but not necessarily solved in polynomial time.

    • NP-Hard problems are at least as hard as the hardest problems in NP, but may not be in NP themselves.

    • Examples of NP problems include the subset sum problem and the traveling salesm...

  • Answered by AI
Round 5 - HR 

Round duration - 30 minutes
Round difficulty - Easy

That was the round for which I’ve been waiting for hours 
She was very friendly and nice to talk to. It didn’t seem that I was talking to the HR. It was more like talking to a friend. Finally we discussed about the pay-scale and work culture in Accolite.

Interview Preparation Tips

Eligibility criteriaAbove 7 CGPAAccolite Digital Pvt Ltd interview preparation:Topics to prepare for the interview - Data Structures, Algorithms, System Design, Aptitude, OOPSTime required to prepare for the interview - 6 monthsInterview preparation tips for other job seekers

Tip 1 : Must do Previously asked Interview as well as Online Test Questions.
Tip 2 : Go through all the previous interview experiences from Codestudio and Leetcode.
Tip 3 : Do at-least 2 good projects and you must know every bit of them.

Application resume tips for other job seekers

Tip 1 : Have at-least 2 good projects explained in short with all important points covered.
Tip 2 : Every skill must be mentioned.
Tip 3 : Focus on skills, projects and experiences more.

Final outcome of the interviewSelected

Skills evaluated in this interview

Interview experience
3
Average
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(1 Question)

  • Q1. Explain dependency injection, indexes in sql, SOLID principles.
  • Ans. 

    Dependency injection is a design pattern where dependencies are injected into a class rather than created within the class itself.

    • Dependency injection helps in achieving loose coupling between classes.

    • It allows for easier testing and maintenance of code.

    • Example: Constructor injection, setter injection, and interface injection are common types of dependency injection.

    • Indexes in SQL are used to improve the performance of...

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
Moderate
Process Duration
Less than 2 weeks
Result
Not Selected

I applied via Job Portal and was interviewed in Jul 2024. There was 1 interview round.

Round 1 - Technical 

(2 Questions)

  • Q1. SOLID principles
  • Q2. Microservice Architecture and Kafka

Interview Preparation Tips

Interview preparation tips for other job seekers - Be prepared with core concepts.
Interview experience
1
Bad
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Technical 

(2 Questions)

  • Q1. What is java and its features ?
  • Ans. 

    Java is a high-level programming language known for its platform independence and object-oriented features.

    • Java is platform-independent, meaning it can run on any device with a Java Virtual Machine (JVM)

    • It is object-oriented, allowing for the creation of reusable code and modular programs

    • Java is known for its robust standard library, providing a wide range of pre-built functionality

    • It supports multithreading, allowing ...

  • Answered by AI
  • Q2. What is java 8 and features
  • Ans. 

    Java 8 is a major release of the Java programming language with new features like lambda expressions, streams, and default methods.

    • Lambda expressions allow you to treat functionality as a method argument.

    • Streams provide a new abstraction to work with sequences of elements.

    • Default methods allow interfaces to have method implementations.

    • Date and Time API provides a new way to work with dates and times.

    • Optional class help

  • Answered by AI

Skills evaluated in this interview

Interview experience
4
Good
Difficulty level
-
Process Duration
-
Result
-
Round 1 - Resume Shortlist 
Pro Tip by AmbitionBox:
Keep your resume crisp and to the point. A recruiter looks at your resume for an average of 6 seconds, make sure to leave the best impression.
View all tips
Round 2 - Technical 

(3 Questions)

  • Q1. Difference between Procedure, Packages and functions.
  • Ans. 

    Procedures, Packages and Functions are all subprograms in PL/SQL with different characteristics.

    • Procedures are subprograms that perform a specific task and may or may not return a value.

    • Functions are subprograms that always return a value and can be used in SQL statements.

    • Packages are a collection of related procedures, functions, variables, and other program constructs that can be used as a single unit.

    • Packages provid...

  • Answered by AI
  • Q2. If table or view does not exist what does it mean
  • Ans. 

    It means that the table or view does not exist in the database.

    • The query will fail and return an error message.

    • The application may crash or behave unexpectedly.

    • The table or view may have been deleted or renamed.

    • Check the spelling and syntax of the query.

    • Make sure the database connection is established and valid.

  • Answered by AI
  • Q3. Difference Between Views and Materialized Views
  • Ans. 

    Views are virtual tables while Materialized Views are physical tables.

    • Views are created using SELECT statement while Materialized Views are created using CREATE MATERIALIZED VIEW statement.

    • Views do not store data while Materialized Views store data.

    • Views are updated dynamically while Materialized Views are updated manually or automatically based on refresh settings.

    • Materialized Views are faster for read-heavy workloads...

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Details explanation about the projects and the concepts what we used.

Interview Preparation Tips

Interview preparation tips for other job seekers - Always answer bold whatever maybe the questions explain in brief whatever you know and your answers should be to the point.

Skills evaluated in this interview

Magic Edtech Interview FAQs

How many rounds are there in Magic Edtech Software Developer interview?
Magic Edtech interview process usually has 2-3 rounds. The most common rounds in the Magic Edtech interview process are Coding Test, HR and Aptitude Test.
What are the top questions asked in Magic Edtech Software Developer interview?

Some of the top questions asked at the Magic Edtech Software Developer interview -

  1. HashMap in j...read more
  2. Basic Java, spring questi...read more

Tell us how to improve this page.

Magic Edtech Software Developer Interview Process

based on 6 interviews

Interview experience

4
  
Good
View more
Magic Edtech Software Developer Salary
based on 59 salaries
₹7.4 L/yr - ₹13.5 L/yr
19% more than the average Software Developer Salary in India
View more details

Magic Edtech Software Developer Reviews and Ratings

based on 14 reviews

3.4/5

Rating in categories

3.5

Skill development

3.7

Work-life balance

3.2

Salary

3.0

Job security

3.5

Company culture

2.9

Promotions

3.6

Work satisfaction

Explore 14 Reviews and Ratings
Consultant
143 salaries
unlock blur

₹5.9 L/yr - ₹22.8 L/yr

Senior Software Engineer
143 salaries
unlock blur

₹6 L/yr - ₹18 L/yr

Software Engineer
135 salaries
unlock blur

₹4 L/yr - ₹14 L/yr

Lead Consultant
127 salaries
unlock blur

₹8 L/yr - ₹33 L/yr

Softwaretest Engineer
118 salaries
unlock blur

₹1 L/yr - ₹7 L/yr

Explore more salaries
Compare Magic Edtech with

Xoriant

4.1
Compare

Photon Interactive

4.0
Compare

CitiusTech

3.4
Compare

Iris Software

4.0
Compare
Did you find this page helpful?
Yes No
write
Share an Interview