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 Senior Software Developer Interview Questions and Answers

Updated 29 Nov 2022

Magic Edtech Senior Software Developer Interview Experiences

1 interview found

I applied via Recruitment Consulltant and was interviewed in 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 - Case Study 

Ther try to gaze out what are the responsibilities you handled and your growth potential

Round 3 - Case Study 

They try to find out what you are will do in a given set of scenarios

Round 4 - HR 

(2 Questions)

  • Q1. They tell you about the company
  • Q2. They ask about your flexibility with working pattern

Interview Preparation Tips

Interview preparation tips for other job seekers - Try to answer as much close to reality instead of trying to impress by false impressions. They are very experienced and can easily see through your disguise

Interview questions from similar companies

Interview Questionnaire 

1 Question

  • Q1. Questions on core java, data structures, Spring

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

I applied via Approached by Company and was interviewed before Apr 2021. There were 2 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 - Technical 

(1 Question)

  • Q1. Basic front-end questions

Interview Preparation Tips

Interview preparation tips for other job seekers - Good company with work life balance

I applied via Recruitment Consultant and was interviewed in May 2019. There were 3 interview rounds.

Interview Questionnaire 

1 Question

  • Q1. Technical questions & team leading

Interview Preparation Tips

Interview preparation tips for other job seekers - Interview is not difficult..

Interview Questionnaire 

1 Question

  • Q1. Java multithreading, oops

I applied via Recruitment Consulltant and was interviewed before Oct 2021. There were 3 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 - Technical 

(1 Question)

  • Q1. Deep Copy vs Shallow Copy, Object Prototyping
  • Ans. 

    Deep Copy creates a new object with a new memory address while Shallow Copy creates a new reference to the same memory address.

    • Deep Copy duplicates the object and its properties while Shallow Copy only duplicates the object reference.

    • Object Prototyping is a way to create new objects based on existing objects.

    • Prototyping allows for inheritance and the ability to add or override properties and methods.

  • Answered by AI
Round 3 - Technical 

(1 Question)

  • Q1. Accessibility, Semantic Tags, Problem solving

Interview Preparation Tips

Topics to prepare for Globant Senior Software Engineer interview:
  • Closures
  • Es6
Interview preparation tips for other job seekers - Try to solve the question , interviewer will provide you hint to proceed as well. so don’t worry. Just give your best

I applied via Campus Placement and was interviewed in Dec 2020. There was 1 interview round.

Interview Questionnaire 

2 Questions

  • Q1. 1. If you given a no return its corresponding excel no.
  • Ans. 

    Convert given no to corresponding excel no.

    • Excel no starts from 1 and goes up to 16384

    • Excel no is calculated using column and row numbers

    • For example, 1 corresponds to A, 27 corresponds to AA, 28 corresponds to AB, and so on

  • Answered by AI
  • Q2. 2. find unique character in a window of k size in a string
  • Ans. 

    Find unique characters in a window of k size in a string.

    • Use a sliding window approach.

    • Maintain a hash table to keep track of character frequency.

    • Remove characters from hash table as the window slides.

  • Answered by AI

Interview Preparation Tips

Interview preparation tips for other job seekers - Communication is very important. Give your solution from brute force to optimal. Interviewer has tell me to write code of both questions in any programming language.

Skills evaluated in this interview

I applied via Approached by Company and was interviewed before Apr 2021. There were 3 interview rounds.

Round 1 - Technical 

(1 Question)

  • Q1. Technical interview with my primary skill set Where all details asked about technology And given one program to do using primary skill
Round 2 - HR 

(1 Question)

  • Q1. Salary Discussion Questions about why to change org And More specific to HR questions About yourself
Round 3 - Managiral 

(1 Question)

  • Q1. Question about last project work About Yourself

Interview Preparation Tips

Interview preparation tips for other job seekers - Company is growing with different skillset and domain

I appeared for an interview in Aug 2020.

Interview Questionnaire 

8 Questions

  • Q1. Position was for UI - Fundamentals of JavaScript (Closure, Promises, Event Loop, filter vs map, Event delegation)
  • Q2. Lifecycle of React Component, State vs Props, Optimization techniques, Redux vs Context
  • Q3. Coding challenge (JS) - remove duplicate entries from array
  • Ans. 

    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

  • Answered by AI
  • Q4. Coding Challenge (JS) - determine if words in given array are anagram or not
  • Ans. 

    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

  • Answered by AI
  • Q5. Client Round (1) - Questions on design system, coding challenge - Let's try to create a modal component in React JS from scratch
  • Q6. Client Round (2) - Questions based on scenarios to test your thinking ability and problem solving approach
  • Q7. Client Round (3) - Questions on all the technologies that you have mentioned in your CV. Additional questions on Agile, DevOps and your understanding of CI-CD.
  • Q8. Client Round (4) - Coding challenge - implement/rewrite any inbuilt method provided by JS (e.g. Array.map, Array.filter, function.bind)

Interview Preparation Tips

Interview preparation tips for other job seekers - Prepare for fundamentals of JS.
Answering questions of React would be easy if you already work on it.
Try to solve at least 5 problems on Hacker Rank or Hacker Earth, before appearing for interview.
That would help you prepare mentally and logically to bare with the process and develop an attitude of keep trying.

Good luck!

Skills evaluated in this interview

Magic Edtech Interview FAQs

How many rounds are there in Magic Edtech Senior Software Developer interview?
Magic Edtech interview process usually has 4 rounds. The most common rounds in the Magic Edtech interview process are Case Study, Resume Shortlist and HR.

Tell us how to improve this page.

Magic Edtech Senior Software Developer Salary
based on 19 salaries
₹11.1 L/yr - ₹20 L/yr
6% less than the average Senior Software Developer Salary in India
View more details

Magic Edtech Senior Software Developer Reviews and Ratings

based on 1 review

4.0/5

Rating in categories

5.0

Skill development

4.0

Work-life balance

4.0

Salary

5.0

Job security

3.0

Company culture

3.0

Promotions

3.0

Work satisfaction

Explore 1 Review and Rating
Senior Software Engineer
145 salaries
unlock blur

₹6 L/yr - ₹18 L/yr

Consultant
143 salaries
unlock blur

₹5.9 L/yr - ₹22.8 L/yr

Software Engineer
133 salaries
unlock blur

₹3.7 L/yr - ₹14 L/yr

Lead Consultant
128 salaries
unlock blur

₹9 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.1
Compare

CitiusTech

3.3
Compare

Iris Software

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