Twitter (X) interview questions¶
The most frequent LeetCode problems tagged to Twitter (X). This is a data-only page. For process and behavioral prep, use the coding guide and behavioral guide.
Based on 0 distinct problems tagged to Twitter (X) in the last 6 months (0 in the last 30 days, 0 in the last 3 months, 45 all-time) across two open datasets of LeetCode company tags. Tags are user-reported, so treat frequency as a signal, not a promise.
Most frequent problems¶
Ranked by frequency, weighted toward the last 30 days. Classics like Two Sum sit near the top of almost every company's list because users tag them everywhere. Solve those fast. The signature list below is more specific to this company.
| # | Problem | Difficulty | Last seen | Topics |
|---|---|---|---|---|
| 1 | Alien Dictionary | Hard | Older | Array, String, Depth-First Search, Breadth-First Search |
| 2 | Best Meeting Point | Hard | Older | Array, Math, Sorting, Matrix |
| 3 | Binary Gap | Easy | Older | Bit Manipulation |
| 4 | Count Sub Islands | Medium | Older | Array, Depth-First Search, Breadth-First Search, Union-Find |
| 5 | Design Authentication Manager | Medium | Older | Hash Table, Linked List, Design, Doubly-Linked List |
| 6 | Design Skiplist | Hard | Older | Linked List, Design |
| 7 | Design Twitter | Medium | Older | Hash Table, Linked List, Design, Heap (Priority Queue) |
| 8 | Finding the Users Active Minutes | Medium | Older | Array, Hash Table |
| 9 | Flatten 2D Vector | Medium | Older | Array, Two Pointers, Design, Iterator |
| 10 | Flatten Nested List Iterator | Medium | Older | Stack, Tree, Depth-First Search, Design |
| 11 | Happy Number | Easy | Older | Hash Table, Math, Two Pointers, Floyd's Cycle Finding Algorithm |
| 12 | Implement Trie (Prefix Tree) | Medium | Older | Hash Table, String, Design, Trie |
| 13 | Insert Delete GetRandom O(1) | Medium | Older | Array, Hash Table, Math, Design |
| 14 | Integer to Roman | Medium | Older | Hash Table, Math, String |
| 15 | Kth Smallest Element in a Sorted Matrix | Medium | Older | Array, Binary Search, Sorting, Heap (Priority Queue) |
| 16 | LRU Cache | Medium | Older | Hash Table, Linked List, Design, Doubly-Linked List |
| 17 | Lowest Common Ancestor of a Binary Search Tree | Medium | Older | Tree, Depth-First Search, Binary Search Tree, Binary Tree |
| 18 | Masking Personal Information | Medium | Older | String |
| 19 | Max Points on a Line | Hard | Older | Array, Hash Table, Math, Geometry |
| 20 | Merge Intervals | Medium | Older | Array, Sorting, Quicksort |
| 21 | Merge k Sorted Lists | Hard | Older | Linked List, Divide and Conquer, Heap (Priority Queue), Merge Sort |
| 22 | Minimum Elements to Add to Form a Given Sum | Medium | Older | Array, Greedy |
| 23 | Minimum Genetic Mutation | Medium | Older | Hash Table, String, Breadth-First Search, Bidirectional Search |
| 24 | Minimum Number of Steps to Make Two Strings Anagram | Medium | Older | Hash Table, String, Counting |
| 25 | Multiply Strings | Medium | Older | Math, String, Simulation |
| 26 | Number of Black Blocks | Medium | Older | Array, Hash Table, Enumeration |
| 27 | Number of Connected Components in an Undirected Graph | Medium | Older | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory |
| 28 | One Edit Distance | Medium | Older | Two Pointers, String |
| 29 | Pascal's Triangle | Easy | Older | Array, Dynamic Programming |
| 30 | Permutation Sequence | Hard | Older | Math, Recursion |
| 31 | Process Tasks Using Servers | Medium | Older | Array, Heap (Priority Queue) |
| 32 | Regular Expression Matching | Hard | Older | String, Dynamic Programming, Recursion |
| 33 | Remove All Occurrences of a Substring | Medium | Older | String, Stack, Simulation |
| 34 | Reverse Linked List | Easy | Older | Linked List, Recursion |
| 35 | The Skyline Problem | Hard | Older | Array, Divide and Conquer, Binary Indexed Tree, Segment Tree |
| 36 | Time Needed to Buy Tickets | Easy | Older | Array, Queue, Simulation |
| 37 | Trapping Rain Water | Hard | Older | Array, Two Pointers, Dynamic Programming, Stack |
| 38 | Trapping Rain Water II | Hard | Older | Array, Breadth-First Search, Heap (Priority Queue), Matrix |
| 39 | Tweet Counts Per Frequency | Medium | Older | Hash Table, String, Binary Search, Design |
| 40 | Valid Parentheses | Easy | Older | String, Stack, Bracket Sequences |
Sources¶
- liquidslr/leetcode-company-wise-problems and snehasishroy/leetcode-companywise-interview-questions, merged by scripts/build_question_data.py.
Next: More companies