Java: Get the first and last occurrence of the specified elements in a linked list

Last update on May 22 2025 13:14:43 (UTC/GMT +8 hours)

10. Get First and Last Occurrence

Write a Java program to get the first and last occurrence of the specified elements in a linked list.

Sample Solution:-

Java Code:

import java.util.LinkedList;
import java.util.Iterator;
  public class Exercise10 {
  public static void main(String[] args) {
    // create an empty linked list
     LinkedList<String> l_list = new LinkedList<String>();
   // use add() method to add values in the linked list
          l_list.add("Red");
          l_list.add("Green");
          l_list.add("Black");
          l_list.add("Pink");
          l_list.add("orange");
      
      // print original list
   System.out.println("Original linked list:" + l_list);  
 
   // Find first element of the List
    Object first_element = l_list.getFirst();
    System.out.println("First Element is: "+first_element);
 
    // Find last element of the List
    Object last_element = l_list.getLast();
    System.out.println("Last Element is: "+last_element);
 }
}

Sample Output:

Original linked list:[Red, Green, Black, Pink, orange]                 
First Element is: Red                                                  
Last Element is: orange

Pictorial Presentation:

Flowchart:

For more Practice: Solve these Related Problems:

• Write a Java program to find and print the first and last index of a specified element in a linked list.
• Write a Java program to implement a method that returns both the first and last occurrence of an element as a pair.
• Write a Java program to search a linked list for a duplicate element and return the distance between its first and last occurrence.
• Write a Java program to use recursion to locate the first and last occurrence of an element in a linked list.

Go to:

• Java Collection Exercises Home ↩
• Java Exercises Home ↩

PREV : Insert Elements at Position.
NEXT : Display Elements and Positions.

Java Code Editor:

Contribute your code and comments through Disqus.