Problem database last updated: June 20, 2025
19 problems · 4 Easy, 10 Medium, 5 Hard · Ranked #96 of 458
4 Easy
21% · avg 23%
10 Medium
53% · avg 59%
5 Hard
26% · avg 18%
Based on 19 reported problems, Tekion interviews are slightly harder than average - 26% Hard vs 18% across all companies. The majority (53%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Tekion puts unusual emphasis on prefix-sum (21.1% of problems, 6.3x the industry average), binary-search (21.1% of problems, 2.4x the industry average), dynamic-programming (42.1% of problems, 2.1x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (73.7%), dynamic-programming (42.1%), binary-search (21.1%), prefix-sum (21.1%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Count the Number of Infection Sequences You are given an integer n and an array sick sorted in increasing order, representing positions of infected people in a line of n people. | Hard | Very Likely | arraymathcombinatorics | Solve |
Trapping Rain Water 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. | Hard | Very Likely | arraytwo-pointersdynamic-programming | Solve |
Two Sum Given an array of integers nums and an integer target, return the indices of the two numbers that add up to target. | Easy | Likely | arrayhash-map | Solve |
Most Stones Removed with Same Row or Column On a 2D plane, we place n stones at some integer coordinate points. Each coordinate point may have at most one stone. | Medium | Likely | hash-tabledepth-first-searchunion-find | Solve |
Maximum Subarray Given an integer array nums, find the subarray with the largest sum, and return its sum. | Medium | Likely | arraydivide-and-conquerdynamic-programming | Solve |
Split Array Largest Sum Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. | Hard | Likely | arraybinary-searchdynamic-programming | Solve |
Jump Game You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length... | Medium | Likely | arraydynamic-programminggreedy | Solve |
Valid Parenthesis String Given a string s containing only three types of characters: '(', ')' and '', return true if s is valid. | Medium | Likely | stringdynamic-programmingstack | Solve |
Best Time to Buy and Sell Stock III You are given an array prices where prices[i] is the price of a given stock on the ith day. | Hard | Likely | arraydynamic-programming | Solve |
Word Ladder A transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that: | Hard | Likely | hash-tablestringbreadth-first-search | Solve |
Ways to Split Array Into Three Subarrays A split of an integer array is good if: | Medium | Likely | arraytwo-pointersbinary-search | Solve |
Product of the Last K Numbers Design an algorithm that accepts a stream of integers and retrieves the product of the last k integers of the stream. | Medium | Likely | arraymathdesign | Solve |
Spiral Matrix Given an m x n matrix, return all elements of the matrix in spiral order. | Medium | Likely | arraymatrixsimulation | Solve |
Cousins in Binary Tree Given the root of a binary tree with unique values and the values of two different nodes of the tree x and y, return true if the nodes corresponding to the valu... | Easy | Likely | treedepth-first-searchbreadth-first-search | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Find Peak Element A peak element is an element that is strictly greater than its neighbors. | Medium | Likely | arraybinary-search | Solve |
Product of Array Except Self Given an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i]. | Medium | Likely | arrayprefix-sum | Solve |
Find First and Last Position of Element in Sorted Array Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. | Medium | Likely | arraybinary-search | Solve |
Is Subsequence Given two strings s and t, return true if s is a subsequence of t, or false otherwise. | Easy | Likely | two-pointersstringdynamic-programming | Solve |
Count the Number of Infection Sequences
SolveYou are given an integer n and an array sick sorted in increasing order, representing positions of infected people in a line of n people.
Trapping Rain Water
SolveGiven 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.
Two Sum
SolveGiven an array of integers nums and an integer target, return the indices of the two numbers that add up to target.
Most Stones Removed with Same Row or Column
SolveOn a 2D plane, we place n stones at some integer coordinate points. Each coordinate point may have at most one stone.
Maximum Subarray
SolveGiven an integer array nums, find the subarray with the largest sum, and return its sum.
Split Array Largest Sum
SolveGiven an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized.
Jump Game
SolveYou are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
Valid Parenthesis String
SolveGiven a string s containing only three types of characters: '(', ')' and '', return true if s is valid.
Best Time to Buy and Sell Stock III
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Word Ladder
SolveA transformation sequence from word beginWord to word endWord using a dictionary wordList is a sequence of words beginWord -> s1 -> s2 -> ... -> sk such that:
Ways to Split Array Into Three Subarrays
SolveA split of an integer array is good if:
Product of the Last K Numbers
SolveDesign an algorithm that accepts a stream of integers and retrieves the product of the last k integers of the stream.
Spiral Matrix
SolveGiven an m x n matrix, return all elements of the matrix in spiral order.
Cousins in Binary Tree
SolveGiven the root of a binary tree with unique values and the values of two different nodes of the tree x and y, return true if the nodes corresponding to the valu...
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Find Peak Element
SolveA peak element is an element that is strictly greater than its neighbors.
Product of Array Except Self
SolveGiven an integer array nums, return an array answer such that answer[i] is equal to the product of all the elements of nums except nums[i].
Find First and Last Position of Element in Sorted Array
SolveGiven an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value.
Is Subsequence
SolveGiven two strings s and t, return true if s is a subsequence of t, or false otherwise.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Tekion interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Tekion interviews focus heavily on array, dynamic-programming, binary-search problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Tekion interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
Tekion has been reported to ask 19 distinct coding problems. The most common topics are array, dynamic-programming, binary-search. 4 are Easy difficulty, 10 are Medium, and 5 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 19 reported problems, Tekion interviews are slightly harder than average - 26% Hard vs 18% across all companies. 53% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, dynamic-programming, binary-search. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Tekion coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a Tekion interview with AIarrow_forward
