TEKION CORP 6M + PPO Experience (On campus)
Summary
I went through Tekion's on‑campus interview loop consisting of an OA, two technical rounds and an HR round, but was not selected despite reaching the final HR stage.
Full Experience
OA Round: (approx 200 participants shortlisted based on branch + cgpa)
Q1 - https://leetcode.com/problems/longest-balanced-substring-after-one-swap/description/ (exact same, solved all TCs) Q2 - advanced BS ques based on inclusion exclusion principle (solved half TCs with brute force and hardcoding visible TCs)
There were 20 MCQs - cs fundamentals
Tech Round 1: (17 people shortlisted from OA)
First 20 mins intro + resume discussion Q1 : RandomizedSet design - did comfortably in 25 mins Q2 : https://leetcode.com/problems/set-matrix-zeroes/description/ (solved comfortably in 15 mins, but could not discuss one edge case due to no time left)
Tech Round 2: (6 people shortlisted from R1)
First 45 mins DSA problem, was given a story, boiled down to return minimum size of a subarray having sum >= K , variant of this problem : https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/description/, optimal is monotonic deque, but could only give a heap solution, giving TC O(nlogn). Remaining 15 mins were discussion about hackathon project, some questions on DBMS (indexing), an SQL query, a basic question about thread pool and its advantages. Went good but not as good as round 1.
HR Round 3: (3 people shortlisted)
10 mins discussion about SIH and its project mentioned in my resume, basic HR questions related to teamwork, what I know about the company etc.
Everything ended on a positive note for me, but... Next day the results came and only 1 out of the 3 coming down to HR round was selected and I wasn't one of them :) Nevertheless, got a confidence boost as this was my first proper interview loop and I feel I did good. Hopefully the next experience I post will be of selection.
Interview Questions (4)
Longest Balanced Substring After One Swap
Given a string, find the length of the longest substring that can become a balanced string (equal number of '0's and '1's) after swapping at most one character. This is the problem linked in the OA round.
RandomizedSet Design
Design a data structure that supports insert(val), remove(val), and getRandom() in average O(1) time. insert returns true if the element was not present, false otherwise; remove returns true if the element was present, false otherwise; getRandom returns a random element from the current set of elements.
Set Matrix Zeroes
Given an m x n integer matrix, if an element is 0, set its entire row and column to 0. Do it in-place with O(1) additional space.
Shortest Subarray with Sum at Least K
Given an integer array and an integer K, find the length of the shortest, non‑empty, contiguous subarray of which the sum is at least K. If no such subarray exists, return -1. The optimal solution uses a monotonic deque; I provided a heap‑based O(n log n) solution during the interview.