Palindrome Linked List | Leetcode 234 | Live coding session | April Day 1 | LEETCODE EXPLORE

1) 0:00 Explaining the problem out loud
2) 1:10 Algorithm walkthrough
3) 8:15 Coding it up
4) 13:00 TC/SC

PS : Please increase the speed to 1.25X

[Saurabh-febg]

I watch the algo and code it by myself, it has helped me a lot thanks man
currently I am in techmahindra and now trying to go into pbc lets see what happens

[tanson]

I think once we identify the mid point we can add the other half to an array list and then do the comparison. Space wise it is the same and also we can avoid the reverse function by using Collections.reverse(aList). What do you think?