### LeetCode - Crawler Log Folder Solution - The Coding Shala

Home >> LeetCode >> Crawler Log Folder

In this post, we will learn how to solve LeetCode's Crawler Log Folder problem and will implement Crawler Log Folder Java Solution.

## Crawler Log Folder Problem

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).
• "./": Remain in the same folder.
• "x/": Move to the child folder named x (This folder is guaranteed to always exist).
You are given a list of strings logs where logs[i] is the operation performed by the user at the ith step. The file system starts in the main folder, then the operations in logs are performed. Return the minimum number of operations needed to go back to the main folder after the change folder operations.

Input: logs = ["d1/","d2/","../","d21/","./"]
Output: 2
Explanation: Use this change folder operation "../" 2 times and go back to the main folder.

## Crawler Log Folder Java Solution

Approach 1:
Straight forward solution using the loop.

Java Program:

```class Solution {
public int minOperations(String[] logs) {
int ans = 0;
for(int i=0; i<logs.length; i++){
if(logs[i].equals("./")) continue;
else if(logs[i].equals("../")) ans--;
else ans++;
if(ans < 0) ans =0;
}
if(ans < 0) return 0;
return ans;
}
}
```

Other Posts You May Like