Today we have a doozy for ya. We’ll be dealing with file system paths. Got what it takes? Post your answer in a github gist and comment the link below.
Suppose we represent our file system by a string in the following manner:
dir subdir1 subdir2 file.ext
dircontains an empty sub-directory
subdir1and a sub-directory
subdir2containing a file
ext\n\t\tsubsubdir1\n\ tsubdir2\n\t\tsubsubdir2\n\t\ t\tfile2.ext"
dir subdir1 file1.ext subsubdir1 subdir2 subsubdir2 file2.ext
dircontains two sub-directories
subdir1contains a file
file1.extand an empty second-level sub-directory
subdir2contains a second-level sub-directory
subsubdir2containing a file
We are interested in finding the longest (number of characters) absolute path to a file within our file system. For example, in the second example above, the longest absolute path is
"dir/subdir2/subsubdir2/file2., and its length is 32 (not including the double quotes).
Given a string representing the file system in the above format, return the length of the longest absolute path to a file in the abstracted file system. If there is no file in the system, return 0.
The name of a file contains at least a period and an extension.
The name of a directory or sub-directory will not contain a period.