tekion logo

Tekion Interviews

19 experiences499 reads68 questions21% success rate
Tekion DSA round | 7.5 yrs experience
tekion logo
Tekion
7.5 yearsRejected
November 22, 202554 reads

Summary

I recently went through a challenging Data Structures and Algorithms interview round at Tekion, where I was presented with two difficult LeetCode problems. Despite effectively solving both, I ultimately received a rejection.

Full Experience

I had an interview with Tekion for a DSA round. I was asked two questions. The first was Trapping Rain Water. I was able to solve this problem and explain my approach thoroughly, demonstrating a deep understanding of the core concepts. The second question was Find the K-th Character in String Game II. For this problem, I devised and implemented the correct solution. However, I made a small error, using < instead of <= in a comparison, which led to incorrect results. I was actively debugging the issue, but the interviewer stopped me at the 55-minute mark. I mentioned that I believed my solution was very close, and I later confirmed the comparison mistake using an LLM. After calling HR, I received notification of my rejection. I found the interviewer uncollaborative, and it was difficult to get any acknowledgment or feedback. It felt like they deliberately gave me a hard second question. I'm left wondering what more one needs to do to successfully clear such a round.

Interview Questions (2)

Q1
Trapping Rain Water
Data Structures & AlgorithmsHard

Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it can trap after raining.

Q2
Find the K-th Character in String Game II
Data Structures & AlgorithmsHard

This problem typically involves a string transformation game where an initial string undergoes iterative modifications. You are given an initial string and an integer k, and the goal is to determine the k-th character of the string after a specified number of operations or at a particular point in the game's evolution.

Tekion SDE 2 | Offline drive at TEKION office, bangalore.
tekion logo
Tekion
SDE 2bangaloreOngoing
October 31, 202571 reads

Summary

Attended an offline drive for SDE 2 position at Tekion in Bangalore. Faced two DSA rounds with coding problems.

Full Experience

Tekion SDE 2

Offline drive at tekion office bangalore

dsa round:

1. Best time to buy and sell the stock
https://leetcode.com/problems/best-time-to-buy-and-sell-stock

2. minimum-size-subarray-sum
https://leetcode.com/problems/minimum-size-subarray-sum

Interview Questions (2)

Q1
Best Time to Buy and Sell Stock
Data Structures & AlgorithmsEasy

Given an array of prices where prices[i] represents the price of a given stock on day i, find the maximum profit you can achieve by buying one day and selling one day after.

Q2
Minimum Size Subarray Sum
Data Structures & AlgorithmsMedium

Given an array of positive integers and a positive integer s, find the minimal length of a contiguous subarray such that the sum of the subarray is greater than or equal to s.

Tekion offer
tekion logo
Tekion
SDE-1Rejected
October 9, 202576 reads

Summary

I interviewed at Tekion for an SDE-1 role through three offline rounds covering machine coding, low-level design, and managerial topics, which ultimately led to an offer. However, I rejected the offer due to a salary negotiation disagreement.

Full Experience

I recently went through an interview process with Tekion for an SDE-1 position, which consisted of three offline rounds.

Round 1 (45 min to code): Machine Coding

I was tasked with designing a file management system and implementing fully functional methods for cp, mv, mkdir, and pwd.

Round 2 (1 hour round): Low-Level Design (LLD)

I had to design a parking lot system, focusing on outlining all the necessary methods and classes. This round also included several follow-up questions:

  • How to make the system fast while fetching empty slots.
  • A deep dive on Redis cache, including questions about why it cannot be used in place of a primary database.
  • A discussion on Parallelism vs. Concurrency.
  • Some questions derived from my resume.

Round 3 (30 min): Managerial

This round involved discussions about my current project and the components of a movie ticket booking system from a High-Level Design (HDL) perspective. I was also asked which database I would choose for such a system (e.g., MySQL, MongoDB, Cassandra, etc.) and had to explain the CAP theorem in relation to my chosen database, specifically identifying which aspect wouldn't be possible.

