LinkedList Patternwise questions
Question Details
Linked List https://leetcode.com/problems/design-linked-list/ Normal Recursion(Given 1 LL) Simple Recursion Nothing else https://leetcode.com/problems/swapping-nodes-in-a-linked-list/ https://leetcode.com/problems/plus-one-linked-list/ https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/ Modifying the LL But the number of Nodes will be same Reversing the Linked List https://leetcode.com/problems/reverse-linked-list/ https://leetcode.com/problems/reverse-linked-list-ii/ https://leetcode.com/problems/palindrome-linked-list/ https://leetcode.com/problems/reverse-nodes-in-k-group/ https://leetcode.com/problems/print-immutable-linked-list-in-reverse/ Reordering the Nodes https://leetcode.com/problems/partition-list/ - IMP https://leetcode.com/problems/reorder-list/ https://leetcode.com/problems/swap-nodes-in-pairs/ https://leetcode.com/problems/rotate-list/ https://leetcode.com/problems/odd-even-linked-list/ Delete Nodes https://leetcode.com/problems/remove-nth-node-from-end-of-list/ https://leetcode.com/problems/remove-duplicates-from-sorted-list/ - if asked to...
Full Details
Linked List
https://leetcode.com/problems/design-linked-list/
Normal Recursion(Given 1 LL)
Simple Recursion Nothing else
https://leetcode.com/problems/swapping-nodes-in-a-linked-list/
https://leetcode.com/problems/plus-one-linked-list/
https://leetcode.com/problems/convert-binary-number-in-a-linked-list-to-integer/
Modifying the LL But the number of Nodes will be same
Reversing the Linked List
https://leetcode.com/problems/reverse-linked-list/
https://leetcode.com/problems/reverse-linked-list-ii/
https://leetcode.com/problems/palindrome-linked-list/
https://leetcode.com/problems/reverse-nodes-in-k-group/
https://leetcode.com/problems/print-immutable-linked-list-in-reverse/
Reordering the Nodes
https://leetcode.com/problems/partition-list/ - IMP
https://leetcode.com/problems/reorder-list/
https://leetcode.com/problems/swap-nodes-in-pairs/
https://leetcode.com/problems/rotate-list/
https://leetcode.com/problems/odd-even-linked-list/
Delete Nodes
https://leetcode.com/problems/remove-nth-node-from-end-of-list/
https://leetcode.com/problems/remove-duplicates-from-sorted-list/ - if asked to remove duplicates from unsorted list then Use HashMap. (Q in HashMap section)
https://leetcode.com/problems/remove-duplicates-from-sorted-list-ii/
https://leetcode.com/problems/remove-linked-list-elements/
Insert Node
1.https://leetcode.com/problems/insert-into-a-sorted-circular-linked-list
Given 2 or more LL
https://leetcode.com/problems/add-two-numbers/
https://leetcode.com/problems/add-two-numbers-ii
https://leetcode.com/problems/merge-two-sorted-lists/
https://leetcode.com/problems/merge-k-sorted-lists/ - IMP
https://leetcode.com/problems/intersection-of-two-linked-lists/
https://leetcode.com/problems/add-two-polynomials-represented-as-linked-lists/
Fast Pointer Slow Pointer(Cycle or middle ele)
https://leetcode.com/problems/linked-list-cycle/
https://leetcode.com/problems/middle-of-the-linked-list/
https://leetcode.com/problems/delete-the-middle-node-of-a-linked-list/
https://leetcode.com/problems/linked-list-cycle-ii/
Hash Table
https://leetcode.com/problems/copy-list-with-random-pointer/ - IMP
https://leetcode.com/problems/remove-duplicates-from-an-unsorted-linked-list/ - If asked in sorted then no need of hash table.
Design Some data struct using LL
https://leetcode.com/problems/lru-cache/
https://leetcode.com/problems/design-hashmap/
https://leetcode.com/problems/max-stack/
https://leetcode.com/problems/design-hashset/
https://leetcode.com/problems/design-browser-history - stk
https://leetcode.com/problems/design-twitter - no need of LL
https://leetcode.com/problems/design-circular-queue
Murge Sort on List
https://leetcode.com/problems/sort-list/
LL + Tree Q\'s
https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list/
https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list/
https://leetcode.com/problems/maximum-twin-sum-of-a-linked-list/
https://leetcode.com/problems/delete-node-in-a-linked-list/
To Do :
https://leetcode.com/problems/all-oone-data-structure
https://leetcode.com/problems/lfu-cache
https://leetcode.com/problems/design-a-text-editor
About This Question
This is a reported interview question from a twitter/x interview for a swe role reported in 2024.
It covers the following topics: Hash Table, Strings, Binary Tree, Linked List, Sorting, Binary Search, Queue, Recursion, Stack .
About Twitter/X Interview Reports
This question was reported by a candidate who interviewed at Twitter/X. LeakCode aggregates interview reports from 10+ sources, including 1Point3Acres, Glassdoor, LeetCode Discuss, Blind, Reddit, Indeed, and Nowcoder. Each report is translated where necessary, deduplicated against existing entries, and tagged by company, role, round type, and reporting date.
Use this question as one calibration data point, not a memorization target. Companies typically rotate their question pools every 2-4 months; the exact wording of a 2024 question may differ from what you encounter today. The underlying pattern, difficulty level, and follow-up depth at Twitter/X are the higher-signal extractions to take from this report.
For broader preparation context, the Twitter/X interview process typically includes a recruiter screen, one or two technical phone screens, and a 4-5 round on-site loop covering coding, system design (at L4+ levels), and behavioral. Reports tagged on LeakCode show the round-by-round distribution and typical difficulty calibration. To browse questions filtered by round type and seniority, use the company hub linked above.
How To Practice This Type of Question
Solve similar problems on LeetCode under timed conditions (25-35 minutes per medium difficulty). The goal is pattern recognition: recognize the underlying technique (sliding window, two-pointer, BFS, memoized recursion, etc.) within 60-90 seconds of reading. Strong candidates verbalize their hypothesis out loud before coding, then iterate based on feedback. Weak candidates dive into implementation immediately, lose time on the wrong approach, and run out of time for follow-ups.
Companies update their question pools every 2-4 months. The exact wording of any given question may have been retired by the time you interview. Focus your prep on the pattern, not the specific problem. The patterns that appear in Twitter/X reports consistently are the ones worth investing in; one-off niche problems are not.
During Your Twitter/X Round
Apply the standard interview round template: clarify requirements (2-3 minutes), state your approach out loud and confirm direction with the interviewer (3-5 minutes), code with narration (15-25 minutes), test with concrete examples including edge cases (5 minutes), discuss optimization or trade-offs if time permits (5 minutes). This template is universally accepted across FAANG and adjacent companies; deviating from it produces weaker interviewer feedback signal.
The single most predictive failure mode in Twitter/X reports tagged "no hire": not asking clarifying questions. Interviewers are explicitly trained to weight this. Strong candidates ask 3-5 clarifying questions even on problems that look obvious; weak candidates dive into code immediately. The clarifying-question check is often the first signal recorded in the interviewer's written notes.