Practice Reorder Data in Log Files

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

Medium#937

LeetCode Problem

Reorder Data in Log Files

Array String Sorting

Problem Statement

Each log begins with an identifier followed by space-separated content. A letter-log contains only lowercase-letter words after its identifier; a digit-log contains only digit words. Return all letter-logs first, sorted lexicographically by content and then by identifier for ties. Place digit-logs afterward in their original relative order.

Source: Reorder Data in Log Files on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

logs = ["dig1 8 1 5 1","let1 art can","dig2 3 6","let2 own kit dig","let3 art zero"]

Output

["let1 art can","let3 art zero","let2 own kit dig","dig1 8 1 5 1","dig2 3 6"]

# Example 2

Input

logs = ["a1 9 2 3 1","g1 act car","zo4 4 7","ab1 off key dog","a8 act zoo"]

Output

["g1 act car","a8 act zoo","ab1 off key dog","a1 9 2 3 1","zo4 4 7"]

Constraints

1 <= logs.length <= 100

3 <= logs[i].length <= 100

All the tokens of logs[i] are separated by a single space.

logs[i] is guaranteed to have an identifier and at least one word after the identifier.

Review your practice with PhantomCodeAI

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

Start Free