thoughtspot LeetCode Questions
5 questions all-time · 0 easy · 2 medium · 3 hard
| # | Problem | Difficulty | Frequency | Acceptance |
|---|---|---|---|---|
| 1 | Count Paths That Can Form a Palindrome in a Tree Hash Table, Bit Manipulation, Tree, Depth-First Search | Hard | 100 | 0.5% |
| 2 | Minimum Window Substring Hash Table, String, Sliding Window | Hard | 87 | 0.5% |
| 3 | Interleaving String String, Dynamic Programming | Medium | 77 | 0.4% |
| 4 | Count Pairs of Connectable Servers in a Weighted Tree Network Array, Tree, Depth-First Search | Medium | 77 | 0.6% |
| 5 | Largest Rectangle in Histogram Array, Stack, Monotonic Stack | Hard | 77 | 0.5% |
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.