| # | Title | Solutions | Video | Difficulty | Tag

|-----|----------------|---------------|--------|-------------|-------------

|1601|[Maximum Number of Achievable Transfer Requests](https://leetcode.com/problems/maximum-number-of-achievable-transfer-requests/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1601.java)||Hard|Backtracking|

|1598|[Crawler Log Folder](https://leetcode.com/problems/crawler-log-folder/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1598.java)||Easy|Stack|

|1592|[Rearrange Spaces Between Words](https://leetcode.com/problems/rearrange-spaces-between-words/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1592.java)||Easy|String|

|1588|[Sum of All Odd Length Subarrays](https://leetcode.com/problems/sum-of-all-odd-length-subarrays/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1588.java)||Easy|Array|

classSolution {

intmax =0;

publicintmaximumRequests(intn,int[][]requests) {

helper(requests,0,newint[n],0);

returnmax;

}

privatevoidhelper(int[][]requests,intindex,int[]count,intnum) {

if (index ==requests.length) {

for (inti :count) {

if (0 !=i) {

return;

}

}

max =Math.max(max,num);

return;

}

count[requests[index][0]]++;

count[requests[index][1]]--;

helper(requests,index +1,count,num +1);

count[requests[index][0]]--;

count[requests[index][1]]++;

helper(requests,index +1,count,num);

}

}