Test results - Codility

Tasks Details

easy

1. MaxProductOfThree

Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).

Task Score

100%

Correctness

100%

Performance

100%

A non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P < Q < R < N).

For example, array A such that:

A[0] = -3 A[1] = 1 A[2] = 2 A[3] = -2 A[4] = 5 A[5] = 6

contains the following example triplets:

(0, 1, 2), product is −3 * 1 * 2 = −6

(1, 2, 4), product is 1 * 2 * 5 = 10

(2, 4, 5), product is 2 * 5 * 6 = 60

Your goal is to find the maximal product of any triplet.

Write a function:

class Solution { public int solution(int[] A); }

that, given a non-empty array A, returns the value of the maximal product of any triplet.

For example, given array A such that:

A[0] = -3 A[1] = 1 A[2] = 2 A[3] = -2 A[4] = 5 A[5] = 6

the function should return 60, as the product of triplet (2, 4, 5) is maximal.

Write an efficient algorithm for the following assumptions:

N is an integer within the range [3..100,000];

each element of array A is an integer within the range [−1,000..1,000].

Solution

Programming language used Java 8

Time spent on task 27 minutes

Notes

not defined yet

Code: 13:25:07 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11

// you can also use imports, for example:
// import java.util.*;

// you can write to stdout for debugging purposes, e.g.
// System.out.println("this is a debug message");

class Solution {
    public int solution(int[] A) {
        // write your code in Java SE 8
    }
}

Code: 13:25:12 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}

Code: 13:25:21 UTC, java, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}

User test case 1:

[-5, -6, -4, -7, -10]

Analysis

expand all Example tests

▶

example
example test

✔

0.004 s

expand all User tests

▶

test_data1

✔

0.004 s

OK
function result: -280

Code: 13:26:07 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}

//

Code: 13:26:37 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}

// - - +
// - - -
// - + +
// + + +

Code: 13:27:21 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}



// - - +
// - - -
// - + +
// + + +

Code: 13:27:32 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}

45 6 710

// - - +
// - - -
// - + +
// + + +

Code: 13:27:45 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

70 20
// - - +
// - - -
// - + +
// + + +

Code: 13:27:55 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - - +
// - - -
// - + +
// + + +

Code: 13:28:18 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

70 20
// - - +
// - - -
// - + +
// + + +

Code: 13:28:29 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - - +
// - - -
// - + +
// + + +

Code: 13:28:58 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - +
// + -

Code: 13:29:33 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - +
// + -
//

Code: 13:29:43 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - +
// + -
// - -

Code: 13:30:03 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - +
// + -
// - - 큰 수
// + + 큰 수

Code: 13:30:13 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

Code: 13:30:23 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

//

Code: 13:30:36 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + -

Code: 13:30:48 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + -

Code: 13:31:07 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + - 크게 나올 수 있는 수
//

Code: 13:31:42 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + - 크게 나올 수 있는 수
// ++

Code: 13:31:53 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + - 크게 나올 수 있는 수
//

Code: 13:32:03 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + - 크게 나올 수 있는 수
//

Code: 13:32:19 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        +
        
        -
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + - 크게 나올 수 있는 수
//

Code: 13:33:57 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        +
        -
    
        return answer;
    }
}


10 7 6 5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + - 크게 나올 수 있는 수
//

Code: 13:34:19 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        +
        -
    
        return answer;
    }
}


 -5 4

// - + 작은 수
// + - 작은 수
// - - 큰 수
// + + 큰 수

// + - 크게 나올 수 있는 수
//

Code: 13:37:38 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}

Code: 13:37:38 UTC, java, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul  > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}

User test case 1:

[-5, -6, -4, -7, -10]

User test case 2:

[-5, -5, 4, 3]

Analysis

expand all Example tests

▶

example
example test

✔

0.004 s

expand all User tests

▶

test_data1

✔

0.004 s

OK
function result: -280

▶

test_data2

✔

0.008 s

OK
function result: 100

Code: 13:37:57 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];  
        }
    
        return answer;
    }
}

Code: 13:38:38 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 1];
        }
    
        return answer;
    }
}

Code: 13:39:20 UTC, java, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 1];
        }
    
        return answer;
    }
}

User test case 1:

[-5, -6, -4, -7, -10]

User test case 2:

[-5, -5, 4, 3]

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 180 expected 60

0.004 s

WRONG ANSWER, got 180 expected 60

expand all User tests

▶

test_data1

✔

0.004 s

OK
function result: -280

▶

test_data2

✔

0.008 s

OK
function result: 100

Code: 13:39:51 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        뇬
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 1];
        }
    
        return answer;
    }
}

Code: 13:39:59 UTC, java, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        System.out.println(firstTwoMul);
        System.out.println(lastTwoMul);
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 1];
        }
    
        return answer;
    }
}

User test case 1:

[-5, -6, -4, -7, -10]

User test case 2:

[-5, -5, 4, 3]

Analysis

expand all Example tests

▶

example
example test

✘

WRONG ANSWER
got 180 expected 60

0.008 s

WRONG ANSWER, got 180 expected 60

stdout:

6
30

expand all User tests

▶

test_data1

✔

0.008 s

OK
function result: -280

stdout:

70
20

▶

test_data2

✔

0.008 s

OK
function result: 100

stdout:

25
12

Code: 13:40:42 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        System.out.println(firstTwoMul);
        System.out.println(lastTwoMul);
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];
        }
    
        return answer;
    }
}

