Raised as issue

For an unordered linked list, one can simply add the seen elements in an array/list and skip the nodes where data is already in the seen list.

With JUnit 5 is possible and easy.

Huge update to this kata!

Huge update to this kata!

Your link is wrong and give a 404 error:
http://junit-team.github.io/junit/javadoc/4.10/org/hamcrest/CoreMatchers.html

Take the pebble from my hand grasshopper.

Why it is soo messed up respect to other languages?!?

Ya I think it came from the David Carradine TV show "Kung Fu" and "Kung Fu the Legend Returns".

The problem states that the list will always be sorted in increasing order. Removing duplicates from an unordered list would be a great future Linked List problem to create, however.

Thanks, laoris. Now it is fixed, I substitute the confussing 769 for 789. Thanks for your time.

I took it for a famous quote about learning your kung fu, but who knows if I was right.

Well, you can group tests into more test classes. To run it in embedded editor, you can wrap them into one suite, like:

import org.junit.Test;
import org.junit.runner.RunWith;
import org.junit.runners.Suite;
import static org.hamcrest.CoreMatchers.is;
import static org.junit.Assert.assertThat;

@RunWith(Suite.class)
@Suite.SuiteClasses({
   MyTestSuite.MyTests.class,
   MyTestSuite.MyTests2.class
})
public class MyTestSuite {   
  
  public static class MyTests {
    @Test public void testIt() {
      assertThat(true, is(true));
    }
  }  
  
  public static class MyTests2 {
    @Test public void testIt2() {
      assertThat(false, is(false));
    }
  }
}

This will return integers in the range [0, 1000], so it's not better.