|-----|----------------|---------------|---------------|---------------|--------|-------------|-------------

|5087|[Letter Tile Possibilities](https://leetcode.com/problems/letter-tile-possibilities/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5087.java)| O(1)| O(1)||Medium||

|5083|[Occurrences After Bigram](https://leetcode.com/problems/occurrences-after-bigram/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_5083.java)| O(n)| O(1)||Easy||

|1137|[N-th Tribonacci Number](https://leetcode.com/problems/n-th-tribonacci-number/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1137.java)| O(n)| O(n)||Easy||

|1122|[Relative Sort Array](https://leetcode.com/problems/relative-sort-array/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1122.java)| O(n)| O(n)||Easy||

|1071|[Greatest Common Divisor of Strings](https://leetcode.com/problems/greatest-common-divisor-of-strings/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1071.java)| O(m*n)| O(1)||Easy||

|1065|[Index Pairs of a String](https://leetcode.com/problems/index-pairs-of-a-string/)|[Solution](../master/src/main/java/com/fishercoder/solutions/_1065.java)| O(nlogn)| O(1)||Medium||

packagecom.fishercoder.solutions;

publicclass_1137 {

publicstaticclassSolution1 {

publicinttribonacci(intn) {

if (n <=1) {

returnn;

}

int[]numbers =newint[n +1];

numbers[0] =0;

numbers[1] =1;

numbers[2] =1;

for (inti =3;i <=n;i++) {

numbers[i] =numbers[i -1] +numbers[i -2] +numbers[i -3];

}

returnnumbers[n];

}

}

}

packagecom.fishercoder;

importcom.fishercoder.solutions._1137;

importorg.junit.BeforeClass;

importorg.junit.Test;

importstaticorg.junit.Assert.assertEquals;

publicclass_1137Test {

privatestatic_1137.Solution1solution1;

publicstaticvoidsetup() {

solution1 =new_1137.Solution1();

}

publicvoidtest1() {

assertEquals(2,solution1.tribonacci(3));

}

publicvoidtest2() {

assertEquals(4,solution1.tribonacci(4));

}

publicvoidtest3() {

assertEquals(1389537,solution1.tribonacci(25));

}

publicvoidtest4() {

assertEquals(0,solution1.tribonacci(0));

}

publicvoidtest5() {

assertEquals(1,solution1.tribonacci(2));

}

}