These six problems mix the Expert unit's structures on new data. The skill is choosing: a Fenwick tree when values change and you need counts or sums by position or value, a segment tree when the combine step cannot be undone, sorted positions plus binary search when the data is fixed, and a plain queue or list when the operations only touch the ends.
Before coding, say the cost you are aiming for and why a simpler structure is not enough. Two of these problems are solved best without any tree at all, and an interviewer will notice if you reach for one anyway.
Pick the lightest structure that meets the cost target.