sub_strings | Ruby challenge that solves the Sub Strings Challenge | Dictionary library

Learning about generics.. I have a generic array handler that allows various array manipulations on specific types. I was told to sort the test data using a constraint on T with IComparable but couldn't figure it out where to put the condition so I just used Sort which uses IComparable (even if it gets the result it likely wasn't how I was supposed to make it).

Anyway, I also have a method to extract a section of an array, which is where the errors appear. Such as this one:

CS0411: The type arguments for method 'ArrayHelper_T.GetSubArray(T[], int, int)' cannot be inferred from the usage. Try specifying the type arguments explicitly.

If I use the other one that I out-commented (Program/ Main) I get a different error I don't know how to fix either. I read the msdn on generics and interfaces, and looked at similar error questions here but it didn't help me finding solutions.

I am trying to do slicing in string "abcdeeefghij", here I want the slicing in such a way that whatever input I use, i divide the output in the format of a list (such that in one list element no alphabets repeat).

In this case [abcde,e,efghij].

Another example is if input is "aaabcdefghiii". Here the expected output is [a,a,acbdefghi,i,i].

Also amongst the list if I want to find the highest len character i tried the below logic: max_str = max(len(sub_strings[0]),len(sub_strings[1]),len(sub_strings[2])) print(max_str) #output - 6

which will yield 6 as the output, but i presume this logic is not a generic one: Can someone suggest a generic logic to print the length of the maximum string.

I am trying to split String in to 2 sub_strings on the first appearance of comma character.

Also the first occurred comma must be removed.

Example :

Suppose this is the string

Manhattan Ave, Brooklyn,NY,USA

dividing this into this

Manhattan Ave

Brooklyn,NY,USA

also to note that first comma has been removed.

and finally saving these sub_string into variables.