Reorder Data in Log Files

MediumStringssorting

Solve this the way you would in the interview: out loud, on a timer, with an AI interviewer asking follow-ups while you code. You get a scored report at the end.

Practice this as a mock interviewFree to start, no account needed

Problem

Each string in logs is a log line: an **identifier** followed by one or more space-separated words. Every word after the identifier is made entirely of lowercase letters (a **letter-log**) or entirely of digits (a **digit-log**). Identifiers are alphanumeric. Reorder the logs so that: - all letter-logs come before all digit-logs; - letter-logs are sorted by their content (everything after the identifier) as plain strings, and logs with identical content are ordered by identifier; - digit-logs keep their original relative order. Return the reordered list.

Examples

Input: logs = ["a1 9 2 3","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","zo4 4 7"]
Contents "act car" < "act zoo" < "off key dog"; the digit-logs follow in input order.
Input: logs = ["b2 hi there","a7 hi there","c 5 5"]
Output: ["a7 hi there","b2 hi there","c 5 5"]
Equal contents, so identifier a7 comes before b2.

Constraints

  • 1 <= logs.length <= 100
  • 3 <= logs[i].length <= 100
  • Tokens are separated by single spaces with no leading or trailing spaces
  • Each log has an identifier and at least one word after it

What the interviewer grades

A correct solution is one of five scores. The report also grades problem understanding (did you clarify inputs and edge cases before coding), problem solving, communication while you work, code quality, and testing. See a sample report, or read up on the pattern in the lessons.

More sorting problems