
Synthesized from 31 candidate submissions for ALL.
Tekion's hiring process is characterized by role-specific assessments, ranging from live coding and low-level design for entry-level engineering roles to high-level system design for senior positions. Product and non-engineering roles focus heavily on written case studies and B2B-specific operational knowledge.
The candidate underwent two rounds of interviews for the Associate Software Engineer - Frontend role at Tekion. The first round tested DSA, JavaScript, web fundamentals, and machine coding, while the second round focused on a machine coding task with the hiring manager. The candidate was selected for the role.
A single round covering DSA, JavaScript, web fundamentals, and machine coding. JavaScript questions focused on output-based concepts like closures, async APIs, and hoisting. Problem-solving involved implementing a deep copy function. DSA included the two-sum problem (with and without a sorted array). Machine coding required building a basic React app to fetch and display data from an external API, with follow-up tasks like adding search and filtering features.
JavaScript output-based questions (closures, async APIs, hoisting)
Implement deepCopy function
DSA: Two Sum problem (with and without sorted array)
Machine Coding: Build a basic React app to fetch and display data from an external API
Machine Coding: Add search and filtering features
A machine coding round conducted by a hiring manager. The task was to build a matching cards game where two cards must match to remain open; otherwise, they close.
Machine Coding: Build a matching cards game
The candidate participated in two technical rounds. The first round involved BST implementation and validation, while the second round focused on interval overlap detection and LLD for a vending machine. The candidate did not clear the second round.
Candidates were asked to implement a Binary Search Tree (BST) from scratch and traverse it using different methods. Additionally, they had to determine if the constructed tree was a valid BST.
Implement a BST from scratch
Traverse the BST using different methods
Detect if the constructed tree is a BST
Candidates were asked to solve problems involving interval overlap detection and design a vending machine using Low-Level Design (LLD) with implementation.
Detect if two intervals with startTime and endTime are overlapping
Design and implement a vending machine using LLD