After these rounds, I received a call within a week, indicating I was shortlisted. The salary negotiation and the final offer letter took an additional three weeks. I was offered an SDE-1 role with a base salary of 29 LPA, 4000 units of ESOPs (which I found to be of no use), and a joining bonus of 2 LPA. I attempted to negotiate for a 32 LPA base, but it didn't go well, leading me to ultimately reject the offer.

Interview Questions (8)

Q1
Design File Management System
Data Structures & Algorithms

Design a file management system and implement fully functional code for the following methods:

  • cp (copy files/directories)
  • mv (move files/directories)
  • mkdir (make directory)
  • pwd (print working directory)
Q2
Design Parking Lot
System Design

Design a parking lot system. The task was to code the outline of all necessary methods and classes.

Q3
Optimize Empty Slot Fetching in Parking Lot
System Design

Follow-up question to the parking lot design: How would you make the system fast while fetching empty slots?

Q4
Deep Dive on Redis Cache
System Design

A deep dive discussion on Redis cache, including questions like why it cannot be used in place of a primary database.

Q5
Parallelism vs. Concurrency
Other

Explain the differences between Parallelism and Concurrency.

Q6
Components of Movie Ticket Booking System (HDL)
System Design

Discuss the components of a movie ticket booking system from a High-Level Design (HDL) perspective.

Q7
Database Choice for Ticket Booking System
System Design

Which database would you choose for a movie ticket booking system (e.g., MySQL, MongoDB, Cassandra, etc.) and why?

Q8
Explain CAP Theorem and DB Choice
System Design

Explain the CAP theorem and identify which aspect (Consistency, Availability, Partition Tolerance) would not be possible in the database you chose for the ticket booking system.

🚀 Tekion SSE Drive (August) – My Experience (Ghosted at the End)
tekion logo
Tekion
SDE IINo Offer
August 31, 202536 reads

Summary

I interviewed for an SSE role at Tekion in August 2025. Despite clearing multiple rounds including DSA, HLD, LLD, and the final hiring manager round, I was ultimately ghosted by the company.

Full Experience

I recently participated in Tekion's SSE hiring drive in August 2025. I hold a B.Tech from a Tier-1 university and am currently an SDE-2 at a FAANG company (though I presented myself as an SDE-1 during the process). My expected CTC was 35LPA+, which they seemed open to exceeding.

Round 1 – DSA (Onsite, pen + paper)

This round consisted of two DSA problems which I had to solve using pen and paper. One was a DFS-based problem and the other was a sliding window problem with a small trick. I successfully solved both and discussed my approach with a Staff SWE, as all SSEs were occupied. Later, the recruiter confirmed that I received positive feedback for this round.

Round 2 – HLD (Staff SWE)

This Higher-Level Design round caught me a bit off guard. The problem statement was simply: "Design a system that accepts a continuous stream of data." I decided to approach it with an event-driven pipeline, utilizing tools like Kafka or SQS for message queuing, an ECS-based processing layer, and Redis for quick data access, with an option to persist data in a traditional database. The interviewer pressed me on why not just use a simple database, and I explained the trade-offs involved. It wasn't my best performance, but I managed to navigate through it.

Round 3 – LLD (SSE)

The Low-Level Design round focused on designing a Food Delivery System. The expectation was to start with a quick HLD overview, then dive into detailed aspects like DB schema design, specifically considering geospatial databases for efficient nearby restaurant queries. I also had to design APIs and the service-level architecture, concluding with discussions on design patterns such as Factory or Observer. I did all of this live on Excalidraw and felt very confident about my performance, receiving a positive signal.

Round 4 – Hiring Manager (Sr. SDM)

The final round was with a Senior SDM and primarily involved deep dives into my current services and projects, along with various ownership and behavioral questions. The goal was also to assess my alignment with the team's culture and needs. The Hiring Manager appeared satisfied with my responses.

What Happened Next?

After completing Round 3, I was informed that Round 4 would be virtual on a subsequent Monday. I requested a one-week extension as I was preparing for a Meta OA. I completed Round 4 later and felt it went well, but then I was met with complete silence – I was ultimately ghosted by Tekion.

Interview Questions (2)

Q1
Design System for Continuous Data Stream
System Design

