Back
Fast-Slow Pointers
Question 1 of 12
8% Complete
Medium
Palindrome linked list check in O(n) time and O(1) space uses...
A
Copy to array then two pointers
B
Find middle, reverse second half, compare, then optionally restore
C
Hash table of seen values
D
Recursively compare ends