Table of Contents
If you want to practice data structure and algorithm programs, you can go through data structure and algorithm interview questions.
This is one of the popular interview question.
In this post, we will discuss how to find middle element in linkedlist in most efficient way.
Java Linked List Interview Programs:
- How to reverse a linked list in java
- How to reverse a linked list in pairs
- How to find middle element of linked list in java
- How to detect a loop in linked list in java
- Find start node of loop in linkedlist
- How to find nth element from end of linked list
- How to check if linked list is palindrome in java
- Add two numbers represented by linked list in java
Assumption:
One of the algo for this would be:
- Traverse the list and find the length of list
- After finding length, again traverse the list and locate n/2 element from head of linkedlist.
Time complexity=time for finding length of list + time for locating middle element=o(n)+o(n) =o(n)
Space complexity= o(1).
Efficient approach:
Above approach will take two traversal but we can find middle element in one traversal also using following algo:
- Use two pointer fastptr and slowptr and initialize both to head of linkedlist
- Move fastptr by two nodes and slowptr by one node in each iteration.
- When fastptr reaches end of nodes, the slowptr pointer will be pointing to middle element.
Lets create java program for it:
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 |
package org.arpit.java2blog; /** @author: Arpit Mandliya */ public class LinkedList{ private Node head; private static class Node { private int value; private Node next; Node(int value) { this.value = value; } } public void addToTheLast(Node node) { if (head == null) { head = node; } else { Node temp = head; while (temp.next != null) temp = temp.next; temp.next = node; } } public void printList() { Node temp = head; while (temp != null) { System.out.format("%d ", temp.value); temp = temp.next; } System.out.println(); } // This function will find middle element in linkedlist public Node findMiddleNode(Node head) { Node slowPointer, fastPointer; slowPointer = fastPointer = head; while(fastPointer !=null) { fastPointer = fastPointer.next; if(fastPointer != null && fastPointer.next != null) { slowPointer = slowPointer.next; fastPointer = fastPointer.next; } } return slowPointer; } public static void main(String[] args) { LinkedList list = new LinkedList(); // Creating a linked list Node head=new Node(5); list.addToTheLast(head); list.addToTheLast(new Node(6)); list.addToTheLast(new Node(7)); list.addToTheLast(new Node(1)); list.addToTheLast(new Node(2)); list.printList(); // finding middle element Node middle= list.findMiddleNode(head); System.out.println("Middle node will be: "+ middle.value); } } |
Logically linked list can be represented as:
Middle element is represented in red color.
Run above program, you will get following output:
|
1 2 3 4 |
5 6 7 1 2 Middle node is: 7 |
Please go through java interview programs for more such programs.