Design a system that accepts a continuous stream of data. The candidate needs to propose a solution, discussing components like event-driven pipelines, processing layers, and storage solutions, along with trade-offs. The interviewer pressed on why not use a simple DB.

Q2
Food Delivery System Design
System Design

Design a Food Delivery System. This involves starting with a quick High-Level Design overview, then moving into detailed aspects such as DB schema design (including geospatial databases for nearby restaurant queries), API design, and service-level architecture. The discussion should conclude with relevant design patterns (e.g., Factory, Observer). All design was done live on Excalidraw.

Preparation Tips

Based on my experience, I'd recommend a balanced prep mix of DSA (focusing on tricky medium-level problems) and HLD/LLD, including thorough system and schema design. Using diagrams during interviews is highly beneficial as interviewers appreciate clarity. It's crucial to always articulate trade-offs, even for seemingly simple questions regarding database, cache, or queue choices. One should also prepare for abrupt outcomes and not take ghosting personally.

Tekion SSE Interview experience
tekion logo
Tekion
SDE II8 years
July 17, 20256 reads

Summary

I interviewed for a Software Solutions Engineer (SSE) role at Tekion, which involved four online rounds covering Data Structures & Algorithms, Low-Level Design, High-Level Design, and a Hiring Manager discussion.

Full Experience

Total 4 rounds, held online

1)DSA 2)LLD 3)HLD 3)Hiring Managerial

Round 1

  1. Count sub-sequences having sum of their elements equal to K Input: arr[] = {5, 5, 1}, K = 6 Output: 2 Input: arr[] = {3, 2, 5, 1, 2, 4}, K = 5 Output: 5 | Explaination [3,2], [5], [1,4],[2,1,2],[3,2]
  2. Design a data structure / class that supports the following operations in O (1) time. void insert(Object x): Inserts an item x to the data structure if not already present void remove(Object x): Removes an item x from the data structure if present boolean search(Object x): Searches an item x in the data structure Object getRandom(): Returns a random element from current set of elements

Round 2 Questions to explain:

  • SOLID Principles
  • Design Patterns (then specific design patterns such as Chain of Responsibility, Decorator, Observer, PubSub)
  • How do you measure a system's performance

LLD: Design Meeting Scheduler.

Round 3 Had brief discussion about my experience, few questions for clarifications and details. HLD: Design worksplace chat application like Slack

Round 4 It was discussions around projects, experience with technical and business situations and leadership scenarios. It was taken by manager.

Interview Questions (3)

Q1
Design Data Structure with O(1) insert, remove, search, getRandom
Data Structures & Algorithms

Design a data structure / class that supports the following operations in O (1) time. void insert(Object x): Inserts an item x to the data structure if not already present void remove(Object x): Removes an item x from the data structure if present boolean search(Object x): Searches an item x in the data structure Object getRandom(): Returns a random element from current set of elements

Q2
Design Meeting Scheduler
System Design

Design Meeting Scheduler.

Q3
Design Workplace Chat Application like Slack
System Design

Design worksplace chat application like Slack

Tekion Corp | SSE | DSA
tekion logo
Tekion
SDE II
June 29, 20255 reads

Summary

I interviewed at Tekion Corp for an SSE role, which involved a DSA discussion. I was given a problem similar to 'Shortest Subarray with Sum At Least K' with a variation to return indices. I used a sliding window pattern but did not pass the interview.

Full Experience

1 hour of DSA discussion. I was given below problem to solve with slight variation, instead of returning the length, I had to return the start and the end indices of the subarray.

https://leetcode.com/problems/shortest-subarray-with-sum-at-least-k/description/

I solved using sliding window pattern, but didn't work out as I received rejection email a day later.

Hope this helps to anyone!

Interview Questions (1)

Q1
Shortest Subarray with Sum At Least K (Return Indices)
Data Structures & Algorithms

I was given the problem 'Shortest Subarray with Sum At Least K' with a slight variation: instead of returning the length, I had to return the start and the end indices of the subarray.

Tekion Interview | SDE2
tekion logo
Tekion
SDE II
June 16, 20255 reads

Summary

I had an interview at Tekion for an SDE2 role which involved Data Structures & Algorithms and Low-Level Design rounds.

Full Experience

