高频题（0）
1. Folder access
Folder access题。
Follow up 1：移除access set里冗余的folder。
Follow up 2：给出一个nolnheritFolder set，去检查用户对一个folder有没有access.
Follow up 1：移除access set里冗余的folder。
Follow up 2：给出一个nolnheritFolder set，去检查用户对一个folder有没有access.
2. Feasibility of Building Construction
Given a series of obstacle and query arrays, where [1, x] represents an obstacle at position x, and [2, x, x+i] represents a query to check if a building can be constructed from position x to position x+i without encountering any obstacles. If construction is not possible due to an obstacle, return '0', otherwise return '1'. For example, given the input [[1, 2], [1, 5], [2, 3, 5], [2, 5, 1]], the output should be '10'.
3. Maximum Fish Caught with Baits
Given two arrays, one representing the size of each fish ('fish') and the other representing the size of each bait ('baits'), where a bait can only catch fish larger than its size (fish equal to or smaller than the bait cannot be caught), and each bait can catch at most three fish, determine the maximum number of fish that can be caught using all the baits.
4. Count Non-Equal Elements After the First Two
Given an array 'arr', count the number of elements starting from the third element that are not equal to the first and second elements of the array.
5. Top N Outgoing Transactions
In the context of the bank system design, implement a feature to retrieve the top N outgoing transactions.
