Role: Associate Software Engineer (Internship + FTE)
College: Not Specified
Interview Date: Last week of August 2022
Interview Type: On-Campus/Internship/Full-Time
Result: Selected
Difficulty: Medium/Hard
Rounds: 3-4 rounds (Online Coding + MCQ, Technical Interview 1, Technical Interview 2, HR Round - not detailed)
Topics Asked: Coding (Split Array Largest Sum, Minimum Number of Jumps, Populating Next Right Pointers in Each Node, Task Scheduler II (approach only), Course Schedule), MCQs (DBMS, OS, OOPS - Java), Deadlock, Trie, Database Design (Hotel Management System), Synchronization, Process Scheduling, Subarrays with sum 0
Experience:
Tekion visited the campus in the last week of August 2022 for the ASE role (internship + FTE). The process was a 2-day event.
Round 1: Online Coding Round (75 mins)
- Conducted on HackerEarth, consisting of 2 coding questions and 8 MCQs.
- Coding questions were of medium/hard difficulty.
- First question similar to "Split Array Largest Sum".
- Second question similar to "Minimum Number of Jumps".
- MCQs were based on DBMS, OS, and OOPS concepts, with code in Java.
Round 2: Technical Interview Round - 1
- Conducted online via Zoom.
- After introductions, the interviewer directly moved to coding questions via a shared document link.
- First question: LeetCode - Populating Next Right Pointers in Each Node. The candidate explained the level order traversal approach and wrote the code.
- Second question: LeetCode - Task Scheduler II. Only the approach was asked.
- Third question: LeetCode - Course Schedule. Approach explanation and code were required.
- The interviewer was satisfied with the solutions.
- Remaining 10-15 minutes were used for questions on deadlock, basics of Trie, etc.
Round 3: Technical Interview Round - 2
- This online round was with a senior person.
- After introductions, the interviewer discussed projects mentioned in the resume.
- Asked to design a database for a Hotel Management system. The candidate expressed discomfort with the design part, so they moved on.
- Questions on strong points other than DSA, leading to discussions on OOPS, OS, and DBMS.
- Specific questions included: "What is synchronization?", "What are process scheduling algorithms and explain them?", "How to handle deadlock?".
- A DSA question was asked: "Given an array consisting of integers -1, 1, 0 and your target is to print all subarrays having sum 0." The candidate solved it.