HI Jacob,

Could please provide example for this input patten on TSQL Challenge-67.

If more than one sequence having same number of characters is found, then the sequence that begins earlier in the English alphabet should get precedence.

Thanks, Gunarathinam.M

Guna,

Look at this example ABCDAFGKFLMNO contains two sequences ABCD and LMNO and both of them are 4 characters long. In such a case you should pick the value that starts earlier: in this example ABCD

Hi Jacob, Can you please tell whether the output is A or NULL for this input string 12345!A"#$%&? Thanks, Loge.

@logeswari,

The result should be A

Can the first number of tally table start with 1 as current table starts the number by 0? Are we all supposed to use the EXACT tally table script provided? Btw, what's the last date for submission as I can see evaluation is in progress.

@Parth, The first row in the Tally Table that is used for evaluation is 0. It is recommended that you use the exact script. You can submit a solution even after evaluation and it will be processed in subsequent evaluation cycles.

Thanks Jacob.

One last thing what would the output for ASDFKIJkLMNAXDBABCIJKPPSRNK? k is in small letter

I assumed that the casing of the output should match the casing of the input, the case-insensitivity should only apply to finding the contiguous sequences of letter.

Case insensitive is to be assumed both in your solution code and in the code that checks your solution. So k and K is the same in all contexts.