Check if Linked List is Palindrome | Programming Interview

Check if the Linked List nodes form a palindrome. We check this using 2 methods: 1. Using Stack: Time O(n), Space O(n) 2. Reversing 2nd half of Linked List: Time O(n), Space O(1) Reverse Linked List Iteratively: https://www.youtube.com/watch?v=2kpLung16jM Reverse Linked List Recursively: https://www.youtube.com/watch?v=rj5U2mM8WzA Find middle element of Linked List: https://www.youtube.com/watch?v=zKNfIHijr1o **** Best Books For Data Structures & Algorithms for Interviews: 1. Cracking the Coding Interview: https://amzn.to/2WeO3eO 2. Cracking the Coding Interview Paperback: https://amzn.to/3aSSe3Q 3. Coding Interview Questions - Narasimha Karumanchi: https://amzn.to/3cYqjkV 4. Data Structures and Algorithms Made Easy - N. Karumanchi: https://amzn.to/2U8FrDt 5. Data Structures & Algorithms made Easy in Java - N. Karumanchi: https://amzn.to/2U0qZgY 6. Introduction to Algorithms - CLR - Cormen, Leiserson, Rivest: https://amzn.to/2Wdp8rZ Support me on Patreon: https://www.patreon.com/KnowledgeCenter Video slides available at: https://neuralnetworksai.blogspot.com/2019/04/check-if-linked-list-is-palindrome.html #Linked #List #Palindrome