Tekion Interview Experience. (New Grad, On-Campus)

tekion logo
tekion
New Grad
August 11, 20224 reads

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.

Full Experience

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:

  1. I was asked to dry run the Quicksort algorithm on a specific test case.
  2. We discussed the Minimum Absolute Difference in BST problem.
  3. I was given the Find First and Last Position of Element in Sorted Array problem.
  4. A conceptual question on "What is a deadlock?"
  5. A question about "What is indexing?"
  6. I had to explain the "Four Pillars of OOPS."
  7. 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:

  1. 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.
  2. 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.

Interview Questions (10)

Q1
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.

Q2
Minimum Absolute Difference in BST
Data Structures & AlgorithmsEasy

Given 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.

Q3
Find First and Last Position of Element in Sorted Array
Data Structures & AlgorithmsMedium

Given an array of integers nums sorted in non-decreasing order, I had to find the starting and ending position of a given target value. If target was not found in the array, I needed to return [-1, -1].

Q4
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.

Q5
What is indexing?
Other

The question was about indexing in databases, covering its purpose, types, and how it improves query performance.

Q6
Four Pillars of OOPS
Other

I was asked to explain the four fundamental principles of Object-Oriented Programming (OOPs): Encapsulation, Abstraction, Inheritance, and Polymorphism.

Q7
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.

Q8
Egg Drop Problem
Data Structures & AlgorithmsHard

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.

Q9
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.

Q10
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.

Preparation Tips

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.

Discussion (0)

Share your thoughts and ask questions

Join the Discussion

Sign in with Google to share your thoughts and ask questions

No comments yet

Be the first to share your thoughts and start the discussion!