Thoughtworks LeetCode Interview Questions
Practice 39 real coding problems frequently asked in Thoughtworks technical interviews. Master these questions to ace your next Thoughtworks software engineering interview.
Top Topics at Thoughtworks
Ace your Thoughtworks interview with AI
Get real-time AI assistance during your actual interview. Invisible to screensharing.
Thoughtworks Interview Problems
| Problem | DifficultyDiff | Action |
|---|---|---|
First Unique Character in a String 100% | EasyE | Solve→ |
Find K Closest Elements 91% | MediumM | Solve→ |
Valid Palindrome II 87% | EasyE | Solve→ |
Maximum Value at a Given Index in a Bounded Array 87% | MediumM | Solve→ |
Kth Largest Element in an Array 83% | MediumM | Solve→ |
Sqrt(x) 82% | EasyE | Solve→ |
Merge Sorted Array 79% | EasyE | Solve→ |
Find Peak Element 79% | MediumM | Solve→ |
Two City Scheduling 76% | MediumM | Solve→ |
Is Subsequence 76% | EasyE | Solve→ |
Jump Game 73% | MediumM | Solve→ |
Make String a Subsequence Using Cyclic Increments 71% | MediumM | Solve→ |
Line Reflection 71% | MediumM | Solve→ |
Longest Palindromic Substring 67% | MediumM | Solve→ |
Daily Temperatures 67% | MediumM | Solve→ |
Find the Index of the First Occurrence in a String 65% | EasyE | Solve→ |
Find Longest Self-Contained Substring 65% | HardH | Solve→ |
Reverse Words in a String 63% | MediumM | Solve→ |
Check if One String Swap Can Make Strings Equal 63% | EasyE | Solve→ |
Alien Dictionary 60% | HardH | Solve→ |
Convert Binary Search Tree to Sorted Doubly Linked List 57% | MediumM | Solve→ |
Construct Quad Tree 56% | MediumM | Solve→ |
Rank Teams by Votes 55% | MediumM | Solve→ |
Add Two Integers 53% | EasyE | Solve→ |
Maximum Matrix Sum 52% | MediumM | Solve→ |
Pass your interview with AI assistance
Get real-time solutions during your actual coding interview. Invisible to screensharing.
Merge Strings Alternately 49% | EasyE | Solve→ |
Maximum Sum Circular Subarray 47% | MediumM | Solve→ |
Clone Graph 44% | MediumM | Solve→ |
Permutations 41% | MediumM | Solve→ |
Check If N and Its Double Exist 39% | EasyE | Solve→ |
Gas Station 36% | MediumM | Solve→ |
Word Break II 36% | HardH | Solve→ |
Longest Subarray of 1's After Deleting One Element 35% | MediumM | Solve→ |
LRU Cache 31% | MediumM | Solve→ |
Diagonal Traverse 26% | MediumM | Solve→ |
Binary Search Tree Iterator 23% | MediumM | Solve→ |
Word Search 22% | MediumM | Solve→ |
Combination Sum II 22% | MediumM | Solve→ |
Bus Routes 20% | HardH | Solve→ |
Similar Companies
Explore interview questions from other companies with similar interview patterns.
Frequently Asked Questions
What LeetCode problems does Thoughtworks ask in interviews?
Thoughtworks commonly asks 39 coding problems in technical interviews, including First Unique Character in a String, Find K Closest Elements, Valid Palindrome II. The difficulty breakdown is 10 Easy, 25 Medium, and 4 Hard problems.
How should I prepare for a Thoughtworks coding interview?
Focus on the most frequently asked problems first, especially those with high frequency scores. Thoughtworks interviews typically emphasize Array and String. Practice explaining your thought process while coding.
What is the difficulty level of Thoughtworks coding interviews?
Based on our data, Thoughtworks interviews include 10 Easy (26%), 25 Medium (64%), and 4 Hard (10%) problems.
Ready to ace your Thoughtworks interview?
Join thousands of engineers who landed offers at top tech companies.
Get Started FreeNo credit card required