Reorder Data in Log Files — Day 13(Python)

Image for post
Image for post
Photo by Viktor Talashuk on Unsplash

Today we will be looking into one of Amazon’s popular coding questions.

937. Reorder Data in Log Files

You have an array of logs. Each log is a space-delimited string of words.

For each log, the first word in each log is an alphanumeric identifier. Then, either:

  • Each word after the identifier will consist only of lowercase letters, or;
  • Each word after the identifier will consist only of digits.

We will call these two varieties of logs letter-logs and digit-logs. It is guaranteed that each log has at least one word after its identifier.

Reorder the logs so that all of the letter-logs come before any digit-log. The letter-logs are ordered lexicographically ignoring identifiers, with the identifier used in case of ties. The digit-logs should be put in their original order.

Return the final order of the logs.

Example 1:

Constraints:

  1. 0 <= logs.length <= 100
  2. 3 <= logs[i].length <= 100
  3. logs[i] is guaranteed to have an identifier and a word after the identifier.

Solution

The significant part of solving this problem is learning to use the split function and lambda in python.

  1. Create two lists; letter_log and digit_log, one that includes letters and the other that includes numerals. We will use the split function to separate the identifier and the next part.
  2. Using the isdigit function, identify if the second part is digit or alphabets and accordingly place it in the letter_log list or digit_log list.

3. Sort the letter_log list based on the part after the identifier. I have used lambda to do so.

4. Append the sorted letter_log list and the digit_log list to the output list.

The complete code is as below

Complexity Analysis

Time Complexity

The time complexity to sort string takes O(NlogN). Hence time complexity of the above algorithm is O(NlogN).

Space Complexity

We are using additional storage space while separating the digit log and letter log and the size of both the lists will not exceed N. Hence Space complexity is O(N).

Software Engineer. Find me @ www.linkedin.com/in/annamariya-jt

Get the Medium app

A button that says 'Download on the App Store', and if clicked it will lead you to the iOS App store
A button that says 'Get it on, Google Play', and if clicked it will lead you to the Google Play store