Target 2024 paper 1
Complete Target placement paper with aptitude questions and solutions
This page collects Target 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 Target patterns and the latest shifts.
Target 2024 paper 1
Complete Target placement paper with aptitude questions and solutions
Target 2024 paper 2
Additional 2024 Target paper with detailed solutions
Target 2024 paper 3
Another 2024 Target paper with comprehensive solutions
| Section | Questions | Time | Difficulty | Focus Areas |
|---|---|---|---|---|
| Aptitude | 20-25 | 30-40 min | Medium | Quantitative, logical reasoning |
| Technical | 15-20 | 25-30 min | Medium | Domain knowledge, basics |
| Verbal Ability | 10-15 | 15-20 min | Easy-Medium | Comprehension, grammar |
Total: 50-60 questions, 60-90 minutes
Key Changes in 2024:
This section contains practice questions styled on Target 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.
Problem Statement: Merge two sorted linked lists and return a new sorted list.
Example:
Input: 1→2→4 , 1→3→4Output: 1→1→2→3→4→4Solution (Java):
public ListNode mergeTwoLists(ListNode a, ListNode b) { ListNode dummy = new ListNode(0), cur = dummy; while (a != null && b != null) { if (a.val <= b.val) { cur.next = a; a = a.next; } else { cur.next = b; b = b.next; } cur = cur.next; } cur.next = (a != null) ? a : b; return dummy.next;}Time Complexity: O(n + m)
Space Complexity: O(1)
Problem Statement: Find the contiguous subarray with the largest sum.
Example:
Input: [-2, 1, -3, 4, -1, 2, 1, -5, 4]Output: 6 // [4, -1, 2, 1]Solution (Java):
public int maxSubArray(int[] nums) { int best = nums[0], cur = nums[0]; for (int i = 1; i < nums.length; i++) { cur = Math.max(nums[i], cur + nums[i]); best = Math.max(best, cur); } return best;}Time Complexity: O(n)
Space Complexity: O(1)
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)
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)
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)
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)
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)
Solution:
1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.
Answer: 3NF
Solution:
OS uses demand paging (and sometimes segmentation) to implement virtual memory.
Answer: Demand paging
Solution:
HAVING filters aggregates; WHERE filters rows before grouping.
Answer: HAVING
Solution:
TCP is connection-oriented; UDP is connectionless.
Answer: TCP
Hiring volume
2024 Data: Target hired 200-500 candidates from top engineering colleges in 2024. The company conducted placement drives at 30+ colleges across India.
Salary packages
2024 Packages: ₹15-25 LPA for freshers
Process changes
2024 Updates: Updated online assessment platform, new interview formats
Based on candidate experiences from 2024 Target interviews:
2024 Interview Process:
Common 2024 Interview Topics:
Success Tips:
For detailed interview experiences, visit Target Interview Experience page.