Go translation

D translation

Rust translation

Go translation

D translation

Rust translation

• Missing return type in initial soluton of TS

letter code (1-3 letters): Z < ... < BA < A < AA < AAA

There're more values between BA, A, A, AA and AA, AAA.

The rules are not "complex", they're "overcomplicated to the point of being unusable".

The letters' precedence is completely unclear:

1. Is it "the letter at lower index has to be 'higher'"? Then why are AZ, AY, ..., AAZ, AAY etc. are missing from your Z < ... < BA < A < AA < AAA range?
2. Is it "the more letters, the better"? Then why is A better than BA?
3. Something else?

The number absence is not explained:

1. Is it lower than 0? (Why is there a 0 in the first place)
2. Is it equivalent to 0?
3. Is it equivalent to 999?
4. Is it better than 999?
5. Something else?

It's not clear how combinations of + and - work. I assume that it's duplicating the 1 and 0 pattern in binary numbers, but at the same time it could be "more pluses than minuses - better mark, more minuses than pluses - worse mark" (but than the precedence of cases like +--, -+-, --+ is not clear). And considering the fact that the latter actually makes some sense, the ability to mix pluses and minuses which should be cancelling out each other is completely illogical.

The description is doing a bad job at specifying the grading rules:

• Notes section is not for crucial information. These key rules should be put in the "basic principles" part
• There are no mentions about 3-letter grades. How many characters do we need to support in total?
• Example is not definition, so the rules should be fully specified

Why is 0 a possible array element? Clearing 0 lines is absurd.