Round 1 - DSA(2 ques)

  1. https://leetcode.com/problems/jump-game-ii/description/
  2. https://leetcode.com/problems/rotting-oranges/description/

Interviewer started the discussion with brute force approach and then went on to discuss optimized soln.


Round 2 - LLD

Design Book my show
Discussion: detailed entity models, API contracts, concurrency control for bookings

Interview Questions (3)

Q1
Jump Game II
Data Structures & Algorithms
Q2
Rotting Oranges
Data Structures & Algorithms
Q3
Design Book my show
System Design

Design Book my show.

Tekion Interview Experience | SDE1 Backend
tekion logo
Tekion
SDE1 BackendChennai
June 7, 202512 reads

Summary

I recently interviewed at Tekion for an SDE1 Backend role in Chennai. I successfully completed the DSA round, solving both questions, but I struggled with the LLD aspect of the system design round. I am currently awaiting results and not expecting a positive outcome.

Full Experience

Hi All,

I recently interviewed at Tekion for the SDE1 position. I’m a 2023 graduate, and I got this opportunity after reaching out to a friend who kindly shared my profile with the HR team, also applied on job portal. The position was for the Chennai location.

Round 1 - DSA

Q1 - Find Peak Element

Q2 - Find Leaves of binary tree

I was able to solve both the questions within 45 mins.

Round 2 - LLD + HM

This round focused on system design and managerial fit.

He asked me to design a system like Bookmyshow, where user could add theaters, book the seats, see all the shows and so on.

The LLD round did not go well for me, as he asked multiple questions related to the design that I created and wasn't able to answer them.

At the end he asked few managerial questions as well.

  1. What will you do if you are stuck with an issue and you have release of that feature coming up in next 5 days.
  2. What will you make sure before the production release?

I’m still waiting for the result, but considering how the second round went, I’m not expecting a positive outcome.

Interview Questions (5)

Q1
Find Peak Element
Data Structures & Algorithms
Q2
Find Leaves of binary tree
Data Structures & Algorithms
Q3
Design Bookmyshow System
System Design

Design a system like Bookmyshow, where user could add theaters, book the seats, see all the shows and so on.

Q4
Issue Resolution Near Release
Behavioral

What will you do if you are stuck with an issue and you have release of that feature coming up in next 5 days.

Q5
Pre-Production Release Checks
Behavioral

What will you make sure before the production release?

Tekion Corp | SDE2 | Reject
tekion logo
Tekion
SDE II
May 14, 20257 reads

Summary

I interviewed for an SDE2 role at Tekion Corp, which involved DSA, System Design, and Hiring Manager rounds. Despite performing well in the initial technical rounds, I was rejected due to challenges faced during the Hiring Manager round.

Full Experience

Round 1 – DSA

Result: Strong Hire


Round 2 – System Design (HLD + LLD)

Question: Design a Booking.com-style hotel reservation system.
Result: Strong Hire

Covered:

  • High-Level Design (HLD): service boundaries, data flow, scaling strategies, component interactions (API Gateway, Search Service, Booking Service, Review Service, etc.)
  • Low-Level Design (LLD): detailed class/data models, DB schema, API contracts, concurrency control for bookings

Key Requirements:

  1. Search & Filtering (location, dates, price, ratings, amenities)
  2. Availability & Booking
    • Real-time room availability, concurrency control to prevent double-booking
    • Booking creation, modification, cancellation
  3. User Reviews & Ratings
  4. Scalability & Reliability
    • Caching, load balancing, DB sharding by region
    • High-QPS handling during peak seasons
  5. API Design & Data Model
    • Endpoints: /search, /book, /cancel, /reviews
    • Schema: Hotel, Room, Booking, User, Review tables

Round 3 – Hiring-Manager

This was the most difficult round in my opinion. The HM asked a mix of behavioral and past-experience-based questions, along with a couple of technical deep dives.

Questions which I couldn’t answer properly:

  1. API Latency Debugging (without code changes):
    “Without adding new logs or deploying changes, how would you pinpoint whether high latency is due to DB access, business logic, or network?”
  2. PATCH Endpoint Design:
    “How would you design a RESTful PATCH API for partial updates?”
    • The interviewer was specifically focused on JSON Patch semantics.
    • I was only familiar with JSON Merge Patch, which led to some confusion in articulating the request/response format.

