1. Question 1
Given a chessboard of n rows (top to bottom) and n columns (left to right). In each move, a knight moves either:
2 column positions and 1 row position
2 row positions and 1 column position
In other words, a move is 2 steps along one axis and 1 step along a perpendicular axis.
Given a starting position A and ending position B, calculate the minimum number of moves needed by the k night to move from A to B if it is possible. If it is not possible, return -1. All moves must remain within the chessboard.

Example
n = 9
startRow = 4
startCol = 4
endRow = 4
endCol = 8

The chessboard has a size of 9 x 9.
Starts at the position (startRow, startCol) = (4, 4).
- Move 1 step up or down, then 2 steps right to reach either the position (3,6) or (5,6).
- Move 2 steps right and 1 step down or up as... Show More

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

The Amazon warehouse receives a multitude of packages every day, each assigned a unique identifier from 1 to n. The warehouse manager must sort the packages, not by their identifiers, but rather through a specific process defined by a permutation sorterOrder that ensures optimal processing.

Initially, the number of sorted packages, sortedCount, is zero. In each operation, the manager sifts thro ugh the packages from left to right. If the current package's identifier aligns with the next one to be sorted (i.e., sorterOrder[i] = sortedCount + 1), the manager sorts it and increments sortedCount by one. If the current package is not next in the sorting sequence, the manager overlooks it.

Determine the number of operations required by the manager to sort all the packages. One operation indicates a complete check from the first package to the last.

Note: A permutation is a sequence consisting of integers from 1 to n, of length n, containing each integer exactly once. For example, [1, 3, 2] is a permutation, while [1, 2, 1] is not.

Example 1:
n = 5
sorterOrder = [5, 3, 4, 1, 2]

Initially sortedCount = 0. In the first operation, the manager does the following: Show More

2. Code Question 2

In Amazon's vast inventory system, there's a need to ensure the efficient organization of product codes, represented by the sequence productSeq.

The product codes are categorized using characters 'a' through 'g'. For better management, a substring of product codes is considered valid if the count of each character within the substring does not exceed the number of distinct characters present.

Your task is to determine the number of valid substrings in productSeq that meet this criteria.

A string a is considered a substring of b if a can be obtained from b by removing several (possibly zero) characters from the beginning or the end of the string.

Example:
productSeq = "abaa" Show More

The data engineers at Amazon are working on partitioning their server chains. There is a linear chain of n servers numbered from 1 to n, where the cost parameter associated with the ith server is represented by the array cost[i]. These servers need to be partitioned into exactly k different server chains. The cost of partitioning a server chain servers[i : j] is defined as cost[i] + cost[j]. The t otal cost is the sum of the partitioning cost of each server chain.

Given n servers, an array cost, and an integer k, find the minimum and maximum possible total cost of the operations and return them in the form of an array of size 2: [minimum cost, maximum cost].

Note: Partitioning of an array means splitting the array sequentially into two or more parts where each element belongs to exactly one partition. For an array [1, 2, 3, 4, 5], a valid partition would be [[1], [2, 3], [4, 5]], while [[1, 2], [2, 3], [4, 5]] and [[1, 3], [2, 4, 5]] would be considered invalid partitions.

Example:
Given cost = [1, 2, 3, 2, 5] and k = 3. Show More

1. Simple Text Queries

In this challenge, you will be given an array of sentences and an array of queries. Determine which
sentences contain all of the words of a query. If no sentence contains all of the words, the answer to
that query is [-1].

Example:
sentences = ['bob and alice like to text each other', 'bob does not like to ski but does not like to fall',
'Alice likes to ski']
que ries = ['bob alice', 'alice', 'like', 'non occurrence']

The results of the queries are:

0. sentences[0] -> [0]
1. sentences[0] -> [0]
2. sentences[0], sentences[1], sentences[1] -> [0, 1, 1]
3. none match -> [-1]

Return a 2-dimensional integer array: [[0], [0], [0, 1, 1], [-1]].

Note: The word "like" in queries[2] does not match "likes" in sentences[2]. The word "alice" does not match
"alice" in sentence[2]. Matches must be exact.

After each query has been processed, add an array of indices of the matching sentences to the answer. Show More

Solution

In a lively car showroom, an array of cars awaits, each with its distinctive features. Picture yourself mixing and matching these cars in unique
combinations to create dream blends which have an F-score equal to the XOR value of the combination.

Your mission: To compute the blend score, which is the XOR of the F-score values for all these dreamy combinations.

Now, it's time to r eveal the grand total!

Input Format:

- The first line of input consists of the integer N, representing the number of cars in the showroom.
- The second line consists of N integers, representing the features of the car.

Output Format:
Print the sum of F-scores obtained.

Constraints:
1 <= N <= 10^4
0 <= Fi <= 10^4

Sample Testcase 0:
Testcase Input: Show More