On-campus · Jun 2026
Software Engineer 1 at MAQ Software
I would describe myself as modest, but hard working and I consistently sets firm goals for myself. Then, once I’ve defined the benchmarks, I take the necessary steps to achieve those milestones.I am someone who is consistently growing themselves and who is always excited to learn something new.
- Outcome
- Selected
- Rounds
- 3
- Format
- Virtual
- Panel
- Technical panel
What was the difficulty level of the interview? (1- very easy, 10-very difficult)
7/10
Tell us about the written/online test. (Aptitude, Coding, Test Platform, etc)
There was one written round consisting of two section. 1. First section consisted of 30 multiple choice aptitude questions ( Quant+logical reasoning),difficulty level of the questions was intermediate. Time given for this section was 30 min. 2. Second section consisted of 4 coding questions, they were: i. Compute factorial of a large number. ii. Convert a given decimal number to its binary form. iii. Maximum profit earned from buying and selling stock (more then one stock). iv. Given a number. Find whether any of the possible permutations of number can be divisible by 8 or not. example: Input – 524 possible permutations 524,542,254,245,425,452 output – 0 There was sectional cut off.
Describe your all Technical Interviews specifying number of rounds and details of each round (if any).
After the online round there were 2 interview rounds : 1. F2F 1 (Technical): i. Introduce yourself ii. Tell me about projects.(He was interested in the machine learning project that I have done.) iii. Detailed discussion about the internship that I have done. iv. Reverse a number using recursion. v. Palindrome partitioning (solved it using backtracking). vi. Asked me about oops concepts(3 pillars of oops). vii. Sql Queries, Database Indexing,Transaction Control, viii. Real life example for the use of Abstract classes. 2. F2F (Technical + HR): First Half of the interview was through my resume only.The he came to data structures and asked me to solve the following three problems: i. Given a boolean matrix mat[M][N] of size M X N, modify it such that if a matrix cell mat[i][j] is 1 (or true) then make all the cells of ith row and jth column as 1. https://www.geeksforgeeks.org/a-boolean-matrix-question/ ii. Snake Ladder Problem https://www.geeksforgeeks.org/snake-ladder-problem-2/ iii. Construct a stack such that push , pop, getmin , getmax , takes O(1) time complexity. Then he asked me
Log in to view the remaining questions.
Log in
