TuringLeetCode Questions
VerifiedCompany-wise coding interview questions asked by Turing, ranked by real frequency across 30-day, 3-month, and 6-month recency windows.
# | Problem | Difficulty | Frequency↓ | Acceptance | |
|---|---|---|---|---|---|
| #3 | Medium | 100% | 39.4% | ||
| #468 | Validate IP Address3 sources | Medium | 88% | 28.4% | |
| #20 | Valid Parentheses3 sources | Easy | 88% | 44.5% | |
| #875 | Koko Eating Bananas3 sources | Medium | 88% | 50.2% | |
| #983 | Minimum Cost For Tickets3 sources | Medium | 88% | 67.5% | |
| #3138 | Medium | 77% | 39.9% | ||
| #682 | Baseball Game3 sources | Easy | 75% | 80.8% | |
| #1027 | Longest Arithmetic Subsequence3 sources | Medium | 75% | 50.1% | |
| #5 | Longest Palindromic Substring3 sources | Medium | 75% | 38.2% | |
| #3091 | Medium | 67% | 44.5% | ||
| #3122 | Medium | 67% | 42.4% | ||
| #1703 | Hard | 67% | 42.4% | ||
| #200 | Number of Islands3 sources | Medium | 63% | 64.7% | |
| #121 | Best Time to Buy and Sell Stock3 sources | Easy | 63% | 57.1% | |
| #1 | Two Sum3 sources | Easy | 63% | 57.8% | |
| #14 | Easy | 63% | 47.9% | ||
| #264 | Ugly Number II3 sources | Medium | 61% | 49.7% | |
| #53 | Maximum Subarray3 sources | Medium | 52% | 53.5% | |
| #56 | Merge Intervals3 sources | Medium | 52% | 52.3% | |
| #697 | Degree of an Array3 sources | Easy | 52% | 58.5% | |
| #238 | Product of Array Except Self3 sources | Medium | 52% | 69.1% | |
| #1013 | Easy | 52% | 42.9% | ||
| #215 | Kth Largest Element in an Array3 sources | Medium | 52% | 69.1% | |
| #34 | Medium | 52% | 49.3% | ||
| #818 | Race Car3 sources | Hard | 52% | 44.9% | |
| #55 | Jump Game3 sources | Medium | 52% | 41.2% | |
| #3137 | Medium | 52% | 60.9% | ||
| #49 | Group Anagrams3 sources | Medium | 52% | 72.9% | |
| #3153 | Medium | 52% | 43.2% | ||
| #15 | 3Sum3 sources | Medium | 52% | 39.4% | |
| #4 | Median of Two Sorted Arrays3 sources | Hard | 52% | 47.0% | |
| #2261 | K Divisible Elements Subarrays3 sources | Medium | 52% | 55.1% | |
| #1925 | Count Square Sum Triples3 sources | Easy | 52% | 77.2% | |
| #665 | Non-decreasing Array3 sources | Medium | 52% | 25.5% | |
| #3108 | Minimum Cost Walk in Weighted Graph3 sources | Hard | 52% | 68.2% | |
| #60 | Permutation Sequence2 sources | Hard | 52% | 0.5% | |
| #997 | Easy | 50% | 50.9% | ||
| #1668 | Easy | 50% | 41.9% |
Turing Technical Interview Overview & Company-Wise Questions
Software engineering and technical interviews at Turing emphasize real-world problem solving, algorithmic efficiency, and scalable data structure design. The curated dataset above contains 38 verified LeetCode problems, categorized by frequency and filtered across recent interview seasons.
Frequently Asked Questions
What are the top LeetCode questions for Turing?
Leading questions include Longest Substring Without Repeating Characters, Validate IP Address, Valid Parentheses. Reviewing questions with higher recency (within the last 30 to 90 days) yields the highest return on preparation time.
Where can I practice company-wise LeetCode questions for Turing?
You can practice all 38 Turing LeetCode questions right here on LeetMap Pro. Filter by 30-day, 3-month, and 6-month recency, track your progress with local checkpoints, and practice curated SQL problems completely free.
How should I prepare for Turing coding rounds?
Begin by reviewing Medium-difficulty problems (23 tracked), which constitute the majority of technical rounds. Complement coding practice with foundational DSA patterns like Sliding Window, Two Pointers, and Graph Traversal.