Different Ways – HackerRank Solution

In this post, we will solve Different Ways HackerRank Solution. This problem (Different Ways) is a part of HackerRank Functional Programming series.



Arsenal have been on a losing streak for years now. Their critic have gone to the extent of saying that they can’t even defeat a team of lemurs. So Arsenal decided to show them how wrong they are. But they have done a grave mistake. You are in charge of lemur team and are confident of the abilities of a lemur. Given N lemurs, you have to select K out of them who will be facing off Arsenal in a soccer match.

You have to count total number of different teams you can form by selecting K out of N lemurs. A team is different from other team if there’s exist atleast one lemur who is in one team but not in other. As this number can be large print answer modulo (10^8+7).

Let’s say count(N, K) represent how many different team can be formed by selecting K out of N lemurs. Then any of the following condition may occur:

  • K = 0, that is you have to select no one. There only one way of doing that, ie, selecting no one.
  • K = N, you have to select all of them. Here, also, is only way of doing that, ie, selecting all.
  • 0 < K < N, let’s number N lemurs from [1, N]. Then there are two option
    • Select first lemur, and then select (K-1) lemurs from remaining (N-1) lemurs.
    • Don’t select first lemur, so you have to select K lemurs from remaining (N-1) lemurs.

Mathematically, we can represent this situation as following

              1                                   , K = 0
count(N, K) = 1                                   , K = N
              count(N-1, K-1) + count(N-1, K),    , 0 < K < N

Note: Haskell users can use Data.Vector library.


First line of input will contain a integer, T, representing the number of test cases. Then T lines follow, each representing a test case. In each test case, there are two space separated integers, N K, total number of lemurs available and number of lemurs to be selected.


For each test case, print total number of different teams that can be formed. As this number be large, print answer modulo (10^8+7).


  • 1 <= T <= 1000
  • 1 <= N <= 1000
  • 0 <= K <= N

Sample Input

2 1
5 1
5 2
5 3
10 5 

Sample Output



Test case #1: You have to select one of two lemur {a, b}. Any of them can be selected, {{a}, {b}}.
Test case #2: Similarly you have to select any one out of five lemurs {a, b, c, d, e}. There are 5 ways of doing that, {{a}, {b}, {c}, {d}, {e}}.
Test case #3: You have to select two lemurs out of five {a, b, c, d, e}. These are the possible teams: {{a, b}, {a, c}, {a, d}, {a, e}, {b, c}, {b, d}, {b, e}, {c, d}, {c, e}, {d, e}}.
Test case #4: Selecting three out of five lemurs is equivalent rejecting two of them. So it will be equal to number of ways of selecting two of five lemurs.
Test case #5: There can be 252 different teams formed by selecting 5 out of 10 lemurs.

Solution – Different Ways – HackerRank Solution

import java.util.Scanner

import scala.collection.mutable

object Solution {
  private val data = mutable.Map[(Int, Int), Int]()

  private val modulo = 100000007

  def solve(n: Int, k: Int): Int = {
    def inner(n: Int, k: Int, acc: Int): Int = data.getOrElseUpdate((n, k),
      if (k == 0 || k == n) 1 else (solve(n - 1, k - 1) + solve(n - 1, k)) % modulo

    inner(n, k, 0)

  def main(args: Array[String]): Unit = {
    val sc = new Scanner(System.in)

    val t = sc.nextInt
    println((0 until t).map(_ => solve(sc.nextInt, sc.nextInt)).mkString("\n"))

Note: This problem (Different Ways) is generated by HackerRank but the solution is provided by CodingBroz. This tutorial is only for Educational and Learning purpose.

Leave a Comment

Your email address will not be published. Required fields are marked *