MAQ Software offer On-Campus Internship plus Full-Time Offer
- Job Location Offered: Mumbai and Hyderabad
- Date of Interview: First Week Of October
- Internship duration: 6 months
Round 1: Written Test
Students were shortlisted on the basis of written tests. It consists of
| section 01 | Aptitude Question |
| Section 02 | 4 programming question |
Aptitude Questions are based on
- Simple Interest
- Compound Interest
- Time and Work
- Calendar
- Mixture and Allegation
- Ratio and Proportion
Programming Questions are similar to these questions:
- https://www.geeksforgeeks.org/c-program-sort-array-names-strings/amp/
- https://www.geeksforgeeks.org/kth-non-repeating-character-python-using-list-comprehension-ordereddict/amp/
- https://www.geeksforgeeks.org/searching-for-character-and-substring-in-a-string/
- https://www.geeksforgeeks.org/reverse-words-given-string-java/amp/
Round 2: Technical Interview 45min
- Introduce yourself
- Projects included in Resume
- Discussion on Projects Mentioned in projects
- Two coding questions
- https://www.codegrepper.com/code-examples/whatever/find+all+permutation+of+a+string+geeksforgeeks
- https://www.geeksforgeeks.org/detect-loop-in-a-linked-list/amp/
- 2 Puzzle
Round 3: Technical Interview 45 min
- Introduce yourself
- Projects included in Resume
- Discussion on Projects Mentioned in projects
- Two coding questions
- https://www.geeksforgeeks.org/searching-array-adjacent-differ-k/amp/f+a+string+geeksforgeeks
- https://leetcode.com/problems/search-in-rotated-sorted-array/
- 3 Puzzle
Round 4: Technical + HR 1 hrs
- Introduce yourself
- Projects included in Resume
- Discussion on Projects Mentioned in projects
- 3 coding questions
- https://www.geeksforgeeks.org/problems/circular-linked-list/1
- https://www.geeksforgeeks.org/problems/height-of-binary-tree/1
- https://www.geeksforgeeks.org/problems/reverse-a-string-using-stack/1
- 2 Puzzle
Finally Selected and a meeting is scheduled with all panelists and HR. Signing bonds, location preference, and package is discussed .we can ask “N” number of question to them at this time.