There are 100 big tests! So you did half the job. Bon courrage

indexof is a loop-alike method, so your code is O(n²)

if you wanna code in c# I would recommend not to use the String.Replace() method.The String.Replace() method replaces all occurences and cannot be specified with a count as an Argument. There is no overload of that method that takes that argument. So avoid that method, it won't get you far.

I didn't check your code, but at some point you are returning short.ly/aaaab, which is too long

I must be missing something, I'm passing the tests, however when I attempt the problem I get something like:

Wrong redirection: 'nlekogos.lt' should equal 'gzwvro.sl'

I don't understand how 'nlekogos.lt' is a valid shortened url, I thought they began with short.ly/

u r right )
best from O(1) to O(3)

This problem has a linear-time solution. By resorting to sorting you make it n log n.

if maximum length after short.ly/ can be 4 then 26⁴ is maximum number of links (from a to zzzz)
i gon an error at 456977 because shortURL is longer then 4
please reduce maximum tests to 456975

java, 2. XD

Same question.
I passed 61 big tests and still "Execution Timed Out (16000 ms)"
Java

My solution returns:

BILL + JIM = DUDES
9788 + 374 = 10162

can you tell me answer for BILL + JIM = DUDES
i find only this one 7411 + 642 = 08053

upd: 9422 + 743 = 10165

)))