Tasks Details
medium
1.
FibFrog
Count the minimum number of jumps required for a frog to get to the other side of a river.
Task Score
100%
Correctness
100%
Performance
100%
The Fibonacci sequence is defined using the following recursive formula:
F(0) = 0 F(1) = 1 F(M) = F(M - 1) + F(M - 2) if M >= 2A small frog wants to get to the other side of a river. The frog is initially located at one bank of the river (position −1) and wants to get to the other bank (position N). The frog can jump over any distance F(K), where F(K) is the K-th Fibonacci number. Luckily, there are many leaves on the river, and the frog can jump between the leaves, but only in the direction of the bank at position N.
The leaves on the river are represented in an array A consisting of N integers. Consecutive elements of array A represent consecutive positions from 0 to N − 1 on the river. Array A contains only 0s and/or 1s:
- 0 represents a position without a leaf;
- 1 represents a position containing a leaf.
The goal is to count the minimum number of jumps in which the frog can get to the other side of the river (from position −1 to position N). The frog can jump between positions −1 and N (the banks of the river) and every position containing a leaf.
For example, consider array A such that:
A[0] = 0 A[1] = 0 A[2] = 0 A[3] = 1 A[4] = 1 A[5] = 0 A[6] = 1 A[7] = 0 A[8] = 0 A[9] = 0 A[10] = 0The frog can make three jumps of length F(5) = 5, F(3) = 2 and F(5) = 5.
Write a function:
class Solution { public int solution(int[] A); }
that, given an array A consisting of N integers, returns the minimum number of jumps by which the frog can get to the other side of the river. If the frog cannot reach the other side of the river, the function should return −1.
For example, given:
A[0] = 0 A[1] = 0 A[2] = 0 A[3] = 1 A[4] = 1 A[5] = 0 A[6] = 1 A[7] = 0 A[8] = 0 A[9] = 0 A[10] = 0the function should return 3, as explained above.
Write an efficient algorithm for the following assumptions:
- N is an integer within the range [0..100,000];
- each element of array A is an integer that can have one of the following values: 0, 1.
Copyright 2009–2024 by Codility Limited. All Rights Reserved. Unauthorized copying, publication or disclosure prohibited.
Solution
Programming language used Java 8
Time spent on task 39 minutes
Notes
not defined yet
Task timeline
Code: 05:36:16 UTC,
java,
autosave
Code: 06:01:12 UTC,
java,
autosave
Code: 06:02:11 UTC,
java,
autosave
Code: 06:02:33 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) {
// write your code in Java SE 8
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if ()
}
}
Code: 06:03:04 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
// write your code in Java SE 8
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if ()
}
}
Code: 06:03:33 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
// write your code in Java SE 8
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} els e{
fibonacciMap.put(num, getFibonacciData)
}
}
}
Code: 06:03:49 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
// write your code in Java SE 8
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} els e{
fibonacciMap.put(num, getFibonacciData(num - 1) + getFibonacciData(num - 2))
}
}
}
Code: 06:04:08 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
// write your code in Java SE 8
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} els e{
fibonacciMap.put(num, getFibonacciData(num - 2) + getFibonacciData(num - 1));
return fibonacciMap.get(num);
}
}
}
Code: 06:04:25 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
// write your code in Java SE 8
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, getFibonacciData(num - 2) + getFibonacciData(num - 1));
return fibonacciMap.get(num);
}
}
}
Code: 06:04:35 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
// write your code in Java SE 8
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:05:06 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= )
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:05:22 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:05:52 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:06:14 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");
import java.util.Map;
import java.util.HashMap;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:06:25 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:06:49 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList)
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:07:01 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:07:31 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.Queue;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:07:41 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
Code: 06:07:55 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
}
Code: 06:08: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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
int position;
int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:08:50 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
public int getPosition() {
return this.position;
}
public int getJump() {
return th
}
}
Code: 06:09:00 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
public int getPosition() {
return this.position;
}
public int getJump() {
return this.jump;
}
}
Code: 06:09:34 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
}
public int getPosition() {
return this.position;
}
public int getJump() {
return this.jump;
}
}
Code: 06:09:38 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:10:05 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
queu.add(new Point(-1, 0)); // Str
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:10:36 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibo)
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:10:46 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");
import java.util.Map;
import java.util.HashMap;
import java.util.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
}
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:11:17 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jum + 1;
} else if ()
}
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:11:41 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jum + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next]
}
}
}
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:12:02 UTC,
java,
autosave
123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jum + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next]
}
}
}
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:12:32 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jum + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
Point point new Point(next, currentPoint.jump + 1);
queue.add(point);
}
}
}
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:12:43 UTC,
java,
autosave
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jum + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.jump + 1));
}
}
}
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Code: 06:12:45 UTC,
java,
verify,
result: Failed
12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jum + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.jump + 1));
}
}
}
}
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Analysis
Compile error
Solution.java:27: error: cannot find symbol
queu.add(new Point(-1, 0)); // Starting point.
^
symbol: variable queu
location: class Solution
Solution.java:32: error: position has private access in Point
int next = currentPoint.position + fibonacci;
^
Solution.java:34: error: cannot find symbol
return currentPoint.jum + 1;
^
symbol: variable jum
location: variable currentPoint of type Point
Solution.java:38: error: jump has private access in Point
queue.add(new Point(next, currentPoint.jump + 1));
^
Solution.java:62: error: cannot find symbol
this.jum = jump;
^
symbol: variable jum
5 errors
Code: 06:12:56 UTC,
java,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jump + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.jump + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jum) {
this.position = position;
this.jum = jump;
}
}
Analysis
Compile error
Solution.java:27: error: cannot find symbol
queu.add(new Point(-1, 0)); // Starting point.
^
symbol: variable queu
location: class Solution
Solution.java:32: error: position has private access in Point
int next = currentPoint.position + fibonacci;
^
Solution.java:34: error: jump has private access in Point
return currentPoint.jump + 1;
^
Solution.java:38: error: jump has private access in Point
queue.add(new Point(next, currentPoint.jump + 1));
^
Solution.java:63: error: cannot find symbol
this.jum = jump;
^
symbol: variable jum
5 errors
Code: 06:13:14 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jump + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.jump + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
}
Code: 06:13:14 UTC,
java,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jump + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.jump + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
}
Analysis
Compile error
Solution.java:27: error: cannot find symbol
queu.add(new Point(-1, 0)); // Starting point.
^
symbol: variable queu
location: class Solution
Solution.java:32: error: position has private access in Point
int next = currentPoint.position + fibonacci;
^
Solution.java:34: error: jump has private access in Point
return currentPoint.jump + 1;
^
Solution.java:38: error: jump has private access in Point
queue.add(new Point(next, currentPoint.jump + 1));
^
4 errors
Code: 06:13:44 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jump + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.jump + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
public int getPosition() {
return
}
}
Code: 06:14:17 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jump + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.jump + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
public int getPosition() {
return th
}
}
Code: 06:14:34 UTC,
java,
autosave
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.position + fibonacci;
if (next == A.length) {
return currentPoint.jump + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.getJump() + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
public int getPosition() {
return this.position;
}
public int getJump() {
return this.jump;
}
}
Code: 06:14:43 UTC,
java,
verify,
result: Failed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queu.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.getPosition() + fibonacci;
if (next == A.length) {
return currentPoint.getJump() + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.getJump() + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
public int getPosition() {
return this.position;
}
public int getJump() {
return this.jump;
}
}
Analysis
Compile error
Solution.java:27: error: cannot find symbol
queu.add(new Point(-1, 0)); // Starting point.
^
symbol: variable queu
location: class Solution
1 error
Code: 06:14:51 UTC,
java,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queue.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.getPosition() + fibonacci;
if (next == A.length) {
return currentPoint.getJump() + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.getJump() + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
public int getPosition() {
return this.position;
}
public int getJump() {
return this.jump;
}
}
Analysis
Code: 06:14:56 UTC,
java,
verify,
result: Passed
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queue.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.getPosition() + fibonacci;
if (next == A.length) {
return currentPoint.getJump() + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.getJump() + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
public int getPosition() {
return this.position;
}
public int getJump() {
return this.jump;
}
}
Analysis
Code: 06:15:01 UTC,
java,
final,
score:
100
1234567891011121314151617181920212223242526272829303132333435363738394041424344454647484950515253545556575859606162636465666768697071
// 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.List;
import java.util.ArrayList;
import java.util.Collections;
import java.util.Queue;
import java.util.LinkedList;
class Solution {
private final Map<Integer, Integer> fibonacciMap = new HashMap<>();
public int solution(int[] A) {
for (int idx =0; getFibonacciData(idx) <= A.length + 1; idx++) {
getFibonacciData(idx);
}
List<Integer> fibonacciList = new ArrayList<>(fibonacciMap.values());
Collections.reverse(fibonacciList);
Queue<Point> queue = new LinkedList<>();
boolean[] check = new boolean[A.length + 1];
queue.add(new Point(-1, 0)); // Starting point.
while (!queue.isEmpty()) {
Point currentPoint = queue.poll();
for (int fibonacci : fibonacciList) {
int next = currentPoint.getPosition() + fibonacci;
if (next == A.length) {
return currentPoint.getJump() + 1;
} else if (next < A.length && next >= 0) {
if (A[next] == 1 && !check[next]) {
check[next] = true;
queue.add(new Point(next, currentPoint.getJump() + 1));
}
}
}
}
return -1;
}
private int getFibonacciData(int num) {
if (num <= 1) {
return num;
}
if (fibonacciMap.containsKey(num)) {
return fibonacciMap.get(num);
} else {
int temp = getFibonacciData(num - 2) + getFibonacciData(num - 1);
fibonacciMap.put(num, temp);
return temp;
}
}
}
class Point {
private int position;
private int jump;
public Point(int position, int jump) {
this.position = position;
this.jump = jump;
}
public int getPosition() {
return this.position;
}
public int getJump() {
return this.jump;
}
}
Analysis summary
The solution obtained perfect score.
Analysis
Detected time complexity:
O(N * log(N))
expand all
Correctness tests
1.
0.008 s
OK
2.
0.008 s
OK
3.
0.004 s
OK
4.
0.012 s
OK
1.
0.012 s
OK
2.
0.012 s
OK
3.
0.008 s
OK
1.
0.012 s
OK
2.
0.008 s
OK
3.
0.012 s
OK
4.
0.012 s
OK
5.
0.008 s
OK
6.
0.012 s
OK
7.
0.012 s
OK
8.
0.012 s
OK
1.
0.008 s
OK
1.
0.016 s
OK
2.
0.012 s
OK
3.
0.012 s
OK
4.
0.012 s
OK
1.
0.012 s
OK
expand all
Performance tests
1.
0.032 s
OK
1.
0.036 s
OK
1.
0.160 s
OK
2.
0.132 s
OK
3.
0.132 s
OK
1.
0.188 s
OK
2.
0.152 s
OK
1.
0.208 s
OK
1.
0.160 s
OK
2.
0.240 s
OK