Auxia

Role: SWE-Intern

College: MNNIT

Interview Date: October 2025

Interview Type: On-Campus/Internship

Result: Selected

Difficulty: Medium

Rounds: 4 rounds

Topics Asked: Data Structures, Algorithms (Mathematics-based, Knapsack, Digit DP, Min-heap, Graph BFS, N-ary tree problems), Operating Systems, OOPs, Projects, Debugging, HR questions.

Experience:

The interview process for the SWE-Intern role at Auxia Software on-campus at MNNIT consisted of an Online Assessment followed by two Technical Rounds and one HR Round.

Online Assessment (OA) Round:

This round comprised 4 DSA-based questions.

• Question 1: A mathematics-based problem.
• Question 2: Not explicitly remembered by the candidate.
• Question 3: A Knapsack problem, solvable with or without Dynamic Programming.
• Question 4: A straightforward Digit DP question: "Count numbers divisible by 3 from 1 to n" where n ≤ 1e9.

Round 1 (Technical):

The interviewer did not ask for the resume and directly shared a Google Docs link for coding.

• Question 1: Given N enemies, each with a name and energy, arranged in timestamp order. A soldier fires a gun from the left side; the bullet hits every enemy (no misses), and its energy decreases by 1 after hitting each enemy. Return the names of the enemies in the order they die. If two enemies die at the same time, order them by timestamp. Example: Input: (a, 2), (c, 10), (e, 3), (b, 2), (f, 1). Output: f, a, b, e, c. Hint: Use a min-heap. The candidate explained the brute-force approach and then optimized it using precomputed distances for BFS, with hints from the interviewer.
• Question 2: Given an N-ary tree with green and red nodes. Count the number of paths that start from one red node and end at another red node (not necessarily including the root). The candidate initially approached it by precomputing red nodes at each node for all k branches, storing in an N × K matrix, and then multiplying and summing counts. The interviewer asked for optimization without hints, leading to an optimized approach using a suffix sum technique.

The interviewer was helpful and provided hints when the candidate was going off track. The candidate also wrote down the time complexity for each code block.

Round 2 (Technical):

This round started with a discussion about the candidate's projects, specifically the "Anokhi Pehel" website. The interviewer asked to open implemented features. Later, they checked a personal project where Google Login was throwing an error. The interviewer asked the candidate to open the console of the deployed site (render) and explain the issue, leading to a technical discussion. When no visible error was found, the interviewer asked the candidate to clone the project and run it locally to debug.

Afterward, the interviewer asked if the candidate had any questions for them.

HR Round:

The HR round began with the candidate's introduction and a discussion about core subjects.

• Question: "Which subject do you like more — OS or OOPs?" The candidate chose Operating Systems and gave reasons related to hardware and software interaction, touching on virtual memory.
• Question: "What is virtual memory? Give a real-life example." The candidate explained using the example of a 32 GB game running on 8 GB RAM.
• Follow-up Question: "Suppose there's a long movie like Sholay — around 10 GB. How does it run?" The candidate explained swapping in chunks and pre-swapping the next segment to avoid buffering.

After 10 minutes, both the interviewers from the technical rounds entered and announced the candidate's selection.

Overall Experience: The candidate was stunned and expressed gratitude. A group picture was taken.