ThoughtWorks Interview Questions — 8 DSA Problems

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

Most frequently asked ThoughtWorks LeetCode questions for software engineering interviews.

• Number of Bit Changes to Make Two Integers Equal (EASY) — Bit Manipulation
• Maximum GCD-Sum of a Subarray (HARD) — Array, Math, Binary Search, Number Theory
• Maximize the Number of Partitions After Operations (HARD) — String, Dynamic Programming, Bit Manipulation, Bitmask
• Number of Subarrays That Match a Pattern II (HARD) — Array, Rolling Hash, String Matching, Hash Function
• Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
• Longest Substring Without Repeating Characters (MEDIUM) — Hash Table, String, Sliding Window
• Valid Parentheses (EASY) — String, Stack
• Longest Palindromic Substring (MEDIUM) — Two Pointers, String, Dynamic Programming