Do not mess it up

There arenpeopleand 40 types of hats labeled from 1 to 40.Given a list of list of integershats, wherehats[i]is a list of all hats preferredby thei-thperson.Return the number of ways that ...

A string is called ahappy prefixif is anon-emptyprefix which is also a suffix (excluding itself).Given a strings. Return thelongest happy prefixofs.Return an empty string if no such prefi...

Given abinary treeroot, the task is to return the maximum sum of all keys ofanysub-tree which is also a Binary Search Tree (BST).Assume a BST is defined as follows:The left subtree of a node c...

We havenjobs, where every jobis scheduled to be done fromstartTime[i]toendTime[i], obtaining a profitofprofit[i].You're given thestartTime,endTimeandprofitarrays,you need to output th...

A die simulator generates a random number from 1 to 6 for each roll.You introduced a constraint to the generator such that it cannot roll the numberimore thanrollMax[i](1-indexed)consecutivetim...

Implement wildcard pattern matching with support for'?'and'*'.'?' Matches any single character.'*' Matches any sequence of characters (including the empty sequence).The matching should cover t

Return thelengthof the shortest, non-empty, contiguoussubarray ofAwith sum at leastK.If there is no non-empty subarray with sum at leastK, return-1.Example 1:Input: A = [1], K = 1Ou...