I want to build palindrom checker in Rust, the constraint is O(n) time with 0(1) additional space. My ideas are:
Get the middle of the linked list.