We use cookies to ensure you have the best browsing experience on our website. Please read our cookie policy for more information about how we use cookies.
  1. Prepare
  2. Algorithms
  3. Dynamic Programming
  4. Count Scorecards
  5. Discussions

Count Scorecards

Sort by

recency

|

13 Discussions

|

  • yashparihar729
     + 0 comments

    Here is my solution in java, javascript, python, C, C++, Csharp HackerRank Count Scorecards Problem Solution

  • thecodingsoluti2
     + 0 comments

    Here is Count Scorecards problem solution in Python Java C++ and C programming - https://programs.programmingoneonone.com/2021/07/hackerrank-count-scorecards-problem-solution.html

  • pablo_a_mayobre
     + 0 comments

    This is unsolvable in javascript unless you implement an extremely efficient algorithm. IT TIMEOUTS EVERY SINGLE TIME!

  • kent_hervey
     + 1 comment

    Please explain module 10^9 +7

    I don't see how it relates to the problem, or the sample output

    • diego_alifano
       + 1 comment

      I came to ask exactly the same but I see no one has answered your post. Did you ever found out why that is in the problem enunciation?

      • kent_hervey
         + 1 comment

        No.

        Hard for me to tell with the Hackerrank user interface, but I don't think I attempted it. Maybe for that reason

        • diego_alifano
           + 0 comments

          I found this in another challenge and it offers a better explanation:

          Since the answer can be huge, print it modulo 10^9+7

          I attempted the challenge and I have the right answers for the first cases but as others have stated before, once you start handling a larger number of players you need a better way to eliminate possible but invalid score cards.

  • podhorsky_ksj
     + 1 comment

    I think, results for 2nd and 5th are wrong.

    For example for 2nd, why there can't be result 0 0 3 or 3 0 0 or 0 3 0? So, only one player win all the matches. That's why there are 3 more posibilities.

    • avisharmaanubhav
       + 0 comments

      cause every player will have match with other players only once. Let,s say player A,B,C. A will have match only with B and C. so he can win only 2 times. possible matches will be between: AB AC BC so you can clearly see that no player is having 3 matches. I hope it helps!

Join us

Create a HackerRank account

Be part of a 26 million-strong community of developers

Already have an account?Log in