• ###### alsadi77commented on "Function 1 - hello world" kata

Correct, thnx!
fixed!

• ###### tonylicodingcommented on "Function 1 - hello world" kata

Don't approve -> did you even read the task. It's hello world not `"Hello, Jack"`.

• ###### alsadi77commented on "Function 1 - hello world" kata

oh thank you so much, I will fix it now!

• ###### Stettafirecommented on "Function 1 - hello world" kata

Sorry, a little OCD thing of mine. In C# the standard is for methods to be capitalised. So greet() should instead be Greet().
Thank you.

Question

• ###### B1tsresolved a question on "Bob's Jump" kata

And how is this a kata issue?? You can ask questions under any specific solution, if that helps. Closing...

Edit: what the hell, sorry. It was showing up as issue to me. But you should use spoiler flag for questions like this.

• ###### Hyper-Gamma ㆆ _ ㆆcommented on "Bob's Jump" kata

You can search about fibonacci ladder problem where length of steps not greater than 2. Then think about generalization of this problem.

• ###### Cuppitcreated a question for "Bob's Jump" kata

This comment is hidden because it contains spoiler information about the solution

.

• ###### B1tscreated a suggestion for "Bob's Jump" kata

I tried messing around with C++ translation, but I'm not sure what ranges it could handle, as they seem to quickly approach datatype's limit. Feel free to fork and change what you want.

• ###### XRFXLPresolved a suggestion on "Bob's Jump" kata

No random tests.
This hardcoded solution will pass your translated kata:

``````using System.Collections.Generic;
using System.Linq;
namespace Solution
{
class Kata
{
public static int i = 0;
public static int countWays(int n, int k)
{
int[] X = {1, 4, 2, 13, 7, 492, 7936};
return X[i++];
}
}
}
``````

DONE!!