DSA Doctor
Verified Company Vault
Thoughtspot DSA Interview Questions
5 curated coding interview questions directly asked in Thoughtspot technical rounds, sorted by frequency with recency and difficulty diagnostics.
5
Total Questions
0 (0%)
Easy Problems
2 (40%)
Medium Problems
3 (60%)
Hard Problems
🔥 Most Tested Topics:
Strings (3)Trees (3)Arrays (1)Graphs (1)Core DSA (1)
📂 Sourced Datasets:
All questionsOlder than 6 months
| ID | Problem | Difficulty | Topic | Pattern | Acceptance | Frequency | Recency |
|---|---|---|---|---|---|---|---|
| 2791 | Count Paths That Can Form a Palindrome in a Tree | Hard | Strings; Trees | Hashing / Sliding Window; DFS / BFS | 52.2% | 100.0% | all |
| 76 | Minimum Window Substring | Hard | Arrays; Strings; Trees | Sorting / Prefix / Scan; Hashing / Sliding Window; DFS / BFS; Sliding Window | 47.5% | 87.5% | all |
| 97 | Interleaving String | Medium | Strings | Hashing / Sliding Window | 44.0% | 75.0% | all |
| 3067 | Count Pairs of Connectable Servers in a Weighted Tree Network | Medium | Trees; Graphs | DFS / BFS; BFS / DFS / Topological Sort | 55.9% | 75.0% | all |
| 84 | Largest Rectangle in Histogram | Hard | Core DSA | Implementation / Reasoning | 49.9% | 75.0% | all |