Publish Your Article Here

Program: Identify middle element of a Linked List

Problem Description:

Write a simple code to identify middle element from given linked list.

Our approach is:

We can identify the middle element based on the lenght of the Linked list. But we cannot find the middle index until we traverse through Linked list and count the length. There are two ways to solve this problem.

First Approach:

  • We will traverse twice over linked list in this approach.
  • In first traversal, we will count the length.
  • Identify middle index from the length.
  • In the second traversal, go to the number of nodes based on middle index and get the node data.

Second Approach:

  • We will manage two temp nodes and traverse through Linked list once.
  • We will increment first temp node once and second temp node twice until we reach end of the linked list.
  • At the end of the traversal, the first temp node represents middle index.

package com.java2novice.algos;

public class LinkedListMiddleElement {

    static class Node{
        int data;
        Node next;
        Node(int tmp) {
            data = tmp;

    static void findMiddleElementV1(Node head) {
         * In this method, first we get the element count by traversing through the linked list.
         * Then we identify middle element index by count.
         * Then traverse through linked list nodes based on count.
        int count = 0;
        Node countNode = head;
        while(countNode != null) {
            countNode =;
        count = count/2;
        while(head != null) {
            head =;
            if(count == 0) {
                System.out.println("Middle Element: " +;

    static void findMiddleElementV2(Node head) {

         * In this approach, we will have two node references. 
         * First node, we increment by two steps
         * Second node, we increment ny one step.
         * At the end we get the middle element ny second node.
        Node singIncNode = head;
        Node doubIncNode = head;
        if(head == null) {
            System.out.println("The haed node is null, no elements in the linked list");

        while(doubIncNode != null && != null) {
            doubIncNode =;
            singIncNode =;
        System.out.println("Middle Element: "+;

    public static void main(String a[]) {

        Node n1 = new Node(10);
        Node n2 = new Node(29);
        Node n3 = new Node(20);
        Node n4 = new Node(25);
        Node n5 = new Node(10); = n2; = n3; = n4; = n5;

Middle Element: 20
<< Previous Program | Next Program >>

List Of All Interview Programs:

  1. Remove last node of the Linked List
  2. Identify middle element of a Linked List
  3. Identify given LinkedList is a palindrom or not using Stack.
  4. Remove duplicates from sorted linked list
  5. Find Nth node from the end of Linked List
  6. Identify loop/cycle in a LinkedList.
  7. Find length of a loop in a LinkedList.
  8. Detect and remove loop in a LinkedList.
  9. How to reverse Singly Linked List?
  10. Check if given Linked List is a Circular Linked List or not.
  11. Find out duplicate number between 1 to N numbers.
  12. Find out middle index where sum of both ends are equal.
  13. Write a singleton class.
  14. Write a program to create deadlock between two threads.
  15. Write a program to reverse a string using recursive algorithm.
  16. Write a program to reverse a number.
  17. Write a program to convert decimal number to binary format.
  18. Write a program to find perfect number or not.
  19. Write a program to implement ArrayList.
  20. Write a program to find maximum repeated words from a file.
  21. Wrie a program to find out duplicate characters in a string.
  22. Write a program to find top two maximum numbers in a array.
  23. Write a program to sort a map by value.
  24. Write a program to find common elements between two arrays.
  25. How to swap two numbers without using temporary variable?
  26. Write a program to print fibonacci series.
  27. Write a program to find sum of each digit in the given number using recursion.
  28. Write a program to check the given number is a prime number or not?
  29. Write a program to find the given number is Armstrong number or not?
  30. Write a program to convert binary to decimal number.
  31. Write a program to check the given number is binary number or not?
  32. Write a program for Bubble Sort in java.
  33. Write a program for Insertion Sort in java.
  34. Write a program to implement hashcode and equals.
  35. How to get distinct elements from an array by avoiding duplicate elements?
  36. Write a program to get distinct word list from the given file.
  37. Write a program to get a line with max word count from the given file.
  38. Write a program to convert string to number without using Integer.parseInt() method.
  39. Write a program to find two lines with max characters in descending order.
  40. Write a program to find the sum of the first 1000 prime numbers.
  41. Find longest substring without repeating characters.
  42. Write a program to remove duplicates from sorted array.
  43. How to sort a Stack using a temporary Stack?
  44. Write a program to print all permutations of a given string.
  45. Implement Binary Search Tree (BST)
  46. Find min and max value from Binary Search Tree (BST)
  47. Find height of a Binary Search Tree (BST)
  48. Implement Binary Search Tree (BST) Level order traversal (breadth first).
  49. Implement Binary Search Tree (BST) pre-order traversal (depth first).
  50. Implement Binary Search Tree (BST) in-order traversal (depth first).
  51. Implement Binary Search Tree (BST) post-order traversal (depth first).
  52. How to check the given Binary Tree is Binary Search Tree (BST) or not?
  53. How to delete a node from Binary Search Tree (BST)?
  54. Write a program to find common integers between two sorted arrays.
  55. Write a program to find given two trees are mirror or not.
  56. HackerRank stack problem - Find maximum element.
  57. HackerRank stack problem - Balanced Brackets.
  58. HackerRank stack problem - Equal Stacks.
  59. HackerRank stack problem - Game Of Two Stacks.
Knowledge Centre
What is daemon thread?
Daemon thread is a low priority thread. It runs intermittently in the back ground, and takes care of the garbage collection operation for the java runtime system. By calling setDaemon() method is used to create a daemon thread.
Famous Quotations
Be yourself; everyone else is already taken.
-- Oscar Wilde

About Author

I'm Nataraja Gootooru, programmer by profession and passionate about technologies. All examples given here are as simple as possible to help beginners. The source code is compiled and tested in my dev environment.

If you come across any mistakes or bugs, please email me to [email protected].

Most Visited Pages

Other Interesting Sites

Reference: Java™ Platform Standard Ed. 7 - API Specification | Java™ Platform Standard Ed. 8 - API Specification | Java is registered trademark of Oracle.
Privacy Policy | Copyright © 2024 by Nataraja Gootooru. All Rights Reserved.