Turing interview questions¶
The most frequent LeetCode problems tagged to Turing. This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 6 distinct problems tagged to Turing in the last 6 months (0 in the last 30 days, 1 in the last 3 months, 38 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Difficulty mix (last 6 months): Medium 67%, Hard 33%
Most tagged topics (share of problems): Hash Table 50%, Math 33%, Dynamic Programming 33%, String 33%, Sliding Window 33%, Array 33%, Heap (Priority Queue) 17%, Binary Search 17%, Greedy 17%, Prefix Sum 17%
Watch out: Turing has thin LeetCode data. Weight the reported questions and the format notes above more than this list.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Ugly Number II | Medium | 3 months | Hash Table, Math, Dynamic Programming, Heap (Priority Queue) |
| 2 | Validate IP Address | Medium | 6 months | String |
| 3 | Longest Substring Without Repeating Characters | Medium | 6 months | Hash Table, String, Sliding Window |
| 4 | Longest Arithmetic Subsequence | Medium | 6 months | Array, Hash Table, Binary Search, Dynamic Programming |
| 5 | Minimum Adjacent Swaps for K Consecutive Ones | Hard | 6 months | Array, Greedy, Sliding Window, Prefix Sum |
| 6 | Permutation Sequence | Hard | 6 months | Math, Recursion |
Signature problems¶
Problems where Turing accounts for a large share of all recent tags across companies. These are the most Turing-specific questions in the data.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Ugly Number II | Medium | 3 months | Hash Table, Math, Dynamic Programming, Heap (Priority Queue) |
| 2 | Validate IP Address | Medium | 6 months | String |
| 3 | Longest Arithmetic Subsequence | Medium | 6 months | Array, Hash Table, Binary Search, Dynamic Programming |
| 4 | Minimum Adjacent Swaps for K Consecutive Ones | Hard | 6 months | Array, Greedy, Sliding Window, Prefix Sum |
| 5 | Permutation Sequence | Hard | 6 months | Math, Recursion |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies