Tasks Details
medium
1.
DoubleHanoi
Find the maximum number of disks that can be placed on two rods. The disks should be in decreasing order of size on the first rod and in increasing order of size on the second rod.
Task Score
100%
Correctness
100%
Performance
100%
You are given N disks and two rods, each with one initial disk.
On the left rod, disks can be placed in decreasing order of size (smaller disks on top of bigger ones). On the right rod, disks can be placed in increasing order of size (bigger disks on top of smaller ones). Note that it is not permissible to place two disks of equal size on top of each other. The initial disks cannot be moved.
Write a function:
class Solution { public int solution(int[] A, int L, int R); }
that, given an array A of integers representing the sizes of the N disks and two integers L and R representing the size of the initial disks on the left and right rods respectively, returns the maximum number of disks from A that can be placed on the rods while satisfying the rules presented above.
Examples:
1. Given A = [2, 3, 3, 4], L = 3 and R = 1, your function should return 3, since only three disks can be placed on the rods. Note that the disk of size 2 can be placed on either the left rod or the right rod.
2. Given A = [1, 4, 5, 5], L = 6 and R = 4, your function should return 4.
3. Given A = [5, 2, 5, 2], L = 8 and R = 1, your function should return 4.
4. Given A = [1, 5, 5], L = 2 and R = 4, your function should return 2.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [1..50,000];
- each element of array A is an integer within the range [1..1,000,000,000];
- L and R are integers within the range [1..1,000,000,000].
Copyright 2009–2025 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 21
Time spent on task 49 minutes
Notes
not defined yet
Code: 09:06:55 UTC,
java,
autosave
Code: 09:32:36 UTC,
java,
autosave
Code: 09:32:46 UTC,
java,
autosave
Code: 09:33:16 UTC,
java,
autosave
// 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, int L, int R) {
for(int i=0;i<A.length;i++){
}
return 0;
}
}
Code: 09:33:27 UTC,
java,
autosave
// 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, int L, int R) {
for(int i=0;i<A.length;i++){
}
return 0;
}
}
Code: 09:38:17 UTC,
java11,
autosave
Code: 09:38:35 UTC,
java11,
autosave
Code: 09:38:57 UTC,
java11,
autosave
// 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, int L, int R) {
for(int i=0;i<A.length;i++){
}
return 0;
}
}
Code: 09:39:43 UTC,
java11,
autosave
// 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, int L, int R) {
int
for(int i=0;i<A.length;i++){
}
return 0;
}
}
Code: 09:39:53 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
for(int i=0;i<A.length;i++){
}
return 0;
}
}
Code: 09:40:11 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
for(int i=0;i<A.length;i++){
if(A[i]>A)
}
return 0;
}
}
Code: 09:40:32 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:41:00 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:42:35 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
Ha
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:42:58 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
HashMap mapL = new HashMap();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:43:23 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
Map<Integer, Integer> hashMap = new HashMap<String, Integer>(
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:43:37 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
Map<Integer, Bool> hashMap = new HashMap();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:43:56 UTC,
java11,
autosave
// 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, int L, int R) {
int count =0;
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:44:10 UTC,
java,
autosave
// 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, int L, int R) {
for(int i=0;i<A.length;i++){
}
return 0;
}
}
Code: 09:44:20 UTC,
java,
autosave
// 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, int L, int R) {
int count =0;
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
Code: 09:44:39 UTC,
java,
verify,
result: Failed
// 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, int L, int R) {
int count =0;
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
Analysis
Compile error
Solution.java:19: error: reached end of file while parsing } ^ 1 error
Code: 09:45:07 UTC,
java,
autosave
// 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, int L, int R) {
int count =0;
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:45:11 UTC,
java,
verify,
result: Failed
// 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, int L, int R) {
int count =0;
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Analysis
Compile error
Solution.java:10: error: cannot find symbol
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
^
symbol: class Map
location: class Solution
Solution.java:10: error: cannot find symbol
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
^
symbol: class Bool
location: class Solution
Solution.java:10: error: cannot find symbol
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
^
symbol: class HashMap
location: class Solution
Solution.java:10: error: cannot find symbol
Map<Integer, Bool> hashMap = new HashMap<Integer, Bool>();
^
symbol: class Bool
location: class Solution
4 errors
Code: 09:45:29 UTC,
java,
verify,
result: Failed
// 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, int L, int R) {
int count =0;
Map<Integer, boolean> hashMap = new HashMap<Integer, boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Analysis
Compile error
Solution.java:10: error: cannot find symbol
Map<Integer, boolean> hashMap = new HashMap<Integer, boolean>();
^
symbol: class Map
location: class Solution
Solution.java:10: error: unexpected type
Map<Integer, boolean> hashMap = new HashMap<Integer, boolean>();
^
required: reference
found: boolean
Solution.java:10: error: cannot find symbol
Map<Integer, boolean> hashMap = new HashMap<Integer, boolean>();
^
symbol: class HashMap
location: class Solution
Solution.java:10: error: unexpected type
Map<Integer, boolean> hashMap = new HashMap<Integer, boolean>();
^
required: reference
found: boolean
4 errors
Code: 09:46:10 UTC,
java,
autosave
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> map = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:47:49 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> map = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Code: 09:47:56 UTC,
java,
verify,
result: Failed
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> map = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
count++;
}
}
return 0;
}
}
Analysis
expand all
Example tests
1.
0.008 s
WRONG ANSWER,
got 0 expected 3
1.
0.004 s
WRONG ANSWER,
got 0 expected 4
1.
0.008 s
WRONG ANSWER,
got 0 expected 4
1.
0.008 s
WRONG ANSWER,
got 0 expected 2
Code: 09:48:20 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
mapL
count++;
}
}
return 0;
}
}
Code: 09:48:39 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
mapL.put(a[i])
count++;
}
}
return 0;
}
}
Code: 09:48:51 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L){
mapL.put(a[i],true);
count++;
}
}
return 0;
}
}
Code: 09:49:17 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i]==null)){
mapL.put(A[i],true);
count++;
}
}
return 0;
}
}
Code: 09:49:27 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
}
}
return 0;
}
}
Code: 09:49:45 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
}
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
}
}
return 0;
}
}
Code: 09:50:01 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
A[i] = 0;
count++;
}
if(A[i]>R && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
}
}
return 0;
}
}
Code: 09:50:30 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
A[i] = 0;
count++;
}
if(A[i]>R && mapL.get(A[i])==null){
mapL.put(A[i],true);
A[i] = 0;
count++;
}
}
return 0;
}
}
Code: 09:50:41 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
A[i] = 0;
count++;
}
if(A[i]>R && mapL.get(A[i])==null){
mapR.put(A[i],true);
A[i] = 0;
count++;
}
}
return 0;
}
}
Code: 09:50:52 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
A[i] = 0;
count++;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
A[i] = 0;
count++;
}
}
return 0;
}
}
Code: 09:51:02 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
A[i] = 0;
count++;
}
if(A[i]<R && mapR.get(A[i])==null){
mapR.put(A[i],true);
A[i] = 0;
count++;
}
}
return 0;
}
}
Code: 09:51:26 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]>L && mapL.get(A[i])==null){
mapL.put(A[i],true);
A[i] = 0;
count++;
}
if(A[i]<R && mapR.get(A[i])==null){
mapR.put(A[i],true);
A[i] = 0;
count++;
}
}
return 0;
}
}
Code: 09:51:56 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]<L && mapL.get(A[i])==null){
mapL.put(A[i],true);
A[i] = 0;
count++;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
A[i] = 0;
count++;
}
}
return 0;
}
}
Code: 09:52:30 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]<L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
A[i] = 0;
count++;
}
}
return 0;
}
}
Code: 09:52:44 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]<L && mapL.get(A[i])==null){
mapL.put(A[i],true);
continue;
count++;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
A[i] = 0;
count++;
}
}
return 0;
}
}
Code: 09:53:02 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]<L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
continue;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
count++;
}
}
return 0;
}
}
Code: 09:53:16 UTC,
java,
autosave
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]<L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
continue;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
count++;
}
}
return count;
}
}
Code: 09:53:56 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]<L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
continue;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
count++;
}
}
return count;
}
}
Analysis
Code: 09:55:00 UTC,
java,
verify,
result: Passed
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]<L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
continue;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
count++;
}
}
return count;
}
}
Analysis
Code: 09:55:05 UTC,
java,
final,
score:
100
// you can also use imports, for example:
// import java.util.*;
import java.util.HashMap;
// 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, int L, int R) {
int count =0;
HashMap<Integer, Boolean> mapL = new HashMap<Integer, Boolean>();
HashMap<Integer, Boolean> mapR = new HashMap<Integer, Boolean>();
for(int i=0;i<A.length;i++){
if(A[i]<L && mapL.get(A[i])==null){
mapL.put(A[i],true);
count++;
continue;
}
if(A[i]>R && mapR.get(A[i])==null){
mapR.put(A[i],true);
count++;
}
}
return count;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N*log(N)) or O(N)
expand all
Correctness tests
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.008 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
1.
0.008 s
OK
2.
0.012 s
OK
1.
0.008 s
OK
2.
0.004 s
OK
3.
0.008 s
OK
4.
0.012 s
OK
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.012 s
OK
4.
0.008 s
OK
5.
0.008 s
OK
6.
0.008 s
OK
small_every_value_occurs_more_than_once
Small random tests, every value occurs at least twice. N = 100.
Small random tests, every value occurs at least twice. N = 100.
✔
OK
1.
0.012 s
OK
2.
0.012 s
OK
3.
0.012 s
OK
4.
0.008 s
OK
1.
0.008 s
OK
2.
0.012 s
OK
3.
0.008 s
OK
4.
0.008 s
OK
expand all
Correctness/performance tests
1.
0.032 s
OK
2.
0.028 s
OK
3.
0.028 s
OK
4.
0.052 s
OK
5.
0.056 s
OK
6.
0.048 s
OK
1.
0.132 s
OK
2.
0.104 s
OK
3.
0.128 s
OK
4.
0.244 s
OK
5.
0.248 s
OK
6.
0.244 s
OK
expand all
Performance tests
1.
0.064 s
OK
2.
0.064 s
OK
3.
0.060 s
OK
4.
0.040 s
OK
5.
0.040 s
OK
6.
0.040 s
OK
1.
0.304 s
OK
2.
0.300 s
OK
3.
0.176 s
OK
4.
0.172 s
OK