Skip to content

Practice Split the Array

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Easy#3046
LeetCode Problem

Split the Array

Problem Statement

Given an even-length integer array nums, determine whether all its elements can be partitioned into two arrays of equal length such that neither resulting array contains a repeated value. Return true if such a partition exists, otherwise false.

Source: Split the Array on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input
nums = [1,1,2,2,3,4]
Output
true

# Example 2

Input
nums = [1,1,1,1]
Output
false

Constraints

1 <= nums.length <= 100
nums.length % 2 == 0
1 <= nums[i] <= 100

Related LeetCode Problems

Practice more problems similar to Split the Array.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.