Talentd
FleetCode
Make and follow sheets.Sign in

Turing Interview Questions (37)

Coding problems reported from Turing interviews and online assessments.

Start practising
A private sheet of Turing's most asked problems with a two-week finish date.
Questions37
Easy10
Medium23
Hard4
TitleSolutionAcceptDifficultyAsked
Solution53.7%Medium
Showing 1–3 of 3

More about Turing interviews

Turing is a global remote hiring platform that connects software engineers with top U.S. companies. Because developers hired through Turing work on real production systems for international teams, their interview process emphasizes strong data structures, algorithmic thinking, and the ability to write clean, production-ready code.

The typical Turing coding interview evaluates how well candidates solve practical algorithmic problems under time pressure. Many questions resemble medium-level LeetCode problems and focus on writing efficient solutions rather than memorizing patterns. Interviewers often ask candidates to explain trade-offs, optimize brute-force solutions, and write readable code.

Common data structure and algorithm topics asked in Turing interview questions include:

  • Arrays and string manipulation
  • Hash maps and frequency counting
  • Two pointers and sliding window techniques
  • Binary search and sorting-based problems
  • Trees, recursion, and DFS/BFS traversal
  • Dynamic programming and greedy optimization

In most interviews, candidates can expect a mix of easy to medium problems with occasional harder follow-up questions that test optimization or scalability. Beyond algorithms, Turing may also evaluate debugging ability, API design thinking, and familiarity with real-world coding practices.

FleetCode helps you prepare efficiently by organizing the most frequently asked from real candidate experiences. Each problem includes clear explanations and solutions in Python, Java, and C++, allowing you to master the patterns Turing interviewers expect. By practicing these curated questions, you can quickly build the problem-solving confidence needed to succeed in Turing's developer screening process.

Interview tips

Preparing for a Turing coding interview requires strong fundamentals and the ability to solve practical algorithmic problems quickly. Since Turing hires developers for remote roles with global companies, their evaluation focuses on both coding ability and real-world engineering thinking.

Typical Turing Interview Process

  • Online Screening / Coding Test:
  • Technical Interview: A live coding session where you solve problems while explaining your reasoning.
  • Advanced Technical or System Design Round: For senior roles, this may include architecture questions or deeper problem solving.
  • Client Interview: If you pass Turing's screening, you may interview with the company you will work with.

Most Common Problem Categories

  • Array and string manipulation
  • Hash map and set based lookups
  • Two pointers and sliding window
  • Binary search optimization problems
  • Tree traversal and recursion
  • Dynamic programming for optimization tasks

Many Turing interviews start with a straightforward solution and then ask you to optimize the time or space complexity. Practicing common patterns such as prefix sums, two pointers, and memoization can significantly improve your performance.

Common Mistakes to Avoid

  • Jumping into coding without explaining your approach
  • Ignoring edge cases like empty arrays or duplicate values
  • Writing code that works but is not optimized
  • Not testing your solution with sample inputs

Recommended Preparation Timeline

  • Week 1–2: Master arrays, strings, and hash map problems
  • Week 3–4: Practice trees, recursion, and binary search
  • Week 5–6: Focus on dynamic programming and mixed interview sets

A strong strategy is to practice curated sets of Turing interview questions and simulate real interview conditions.

Frequently asked questions

What DSA topics does Turing ask most?

The most common topics in Turing interview questions include arrays, strings, hash maps, two pointers, sliding window techniques, and tree traversal. Binary search and dynamic programming also appear in some interviews, especially for more experienced developer roles.

How hard are Turing coding interviews?

Turing coding interviews are generally considered medium difficulty. Most problems resemble mid-level LeetCode questions that test arrays, hash maps, recursion, and optimization techniques. Candidates are expected to write clean, efficient code and explain their reasoning clearly during live coding sessions.

Does Turing ask system design questions?

System design questions are usually asked for senior or experienced developer roles. Junior and mid-level candidates are primarily evaluated on data structures, algorithms, and coding ability, while senior candidates may also discuss scalability, architecture, and API design.

What is the Turing interview process like?

The Turing interview process typically includes an online coding assessment followed by one or two live technical interviews. Candidates who pass these rounds may then interview directly with the client company they will work with after joining Turing.

How many LeetCode problems should I solve for Turing?

Focus on medium-level problems involving arrays, hashing, recursion, and optimization rather than trying to solve hundreds of random questions.

How long should I prepare for a Turing coding interview?

Most developers need about 4–6 weeks of focused practice to prepare. During this time, candidates should review core data structures, practice common coding patterns, and simulate real interview conditions with timed problem solving.