Code: 13:40:54 UTC, java, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int firstTwoMul = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        System.out.println(firstTwoMul);
        System.out.println(lastTwoMul);
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];
        }
    
        return answer;
    }
}

User test case 1:

[-5, -6, -4, -7, -10]

User test case 2:

[-5, -5, 4, 3]

Analysis

expand all Example tests

▶

example
example test

✔

0.008 s

stdout:

6
30

expand all User tests

▶

test_data1

✔

0.008 s

OK
function result: -280

stdout:

70
20

▶

test_data2

✔

0.004 s

OK
function result: 100

stdout:

25
12

Code: 13:49:51 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

import java.util.*;

class Solution {
    public int solution(int[] A) {
        int answer;
        
        Arrays.sort(A);
        
        int answer = A[0] * A[1];
        int lastTwoMul = A[A.length - 1] * A[A.length - 2];
        
        System.out.println(firstTwoMul);
        System.out.println(lastTwoMul);
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];
        }
    
        return answer;
    }
}

Code: 13:50:15 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);
        
        int answer1 = A[0] * A[1] * A[A.length - 1];
        int answer2 = A[0] * A[1] * A[A.length - 1];
    
        
        System.out.println(firstTwoMul);
        System.out.println(lastTwoMul);
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];
        }
    
        return answer;
    }
}

Code: 13:50:26 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);
        
        int answer1 = A[0] * A[1] * A[A.length - 1];
        int answer2 = A[A.length - 1] * A[A.length - 2] * A[A.length - 3];
    
        
        System.out.println(firstTwoMul);
        System.out.println(lastTwoMul);
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];
        }
    
        return answer;
    }
}

Code: 13:50:40 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);
        
        int N = A.length;
        int answer1 = A[0] * A[1] * A[N - 1];
        int answer2 = A[N - 1] * A[A.length - 2] * A[A.length - 3];
    
        
        System.out.println(firstTwoMul);
        System.out.println(lastTwoMul);
        
        if (firstTwoMul > lastTwoMul) {
            answer = firstTwoMul * A[A.length - 1];
        } else {
            answer = lastTwoMul * A[A.length - 3];
        }
    
        return answer;
    }
}

Code: 13:51:08 UTC, java, autosave

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);
        
        int N = A.length;
        int answer1 = A[0] * A[1] * A[N - 1];
        int answer2 = A[N - 1] * A[N - 2] * A[N - 3];
        return answer1 > answer2 : answer1 : answer2;
    }
}

Code: 13:51:08 UTC, java, verify, result: Failed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);
        
        int N = A.length;
        int answer1 = A[0] * A[1] * A[N - 1];
        int answer2 = A[N - 1] * A[N - 2] * A[N - 3];
        return answer1 > answer2 : answer1 : answer2;
    }
}

Analysis

Compile error

Solution.java:10: error: ';' expected
        return answer1 > answer2 : answer1 : answer2;
                                ^
Solution.java:10: error: not a statement
        return answer1 > answer2 : answer1 : answer2;
                                             ^
2 errors

Code: 13:51:19 UTC, java, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);
        
        int N = A.length;
        int answer1 = A[0] * A[1] * A[N - 1];
        int answer2 = A[N - 1] * A[N - 2] * A[N - 3];
        return answer1 > answer2 ? answer1 : answer2;
    }
}

User test case 1:

[-5, -6, -4, -7, -10]

User test case 2:

[-5, -5, 4, 3]

Analysis

expand all Example tests

▶

example
example test

✔

0.004 s

expand all User tests

▶

test_data1

✔

0.008 s

OK
function result: -120

▶

test_data2

✔

0.004 s

OK
function result: 100

Code: 13:51:46 UTC, java, verify, result: Passed

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);
        
        int N = A.length;
        int answer1 = A[0] * A[1] * A[N - 1];
        int answer2 = A[N - 1] * A[N - 2] * A[N - 3];
        return answer1 > answer2 ? answer1 : answer2;
    }
}

User test case 1:

[-5, -6, -4, -7, -10]

User test case 2:

[-5, -5, 4, 3]

Analysis

expand all Example tests

▶

example
example test

✔

0.004 s

expand all User tests

▶

test_data1

✔

0.004 s

OK
function result: -120

▶

test_data2

✔

0.004 s

OK
function result: 100

Code: 13:51:50 UTC, java, final, score: 100

show code in pop-up

1 2 3 4 5 6 7 8 9 10 11 12

import java.util.*;

class Solution {
    public int solution(int[] A) {
        Arrays.sort(A);
        
        int N = A.length;
        int answer1 = A[0] * A[1] * A[N - 1];
        int answer2 = A[N - 1] * A[N - 2] * A[N - 3];
        return answer1 > answer2 ? answer1 : answer2;
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N * log(N))

expand all Example tests

▶

example
example test

✔

0.004 s

expand all Correctness tests

▶

one_triple
three elements

✔

0.008 s

0.004 s

▶

simple1
simple tests

✔

0.004 s

▶

simple2
simple tests

✔

0.004 s

▶

small_random
random small, length = 100

✔

0.004 s

expand all Performance tests

▶

medium_range
-1000, -999, ... 1000, length = ~1,000

✔

0.008 s

▶

medium_random
random medium, length = ~10,000

✔

0.028 s

▶

large_random
random large, length = ~100,000

✔

0.228 s

▶

large_range
2000 * (-10..10) + [-1000, 500, -1]

✔

0.080 s

▶

extreme_large
(-2, .., -2, 1, .., 1) and (MAX_INT)..(MAX_INT), length = ~100,000

✔

0.156 s

0.228 s