Tencent Interview Questions — 15 DSA Problems
13 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Tencent LeetCode questions for software engineering interviews.
- Decode String (MEDIUM) — String, Stack, Recursion
- Remove Boxes (HARD) — Array, Dynamic Programming, Memoization
- Minimum Factorization (MEDIUM) — Math, Greedy
- Candy (HARD) — Array, Greedy
- Implement Rand10() Using Rand7() (MEDIUM) — Math, Rejection Sampling, Randomized, Probability and Statistics
- Immediate Food Delivery II (MEDIUM) — Database
- Alien Dictionary (HARD) — Array, String, Depth-First Search, Breadth-First Search, Graph, Topological Sort
- LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
- Remove Duplicates from Sorted List II (MEDIUM) — Linked List, Two Pointers
- Valid Parentheses (EASY) — String, Stack
- Minimum Remove to Make Valid Parentheses (MEDIUM) — String, Stack
- Department Highest Salary (MEDIUM) — Database
- Next Greater Element I (EASY) — Array, Hash Table, Stack, Monotonic Stack
- Debounce (MEDIUM) —
- Merge Intervals (MEDIUM) — Array, Sorting
T
Tencent
15 questions tracked13 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 15 of 15 questions
2ArrayDynamic ProgrammingMemoization
3MediumMinimum Factorization
MathGreedy
5MathRejection SamplingRandomizedProbability and Statistics
7HardAlien Dictionary
ArrayStringDepth-First SearchBreadth-First Search+2
8Hash TableLinked ListDesignDoubly-Linked List
13ArrayHash TableStackMonotonic Stack