dat's what i did

i have a doubt, how do you prove that a b c are greater than 0? i used a boolean to prove that a b c are > 0

Wouldn't this convert the full array to list first and then provide index of match?
why traverse through full array, when we can "return" upon finding the "needle" with a simple for loop, thoughts?

Still Exception in thread "main" java.lang.ArithmeticException: integer overflow for -2147483648

and then, there's this

i dont know why peoples are complaining but they forget this part if it works doesnt matter what it is! it works

The same as mine

i was doing this exactly but mine wouldnt work??? ........ first 2 test cases fine this last one was f%^&$#

Now this is the actual code, I forgot about Math function.

Doesn't work if input parameter haystack=null. Need to add checking for null input.

The test cases changed. This doesn't work anymore, as it returns the wrong outcome for int n =0 .

It's really cool!!!

Interesting way of reversing, i don't agree that it wastes cpu, i understand that you are creating an extra set of bytes with the result string but in this case i don't think it is very expensive.