DSA Doctor
Verified Company Vault
Turing DSA Interview Questions
37 curated coding interview questions directly asked in Turing technical rounds, sorted by frequency with recency and difficulty diagnostics.
37
Total Questions
11 (30%)
Easy Problems
22 (59%)
Medium Problems
4 (11%)
Hard Problems
🔥 Most Tested Topics:
Arrays (22)Strings (9)Core DSA (5)Trees (3)Graphs (3)
📂 Sourced Datasets:
Last 3 monthsLast 6 monthsAll questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 468 | Validate IP Address | Medium | Strings | Hashing / Sliding Window | 28.3% | 100.0% | 3m |
| 1703 | Minimum Adjacent Swaps for K Consecutive Ones | Hard | Arrays | Sorting / Prefix / Scan | 42.3% | 100.0% | 6m |
| 3 | Longest Substring Without Repeating Characters | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS; Sliding Window | 39.1% | 100.0% | all |
| 20 | Valid Parentheses | Easy | Strings | Hashing / Sliding Window | 44.2% | 100.0% | all |
| 1027 | Longest Arithmetic Subsequence | Medium | Core DSA | Implementation / Reasoning | 50.0% | 87.5% | 3m |
| 983 | Minimum Cost For Tickets | Medium | Arrays | Sorting / Prefix / Scan | 67.4% | 87.5% | all |
| 875 | Koko Eating Bananas | Medium | Binary Search | Binary Search | 50.0% | 87.5% | all |
| 665 | Non-decreasing Array | Medium | Arrays | Sorting / Prefix / Scan | 25.5% | 75.0% | 6m |
| 682 | Baseball Game | Easy | Core DSA | Implementation / Reasoning | 80.4% | 75.0% | all |
| 3138 | Minimum Length of Anagram Concatenation | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 39.8% | 75.0% | all |
| 14 | Longest Common Prefix | Easy | Core DSA | Implementation / Reasoning | 47.6% | 62.5% | all |
| 238 | Product of Array Except Self | Medium | Arrays | Sorting / Prefix / Scan | 68.9% | 62.5% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 121 | Best Time to Buy and Sell Stock | Easy | Core DSA | Implementation / Reasoning | 56.8% | 62.5% | all |
| 3091 | Apply Operations to Make Sum of Array Greater Than or Equal to k | Medium | Arrays | Sorting / Prefix / Scan | 44.4% | 62.5% | all |
| 3122 | Minimum Number of Operations to Satisfy Conditions | Medium | Arrays | Sorting / Prefix / Scan | 41.9% | 62.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |
| 997 | Find the Town Judge | Easy | Graphs | BFS / DFS / Topological Sort | 50.8% | 50.0% | all |
| 53 | Maximum Subarray | Medium | Arrays | Sorting / Prefix / Scan | 53.3% | 50.0% | all |
| 56 | Merge Intervals | Medium | Arrays | Sorting / Prefix / Scan | 51.8% | 50.0% | all |
| 697 | Degree of an Array | Easy | Arrays | Sorting / Prefix / Scan | 58.4% | 50.0% | all |
| 200 | Number of Islands | Medium | Graphs | BFS / DFS / Topological Sort | 64.4% | 50.0% | all |
| 1668 | Maximum Repeating Substring | Easy | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS | 41.7% | 50.0% | all |
| 1013 | Partition Array Into Three Parts With Equal Sum | Easy | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 42.7% | 50.0% | all |
| 215 | Kth Largest Element in an Array | Medium | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 68.9% | 50.0% | all |
| 917 | Reverse Only Letters | Easy | Strings | Hashing / Sliding Window | 68.5% | 50.0% | all |
| 34 | Find First and Last Position of Element in Sorted Array | Medium | Arrays | Sorting / Prefix / Scan | 48.9% | 50.0% | all |
| 818 | Race Car | Hard | Core DSA | Implementation / Reasoning | 44.7% | 50.0% | all |
| 55 | Jump Game | Medium | Greedy | Greedy | 40.9% | 50.0% | all |
| 3137 | Minimum Number of Operations to Make Word K-Periodic | Medium | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 60.8% | 50.0% | all |
| 49 | Group Anagrams | Medium | Strings | Hashing / Sliding Window | 72.6% | 50.0% | all |
| 3153 | Sum of Digit Differences of All Pairs | Medium | Arrays | Sorting / Prefix / Scan | 43.1% | 50.0% | all |
| 15 | 3Sum | Medium | Arrays | Sorting / Prefix / Scan | 39.1% | 50.0% | all |
| 4 | Median of Two Sorted Arrays | Hard | Arrays; Heap | Sorting / Prefix / Scan; Priority Queue | 46.6% | 50.0% | all |
| 2261 | K Divisible Elements Subarrays | Medium | Arrays | Sorting / Prefix / Scan | 55.0% | 50.0% | all |
| 1925 | Count Square Sum Triples | Easy | Arrays | Sorting / Prefix / Scan | 77.2% | 50.0% | all |
| 3108 | Minimum Cost Walk in Weighted Graph | Hard | Arrays; Graphs | Sorting / Prefix / Scan; BFS / DFS / Topological Sort | 68.2% | 50.0% | all |