thoughtspot

12 questions tracked12 with solutions

🔍

Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough

Showing 12 of 12 questions

HardCount Subarrays With Median K✓ Our Solution

100

ArrayHash TablePrefix Sum

HardCount Paths That Can Form a Palindrome in a Tree✓ Our Solution

Dynamic ProgrammingBit ManipulationTreeDepth-First Search+1

Hash TableLinked ListDesignDoubly-Linked List

HardMinimum Window Substring✓ Our Solution

Hash TableStringSliding Window

HardMinimum Number of K Consecutive Bit Flips✓ Our Solution

ArrayBit ManipulationQueueSliding Window+1

MediumSnakes and Ladders✓ Our Solution

ArrayBreadth-First SearchMatrix

MediumNumber of Islands✓ Our Solution

ArrayDepth-First SearchBreadth-First SearchUnion Find+1

MediumMost Stones Removed with Same Row or Column✓ Our Solution

Hash TableDepth-First SearchUnion FindGraph

MediumSubarray Sums Divisible by K✓ Our Solution

ArrayHash TablePrefix Sum

MediumInterleaving String✓ Our Solution

StringDynamic Programming

MediumCount Pairs of Connectable Servers in a Weighted Tree Network✓ Our Solution

ArrayTreeDepth-First Search

MediumHouse Robber II✓ Our Solution

ArrayDynamic Programming