The class uses a novel system where the success of an individual is assigned to a symbol. These symbols have the following precedence:

A > B > C > D > E > F

The symbols are collected and fed into the assessment robot. The success of the class is determined in the following way, with the output in green at the end:

"AAABBCDDEFF"

Sometimes it is ambiguous what the output is. In this case , the assessment robot observes the precedence given:

"AAABCCCDDEE" Show More

4. Question 4

Your colleagues often bring a few books to the office to read, then put them into shared book shelves, so other people have the chance to read it as well. After some days, the shelves have become messier and messier. As the office manager you are tasked to develop a function to sort them.

As the basic information of a book, the name, author and edtion will be recorded.
The fun ction will recognize different books as following: Show More

You are a part of the World of Wizards—a global society of magicians. It's your task to create a "warped-spell" that helps the society ensure the authenticity and secrecy of its members.

All the members meet once a month at a secret club. In order to ensure the authenticity of members, each member is sent a "secret" number of 1-7 digits, 10 days before the meeting.

On the meeting day, each m ember has to present a new "warped" number, which is made by casting a warped-spell on the "secret" received 10 days ago.

The "warped" number must have the following magical attributes:

1. Must be strictly 4 - 7 digits in length, i.e., numbers from 1000 to 9999999.
2. Must always be greater than the secret itself.
3. Must have mirror-like characteristics, as shown below: Show More

1. Question 1

You've just started as a trainer in Thoughtworks University, and you want to make a good first impression. You start investigating how to make it easier to organise the coding sessions. It turns out that trainers are spending a lot of their time finding out the average confidence of the participants.

The coding sessions are organised based on how confident the participants are with programming. This is a self-score rating on a scale of 0 to 9. To save having to count how many participants there are, the trainers always prepend this number to the list of participant confidence ratings.

You also find that coding sessions are done in pairs. When there are an odd number of participants, the overall confidence can be determined using the following flow chart: Show More

How to Attempt?
Chocolate Arrangement
Alex loves chocolate a lot. His brother Sam gifts him 2^N boxes of chocolate. These boxes are arranged in 2 rows denoted by 2 arrays A and B both of size N. Each box of chocolate contains some number of chocolates which is represented by A[i] and B[i] (for 1 <= i <= N).
Alex wants the boxes of chocolate in those 2 rows to be arranged in such a way that the boxes containing an equal number of chocolates are placed at the same index i.e. if A[x] and B[y] are equal, then x should be equal to y. You have to help Alex arrange the rows of boxes such that the maximum number of pairs of equal boxes can be placed at the same index, in the manner that Alex wants.
Return the maximum number of pairs of boxes that can be successfully arranged in the manner specified above.
Note: You can rearrange the row only by cyclically shifting the row to the left or to the right. A single cyclic shift to the left is an operation that sets A[0] = A[1], A[1] = A[2], ..., A[N-1] = A[0] simultaneously, and a single Show More