Texas Instruments LeetCode Questions
6 questions all-time · 0 easy · 4 medium · 2 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Generate Parentheses String, Dynamic Programming, Backtracking | Medium | 100 | 0.8% |
| 2 | Minimum Path Sum Array, Dynamic Programming, Matrix | Medium | 100 | 0.7% |
| 3 | Partition Array Into Two Arrays to Minimize Sum Difference Array, Two Pointers, Binary Search, Dynamic Programming, Bit Manipulation, Sorting, Ordered Set, Bitmask | Hard | 88 | 0.2% |
| 4 | Substring with Concatenation of All Words Hash Table, String, Sliding Window | Hard | 88 | 0.3% |
| 5 | Kth Largest Element in an Array Array, Divide and Conquer, Sorting, Heap (Priority Queue), Quickselect | Medium | 88 | 0.7% |
| 6 | Delete Node in a Linked List Linked List | Medium | 88 | 0.8% |
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.