Tekion Interview Experience. (New Grad, On-Campus)
- Posted
- 11 Aug 2022
Summary
I interviewed for a New Grad position at Tekion, which included an Online Assessment followed by two technical rounds and an HR interview. I successfully solved all coding problems in the technical rounds and engaged in discussions on core CS concepts and my projects.
How it went
Round 0: Online Assessment
This round consisted of 10 MCQs covering Debugging, OOPS, and DSA topics. There were also 2 coding questions; one involved Segment Trees and the other was a combination of priority queues and BFS. Unfortunately, I don't recall the exact problem statements.
Round 1: Technical Interview 1
The interviewer started by asking me to tell them about myself. Following that, we moved to the technical questions:
- I was asked to dry run the Quicksort algorithm on a specific test case.
- We discussed the Minimum Absolute Difference in BST problem.
- I was given the Find First and Last Position of Element in Sorted Array problem.
- A conceptual question on "What is a deadlock?"
- A question about "What is indexing?"
- I had to explain the "Four Pillars of OOPS."
- A question asking "What is a friend function?"
I successfully solved all the coding questions with optimal solutions.
Round 2: Technical Interview 2
This round also began with an introduction and then a deep dive into my projects. The interviewer asked:
- A coding question involving a BST and finding a number within a particular range of intervals. I couldn't find a similar question anywhere online.
- The classic Egg Drop Problem with infinite eggs and K floors.
Additionally, there were a few conceptual questions on Operating Systems, DBMS, and OOPS. I managed to solve both coding problems, and the interviewer was very helpful throughout the process.
Round 3: HR Interview
The HR round started with the usual "Tell me about yourself" and then moved into a deep discussion about one of my projects. We talked about the business aspects of my project, how to scale it, and make it profitable. It was a friendly and engaging discussion overall.
Questions asked (10)
- 01
Dry Run Quicksort
Other
I was asked to dry run the Quicksort algorithm on a specific test case to demonstrate my understanding of its execution.
- 02
Minimum Absolute Difference in BST
Data Structures & Algorithms · Easy
Open the problemGiven the root of a Binary Search Tree (BST), I needed to return the minimum absolute difference between the values of any two different nodes in the tree.
- 03
Find First and Last Position of Element in Sorted Array
Data Structures & Algorithms · Medium
Open the problemGiven an array of integers
numssorted in non-decreasing order, I had to find the starting and ending position of a giventargetvalue. Iftargetwas not found in the array, I needed to return[-1, -1]. - 04
What is a deadlock?
Other
I was asked to explain what a deadlock is in the context of operating systems, including its conditions and how it can be prevented or detected.
- 05
What is indexing?
Other
The question was about indexing in databases, covering its purpose, types, and how it improves query performance.
- 06
Four Pillars of OOPS
Other
I was asked to explain the four fundamental principles of Object-Oriented Programming (OOPs): Encapsulation, Abstraction, Inheritance, and Polymorphism.
- 07
What is a friend function?
Other
I had to explain the concept of a friend function in C++, including its purpose, how it's declared, and when it might be used.
- 08
Egg Drop Problem
Data Structures & Algorithms · Hard
Given K floors and an infinite supply of eggs, I had to determine the minimum number of attempts needed in the worst case to find the highest floor from which an egg will not break when dropped.
- 09
Tell me about yourself
Behavioral
This was a standard introductory question where I was expected to present a concise overview of my background, education, and relevant experience.
- 10
Project deep dive and business aspects
Behavioral
The interviewer asked for a deep dive into one of my projects, followed by a discussion on its business aspects, including scalability and potential for profitability.
How they prepared
My preparation involved solving over 450 problems on LeetCode and 100 problems on binarysearch. Additionally, I dedicated one month to studying core computer science subjects.