Tekion Interview Questions — 20 DSA Problems

19 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked Tekion LeetCode questions for software engineering interviews.

• Count the Number of Infection Sequences (HARD) — Array, Math, Combinatorics
• Trapping Rain Water (HARD) — Array, Two Pointers, Dynamic Programming, Stack, Monotonic Stack
• Most Stones Removed with Same Row or Column (MEDIUM) — Hash Table, Depth-First Search, Union Find, Graph
• Maximum Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming
• Two Sum (EASY) — Array, Hash Table
• Split Array Largest Sum (HARD) — Array, Binary Search, Dynamic Programming, Greedy, Prefix Sum
• Cousins in Binary Tree (EASY) — Tree, Depth-First Search, Breadth-First Search, Binary Tree
• Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
• Word Ladder (HARD) — Hash Table, String, Breadth-First Search
• Product of the Last K Numbers (MEDIUM) — Array, Math, Design, Data Stream, Prefix Sum
• Find First and Last Position of Element in Sorted Array (MEDIUM) — Array, Binary Search
• Best Time to Buy and Sell Stock III (HARD) — Array, Dynamic Programming
• Ways to Split Array Into Three Subarrays (MEDIUM) — Array, Two Pointers, Binary Search, Prefix Sum
• Find Peak Element (MEDIUM) — Array, Binary Search
• Jump Game (MEDIUM) — Array, Dynamic Programming, Greedy
• Is Subsequence (EASY) — Two Pointers, String, Dynamic Programming
• Spiral Matrix (MEDIUM) — Array, Matrix, Simulation
• Product of Array Except Self (MEDIUM) — Array, Prefix Sum
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Valid Parenthesis String (MEDIUM) — String, Dynamic Programming, Stack, Greedy