ThoughtWorks LeetCode Questions
5 questions all-time · 2 easy · 0 medium · 3 hard
Track your progress. Sign in free to tick off problems and save what you've solved across every company.
| # | 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% |
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. Acceptance is the share of submissions that pass on LeetCode. Click any question to open it on LeetCode.
