1. https://leetcode.com/problems/rearrange-array-to-maximize-prefix-score (15/15 passed)

2. Given N strings that must match and M strings that must not match, construct a regex of at most 25 characters. (I didn't expected such question) (4/18 passed)

Is it enough to get shortlisted for interview?