Java Program To Check If A Linked List Of Strings Forms A Palindrome Last Updated : 22 Jun, 2022 Summarize Comments Improve Suggest changes Share Like Article Like Report Given a linked list handling string data, check to see whether data is palindrome or not? Examples: Input: a -> bc -> d -> dcb -> a -> NULL Output: True String "abcddcba" is palindrome. Input: a -> bc -> d -> ba -> NULL Output: False String "abcdba" is not palindrome. Recommended: Please solve it on "PRACTICE" first, before moving on to the solution. The idea is very simple. Construct a string out of given linked list and check if the constructed string is palindrome or not. Java // Java Program to check if a given linked list // of strings form a palindrome import java.util.Scanner; // Linked List node class Node { String data; Node next; Node(String d) { data = d; next = null; } } class LinkedList_Palindrome { Node head; // A utility function to check if // str is palindrome or not boolean isPalidromeUtil(String str) { int length = str.length(); // Match characters from beginning // and end. for (int i = 0; i < length / 2; i++) if (str.charAt(i) != str.charAt(length - i - 1)) return false; return true; } // Returns true if string formed by // linked list is palindrome boolean isPalindrome() { Node node = head; // Append all nodes to form a // string String str = ""; while (node != null) { str = str.concat(node.data); node = node.next; } // Check if the formed string is // palindrome return isPalidromeUtil(str); } // Driver code public static void main(String[] args) { LinkedList_Palindrome list = new LinkedList_Palindrome(); list.head = new Node("a"); list.head.next = new Node("bc"); list.head.next.next = new Node("d"); list.head.next.next.next = new Node("dcb"); list.head.next.next.next.next = new Node("a"); System.out.println(list.isPalindrome()); } } // This code is contributed by Amit Khandelwal Output: true Time Complexity: O(n), where n is the number of nodes in the given linked list.Auxiliary Space: O(m) where m is the length of the string formed by the linked list. Please refer complete article on Check if a linked list of strings forms a palindrome for more details! Comment More infoAdvertise with us Next Article Java Program To Check If A Linked List Of Strings Forms A Palindrome K kartik Follow Improve Article Tags : Linked List Java Programs DSA palindrome Practice Tags : Linked Listpalindrome Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Array Data Structure Guide In this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous 4 min read Sorting Algorithms A Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ 3 min read Like