MagicPIN interview experience Real time questions & tips from candidates to crack your interview
SDE - 1
MagicPIN
3 rounds | 7 Coding
problems
Rejected
Interview preparation journey
Journey
My journey from the basics to cracking the interview at Magicpin has been both challenging and rewarding. I started with a lot of self-doubt, just like anyone else. Initially, I focused on mastering the fundamentals: data structures, algorithms, and core programming concepts. With each problem solved, my confidence grew, and I gradually transitioned from understanding theory to implementing real-world solutions.
Networking and mentorship also played a crucial role. I made connections on LinkedIn, participated in coding communities, and kept a pulse on industry trends. This exposure helped me align my skills with what companies like Magicpin are looking for.
When the opportunity with Magicpin came along, I was ready. It felt like everything I had worked for was coming together at the right moment. From the basics to advanced-level coding, learning never stopped—it just evolved.
Application story
I connected with HR via email after seeing their LinkedIn post and also messaged them on LinkedIn. HR reached out to me over a call, which initiated the screening and subsequent interview rounds.
Why selected/rejected for the role?
I was rejected in the final round due to a lack of knowledge in the fundamentals of Computer Networks. This experience highlighted the importance of strengthening my understanding of core concepts, and I have since focused on improving in this area to avoid similar gaps in the future.
Preparation
Duration: 6 Months
Topics: Data Structures, Pointers, OS, OOPs, System Design
Tip 1: Focus more on problem-solving.
Tip 2: CS fundamentals like Networking, OS, OOPS, and DBMS are equally important.
Tip 3: 1 Full Stack project, 1 minor (either backend or frontend).
Application process
Where: Linkedin
Eligibility: NA (Salary: 7 LPA)
Tip 1: Add links to online coding platforms.
Tip 2: If prior work experience is present, it is a plus.
Interview rounds
01
Round
Easy
Video Call
Duration60 minutes
Interview date6 Aug 2024
Coding problem2
Round 1 (Easy Round)
Timing: The interview took place in the evening from 4 to 5 p.m.
Interviewer: The interviewer was calm and personable, creating a comfortable atmosphere.
Question Type: The questions covered a mix of data structures and algorithms (DSA) as well as basic web development.
1. Reverse The Array
Easy
15m average time
85% success
0/40
Asked in companies
Given an array/list 'ARR' of integers and a position ‘M’. You have to reverse the array after that position.
Example:
We have an array ARR = {1, 2, 3, 4, 5, 6} and M = 3 , considering 0
based indexing so the subarray {5, 6} will be reversed and our
output array will be {1, 2, 3, 4, 6, 5}.
Problem approach
For DSA-> It was a standard easy question, and I shared the optimized approach. He was satisfied and asked me to code it.
2. Promise method in JavaScript
Implement polyfill for Promise.all() method in JavaScript.
02
Round
Medium
Video Call
Duration60 minutes
Interview date14 Aug 2024
Coding problem2
Round 2 (Medium Round)
Timing: The interview took place from 6 to 7 PM in the evening.
Interviewer: The interviewer was somewhat okay in nature, working as a Tech Lead for the company.
Question Type: The questions were entirely focused on data structures and algorithms (DSA).
1. Rotate DLL
Moderate
10m average time
90% success
0/80
Asked in company
You are given a doubly-linked list with 'N' nodes, rotate the linked list counter-clockwise by 'K' nodes. 'K' is a positive integer and is smaller than the number of nodes in the linked list, that is 'N'.
A doubly linked List (DLL) contains an extra pointer, called the previous pointer, together with the next pointer and data which are there in the singly linked list such that both forward and backward navigation is possible.
For example
The given linked list is -
If K = 3, then the list after rotating it by K nodes is:
Note:
1. The value of any node in the linked list will not be equal to -1.
Problem approach
I initially proposed a solution that involved creating two separate linked lists and combining them afterwards, which had a time complexity of O(n) and a space complexity of O(n). The interviewer asked me to optimize further in terms of space complexity. As a result, I was able to improve the solution to O(n) time complexity and O(1) space complexity.
2. Minimum Number Of Lamps
Easy
10m average time
80% success
0/40
Asked in companies
You are given a string 'S' containing dots (.) and asterisks (*) only, where the dot represents free spaces, and the asterisk denotes lamps. A lamp can illuminate its own cell as well as its immediate neighbouring cells. You need to determine the minimum number of extra lamps that have to be installed in some free spaces in the string so that the whole string will be illuminated, i.e., all the indices of the string can have access to the light of some lamp. Note: If a lamp is present at index 'I', then it illuminates index 'I' - 1, 'I', and 'I' + 1. If a lamp is present at index 0, then it illuminates only indices 0 and 1. Given that the length of the string is greater than or equal to 2, if a lamp is present at the last index, then it illuminates the last and the second last index, provided that the length of the string is greater than or equal to 2. The length of each string is guaranteed to be at least 1.
Problem approach
I initially started with brute counting for all possible P&C, but later decided to go with this approach.
If we don’t have an asterisk (*), then for every three dots, we need one lamp, so the answer is ceil(D/3), where D is the number of dots. The problem can be solved by creating a copy of the given string, and for each asterisk in the first string, we place an asterisk at its adjacent indices in the second string. So if the given string is “...**..,” then the second string will be “..****.”
After that, we count the number of dots in each block of consecutive dots and find the number of needed lamps for that block. For each block, the answer will be ceil(D/3), and the total sum of these lamps will be the answer for the complete string.
03
Round
Easy
Video Call
Duration60 minutes
Interview date20 Aug 2024
Coding problem3
This round is with the CTO of the company.
Time: 5-6 PM.
The person is very particular about the answers and the company.
Checking more about computer fundamentals and networking.
Also, if any past work experience is present, there will be a detailed discussion about the role and responsibilities in the past organization.
1. Computer Fundamentals
What happens when you type www.google.com?
Explain the process in detail.
Problem approach
Tip 1: Must know everything mentioned in the resume.
Tip 2: Project changes can be asked to go live.
Tip 3: Fundamentals are important.
2. Computer Fundamentals
Difference Between HTTP and HTTPS. Outline the key distinctions. (Learn)
3. HR Question
- Discussion on Past Work Experience.
- Provide insights into your previous roles and responsibilities.
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is recursion?
Choose another skill to practice
Similar interview experiences
SDE - 1
3 rounds | 6 problems
Interviewed by MagicPIN
Selected 
1789 views
0 comments
0 upvotes
Software Engineer
3 rounds | 4 problems
Interviewed by MagicPIN
Selected 1169 views
0 comments
0 upvotes
SDE - 1
3 rounds | 9 problems
Interviewed by Salesforce
Selected 3451 views
0 comments
0 upvotes
Associate Software Developer
3 rounds | 8 problems
Interviewed by MagicPIN
Selected 610 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 1
5 rounds | 12 problems
Interviewed by Amazon
Selected 114578 views
24 comments
0 upvotes
SDE - 1
4 rounds | 5 problems
Interviewed by Microsoft
Selected 57824 views
5 comments
0 upvotes
SDE - 1
3 rounds | 7 problems
Interviewed by Amazon
Selected 34960 views
7 comments
0 upvotes