Women's CodeSprint 4 - Hackerrank

Q - 1   LEGOs

Sarah has four different kinds of LEGO pieces of different counts. She gives two types of LEGO to her friend and keeps the other two. She is putting two pieces together by picking one from each of the two types that she has left.

More specifically, the counts for each of the LEGO pieces are  and , respectively. The two types that Sarah gave her friend had  and  pieces, while the types that she kept have  and  pieces, respectively. Find  which would represent the number of two-piece LEGO combinations that Sarah can make.

Note that only  and  will be given as input.

Sample Input :-

2
20 10 40 30
10 30
5 5 10 10
5 10

Sample Output :-

800
50

Explanation :-

In the first case, the number of pieces of the four LEGO types are , ,  and , and the ones she brought have  and  pieces. Thus, the missing types have  and  pieces, so the answer is .

In the second case, the number of pieces of the four LEGO types are , ,  and , and the ones she brought have  and  pieces. Thus, the missing types have  and  pieces, so the answer is .

:- try to solve your self

Solution :-

static int productOfLegoTypes(int a, int b, int c, int d, int p, int q) {
        
        ArrayList<Integer> al = new ArrayList<>();
        
        al.add(a);
        al.add(b);
        al.add(c);
        al.add(d);
        
        for(int i = 0 ; i < 4 ; i++ ) {
            if(al.get(i)==p){
                al.set(i,0);
                break;
            }
        }
        
        for(int i = 0 ; i < 4 ; i++ ) {
            if(al.get(i)==q){
                al.set(i,0);
                break;
            }
        }
        
        int ans = 1;
        for(int i = 0 ; i < 4 ; i++ ) {
            if(al.get(i)!=0){
                ans *= al.get(i);
            }
        }
        
        return ans;
    }