Overall Result: Reject

Interview Questions (5)

Q1
Solving Questions With Brainpower
Data Structures & Algorithms

Solving Questions With Brainpower

Q2
Largest Divisible Subset
Data Structures & Algorithms

Largest Divisible Subset

Q3
Design a Booking.com-style hotel reservation system
System Design

Design a Booking.com-style hotel reservation system. Key Requirements:

  1. Search & Filtering (location, dates, price, ratings, amenities)
  2. Availability & Booking
    • Real-time room availability, concurrency control to prevent double-booking
    • Booking creation, modification, cancellation
  3. User Reviews & Ratings
  4. Scalability & Reliability
    • Caching, load balancing, DB sharding by region
    • High-QPS handling during peak seasons
  5. API Design & Data Model
    • Endpoints: /search, /book, /cancel, /reviews
    • Schema: Hotel, Room, Booking, User, Review tables
Q4
API Latency Debugging without Code Changes
Other

“Without adding new logs or deploying changes, how would you pinpoint whether high latency is due to DB access, business logic, or network?”

Q5
Design RESTful PATCH API for Partial Updates
System Design

“How would you design a RESTful PATCH API for partial updates?” The interviewer was specifically focused on JSON Patch semantics.

Tekion Corp Software Engineer 2 Backend
tekion logo
Tekion
Software Engineer 2 Backend4.5 years
May 9, 202513 reads

Summary

I interviewed for a Software Engineer 2 Backend position at Tekion Corp. I was given two LeetCode problems and managed to solve one of them. Unfortunately, I was rejected after the interview.

Interview Questions (2)

Q1
Minimum Equal Sum of Two Arrays After Replacing Zeros
Data Structures & AlgorithmsMedium

You are given two arrays nums1 and nums2 consisting of non-negative integers. You have to choose an integer x and replace all occurrences of 0 in nums1 with x, and replace all occurrences of 0 in nums2 with x. After these replacements, the sum of elements in nums1 and nums2 must be equal. Return the minimum possible equal sum. If it's not possible to make the sums equal, return -1.

Q2
Minimum Cost to Make Array Equal
Data Structures & AlgorithmsHard

You are given two 0-indexed arrays nums and cost of length n each. You can change any element of nums to any integer x. The cost of changing nums[i] to x is |nums[i] - x| * cost[i]. Return the minimum total cost such that all elements of nums become equal.

Tekion Interview Experience Software Engineer 2 Backend
tekion logo
Tekion
Software Engineer 2 Backend
May 3, 20255 reads

Summary

I interviewed for the Software Engineer 2 Backend role at Tekion, which covered a mix of data structures & algorithms and core computer science concepts.

Full Experience

PS/DS 1.Minimum steps for knight to reach Destination follow up : print Paths 2. Process vs Thread 3. Context switching 4. PCB(Process control Board) 5. polymorphism with code

Interview Questions (5)

Q1
Knight's Tour Minimum Steps and Path
Data Structures & AlgorithmsMedium

Find the minimum number of steps a knight takes to reach a destination on a chessboard. Follow-up: Print all possible paths.

Q2
Process vs Thread
System Design

Explain the differences between a process and a thread.

Q3
Context Switching
System Design

Explain what context switching is.

Q4
Process Control Block (PCB)
System Design

Explain what a Process Control Block (PCB) is.

Q5
Polymorphism with Code Example
Other

Explain polymorphism and provide a code example.

Tekion SDE-1 Backend | Apr 2025 | In person interview
tekion logo
Tekion
SDE-1 BackendBangalore
April 15, 20254 reads

Summary

I attended an in-person hiring drive for the SDE-1 Backend role at Tekion's Bangalore office. I cleared the DSA + Puzzle round but was not shortlisted after the Low-Level Design round for an Elevator System.

Full Experience

🧪 My Experience with the Tekion SDE-1 Backend Hiring Drive (April 13, 2025)

I attended the Tekion in-office hiring drive for the SDE-1 Backend role at their Bangalore office.


