Q1) Given list of transactions, return a list of users who were involved in transaction more then equal to the threshold number of times. Return list of user names in sorted order of thier names.
Transactions -> (User1, User2, Amount)
Eg. Transactions - [[88, 90, 100], [90, 88, 200], [90, 1, 60]], Threshold = 2
Return = [88, 90] Since number of transactions involving 88 -2, involving 90-3 involving 1 -1.

Q2) https://leetcode.com/problems/minimum-difficulty-of-a-job-schedule