Round 1
Section 1: Aptitude Questions
- Total Questions: 20
- Duration: 25 minutes
Section 2: Output-Based Programming Questions (C Language)
- Total Questions: 5
- Marks: 5 marks each
You may choose to start with either section. Please note that there will be negative marking for incorrect answers:
- For each correct answer, you will receive +1 point.
- For each incorrect answer, you will incur a penalty of -0.5 points
Round 2
After successfully clearing the aptitude test, I participated in a paper-based coding test comprising three problems, each varying from easy to medium difficulty. These problems were quite similar to what one might encounter on platforms like LeetCode.Every question is a elimination one.
- Problem 1: The first problem required us to find the maximum subarray sum from a given array. The key aspect was to provide an optimized solution with a time complexity of O(n). We needed to write our logic in any programming language and explain our approach to the PalTech team member. Those who struggled with this problem were advised to leave.
- Problem 2: The second problem was of medium difficulty and involved implementing a queue using two stacks. It was a straightforward question, and candidates who failed to solve it were not allowed to proceed.
- The final question asked us to print a matrix in spiral order. This question was directly from LeetCode and familiar to many.
Round 3(Interview)
- Strong command of OOP concepts is essential.
- Be ready to write and explain SQL queries.
- Ensure a good grasp of DBMS and web technologies for project discussions.