Skip to content

Target Placement Papers 2024

Overview

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.

Download 2024 Placement Papers

Target exam pattern 2024

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:

  • Updated question patterns
  • Increased focus on practical skills
  • New evaluation criteria

Target Placement Papers 2024 - actual questions & solutions

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.

Question 1: merge two sorted lists

Show solution

Problem Statement: Merge two sorted linked lists and return a new sorted list.

Example:

Input: 1→2→4 , 1→3→4
Output: 1→1→2→3→4→4

Solution (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)

Question 2: maximum subarray sum

Show solution

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)

Question 3: 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 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: true

Solution (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: climbing stairs

Show solution

Problem Statement: You can climb 1 or 2 steps. How many distinct ways to climb n stairs?

Example:

Input: n = 4
Output: 5

Solution (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 6: check palindrome

Show solution

Problem Statement: Return true if the string reads the same forward and backward (ignore case).

Example:

Input: "Level"
Output: true

Solution (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 7: 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 = 9
Output: [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 8

Q8: Which normal form removes transitive dependency?

Solution:

1NF: atomic values. 2NF: no partial dependency. 3NF: no transitive dependency.

Answer: 3NF

Question 9

Q9: Virtual memory is typically implemented using?

Solution:

OS uses demand paging (and sometimes segmentation) to implement virtual memory.

Answer: Demand paging

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 protocol is connection-oriented at the transport layer?

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

Key insights from 2024 Target Online Assessment

  1. Aptitude Section is Critical: Must perform well in quantitative and logical reasoning
  2. Technical MCQs: Strong emphasis on domain knowledge, retail/e-commerce basics
  3. Verbal Ability: Important for communication-focused roles
  4. Time Management: 20-25 aptitude in 30-40 min + 15-20 technical in 25-30 min + 10-15 verbal in 15-20 min
  5. Success Rate: Only 20-25% cleared assessment and advanced to interviews
  6. Platform: Target assessment platform
  7. Focus Areas: Quantitative aptitude, logical reasoning, domain knowledge, verbal ability

Target 2024 interview experiences

Based on candidate experiences from 2024 Target interviews:

2024 Interview Process:

  1. Online Assessment (60-90 minutes): Aptitude (20-25) + Technical (15-20) + Verbal (10-15)
  2. Technical Interview (45-60 minutes): Domain knowledge, retail/e-commerce concepts, problem-solving
  3. HR Interview (30-45 minutes): Behavioral questions, company fit, motivation, retail industry interest

Common 2024 Interview Topics:

  • Aptitude: Quantitative reasoning, logical reasoning, time and work
  • Technical: Domain knowledge, retail/e-commerce concepts, problem-solving
  • Verbal: Comprehension, grammar, communication skills
  • Behavioral: Problem-solving approach, teamwork, motivation, retail industry interest

Success Tips:

  • Strong aptitude performance is essential - practice quantitative and logical reasoning
  • Understand retail/e-commerce basics and Target’s business model
  • Prepare behavioral examples using STAR format
  • Understand Target’s business model and retail services
  • Practice verbal ability - comprehension and grammar

For detailed interview experiences, visit Target Interview Experience page.

Preparation tips for Target 2024 pattern

  1. Master Aptitude: Focus on quantitative, logical reasoning - practice regularly
  2. Domain Knowledge: Basic understanding of retail/e-commerce and Target’s business model
  3. Practice Previous Year Papers: Solve Target assessment papers from 2020-2024 to understand patterns
  4. Time Management: Practice completing 20-25 aptitude questions in 30-40 minutes
  5. Verbal Ability: Practice comprehension and grammar
  6. Behavioral Preparation: Prepare examples using STAR format - leadership, teamwork, retail interest
  7. Mock Tests: Take timed practice tests to improve speed and accuracy
  8. Retail Focus: Understand retail industry trends and Target’s services
  9. Communication Skills: Practice articulating thoughts clearly
  10. Business Awareness: Stay updated with Target’s business initiatives and industry trends

Comments & Suggestions

Similar companies

Walmart · Amazon · Flipkart · Meesho · Blinkit · Google