Turing Online Assessment Questions
We hold no confirmed online assessment reports for Turing so far. Below are its 6 closest coding and technical questions, which is what an OA draws from.
See everything we have on Turing →
Browse Turing OA by Year
No year-specific OA data available.
Turing Coding & Technical Questions
#1027 Longest Arithmetic Subsequence
LeetCode #1027: Longest Arithmetic Subsequence. Difficulty: Medium. Topics: Array, Hash Table, Binary Search, Dynamic Programming. Asked at Turing in the last 6 months.
#1703 Minimum Adjacent Swaps for K Consecutive Ones
LeetCode #1703: Minimum Adjacent Swaps for K Consecutive Ones. Difficulty: Hard. Topics: Array, Greedy, Sliding Window, Prefix Sum. Asked at Turing in the last 6 months.
#468 Validate IP Address
LeetCode #468: Validate IP Address. Difficulty: Medium. Topics: String. Asked at Turing in the last 6 months.
#665 Non-decreasing Array
LeetCode #665: Non-decreasing Array. Difficulty: Medium. Topics: Array. Asked at Turing in the last 6 months.
#3 Longest Substring Without Repeating Characters
LeetCode #3: Longest Substring Without Repeating Characters. Difficulty: Medium. Topics: Hash Table, String, Sliding Window. Asked at Turing in the last 6 months.
#3122 Minimum Number of Operations to Satisfy Conditions
LeetCode #3122: Minimum Number of Operations to Satisfy Conditions. Difficulty: Medium. Topics: Array, Dynamic Programming, Matrix. Asked at Turing in the last 6 months.
Most Common OA Topics
Turing OA Format and Platform
The Turing online assessment is delivered through a proctored online platform, most commonly HackerRank. Candidates receive the OA link by email after passing an initial resume review. The coding section typically contains 2 to 3 algorithmic problems with a 70 to 110 minute time limit.
Some Turing teams include an additional work simulation section that tests judgment and decision-making rather than coding ability. This section is not present for all roles. Check the LeakCode question database filtered by role type to see what past candidates for your specific role reported.
FAQ
Does Turing have an online assessment?
Yes. Turing uses an OA as the first technical screen for most engineering and technical roles. It is typically sent after a resume review and before any human interviews. The format has remained consistent across recent hiring cycles.
How hard is the Turing OA?
Based on candidate reports, Turing OA problems range from LeetCode medium to hard. Expect at least one problem that requires an efficient algorithm (not brute force) to pass all test cases within the time limit.
Where do these OA questions come from?
All questions in the LeakCode database are sourced from actual candidate reports on 1Point3Acres, Blind, Glassdoor, Reddit, and LeetCode. They are not AI-generated. Each question links to its source where the original report is public.
Related: Turing All Questions · All OA Questions · Browse Companies · Data Sources