Types of Linked List

import java.util.*;

public class Main {
  static class ListNode {
    int val;
    ListNode next;
    ListNode(int val) {
      this.val = val;
    }
  }

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    int n = sc.nextInt();

    ListNode dummy = new ListNode(0);
    ListNode tail = dummy;
    for (int i = 0; i < n; i++) {
      tail.next = new ListNode(sc.nextInt());
      tail = tail.next;
    }

    int k = sc.nextInt();
    ListNode fast = dummy;
    ListNode slow = dummy;

    for (int i = 0; i < k; i++) {
      fast = fast.next;
    }

    while (fast.next != null) {
      fast = fast.next;
      slow = slow.next;
    }

    slow.next = slow.next.next;

    ListNode cur = dummy.next;
    if (cur == null) {
      System.out.println("EMPTY");
      return;
    }

    boolean first = true;
    while (cur != null) {
      if (!first) System.out.print(" ");
      System.out.print(cur.val);
      first = false;
      cur = cur.next;
    }
    System.out.println();
  }
}

class Node:
    def __init__(self, val):
        self.val = val
        self.next = None

n = int(input())
values = list(map(int, input().split()))
k = int(input())

dummy = Node(0)
tail = dummy
for value in values:
    tail.next = Node(value)
    tail = tail.next

fast = dummy
slow = dummy
for _ in range(k):
    fast = fast.next

while fast.next:
    fast = fast.next
    slow = slow.next

slow.next = slow.next.next

answer = []
cur = dummy.next
while cur:
    answer.append(cur.val)
    cur = cur.next

if answer:
    print(*answer)
else:
    print("EMPTY")