public int version1(int score[],int total){
        int T[] = new int[total+1];
        T[0] = 1;
        for(int i=0; i < score.length; i++){
            for(int j=1; j <= total; j++){
                if(score[i] <= j){
                    T[j] += T[j-score[i]];
                }
            }
        }
        return T[total];
    }
Finding the number of ways a given score could be reached for a game with 3 different ways of scoring (e.g. 3, 5 and 10 points).
test case
what happens if total can't be formed with given values
what if numbers are 0 or negative
src/com/interview/dynamic/NumberOfWaysToScorePoints.java