⚙️ Round 1: DSA + Puzzle

This round had 2 coding questions and 1 puzzle:

  • Construct Binary Tree from Preorder and Inorder Traversals
  • Largest Rectangle in Histogram
  • Camel and Banana Puzzle

I was able to solve all of them within the time limit and cleared the round.


🧱 Round 2: Low-Level Design

The LLD round was focused on designing an Elevator System. I discussed:

  • Entities like Elevator, Floor, Request, Controller, etc.
  • Design patterns like Strategy, Observer, and Singleton
  • Class relationships and interaction flow

But I couldn’t complete the code implementation within the given time.


🚫 Final Outcome

Was not shortlisted after the LLD round.

Interview Questions (4)

Q1
Construct Binary Tree from Preorder and Inorder Traversals
Data Structures & Algorithms

Construct Binary Tree from Preorder and Inorder Traversals

Q2
Largest Rectangle in Histogram
Data Structures & Algorithms

Largest Rectangle in Histogram

Q3
Camel and Banana Puzzle
Other

Camel and Banana Puzzle

Q4
Elevator System Design
System Design

The LLD round was focused on designing an Elevator System.

Tekion SDE2 | 2.5 yrs experience | 2022
tekion logo
Tekion
SDE II2.5 years
April 5, 20259 reads

Summary

I interviewed for an SDE2 role at Tekion with 2.5 years of experience and was selected after multiple technical rounds.

Full Experience

Round 1
1. Given a fixed camera in a forest (with predefined trees), give the best angle in which the camera pictures the maximum of trees. Input angle is given in radian, return angle from 0 (say north)

int ForestCover(vector<Pair<int,int>> coordinateList, int angle) 
{
}

2. Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST.
As a reminder, a binary search tree is a tree that satisfies these constraints:
The left subtree of a node contains only nodes with keys less than the node's key.
The right subtree of a node contains only nodes with keys greater than the node's key.
Both the left and right subtrees must also be binary search trees.

Round 2
1. Splitwise LLD

Round 3
1. HLD basics discussions

Verdict: Selected.

Interview Questions (2)

Q1
Maximize Trees in Camera View
Data Structures & Algorithms

Given a fixed camera in a forest (with predefined trees), give the best angle in which the camera pictures the maximum of trees. Input angle is given in radian, return angle from 0 (say north)

int ForestCover(vector<Pair<int,int>> coordinateList, int angle) 
{
}

Q2
Convert BST to Greater Tree
Data Structures & Algorithms

Given the root of a Binary Search Tree (BST), convert it to a Greater Tree such that every key of the original BST is changed to the original key plus the sum of all keys greater than the original key in BST. As a reminder, a binary search tree is a tree that satisfies these constraints: The left subtree of a node contains only nodes with keys less than the node's key. The right subtree of a node contains only nodes with keys greater than the node's key. Both the left and right subtrees must also be binary search trees.

Tekion | SSE | Bengaluru | Offer
tekion logo
Tekion
SDE IIbengaluru5 yearsOffer
August 14, 202428 reads

Summary

I interviewed for a Senior Software Engineer role at Tekion in Bengaluru, India, and successfully received an offer. The interview process comprised problem-solving, low-level design, high-level design, and a hiring manager discussion.

Full Experience

I recently interviewed for the Senior Software Engineer position at Tekion. I have 5 years of experience and come from a Tier 3 college with a B.Tech in CSE. The interview process, which took place in May 2024, consisted of several rounds.

Problem Solving Round: This round involved solving 2 Leetcode Medium-tagged questions.

LLD Round: I was asked to design an Airplane Booking System. The discussion delved into its underlying Model, APIs, and the detailed Seat Selection Process.

HLD Round: This round began with a discussion about the High-Level Design of my current system. Following that, I was tasked with designing the IRCTC system, with the scope specifically limited to the Search and Booking functionalities.

HM Round: In the Hiring Manager round, we again discussed the design of my current system, and I also answered some behavioral questions.

I was offered the position and accepted it.

Interview Questions (4)

Q1
Design Airplane Booking System
System Design

