ThoughtWorks

8 questions tracked7 with solutions

🔍

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

Showing 8 of 8 questions

EasyNumber of Bit Changes to Make Two Integers Equal✓ Our Solution

100

Bit Manipulation

HardMaximum GCD-Sum of a Subarray

100

ArrayMathBinary SearchNumber Theory

HardMaximize the Number of Partitions After Operations✓ Our Solution

100

StringDynamic ProgrammingBit ManipulationBitmask

HardNumber of Subarrays That Match a Pattern II✓ Our Solution

100

ArrayRolling HashString MatchingHash Function

EasyBest Time to Buy and Sell Stock✓ Our Solution

ArrayDynamic Programming

MediumLongest Substring Without Repeating Characters✓ Our Solution

Hash TableStringSliding Window

EasyValid Parentheses✓ Our Solution

StringStack

MediumLongest Palindromic Substring✓ Our Solution

Two PointersStringDynamic Programming