Magnitude Software Interview Experience (On Campus)
Question Details
For Associate Software Developer role.ONLINE ROUND (2 Sections)Section 1a) Given a number N, find the count of numbers from 1 to N whose binary representation is a palindr...
Full Details
For Associate Software Developer role.
ONLINE ROUND (2 Sections) Section 1 a) Given a number N, find the count of numbers from 1 to N whose binary representation is a palindrome. b) There are two stacks(S1 and S2) of books. Each book in stack has a weight. You are given the maximum weight(W) of books that can be picked. You have to maximize the number of books that can be picked.
Note that each time you can either pick from S1 or S2 only. S1: 3 6 3 2 5 S2: 15 1 1 1 1 1 1 9 W: 15 Answer: 7 c) I don't remember the question exactly but it was based on topological sorting of graph. This was hard. Section 2 a) A website can have many key words. Also there can be many links that a website is linked. Write the design of the tables to store these. b) SQL query which was based on nesting. TECH ROUND 1 a) String comparison ignoring case. Use concept of bits. b) Given only a pointer to a node to be deleted in a singly linked list, delete it c) Delete a tree d) How exactly does compilation happens for a .cpp or .java file to produce executable file? I had to write code on paper for the 3 coding questions. Then he asked me to tell about any two of my projects. No questions here. TECH ROUND 2 Discussion on book stack problem of coding round as I could pass only 2 out of 5 test cases there. He wanted me to solve it completely. I told an approach where in all possibilities are checked using concept of tress. I had to first tell the logic and then write code for it. TECH ROUND 3 a) Structure of N-ary tree. I was told to use linked list to store child nodes instead of vector. b) Traverse N-ary tree and find sum of all nodes. c) If SQL query is stored as a class, what are the member fields of this class?
HR ROUND Nothing much here. Interviewers were very knowledgeable and helpful. They kept giving me hints when I could not proceed and I kept building on those to arrive at the solutions. They focused mostly on logic of my solutions and not whether my code was right.
About This Question
This is a reported interview question from a magnitude software interview for a swe role during the recruiter round reported in 2017.
It covers the following topics: Linked List, Strings, Trees, Sql, Graph, Stack Queue, Sorting, Graphs, Stack .
Difficulty rating: Hard
Topics
About Magnitude Software Interview Reports
This question was reported by a candidate who interviewed at Magnitude Software. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Magnitude Software are the higher-signal extractions to take from this report.
For broader preparation context, the Magnitude Software interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Magnitude Software reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Magnitude Software Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Magnitude Software reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.