Design an Airplane Booking System. The discussion covered the data Model, APIs, and the Seat Selection Process in detail.

Q2
High-Level Design of Current System (HLD Round)
System Design

Discuss the High-Level Design of my current system.

Q3
Design IRCTC Search and Booking
System Design

Design the IRCTC system. The discussion scope was specifically limited to the Search and Booking parts only.

Q4
Design Current System (HM Round)
System Design

As part of the Hiring Manager round, I was asked to discuss the design of my current system.

Tekion | SDE | Rejected
tekion logo
Tekion
SDE I2 yearsRejected
May 29, 202434 reads

Summary

I interviewed with Tekion for an SDE role and went through 4 rounds: Online Test, Problem Solving & Data Structures, LLD, and HM. I was ultimately rejected after the LLD round.

Full Experience

I participated in Tekion's hiring drive, which consisted of four rounds. The process started with an Online Test, followed by a Problem Solving & Data Structures round, a Low-Level Design (LLD) round, and finally, a Hiring Manager (HM) round. I managed to clear the first two rounds but unfortunately received a rejection after the LLD round.

1. Online Test: This round had two medium-difficulty questions. I found them quite manageable, likely because I have a good grasp of LeetCode medium problems.

2. Problem Solving & Data Structures: This round was conducted on the BarRaiser platform. The first question was a DSA problem focused on priority queues, quite similar to the classic 'N-meetings in one room' problem. The second question was an interesting puzzle involving ropes and a lighter to measure time, much like the one found in the provided link.

3. LLD (Low-Level Design): In this round, I was asked to design the classic Snake and Ladder game. The problem seemed straightforward enough for an LLD round. I was confident in my solution, covering all edge cases, but the interviewer appeared to be in a hurry, which might have impacted the discussion.

Verdict: I was rejected after the LLD round.

Interview Questions (3)

Q1
N-Meetings in Rooms (Priority Queue)
Data Structures & AlgorithmsMedium

A Data Structures and Algorithms question involving a priority queue, conceptually similar to the 'N-Meetings in one Room' problem. The goal is usually to determine the maximum number of events or meetings that can be scheduled or accommodated given their start and end times, often requiring optimal selection or management using a priority queue for efficient scheduling.

Q2
Rope and Lighter Time Measurement Puzzle
Other

A classic puzzle involving two ropes and a lighter. Each rope burns for exactly one hour, but their burning rates might be non-uniform. The challenge is to use these ropes and the lighter to accurately measure a specific duration of time, such as 45 minutes.

Q3
Low-Level Design: Snake Ladder Game
System Design

Design a low-level system for the classic board game Snake and Ladder. This involves defining classes for core components such as Board, Player, Dice, Snake, and Ladder, and implementing the game's logic, including player movement, handling encounters with snakes and ladders, and determining the winner.

Tekion || Ghosted || WTF
tekion logo
Tekion
SDE-1No Offer
December 21, 202329 reads

Summary

I interviewed with Tekion for an SDE-1 role, facing a problem-solving round with Java/Spring Boot questions and two coding challenges: string abbreviation and Word Break. Unfortunately, I was ghosted by HR after the first round, preventing further interview stages.

Full Experience

Recently, I interviewed with Tekion for an SDE-1 Role. The first round focused on Problem Solving. I was asked some questions on Java and Spring Boot. Following that, I tackled a coding question about string abbreviation (e.g., if s="AKNS", then abbr="A2S" is a valid abbreviation).

The third question was the classic Word Break problem. I managed to answer all the questions, though I needed a small hint from the interviewer to arrive at the optimal approach for Word Break.

The second and third rounds were scheduled to be for Low-Level Design (LLD) and Hiring Manager (HM) discussions, but I was unfortunately ghosted by HR; they stopped picking up calls and responding to emails. This experience, especially after being laid off, made the job search process quite exhaustive.

Interview Questions (2)

Q1
String Abbreviation Check
Data Structures & AlgorithmsMedium

Given a string s and an abbreviation abbr, determine if abbr is a valid abbreviation of s. For example, if s = "AKNS", then abbr = "A2S" is a valid abbreviation. The abbreviation can contain numbers representing consecutive skipped characters.

