package leetcode;

/**
 * https://leetcode.com/problems/length-of-longest-fibonacci-subsequence/
 */
public class Problem873 {
    public int lenLongestFibSubseq(int[] A) {
        // TODO
        return 0;
    }

    public static void main(String[] args) {
        Problem873 prob = new Problem873();
    }
}

@@ -170,24 +170,8 @@
 ) %7B%0A
-        // TODO%0A
     
@@ -184,16 +184,16 @@
 turn 0;%0A
+
     %7D%0A%0A 
@@ -232,24 +232,24 @@
 g%5B%5D args) %7B%0A
-
         Prob
@@ -280,16 +280,205 @@
 m873();%0A
+        System.out.println(prob.lenLongestFibSubseq(new int%5B%5D%7B1, 2, 3, 4, 5, 6, 7, 8%7D)); // 5%0A        System.out.println(prob.lenLongestFibSubseq(new int%5B%5D%7B1, 3, 7, 11, 12, 14, 18%7D)); // 3%0A
     %7D%0A%7D%0A

Update problem 873