int[] a = {};
    findSmallestInt(a);

nice code！！！

on your fromString method you do not need to parse, result = (int) aTemp; would have suffice

if the shift is negative?

Line 4 is useless. If n < 10, lines 5-14 will not be executed, and you will get the same result.

n%26

I too can't pass the 28th test. Check please!

GJ then, hope it'll help some1 else :)

Thank's, but I have solved this problem in the same day when asked :)

[HINT] Imagne that you have a queue of 5 people. Everytime someone buys a drink he clone himself and they (he himself, and his clone) move to the back of the queue. So for instance after 3rd people took the drink queue looks like this:
initial state [x,y,z,a,b] => x takes the drink => [y, z, a, b, x, x] - note that last index is in real life last guy in queue => y takes the drink => [z, a, b, x, x, y, y] => one eternity later and suddenly you have a queue looking like this [x.... x^n, y.... y^n and so on] so that basically means that x-ish would be taking drinks for another eternity cloning himself each time.

I know that this kata is a little stupid cause how the heck people can clone :D

Good!

yesterday i have done this task :)
thank's

Please which language?