Ad
  • Custom User Avatar

    I learned something day. We dont always have to explictly state the return type. We can state Object
    :D
    great KATA

  • Custom User Avatar

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

  • Custom User Avatar

    I think this should be a 7 Kata. I've done 6 kata easier than this. IMO

  • Custom User Avatar

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

  • Custom User Avatar

    char? is a new one to me too

  • Custom User Avatar

    ahh man, I just saw this now... and I unlocekd the solution (no points for me :'( )

    return new Tuple<char?, int>(mostRepeatedChar, maxConsecutiveCountInt);

    I was not using the ?

    and had removed it. This is my first time working with Tuple...
    Why use the ? i will have to learn about this somemore.
    Anyways good kata! :)

  • Custom User Avatar

    This is annoying. What is expected, But was. Are the same for me. But im still failing?

    EmptyString
    Expected: <(, 0)>
    But was: <(, 0)>
    Completed in 0.018063ms
    LongestAtTheBeginning
    Expected: <(a, 4)>
    But was: <(a, 4)>
    Completed in 0.000601ms
    LongestAtTheEnd
    Expected: <(a, 4)>
    But was: <(a, 4)>
    Completed in 0.000617ms
    LongestInTheMiddle
    Expected: <(u, 3)>
    But was: <(u, 3)>
    Completed in 0.000547ms
    MultipleLongest
    Expected: <(a, 2)>
    But was: <(a, 2)>

    anyone know. perhaps im returning the tuple wrong?

    return new Tuple<char, int>(mostRepeatedChar, maxConsecutiveCountInt);

  • Custom User Avatar

    I need help/ advice. Please.

    One of the helper methods I created is to check if the Bigint/ int contains decimal.
    If it contains decimal we would not count further.

    However we do not have BigDecimal in C# only BigInterger.

    Factorial 45! is huge number. How can I find if decimal exist in bigint?

    public static int divisableCounter (BigInteger totalFactorial, int primeNumber)
    {

            decimal bigDecimal = (decimal)totalFactorial;//this fails at test 45!
            int divisableCounter = 0;
            
            do
            {
                bigDecimal= bigDecimal / primeNumber;
                if (bigDecimal % 1 == 0)
                {
                    divisableCounter++;
                }
                else break;
    
            } while (true);
            return divisableCounter;
    
        }
    
  • Custom User Avatar

    Hi Chrono. How can I see random tests on C#? Console.Write doesnt work.

  • Custom User Avatar

    No shame! Part of the growing process.
    How is your progress as a coder going sir?

  • Custom User Avatar

    I never knew you can use an array like a counter.

  • Custom User Avatar

    you are right brother Chrono. Im getting an error for C#

    System.InvalidOperationException : Sequence contains no elements

    what it do

  • Custom User Avatar

    Thank you sir Chrono. I learnt something today. :)
    PS is your fav version the SNES one or the DS?

  • Custom User Avatar

    hahahahahahh

  • Custom User Avatar

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

  • Loading more items...