# [1598\. Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/)

:::spoiler Solution

class Solution {
public:
    int minOperations(vector<string>& logs)
    {
        int depth = 0;
        for (string log : logs)
        {
            if (log == "../")
            {
                depth = max(0, --depth);
            }
            else if (log != "./")
            {
                ++depth;
            }
        }
        return depth;
    }
};

- T: $O(n)$
- S: $O(1)$
:::