DSA Doctor
Verified Company Vault
Thoughtworks DSA Interview Questions
6 curated coding interview questions directly asked in Thoughtworks technical rounds, sorted by frequency with recency and difficulty diagnostics.
6
Total Questions
2 (33%)
Easy Problems
1 (17%)
Medium Problems
3 (50%)
Hard Problems
🔥 Most Tested Topics:
Arrays (3)Strings (2)Core DSA (1)Dynamic Programming (1)Trees (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 3226 | Number of Bit Changes to Make Two Integers Equal | Easy | Core DSA | Implementation / Reasoning | 63.5% | 100.0% | all |
| 2941 | Maximum GCD-Sum of a Subarray | Hard | Arrays | Sorting / Prefix / Scan | 38.8% | 100.0% | all |
| 3003 | Maximize the Number of Partitions After Operations | Hard | Dynamic Programming | State Transition | 53.4% | 100.0% | all |
| 3036 | Number of Subarrays That Match a Pattern II | Hard | Arrays; Strings | Sorting / Prefix / Scan; Hashing / Sliding Window | 33.7% | 100.0% | all |
| 5 | Longest Palindromic Substring | Medium | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 37.8% | 62.5% | all |
| 1 | Two Sum | Easy | Arrays | Sorting / Prefix / Scan; Two Pointers | 57.5% | 62.5% | all |