In this program, we will create 3 queues using the Queue interface with the help of Linked List collection and store elements in a FIFO (First In First Out) manner. Here, we will compare queues using the equals() method.

Program/Source Code:

The source code to compare two queues is given below. The given program is compiled and executed successfully.

// Java program to compare two queues

import java.util.*;

public class Main {
  public static void main(String[] args) {
    Queue < Integer > queue1 = new LinkedList < > ();
    Queue < Integer > queue2 = new LinkedList < > ();
    Queue < Integer > queue3 = new LinkedList < > ();

    queue1.add(10);
    queue1.add(20);
    queue1.add(30);

    queue2.add(40);
    queue2.add(50);

    queue3.add(40);
    queue3.add(50);

    if (queue1.equals(queue2))
      System.out.println("The queue1 and queue2 have similar elements.");
    else
      System.out.println("The queue1 and queue2 have different elements.");

    if (queue2.equals(queue3))
      System.out.println("The queue2 and queue3 have similar elements.");
    else
      System.out.println("The queue2 and queue3 have different elements.");
  }
}

Output:

The queue1 and queue2 have different elements.
The queue2 and queue3 have similar elements.

Explanation:

In the above program, we imported the "java.util.*" package to use the Queue Interface and LinkedList collection. Here, we created a class Main. The Main class contains a main() method. The main() method is the entry point for the program.

In the main() method, we created a queue using the LinkedList collection and added items to it. Then we compared queues using the equals() method and printed the appropriate message.