Tekion Corp interview experience Real time questions & tips from candidates to crack your interview
SDE - 2
Tekion Corp
2 rounds | 3 Coding
problems
Selected Interview preparation journey
Preparation
Duration: 6 Months
Topics: Data Structures, Algorithms, OOPS, OS, DBMS, CN, Projects
Tip 1 : Work on Competitive Programming skills. That is one thing most companies look out for during hiring. Solve at least 100
questions from every topic.
Tip 2 : You should have at least 2 good projects on your resume. Only write the things that you are completely sure of.
Tip 3 : Work on CS fundamentals as well like -OOPS, OS, and DBMS. There will be MCQ questions from this in the coding round as well as in the 1:1 round
Application process
Where: Referral
Eligibility: No criteria
Tip 1 : Need at least 2 good projects on the resume. Write a short 2-3 lines summary of the project and the tech stack
used.
Tip 2 : Resume should be 1 page only. Try to keep the Resume short with useful information only.
Tip 3 : Your Resume should clearly mention the skillset you have. Companies sometimes filter out Resume based on
skillset only
Interview rounds
01
Round
Easy
Face to Face
Duration60 Minutes
Interview date1 Aug 2020
Coding problem2
It was a 1hr round from 1 pm-2 pm over zoom.
1. Minimum Number of Platform Needed
Easy
23m average time
85% success
0/40
Asked in companies
You are given the arrival and departure times of N trains at a railway station in a day. You need to find the minimum of platforms required for the railway station such that no train waits i.e No train should wait for the platform to be clear or free.
Problem approach
I took one map where the key will be the time and value will be either"Arrival" or "Departure". Store all the values given in 2 arrays in this map. now sort this map according to the key. after sorting the map, iterate through every key and check if the value is arrival -> sum+1 and if the value is "departure" -> sum-1. Return the value of the sum
2. Longest Increasing Subsequence
Moderate
30m average time
65% success
0/80
Asked in companies
For a given array with N elements, you need to find the length of the longest subsequence from the array such that all the elements of the subsequence are sorted in strictly increasing order.
Strictly Increasing Sequence is when each term in the sequence is larger than the preceding term.
For example:
[1, 2, 3, 4] is a strictly increasing array, while [2, 1, 4, 3] is not.
Problem approach
I firstly took one array ans[] and initialized it with 1. now take two pointers i and j, where i will start from 0 and j will start from 1. now take a while loop with condition -> (i arr[i] then
ans[j] = max(ans[j], ans[i]+1
return max value-form the ans array
02
Round
Easy
Face to Face
Duration60 Minutes
Interview date2 Aug 2020
Coding problem1
It was a 1 hr round from 2 pm-3 pm. HR mailed me the zoom link
1. System Design Question
Design BookMyShow
Problem approach
Tip 1: List down all the requirements. Work with the interviewer to check what all should be covered. For example in this
case should we consider any coupons for booking shows?
Tip 2: Try to estimate the number of queries or hits you will get. This will help you to scale your system better
Tip 3: Design a single server with DBMS, API, and business logic and then scale it for the no. of queries estimated in
Tip-2. Learn about CAP theorem
Here's your problem of the day 
Solving this problem will increase your chance to get selected in this company
Skill covered: Programming
What is the purpose of the return keyword?
Choose another skill to practice
Similar interview experiences
Associate Software Engineer
3 rounds | 4 problems
Interviewed by Tekion Corp
Selected 
1328 views
0 comments
0 upvotes
Frontend developer II
3 rounds | 6 problems
Interviewed by Tekion Corp
Selected 384 views
0 comments
0 upvotes
SDE - 1
4 rounds | 6 problems
Interviewed by Tekion Corp
Selected 1794 views
0 comments
0 upvotes
SDE - 2
2 rounds | 3 problems
Interviewed by Tekion Corp
Rejected
398 views
0 comments
0 upvotes
Companies with similar interview experiences
SDE - 2
5 rounds | 12 problems
Interviewed by Walmart
Selected 29739 views
8 comments
0 upvotes
SDE - 2
3 rounds | 5 problems
Interviewed by Amazon
Rejected
6728 views
1 comments
0 upvotes
SDE - 2
6 rounds | 8 problems
Interviewed by Amazon
Selected 5225 views
0 comments
0 upvotes