4 curated coding interview questions directly asked in Texas Instruments technical rounds, sorted by frequency with recency and difficulty diagnostics.
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 22 | Generate Parentheses | Medium | Strings | Hashing / Sliding Window | 78.7% | 100.0% | all |
| 64 | Minimum Path Sum | Medium | Arrays; Trees | Sorting / Prefix / Scan; DFS / BFS | 68.2% | 100.0% | all |
| 2035 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | Arrays; Dynamic Programming | Sorting / Prefix / Scan; State Transition | 23.4% | 87.5% | all |
| 30 | Substring with Concatenation of All Words | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 34.4% | 87.5% | all |