insidcode
ProblemsDuelLeaderboardStats
Sign In
  1. Home
  2. Problems
  3. Remove duplicate elements in-place from a sorted array and return the new length without allocating a secondary array.

Remove duplicate elements in-place from a sorted array and return the new length without allocating a secondary array.

Difficulty: Hard

Phase: 6 · Mixed Logical Challenges

XP Reward: 30 XP

Topics: Mixed Logical Challenges, Hard

Supported Languages: Python, JavaScript, C, C++, Java

Problem Description

Given sorted array of N integers, remove duplicates in-place and print the new length followed by space and the unique elements. Input Format: Read input from standard input (stdin). Output Format: Print the result to standard output (stdout).

Constraints

  • -10^9 <= N <= 10^9

Examples

Example 1

Input: 5 1 1 2 2 3

Output: 3 1 2 3

Explanation: Sample execution for input 5 1 1 2 2 3