Texas Instruments LeetCode Interview Questions
Texas Instruments has asked 6 distinct LeetCode questions across all recorded interviews: 0 easy, 4 medium and 2 hard. The questions reported most often are Generate Parentheses, Minimum Path Sum and Partition Array Into Two Arrays to Minimize Sum Difference. 5 of them were reported in interviews from the 6+ Months Ago window. Each question links straight to LeetCode.
| # | Problem | Difficulty | Frequency | Acceptance | |
|---|---|---|---|---|---|
| 1 | Generate Parentheses | Medium | 100 | 0.8% | |
| 2 | Minimum Path Sum | Medium | 100 | 0.7% | |
| 3 | Partition Array Into Two Arrays to Minimize Sum Difference | Hard | 88 | 0.2% | |
| 4 | Substring with Concatenation of All Words | Hard | 88 | 0.3% | |
| 5 | Kth Largest Element in an Array | Medium | 88 | 0.7% | |
| 6 | Delete Node in a Linked List | Medium | 88 | 0.8% |
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 Texas Instruments, 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 Texas Instruments'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 Texas Instruments. Click any question to open it on LeetCode.
