Test results - Codility

Tasks Details

easy

1. EquiLeader

Find the index S such that the leaders of the sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N - 1] are the same.

Task Score

100%

Correctness

100%

Performance

100%

A non-empty array A consisting of N integers is given.

The leader of this array is the value that occurs in more than half of the elements of A.

An equi leader is an index S such that 0 ≤ S < N − 1 and two sequences A[0], A[1], ..., A[S] and A[S + 1], A[S + 2], ..., A[N − 1] have leaders of the same value.

For example, given array A such that:

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

we can find two equi leaders:

0, because sequences: (4) and (3, 4, 4, 4, 2) have the same leader, whose value is 4.

2, because sequences: (4, 3, 4) and (4, 4, 2) have the same leader, whose value is 4.

The goal is to count the number of equi leaders.

Write a function:

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

that, given a non-empty array A consisting of N integers, returns the number of equi leaders.

For example, given:

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

the function should return 2, as explained above.

Write an efficient algorithm for the following assumptions:

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

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

Solution

Programming language used Java 8

Time spent on task 9 minutes

Notes

not defined yet

Task timeline

Code: 06:34:59 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: 06:35:30 UTC, java, autosave

show code in pop-up

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

// 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");

import java.util.Map;
import java.util.HashMap;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) 
    }
}

Code: 06:36:00 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

// 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");

import java.util.Map;
import java.util.HashMap;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.)
    }
}

Code: 06:36:31 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

// 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");

import java.util.Map;
import java.util.HashMap;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer
    }
}

Code: 06:36: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

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
    }
}

Code: 06:37: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 27 28 29 30 31 32 33 34 35 36

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer
}

Code: 06:37: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 28 29 30 31 32 33 34 35 36 37 38

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer> getRecord(int[] A) {

    }
}

Code: 06:37:44 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer> getRecord(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
}

Code: 06:38:01 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer> getRecord(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    priv
}

Code: 06:39:16 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer> getRecord(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private
}

Code: 06:39:30 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer> getRecord(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int findLeader(int[] A) {

    }
}

Code: 06: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 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer> getRecord(int[] A) {
        
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int findLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:40:06 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = 
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int findLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:40:17 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int key = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                key = entry.getKey();
                max = entry.getValue();
            }
        }
        Vector<Integer> record = new Vector<>();
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }

    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:40:47 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 32 33 34 35 36 37 38 39 40 41 42 43 44

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        fo
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:41:14 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
        }
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:41: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 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
            int right = record.lastElement() - left;
            int equiOne = ((idx + 1) / 2) + 1;
            i
        }
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:42:02 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
            int right = record.lastElement() - left;
            int equiOne = ((idx + 1) / 2) + 1;
            int equiTwo = ((A.length - (idx + 1)))
        }
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:42: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 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
            int right = record.lastElement() - left;
            int equiOne = ((idx + 1) / 2) + 1;
            int equiTwo = ((A.length - (idx + 1)) / 2) + 1;
            if ((left >= equiOne) && (right >= equiTwo)) {
                result++;
            }
        }
        return result;
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:42:34 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 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
            int right = record.lastElement() - left;
            int equiOne = ((idx + 1) / 2) + 1;
            int equiTwo = ((A.length - (idx + 1)) / 2) + 1;
            if ((left >= equiOne) && (right >= equiTwo)) {
                result++;
            }
        }
        return result;
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == key) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Analysis

Compile error

Solution.java:31: error: cannot find symbol
            if (num == key) {
                       ^
  symbol:   variable key
  location: class Solution
1 error

Code: 06:42:50 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 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
            int right = record.lastElement() - left;
            int equiOne = ((idx + 1) / 2) + 1;
            int equiTwo = ((A.length - (idx + 1)) / 2) + 1;
            if ((left >= equiOne) && (right >= equiTwo)) {
                result++;
            }
        }
        return result;
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == leader) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.012 s

Code: 06:42:50 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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
            int right = record.lastElement() - left;
            int equiOne = ((idx + 1) / 2) + 1;
            int equiTwo = ((A.length - (idx + 1)) / 2) + 1;
            if ((left >= equiOne) && (right >= equiTwo)) {
                result++;
            }
        }
        return result;
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == leader) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Code: 06:42:57 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 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
            int right = record.lastElement() - left;
            int equiOne = ((idx + 1) / 2) + 1;
            int equiTwo = ((A.length - (idx + 1)) / 2) + 1;
            if ((left >= equiOne) && (right >= equiTwo)) {
                result++;
            }
        }
        return result;
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == leader) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Analysis

expand all Example tests

▶

example
example test

✔

0.008 s

Code: 06:43:02 UTC, java, final, score: 100

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 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53

// 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");

import java.util.Map;
import java.util.HashMap;
import java.util.Vector;

class Solution {
    public int solution(int[] A) {
        Vector<Integer> record = getRecord(A);
        int result = 0;
        for (int idx = 0; idx < A.length; idx++) {
            int left = record.elementAt(idx);
            int right = record.lastElement() - left;
            int equiOne = ((idx + 1) / 2) + 1;
            int equiTwo = ((A.length - (idx + 1)) / 2) + 1;
            if ((left >= equiOne) && (right >= equiTwo)) {
                result++;
            }
        }
        return result;
    }
    private Vector<Integer> getRecord(int[] A) {
        Vector<Integer> record = new Vector<>();
        int leader = getLeader(A);
        int count = 0;
        for (int num : A) {
            if (num == leader) {
                count++;
            }
            record.add(count);
        }
        return record;
    }
    private int getLeader(int[] A) {
        Map<Integer, Integer> map = new HashMap<>();
        for (int num : A) {
            map.put(num, map.getOrDefault(num, 0) + 1);
        }
        int leader = 0;
        int max = 0;
        for (Map.Entry<Integer, Integer> entry : map.entrySet()) {
            if (entry.getValue() > max) {
                leader = entry.getKey();
                max = entry.getValue();
            }
        }
        return leader;
    }
}

Analysis summary

The solution obtained perfect score.

Analysis

Detected time complexity:

O(N)

expand all Example tests

▶

example
example test

✔

0.012 s

expand all Correctness tests

▶

single
single element

✔

0.012 s

▶

double
two elements

✔

0.008 s

0.012 s

▶

simple
simple test

✔

0.012 s

▶

small_random
small random test with two values, length = ~100

✔

0.012 s

▶

small
random + 200 * [MIN_INT] + random ,length = ~300

✔

0.012 s

expand all Performance tests

▶

large_random
large random test with two values, length = ~50,000

✔

0.236 s

▶

large
random(0,1) + 50000 * [0] + random(0, 1), length = ~100,000

✔

0.420 s

▶

large_range
1, 2, ..., N, length = ~100,000

✔

0.604 s

0.012 s

▶

extreme_large
all the same values

✔

0.716 s