ThoughtWorks LeetCode Interview Questions
ThoughtWorks has asked 5 distinct LeetCode questions across all recorded interviews: 2 easy, 0 medium and 3 hard. The questions reported most often are Number of Bit Changes to Make Two Integers Equal, Maximum GCD-Sum of a Subarray and Maximize the Number of Partitions After Operations. Each question links straight to LeetCode.
| # | Problem | Difficulty | Frequency | Acceptance | |
|---|---|---|---|---|---|
| 1 | Number of Bit Changes to Make Two Integers Equal | Easy | 100 | 0.6% | |
| 2 | Maximum GCD-Sum of a Subarray | Hard | 100 | 0.4% | |
| 3 | Maximize the Number of Partitions After Operations | Hard | 100 | 0.5% | |
| 4 | Number of Subarrays That Match a Pattern II | Hard | 100 | 0.3% | |
| 5 | Two Sum | Easy | 65 | 0.6% |
Where this data comes from
These questions come from the public leetcode-company-wise-problems data set, which collects interview reports from candidates. They are community-reported rather than published by ThoughtWorks, so treat the list as a strong signal of what gets asked, not an official or exhaustive syllabus. Last refreshed .
How to read this list
The tabs at the top split the questions by how recently people said they were asked in interviews. "Last 30 Days" is the past month, "Last 3 Months" is the past quarter, and so on. "All Time" is every question on record for this company.
Frequency is a score from 0 to 100 for how often a question showed up in that time window. A higher number means it came up more often, so the list starts with the most common questions first. It is a relative popularity signal within ThoughtWorks's questions, not a probability that you will be asked it. Acceptance is LeetCode's own share of submissions that pass for that problem, across all users, not something specific to ThoughtWorks. Click any question to open it on LeetCode.
