Friday, May 24, 2024
HomeJavaMethods to examine if a given linked listing is a palindrome in...

Methods to examine if a given linked listing is a palindrome in Java? Instance [Solved]

Disclosure: This text might comprise affiliate hyperlinks. While you buy, we might earn a small fee.

Whats up guys, in case you are questioning find out how to examine if a given linked listing is a
palindrome in Java then you might have come to the fitting place. Previously, I
have shared 
find out how to examine if a given String is palindrome or a given quantity is a palindrome, and on this article, I’ll train you find out how to examine if a linked listing is a
palindrome. However earlier than that, let’s revise what’s a palindrome? A palindrome
is a phrase, phrase or quantity, or different sequence of characters that reads the
identical backward advert ahead. Which means that It provides you an identical factor when learn
ahead or backward. For instance, Mary, Military, Madam, racecar, 1-2-3-2-1,
midday, stage, Hannah, civic, and many others.

Because it’s the linked listing information construction we’re working with, it’s good to actually
perceive what a linked listing is earlier than we will now do stuff with it.

linked listing is an information construction by which every node(ingredient) holds the reference
to the following node. You don’t have to undergo the wrestle of looking the
actual node within the hyperlink listing, all you must do is undergo the earlier
node as a result of it holds the reference to the following node, then you may simply
entry it.

You might want to know that the Java LinkedList class makes use of a doubly linked listing to retailer the weather. It supplies a
linked-list information construction. It inherits the AbstractList class and
Checklist and Deque interfaces.

Issues to notice in Java Linked listing:

  • Java LinkedList class maintains insertion order.
  • Java LinkedList class can comprise duplicate components.
  • Java LinkedList class is non-synchronized.
  • Java LinkedList class can be utilized as a listing, stack, or queue.
  • Within the Java LinkedList class, manipulation is quick as a result of no shifting
    must happen.

Within the Java linked listing, components are linked utilizing pointers. A node
represents a component in a linked listing which have some information and a pointer
pointing to the following node. It may develop and shrink at runtime by allocating
and deallocating reminiscence. So there isn’t any want to provide the preliminary measurement of the
linked listing. Its construction appears just like the picture under.

A Linked listing in Java can both be single or double. I imply singly linked listing or double linked listing. So, it is dependent upon what you need to use. A singly-linked listing permits traversal components solely in a technique. A doubly linked listing permits ingredient two-way traversal.

On different hand, a doubly-linked listing can be utilized to implement stacks in addition to heaps and binary timber. A doubly linked listing makes use of extra
reminiscence per node (two pointers).

You could be questioning how would you understand which information construction to make use of or
when to make use of a linked listing, LinkedList permits for constant-time insertions or removals utilizing iterators, however solely
sequential entry of components. 

In different phrases, you may stroll the listing forwards or backward, however discovering a
place within the listing takes time proportional to the dimensions of the listing.
As a result of “operations that index into the listing will traverse the listing from the start of the tip”.

Java Program to examine if the given Linked Checklist is a Palindrome or not? Instance

So, proper now we will be writing a program to examine if a given linked
listing is a palindrome. Right here is  the whole java program to seek out if a given linked listing s a Palindrome or not. 

