Two Sigma Interview Questions — 23 DSA Problems
20 problems with full solutions in Python, Java, C++, JavaScript, Go, Rust.
Most frequently asked Two Sigma LeetCode questions for software engineering interviews.
- Minimum Operations to Reduce an Integer to 0 (MEDIUM) — Dynamic Programming, Greedy, Bit Manipulation
- Number of Provinces (MEDIUM) — Depth-First Search, Breadth-First Search, Union Find, Graph
- Random Pick with Weight (MEDIUM) — Array, Math, Binary Search, Prefix Sum, Randomized
- Maximum Subarray Sum with One Deletion (MEDIUM) — Array, Dynamic Programming
- Multiply Strings (MEDIUM) — Math, String, Simulation
- Wildcard Matching (HARD) — String, Dynamic Programming, Greedy, Recursion
- Longest String Chain (MEDIUM) — Array, Hash Table, Two Pointers, String, Dynamic Programming, Sorting
- Game of Life (MEDIUM) — Array, Matrix, Simulation
- Power of Four (EASY) — Math, Bit Manipulation, Recursion
- Intersection of Two Arrays (EASY) — Array, Hash Table, Two Pointers, Binary Search, Sorting
- Maximum Sum Circular Subarray (MEDIUM) — Array, Divide and Conquer, Dynamic Programming, Queue, Monotonic Queue
- Word Search II (HARD) — Array, String, Backtracking, Trie, Matrix
- Merge k Sorted Lists (HARD) — Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort
- Parallel Courses III (HARD) — Array, Dynamic Programming, Graph, Topological Sort
- Design Memory Allocator (MEDIUM) — Array, Hash Table, Design, Simulation
- Minimum Space Wasted From Packaging (HARD) — Array, Binary Search, Sorting, Prefix Sum
- Design HashMap (EASY) — Array, Hash Table, Linked List, Design, Hash Function
- Search Suggestions System (MEDIUM) — Array, String, Binary Search, Trie, Sorting, Heap (Priority Queue)
- Design Tic-Tac-Toe (MEDIUM) — Array, Hash Table, Design, Matrix, Simulation
- Robot Room Cleaner (HARD) — Backtracking, Interactive
- Sum of Square Numbers (MEDIUM) — Math, Two Pointers, Binary Search
- Meeting Rooms II (MEDIUM) — Array, Two Pointers, Greedy, Sorting, Heap (Priority Queue), Prefix Sum
- Best Time to Buy and Sell Stock (EASY) — Array, Dynamic Programming
TS
Two Sigma
23 questions tracked20 with solutions
Frequency scoreSorted highest → lowest frequency✓ Our Solution = we have a detailed walkthrough
Showing 23 of 23 questions
1Dynamic ProgrammingGreedyBit Manipulation
2Depth-First SearchBreadth-First SearchUnion FindGraph
3ArrayMathBinary SearchPrefix Sum+1
6StringDynamic ProgrammingGreedyRecursion
7ArrayHash TableTwo PointersString+2
9MathBit ManipulationRecursion
10ArrayHash TableTwo PointersBinary Search+1
11ArrayDivide and ConquerDynamic ProgrammingQueue+1
12ArrayStringBacktrackingTrie+1
13Linked ListDivide and ConquerHeap (Priority Queue)Merge Sort
14ArrayDynamic ProgrammingGraphTopological Sort
15ArrayHash TableDesignSimulation
16ArrayBinary SearchSortingPrefix Sum
17ArrayHash TableLinked ListDesign+1
18ArrayStringBinary SearchTrie+2
19MediumDesign Tic-Tac-Toe
ArrayHash TableDesignMatrix+1
20HardRobot Room Cleaner
BacktrackingInteractive
21MathTwo PointersBinary Search
22MediumMeeting Rooms II
ArrayTwo PointersGreedySorting+2