Courses

Jobs

Interviews

Discussions

Target Interview Questions

Showing 6 questions

Ranking

A question's ranking corresponds to how commonly it's asked by Target. The higher the ranking, the more likely you'll encounter it in a Target interview.

Question

Frequency

Difficulty

Longest Common Prefix

Find the longest string that is a prefix of all strings in a given array. If no common prefix exists, return an empty string.

ArraysStrings

Very likely

If you have a Target interview, it's very likely that you will get this question

Easy

#1. Longest Common Prefix

Easy

Find the longest string that is a prefix of all strings in a given array. If no common prefix exists, return an empty string.

ArraysStrings

This question is very likely to be asked in your Target interview

Sort Colors

You're given an array containing only 0s, 1s, and 2s. Sort the array in place so that elements of the same value are grouped together.

ArraysTwo Pointers

Somewhat likely

If you have a Target interview, you might get this question

Medium

#2. Sort Colors

Medium

You're given an array containing only 0s, 1s, and 2s. Sort the array in place so that elements of the same value are grouped together.

ArraysTwo Pointers

This question is somewhat likely to be asked in your Target interview

Longest Palindromic Substring

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

StringsDynamic Programming

Somewhat likely

If you have a Target interview, you might get this question

Medium

#3. Longest Palindromic Substring

Medium

Find the longest palindromic substring within a given string. A palindromic substring reads the same forwards and backward.

StringsDynamic Programming

This question is somewhat likely to be asked in your Target interview

Maximum Subarray

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

ArraysDynamic ProgrammingGreedy Algorithms

Not likely

If you have a Target interview, it's unlikely that you will get this question

Medium

#4. Maximum Subarray

Medium

Find the contiguous subarray within a given array of numbers which has the largest sum. Return the sum of this subarray.

ArraysDynamic ProgrammingGreedy Algorithms

This question is not likely to be asked in your Target interview

Product of the Last K Numbers

Design a class to efficiently calculate the product of the last k numbers added to a stream. You need to support adding new numbers and querying the product of the last k numbers at any time.

ArraysSliding Windows

Not likely

If you have a Target interview, it's unlikely that you will get this question

Medium

#5. Product of the Last K Numbers

Medium

Design a class to efficiently calculate the product of the last k numbers added to a stream. You need to support adding new numbers and querying the product of the last k numbers at any time.

ArraysSliding Windows

This question is not likely to be asked in your Target interview

Longest Path With Different Adjacent Characters

Find the longest path in a tree where no two adjacent nodes on the path have the same character. The tree is defined by parent-child relationships and each node has an associated character.

ArraysTreesGraphsRecursion

Not likely

If you have a Target interview, it's unlikely that you will get this question

Hard

#6. Longest Path With Different Adjacent Characters

Hard

Find the longest path in a tree where no two adjacent nodes on the path have the same character. The tree is defined by parent-child relationships and each node has an associated character.

ArraysTreesGraphsRecursion

This question is not likely to be asked in your Target interview