2025 papers
Twitter (X) Placement Papers 2024
Overview
This page collects Twitter (X) placement papers from 2024 with previous-year questions, solutions, and the 2024 exam pattern. It is useful when you want real drive history: what the OA looked like, which question types repeated, and how solutions were approached. Work through the papers below to build speed and accuracy, then compare against newer 2025 material so your prep matches both established Twitter (X) patterns and the latest shifts.
Twitter Online Assessment 2024 pattern
| Section | Questions | Time | Difficulty |
|---|---|---|---|
| Coding Problems | 2-3 | 90 min | Medium-Hard |
X Placement Papers 2024 - actual questions & solutions
This section contains practice questions styled on X (Twitter) placement papers 2024 (previous-year pattern), with worked solutions. Use them as timed sectional drills - from student reports drives vary by college and role, so treat this as a high-signal practice bank, not an official paper dump.
Question 1: reverse a string
Show solution
Problem Statement: Given a string, return it reversed.
Example:
Input: "placement"Output: "tnemecalp"Solution (Java):
public String reverse(String s) { return new StringBuilder(s).reverse().toString();}Time Complexity: O(n)
Space Complexity: O(n)
Question 2: check palindrome
Show solution
Problem Statement: Return true if the string reads the same forward and backward (ignore case).
Example:
Input: "Level"Output: trueSolution (Java):
public boolean isPalindrome(String s) { s = s.toLowerCase(); int i = 0, j = s.length() - 1; while (i < j) { if (s.charAt(i++) != s.charAt(j--)) return false; } return true;}Time Complexity: O(n)
Space Complexity: O(1)
Question 3: climbing stairs
Show solution
Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?
Example:
Input: n = 4Output: 5Solution (Java):
public int climbStairs(int n) { if (n <= 2) return n; int a = 1, b = 2; for (int i = 3; i <= n; i++) { int c = a + b; a = b; b = c; } return b;}Time Complexity: O(n)
Space Complexity: O(1)
Question 4: detect cycle in linked list
Show solution
Problem Statement: Return true if the linked list has a cycle.
Example:
Input: 3→2→0→-4→(back to 2)Output: trueSolution (Java):
public boolean hasCycle(ListNode head) { ListNode slow = head, fast = head; while (fast != null && fast.next != null) { slow = slow.next; fast = fast.next.next; if (slow == fast) return true; } return false;}Time Complexity: O(n)
Space Complexity: O(1)
Question 5: valid parentheses
Show solution
Problem Statement: Given a string of brackets, determine if it is valid.
Example:
Input: "()[]{}"Output: trueSolution (Java):
public boolean isValid(String s) { Deque<Character> st = new ArrayDeque<>(); Map<Character, Character> pair = Map.of(')', '(', ']', '[', '}', '{'); for (char c : s.toCharArray()) { if (pair.containsValue(c)) st.push(c); else if (st.isEmpty() || st.pop() != pair.get(c)) return false; } return st.isEmpty();}Time Complexity: O(n)
Space Complexity: O(n)
Question 6: two sum
Show solution
Problem Statement: Given an array of integers and a target, return indices of two numbers that add up to target.
Example:
Input: nums = [2, 7, 11, 15], target = 9Output: [0, 1]Solution (Java):
public int[] twoSum(int[] nums, int target) { Map<Integer, Integer> map = new HashMap<>(); for (int i = 0; i < nums.length; i++) { int need = target - nums[i]; if (map.containsKey(need)) return new int[]{map.get(need), i}; map.put(nums[i], i); } return new int[]{};}Time Complexity: O(n)
Space Complexity: O(n)
Question 7: first non-repeating character
Show solution
Problem Statement: Return the first non-repeating character in a string, or ‘_’ if none.
Example:
Input: "swiss"Output: 'w'Solution (Java):
public char firstUnique(String s) { int[] freq = new int[256]; for (char c : s.toCharArray()) freq[c]++; for (char c : s.toCharArray()) if (freq[c] == 1) return c; return '_';}Time Complexity: O(n)
Space Complexity: O(1)
Question 8
Q8: Which protocol is connection-oriented at the transport layer?
Solution:
TCP is connection-oriented; UDP is connectionless.
Answer: TCP
Question 9
Q9: Time complexity of binary search on a sorted array of n elements is?
Solution:
Each step halves the search space → O(log n).
Answer: O(log n)
Question 10
Q10: Which SQL clause filters grouped rows after GROUP BY?
Solution:
HAVING filters aggregates; WHERE filters rows before grouping.
Answer: HAVING
Question 11
Q11: Which normal form removes transitive dependency?
Solution:
1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.
Answer: 3NF
Key insights from 2024 twitter Online Assessment
- Coding Section is Critical: Must solve 2-3 coding problems correctly to advance
- Real-Time System Design: Strong emphasis on real-time systems and feed generation
- Time Management: 2-3 coding problems in 90 minutes requires excellent speed
- Success Rate: Only 10-15% cleared OA and advanced to interviews
- Platform: Twitter’s assessment platform or HackerRank
- Focus Areas: Arrays, trees, graphs, dynamic programming, real-time systems, feed algorithms
Twitter 2024 interview experiences
Based on candidate experiences from 2024 Twitter (X) interviews:
2024 Interview Process:
- Online Assessment (90 minutes): 2-3 coding problems
- Technical Phone Screen (45-60 minutes): Coding problems, algorithm discussions, system design
- Onsite Interviews (4-5 rounds, 45-60 minutes each):
- Coding rounds (2-3): Algorithms, data structures, problem-solving
- System Design rounds: Real-time feed systems, social media platforms, scalability
- Behavioral rounds: Problem-solving approach, innovation, teamwork
Common 2024 Interview Topics:
- Coding: Arrays, strings, trees, graphs, dynamic programming, feed generation algorithms
- System Design: Real-time feed systems, social media platforms, scalability, distributed systems
- Behavioral: Problem-solving, innovation, teamwork, impact
- Twitter Technologies: Feed generation, real-time systems, social media algorithms
2024 Interview Questions Examples:
- Tweet Feed Generation
- Design Twitter’s feed system (System Design)
- Design Twitter’s trending topics system (System Design)
- Real-time system design questions
Success Tips:
- Strong coding performance is essential - solve problems optimally
- Practice system design for real-time systems and social media platforms
- Prepare examples demonstrating innovation and problem-solving
- Learn Twitter’s products and real-time systems
- Practice explaining your thought process clearly
For detailed interview experiences, visit Twitter Interview Experience page.
Preparation tips for twitter 2024 pattern
- Master Coding Fundamentals: Focus on solving 2-3 coding problems correctly - arrays, trees, graphs, DP
- System Design Mastery: Learn real-time system design, feed generation, social media platforms
- Practice Previous Year Papers: Solve Twitter OA papers from 2020-2024 to understand patterns
- Time Management: Practice completing 2-3 coding problems in 90 minutes
- LeetCode Practice: Solve 200+ LeetCode problems focusing on arrays, strings, trees, graphs (medium-hard difficulty)
- Real-Time Systems: Understand real-time feed generation, social media algorithms, scalability
- Twitter Technologies: Learn feed generation, trending topics, real-time systems
- Behavioral Preparation: Prepare examples using STAR format - innovation, problem-solving, impact
- Mock Tests: Take timed practice tests to improve speed and accuracy
- Distributed Systems: Understand distributed systems, scalability, and real-time processing
Comments & Suggestions
Related resources
Practice 2024 papers to understand Twitter OA pattern and prepare effectively!

