1. A 20-minute personality assessment that required you to select an option, even if none of the options qualified for you.

2. An online self-assessment which took 3 hours and you couldn't get up for. This involved a 2-minute quiz where you have to answer 10 math questions. The questions are easy, but 2 minutes may not be enough. I have no idea what this was testing for.

Then a 20-question quiz covering basic syntax questions for a completely made-up programming language. Most are very easy, but the language was obtuse and weird. Again, I have no idea what skills were being tested for this.

Last are 4 basic algorithm questions. Pretty basic—the most complex data structure I used was a hash table. You can't compile or run your code at all, so that was a bummer.

Given a number and a list of integers, for example [3, 2, 4, 1], return a string where you have the last 3 numbers, a hyphen, then the next 2 to last numbers, then a hyphen, then the next 4 numbers and hyphen, and then the last number.

So if the number is: 1234567890 and the input vector is [3, 2, 4, 1], you would return: 890-67-2345-1

Given a list of ints, determine how many long sequences the list has. A long sequence is defined as a sequence in the list where A[i] < A[i + 1] and must be of length at least 3.

Given a number, return whether or not it is a colorful number. For example, 324 is a colorful number because if we break it into all substrings: [3], [2], [4], [32], [24], [324], then the product of all ints in a substring is unique. So you just have to find all substrings, then find all the products in those substrings and keep track of duplicates.