C# (Coding)

 60 Minutes
 4 Questions

This coding test is designed to assess a candidate's ability to work with C#, data structures, and data manipulation. The test will involve writing code to solve a problem using C# and data structures. The candidate will be expected to demonstrate their knowledge of data structures and data manipulation by writing code that is efficient and effective. The candidate will also be expected to explain their code and provide an explanation of the data structures and data manipulation techniques used.

Example Question:

In a distant realm, there lies a mystical forest inhabited by unique creatures known as the Elementals. These Elementals possess magical abilities represented by symbols: "<" and ">". Each symbol signifies the relationship between their elemental powers.
You are granted a mystical scroll containing a string s of length n. Within this string, each character represents the comparison between two Elementals' powers. The character s[i] is "<" if and only if the power of Elemental a[i] is less than the power of Elemental a[i]+1. Conversely, if s[i] is ">", it means the power of Elemental a[i] is greater than the power of Elemental a[i]+1.
To maintain balance within the forest, you must find an array a consisting of n+1 elements that aligns with the given string s. An array is considered compatible with the string s if the comparison between each pair of adjacent elements matches the corresponding symbol in s.

The cost of an array is determined by the number of different elements it contains. In essence, the cost represents the uniqueness of the elemental powers within the array. For instance, the cost of [1,2,5,4,2] is 4, while the cost of [13,37,42,37,13] is 3.
Your quest is to calculate the minimum cost among all arrays that are compatible with the given string s, ensuring harmony prevails within the mystical forest.

For example, the array [1,2,5,4,2] is compatible with the string "<<>>". However, there may be other arrays that are also compatible, such as [13,37,42,37,13].