public class linkedList {
  public static void principal(String args[])
    Node one = new Node(1);
    Node two = new Node(3);
    Node three = new Node(5);
    Node 4 = new Node(3);
    Node 5 = new Node(1);
    one.ptr = two;
    two.ptr = three;
    three.ptr = 4;
    4.ptr = 5;  
    boolean situation = isPalindrome(one);
    if(situation == true){
      System.out.println("The Linked listing is a palindrome.");    
         System.out.println("The Linked listing is NOT a palindrome.")
  public static boolean isPalindrome(Node head)
    // This pointer will enable the primary traversal
    // of the linked listing
    Node subsequent = head;    
    boolean examine = true;
    Stack<Integer> stack = new Stack<Integer>();     
    // Traverse the linked listing and add its components
    // to the stack
    whereas (subsequent != null) {
      subsequent = subsequent.ptr;
    // Iterate the linked listing once more and  
    // examine by every ingredient with the stack
    whereas (head != null) {
      int i = stack.pop();
      if (head.information == i) {
        examine = true;
      else {
        examine = false;
      // Transfer to the following ingredient in stack and the listing
      head = head.ptr;
    return examine;
class Node {
  int information;
  Node ptr;
  Node(int d)
    ptr = null;
    information = d;

Linked Checklist Palindrome Drawback Algorithm and Resolution rationalization 

Line 1 is the category declaration, line 2 is the principle methodology that
instantiates every node from node 4 to node 8.

As a result of these
variables are of kind node, they’ve entry to the occasion variables
declared in school “Node”, so values had been being assigned to them. Examine
strains 9 to 12.

Line 13 referred to as the tactic “isPalindrome” and
assigned it to a boolean variable situation. So if the situation is true
in line 15, it prints out “Linked listing is a palindrome” else, it does
in any other case

Line 20 is the implementation of the tactic
“isPalindrome” which takes in a parameter “head” of kind Node, In Line 24
the parameter was assigned to variable subsequent of kind node. Then one other
boolean variable examine, in line 25.

In line 26, A stack was created. So, whereas the following ingredient shouldn’t be null, the stack
pushes in information and afterward, there was a re-assignment for the variable
“subsequent”. One other iteration once more, whereas the pinnacle shouldn’t be null the stack pops
out ingredient and shops it within the variable i. 

So if the information within the head Node is the same as the variable “i” then the
boolean examine needs to be set to true, else it needs to be false and after
all, it ought to break. In line 45 head is reassigned to move.ptr.

Line 47 it returned the boolean examine.

From line 51 is the Node
class with occasion variables, int information, and Node ptr respectively.
Adopted by the constructor. It’s not obligatory you might have the node class
the identical class because it was finished right here. You possibly can at all times have it in a separate
file, simply that it needs to be in the identical bundle so you may import from
that very same bundle.


The linked listing is a palindrome.

That is all about find out how to examine if a given linked listing is a palindrome in Java or not. That is an attention-grabbing coding drawback, not only for interviews but additionally
to be taught linked listing information construction because it provides you a chance to
traverse a linked listing. You additionally find out how you should use stack to carry out
the Final In First Out form of operation which is vital to reverse a linked
listing or reverse some other information construction. 

Associated Information Construction and Algorithm Interview Questions from Javarevisited Weblog

  • Methods to implement a linked listing utilizing generics in Java? (answer)
  • Methods to reverse a singly linked listing in Java? (answer)
  • Methods to discover the center ingredient of the linked listing utilizing a single move?
  • Methods to discover the third ingredient from the tip of a linked listing in Java? (answer)
  • High 15 Information Construction and Algorithm Interview Questions (see right here)
  • High 20 String coding interview questions (see right here)
  • 133 core Java interview questions of the final 5 years (see right here)
  • High 30 Array Coding Interview Questions with Solutions (see right here)
  • Methods to implement a skip listing in Java? (solved)
  • High 30 linked listing coding interview questions (see right here)
  • High 50 Java Applications from Coding Interviews (see right here)
  • 5 Free Information Construction and Algorithms Programs for Programmers (programs)
  • 10 Algorithms Books Each Programmer Ought to Learn (books)
  • 10 Free Information Construction and Algorithm Programs for Programmers (programs)
  • Methods to discover the size of a linked listing in Java? (answer)
  • 100+ Information Construction Coding Issues from Interviews (questions)

Thanks for studying this text to this point. If you happen to like this text, then
please share it with your mates and colleagues. In case you have any
questions or doubt then please tell us and I will attempt to discover a solution
for you. As at all times strategies, feedback, revolutionary and higher solutions
are most welcome.



Please enter your comment!
Please enter your name here

Most Popular

Recent Comments