Crawler Log Folder Problem

Crawler Log Folder Problem — ExecCode Easy DSA Practice

Solve the Crawler Log Folder problem on ExecCode. Free online easy DSA practice in Arrays - Logic Building. Write and run code in Java, C++, Python — no signup required to run.

Problem description

Description You are given a list of strings logs where logs[i] is the operation performed by the user at the i^th step. Your task is to compute the required answer and return the minimum number of operations needed to go back to the main folder after the change folder operations. The Leetcode file system keeps a log each time some user performs a change folder operation. The operations are described below: - "../" : Move to the parent folder of the current folder. (If you are already in the main folder, remain in the same folder).

Examples

Input {"logs": ["d1/", "d2/", "../", "d21/", "./"]}; Output 2. Input {"logs": ["d1/", "d2/", "./", "d3/", "../", "d31/"]}; Output 3

Constraints

1 <= logs.length <= 10^3 2 <= logs[i].length <= 10 logs[i] contains lowercase English letters, digits, '.', and '/'. logs[i] follows the format described in the statement. Folder names consist of lowercase English letters and digits.

Practice Crawler Log Folder free on ExecCode. Browse DSA problems, topic map, and placement guides.