johngaitho05
/ String Based File System (Coding Interview Question)
Last active
April 9, 2020 07:31
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| def find_longest_path(s): | |
| i = j = 0 | |
| tabs = 0 | |
| paths = [] | |
| while j < len(s): | |
| if s[j] == '\n': | |
| if '.' in s[i:j]: | |
| index = i - (tabs + 1) | |
| paths.append(find_path(s, index, tabs, j-i)) | |
| if s[j] == '\t': |