41 problems · 11 Easy, 28 Medium, 2 Hard · Ranked #51 of 458
Difficulty breakdown
11 Easy
27% · avg 23%
28 Medium
68% · avg 59%
2 Hard
5% · avg 18%
Top topics
array
58.5%
string
39%
hash-table
26.8%
dynamic-programming
26.8%
sorting
12.2%
two-pointers
12.2%
Interview profile
Based on 41 reported problems, Turing interviews are easier than average - only 5% Hard compared to 18% across all companies. The majority (68%) of questions are Medium difficulty, which is typical for companies that want to see solid fundamentals without excessive trick questions.
Compared to the industry average, Turing puts unusual emphasis on counting (7.3% of problems, 2.2x the industry average), sliding-window (9.8% of problems, 2.1x the industry average), union-find (4.9% of problems, 1.7x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are array (58.5%), string (39%), hash-table (26.8%), dynamic-programming (26.8%). Problems below are sorted by frequency, the ones at the top are asked most often.
All 41 problems
Problem
Difficulty
Frequency
Topics
Valid Parentheses
Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an inte...
Given a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type.
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Given a list paths of directory info, including the directory path, and all the files with contents in this directory, return all the duplicate files in the fil...
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob...
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forwa...
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
Your car starts at position 0 and speed +1 on an infinite number line. Your car can go into negative positions. Your car drives automatically according to a seq...
For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word's maximum k-repeating value is the highest...
You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th...
Minimum Number of Operations to Satisfy Conditions
You are given a 2D matrix grid of size m x n. In one operation, you can change the value of any cell to any non-negative number. You need to perform some operat...
You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an inte...
Given a string queryIP, return "IPv4" if IP is a valid IPv4 address, "IPv6" if IP is a valid IPv6 address or "Neither" if IP is not a correct IP of any type.
Given an array of intervals where intervals[i] = [starti, endi], merge all overlapping intervals, and return an array of the non-overlapping intervals that cove...
Given a list paths of directory info, including the directory path, and all the files with contents in this directory, return all the duplicate files in the fil...
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from rob...
Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0.
A phrase is a palindrome if, after converting all uppercase letters into lowercase letters and removing all non-alphanumeric characters, it reads the same forwa...
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length...
Your car starts at position 0 and speed +1 on an infinite number line. Your car can go into negative positions. Your car drives automatically according to a seq...
For a string sequence, a string word is k-repeating if word concatenated k times is a substring of sequence. The word's maximum k-repeating value is the highest...
You are given a string s and an integer k. You can choose any character of the string and change it to any other uppercase English character. You can perform th...
You are given a 2D matrix grid of size m x n. In one operation, you can change the value of any cell to any non-negative number. You need to perform some operat...
MediumSometimes
arraydynamic-programmingmatrix
How often are these problems asked?
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent Turing interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
Preparing for your Turing coding interview
Turing interviews focus heavily on array, string, hash-table problems. If you're short on time, these are the categories to prioritize. The problems on this page are sorted by frequency, so start from the top and work your way down.
Beyond solving problems, practice explaining your approach. Turing interviewers care about your thought process - how you break down a problem, consider edge cases, and evaluate tradeoffs between solutions. A clean O(n) solution you can explain clearly beats an O(log n) solution you can't articulate.
What coding problems does Turing ask in interviews?add
Turing has been reported to ask 41 distinct coding problems. The most common topics are array, string, hash-table. 11 are Easy difficulty, 28 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
How hard are Turing coding interviews?add
Based on 41 reported problems, Turing interviews are easier than average - only 5% Hard compared to 18% across all companies. 68% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
How should I prepare for a Turing coding interview?add
Start with the highest-frequency problems listed on this page. Focus on the core topics: array, string, hash-table. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real Turing coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.