• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Count number of ways to reach a given score in a game

March 16, 2015 by Dhaval Dave

Consider a game where a player can score 3 or 5 or 10 points in a move. Given a total score n, find number of ways to reach the given score.Examples:
Input: n = 20
Output: 4

There are following 4 ways to reach 20
(10, 10)
(5, 5, 10)
(5, 5, 5, 5)
(3, 3, 3, 3, 3, 5)This problem is a variation of coin change problem

Method 1 : With the help of DP and CoinChange code

int count( int S[], int m, int n )
{
    int i, j, x, y;

    // We need n+1 rows as the table is consturcted in bottom up manner using 
    // the base case 0 value case (n = 0)
    int table[n+1][m];
    
    // Fill the enteries for 0 value case (n = 0)
    for (i=0; i<m; i++)
        table[0][i] = 1;

    // Fill rest of the table enteries in bottom up manner  
    for (i = 1; i < n+1; i++)
    {
        for (j = 0; j < m; j++)
        {
            // Count of solutions including S[j]
            x = (i-S[j] >= 0)? table[i - S[j]][j]: 0;

            // Count of solutions excluding S[j]
            y = (j >= 1)? table[i][j-1]: 0;

            // total count
            table[i][j] = x + y;
        }
    }
    return table[n][m-1];
}


Method 2 :   The idea is to create a table of size n+1 to store counts of all scores from 0 to n. For every possible move (3, 5 and 10), increment values in table.

 

#include <stdio.h>

int count(int n)
{
    int table[n+1], i;

    memset(table, 0, sizeof(table));

    table[0] = 1;

    for (i=3; i<=n; i++)
       table[i] += table[i-3];
    for (i=5; i<=n; i++)
       table[i] += table[i-5];
    for (i=10; i<=n; i++)
       table[i] += table[i-10];

    return table[n];
}


You can also subscribe us for more interview questions :D 
Please do share with us at admin@gohired.in , As sharing is caring

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Interview Questions, problem Tagged With: Dynamic Programming, Recursion

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

Amazon Interview On-Campus For Internship – 1

Search element in a matrix with all rows and columns in sorted order

SAP Hiring Off-Campus General Aptitude

simple sql injection

Printing intermediate Integers between one element & next element of array

Given a float number convert it into the string WITHOUT using any inbuilt Function

CodeChef’ RRCOPY

Daughter’s Age VeryGood Puzzle

LeetCode: Container With Most Water

Check a String is SUBSEQUENCE of another String Find Minimum length for that ( DNA Matching )

Longest Increasing Subsequence

Apriori algorithm C Code Data Mining

Generate largest number arranging a no. of given non negative integer numbers

Common Ancestor in a Binary Tree or Binary Search Tree

Top 10 Interviews Techniqes for Campus Interview in IIT NIT BITS for MTech

Find two non repeating elements in an array of repeating elements

Maximum of all subarrays of size k

Maximum path sum between two leaves

Fibonacci Hashing & Fastest Hashtable

BlueStone E-commerce Interview Experience

System Design: Designing a LLD for Hotel Booking

Regular Expression Matching

BFS (Breath First Search)

Convert number to words java

Linked List V/S Binary Search Tree

Serialise Deserialise N-ary Tree

Stock Buy Sell to Maximize Profit

LeetCode: Binary Tree Maximum Path Sum

flattens 2 D linked list to a single sorted link list

Get Minimum element in O(1) from input numbers or Stack

Copyright © 2025 · Genesis Framework · WordPress · Log in