Menu

Solving LeetCode 2553: Separate the Digits in an Array using Java
🖼️

Solving LeetCode 2553: Separate the Digits in an Array using Java

DEV Community·Jerin·6 months ago
#eKeQY6W8
#java#problem#example#algorithm#nums
Reading 0:00
15s threshold

Difficulty : Easy

Topics : Array, Simulation

Platform : Leetcode

Problem Statement

Given an array of positive integers nums, return an array answer that consists of the digits of each integer in nums after separating them in the same order they appear in nums.

To separate the digits of an integer is to get all the digits it has in the same order.

For example, for the integer 10921, the separation of its digits is [1,0,9,2,1].

Problem Statement Simplified

Deconstruct each digits in nums array and return inorder in answer array.

Mistakes and Learning

Added the modules value to final array list without reversing it - Learned: Created another arraylist and added the values to it and then reversed and added to the main arraylist

Example 1

Input: nums = [13,25,83,77] Output: [1,3,2,5,8,3,7,7] Explanation: - The separation of 13 is [1,3]. - The separation of 25 is [2,5]. - The separation of 83 is [8,3]. - The separation of 77 is [7,7]. answer = [1,3,2,5,8,3,7,7].…

Continue reading — create a free account

Join HashtagPLUS to read full articles, follow hashtags, vote, and join the conversation.