Problem database last updated: June 20, 2025
7 problems · 3 Easy, 2 Medium, 2 Hard · Ranked #185 of 458
3 Easy
43% · avg 23%
2 Medium
29% · avg 59%
2 Hard
29% · avg 18%
Based on 7 reported problems, ThoughtWorks interviews are significantly harder than average - 29% Hard vs 18% across all companies.
Compared to the industry average, ThoughtWorks puts unusual emphasis on bit-manipulation (28.6% of problems, 8.5x the industry average), dynamic-programming (42.9% of problems, 2.2x the industry average), string (57.1% of problems, 2x the industry average). If you're short on time, these are the categories to double down on.
The most common topics are string (57.1%), dynamic-programming (42.9%), array (28.6%), bit-manipulation (28.6%). Problems below are sorted by frequency, the ones at the top are asked most often.
| Problem | Difficulty | Frequency | Topics | |
|---|---|---|---|---|
Number of Subarrays That Match a Pattern II You are given a 0-indexed integer array nums of size n, and a 0-indexed integer array pattern of size m consisting of integers -1, 0, and 1. | Hard | Very Likely | arrayrolling-hashstring-matching | Solve |
Maximize the Number of Partitions After Operations You are given a string s and an integer k. | Hard | Very Likely | stringdynamic-programmingbit-manipulation | Solve |
Number of Bit Changes to Make Two Integers Equal You are given two positive integers n and k. | Easy | Very Likely | bit-manipulation | Solve |
Best Time to Buy and Sell Stock You are given an array prices where prices[i] is the price of a given stock on the ith day. | Easy | Likely | arraydynamic-programming | Solve |
Valid Parentheses Given a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid. | Easy | Likely | stringstack | Solve |
Longest Palindromic Substring Given a string s, return the longest palindromic substring in s. | Medium | Likely | two-pointersstringdynamic-programming | Solve |
Longest Substring Without Repeating Characters Given a string s, find the length of the longest substring without duplicate characters. | Medium | Likely | hash-tablestringsliding-window | Solve |
Number of Subarrays That Match a Pattern II
SolveYou are given a 0-indexed integer array nums of size n, and a 0-indexed integer array pattern of size m consisting of integers -1, 0, and 1.
Maximize the Number of Partitions After Operations
SolveYou are given a string s and an integer k.
Number of Bit Changes to Make Two Integers Equal
SolveYou are given two positive integers n and k.
Best Time to Buy and Sell Stock
SolveYou are given an array prices where prices[i] is the price of a given stock on the ith day.
Valid Parentheses
SolveGiven a string s containing just the characters '(', ')', '{', '}', '[' and ']', determine if the input string is valid.
Longest Palindromic Substring
SolveGiven a string s, return the longest palindromic substring in s.
Longest Substring Without Repeating Characters
SolveGiven a string s, find the length of the longest substring without duplicate characters.
Frequency scores are based on crowdsourced interview reports. A higher score means the problem has been reported more often in recent ThoughtWorks interviews.
Very Likely
75-100%
Likely
50-74%
Sometimes
25-49%
Rare
0-24%
ThoughtWorks interviews focus heavily on string, dynamic-programming, array 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. ThoughtWorks 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.
Looking for more companies? Browse all 458 companies in our directory, or sharpen your fundamentals with our free data structure visualizers and AI-powered DSA tutor.
ThoughtWorks has been reported to ask 7 distinct coding problems. The most common topics are string, dynamic-programming, array. 3 are Easy difficulty, 2 are Medium, and 2 are Hard. Problems are sorted by frequency - the ones at the top are asked most often.
Based on 7 reported problems, ThoughtWorks interviews are significantly harder than average - 29% Hard vs 18% across all companies. 29% of questions are Medium difficulty. Focus on the high-frequency Medium problems first, then work through the Hard ones.
Start with the highest-frequency problems listed on this page. Focus on the core topics: string, dynamic-programming, array. Practice solving them under time pressure and explaining your approach out loud. Mock interviews with AI can simulate the real experience.
Simulate a real ThoughtWorks coding interview with an AI interviewer. Get a scorecard with specific feedback on your problem-solving, code quality, and communication.
Simulate a ThoughtWorks interview with AIarrow_forward
