Turing LeetCode Interview Questions
Practice 35 coding problems currently tagged to Turing. Use the frequency and topic signals to build a focused software engineering interview practice plan.
Last updated:
Top Topics at Turing
Ace your Turing interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Turing Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
Longest Substring Without Repeating Characters 100% | MediumM | Solve→ |
Validate IP Address 88% | MediumM | Solve→ |
Valid Parentheses 85.6% | EasyE | Solve→ |
Koko Eating Bananas 83% | MediumM | Solve→ |
Minimum Cost For Tickets 80% | MediumM | Solve→ |
Minimum Length of Anagram Concatenation 76.5% | MediumM | Solve→ |
Baseball Game 72.4% | EasyE | Solve→ |
Longest Arithmetic Subsequence 72.4% | MediumM | Solve→ |
Longest Palindromic Substring 67.4% | MediumM | Solve→ |
Apply Operations to Make Sum of Array Greater Than or Equal to k 67.4% | MediumM | Solve→ |
Minimum Number of Operations to Satisfy Conditions 67.4% | MediumM | Solve→ |
Minimum Adjacent Swaps for K Consecutive Ones 67.4% | HardH | Solve→ |
Number of Islands 60.9% | MediumM | Solve→ |
Best Time to Buy and Sell Stock 60.9% | EasyE | Solve→ |
Two Sum 60.9% | EasyE | Solve→ |
Ugly Number II 60.9% | MediumM | Solve→ |
Maximum Subarray 51.8% | MediumM | Solve→ |
Merge Intervals 51.8% | MediumM | Solve→ |
Degree of an Array 51.8% | EasyE | Solve→ |
Product of Array Except Self 51.8% | MediumM | Solve→ |
Partition Array Into Three Parts With Equal Sum 51.8% | EasyE | Solve→ |
Kth Largest Element in an Array 51.8% | MediumM | Solve→ |
Find First and Last Position of Element in Sorted Array 51.8% | MediumM | Solve→ |
Race Car 51.8% | HardH | Solve→ |
Jump Game 51.8% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Minimum Number of Operations to Make Word K-Periodic 51.8% | MediumM | Solve→ |
Group Anagrams 51.8% | MediumM | Solve→ |
Sum of Digit Differences of All Pairs 51.8% | MediumM | Solve→ |
3Sum 51.8% | MediumM | Solve→ |
Median of Two Sorted Arrays 51.8% | HardH | Solve→ |
K Divisible Elements Subarrays 51.8% | MediumM | Solve→ |
Count Square Sum Triples 51.8% | EasyE | Solve→ |
Non-decreasing Array 51.8% | MediumM | Solve→ |
Minimum Cost Walk in Weighted Graph 51.8% | HardH | Solve→ |
Permutation Sequence 51.8% | HardH | Solve→ |
Similar Companies
Explore company practice sets with a similar number of tagged coding questions.
Frequently Asked Questions
What LeetCode problems are tagged to Turing?
Our current Turing practice dataset contains 35 tagged coding problems, including Longest Substring Without Repeating Characters, Validate IP Address, Valid Parentheses. The difficulty breakdown is 7 Easy, 23 Medium, and 5 Hard problems.
How should I prepare for a Turing coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Turing interviews typically emphasize Array and Hash Table. Practice explaining your thought process while coding.
What is the difficulty level of Turing coding interviews?
Based on our data, Turing interviews include 7 Easy (20%), 23 Medium (66%), and 5 Hard (14%) problems.
Ready to ace your Turing interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required