All companies
Thoughtworks
2 Easy0 Medium2 Hard4 total
| No. | Problem | Difficulty | Frequency |
|---|---|---|---|
| 3226 | Number of Bit Changes to Make Two Integers Equal | Easy | |
| 2941 | Maximum GCD-Sum of a Subarray | Hard | |
| 3036 | Number of Subarrays That Match a Pattern II | Hard | |
| 1 | Two Sum | Easy |