thoughtspot Interview Questions — 12 DSA Problems

12 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.

Most frequently asked thoughtspot LeetCode questions for software engineering interviews.

• Count Subarrays With Median K (HARD) — Array, Hash Table, Prefix Sum
• Count Paths That Can Form a Palindrome in a Tree (HARD) — Dynamic Programming, Bit Manipulation, Tree, Depth-First Search, Bitmask
• LRU Cache (MEDIUM) — Hash Table, Linked List, Design, Doubly-Linked List
• Minimum Window Substring (HARD) — Hash Table, String, Sliding Window
• Minimum Number of K Consecutive Bit Flips (HARD) — Array, Bit Manipulation, Queue, Sliding Window, Prefix Sum
• Snakes and Ladders (MEDIUM) — Array, Breadth-First Search, Matrix
• Number of Islands (MEDIUM) — Array, Depth-First Search, Breadth-First Search, Union Find, Matrix
• Most Stones Removed with Same Row or Column (MEDIUM) — Hash Table, Depth-First Search, Union Find, Graph
• Subarray Sums Divisible by K (MEDIUM) — Array, Hash Table, Prefix Sum
• Interleaving String (MEDIUM) — String, Dynamic Programming
• Count Pairs of Connectable Servers in a Weighted Tree Network (MEDIUM) — Array, Tree, Depth-First Search
• House Robber II (MEDIUM) — Array, Dynamic Programming