Q2
Word Break
Data Structures & AlgorithmsMedium

Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. The same word in the dictionary may be reused multiple times in the segmentation. You may assume the dictionary does not contain duplicate words.

Tekion Corp | Software Engineer | Interview Experience
tekion logo
Tekion
software engineer2.2 yearsOffer
December 11, 202228 reads

Summary

I successfully interviewed for a Software Engineer position at Tekion Corp, which included rounds on problem-solving, low-level design, and a hiring manager discussion, ultimately leading to an offer.

Full Experience

I went through a total of three rounds for the Software Engineer role at Tekion Corp. The first round was focused on Problem Solving and Data Structures, where I was given two coding questions. One was a stack-based problem, a variation of 'Daily Temperatures,' and the other was 'Swap Nodes in Pairs.' The second round was a Low-Level Design session, where I had to design the 'SplitWise App,' covering class and interface diagrams, entity relationships, service class method implementations, and API design. Finally, the Hiring Manager round involved a detailed discussion about my past projects and various technical topics such as Kafka, caching, transactions, load balancing, parallelism versus concurrency, and more. I was excited to receive an offer after these rounds.

Interview Questions (3)

Q1
Daily Temperatures (Variation)
Data Structures & Algorithms

I was presented with a stack-based coding question that was a variation of LeetCode's 'Daily Temperatures' problem. The goal was to find for each day, how many days one has to wait until a warmer temperature.

Q2
Swap Nodes in Pairs
Data Structures & AlgorithmsMedium

I had to solve a coding problem that required swapping every two adjacent nodes of a given linked list.

Q3
SplitWise App Low-Level Design
System Design

In the Low-Level Design round, I was asked to design the SplitWise application. This involved creating class and interface diagrams, identifying core entities, outlining the implementation of service class methods, and designing the necessary APIs.

Tekion Interview Experience. (New Grad, On-Campus)
tekion logo
Tekion
New Grad
August 11, 202248 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.

Tekion Associate Software Engineer Questions- 2021
tekion logo
Tekion
Associate Software EngineerOngoing
July 7, 202129 reads

Summary

I successfully navigated an online HackerEarth test, passing the initial screening to proceed to a technical interview round. Although my performance in the technical round was average, I received an invitation for the subsequent interview stage.

Full Experience

I applied for the Associate Software Engineer role at Tekion through a referral I got via LinkedIn. About ten days later, I received an email inviting me to an online HackerEarth test.

The HackerEarth test was 1.5 hours long and consisted of 10 MCQs, primarily covering OOPs, DBMS, time/space complexity, and code output, along with 2 coding questions. The MCQs were of easy-medium difficulty, and the coding questions were medium-hard. My camera was off throughout the test. For the first coding question, which was LeetCode's 'Find the Minimum Number of Fibonacci Numbers Whose Sum Is K,' I managed to solve it completely, and all test cases passed. For the second coding question, I wrote some code, but unfortunately, it didn't pass all the test cases. Despite this, I received a positive result and an invite for the next round after two days.

Round 1 was a one-hour session with a single coding question, which was LeetCode's 'Combination Sum.' I approached it with a recursive solution and implemented it. When the interviewer asked if I could optimize the solution, I struggled and couldn't find a better approach. Overall, I felt my performance in this interview was average.

Interview Questions (2)

Q1
Find the Minimum Number of Fibonacci Numbers Whose Sum Is K
Data Structures & AlgorithmsMedium

Given an integer k, return the minimum number of Fibonacci numbers whose sum is equal to k. The same Fibonacci number can be used multiple times. The Fibonacci numbers are generated using the formula F(0) = 0, F(1) = 1, F(n) = F(n - 1) + F(n - 2) for n > 1.

Q2
Combination Sum
Data Structures & AlgorithmsMedium

Given an array of distinct integers candidates and a target integer target, return a list of all unique combinations of candidates where the chosen numbers sum to target. You may return the combinations in any order. The same number may be chosen from candidates an unlimited number of times.

Have a Tekion Interview Experience to Share?

Help other candidates by sharing your interview experience. Your insights could make the difference for someone preparing for their dream job at Tekion.