String Palindrome and Linked List

EasyPython

Problem

An Eaton diagnostic routine receives a device label and an ordered sequence of readings. Determine whether the label is a palindrome, then reverse the first half of the readings in place. For serialization, the linked list is represented by a Python list of node values, where the list order matches linked-list traversal order.

The first half contains floor(n / 2) nodes. For odd-length lists, the middle node remains in its original position. Return both results without changing the label.

Formal Specification

Implement analyze_and_reverse(label, values).

label is a string containing letters, digits, spaces, or punctuation. Compare characters exactly, including case and non-alphanumeric characters.
values is a mutable list of integers representing linked-list node values.
Return a dictionary with is_palindrome, a boolean, and values, the modified list.
Reverse the first floor(len(values) / 2) values in place.

Constraints

0 <= len(label) <= 10^5
0 <= len(values) <= 10^5
-10^9 <= values[i] <= 10^9
The input list must be modified in place
Palindrome comparison is case-sensitive

Function Signature

def analyze_and_reverse(label, values):

The first half contains floor(n / 2) nodes. For odd-length lists, the middle node remains in its original position. Return both results without changing the label.

Formal Specification

Implement analyze_and_reverse(label, values).

label is a string containing letters, digits, spaces, or punctuation. Compare characters exactly, including case and non-alphanumeric characters.
values is a mutable list of integers representing linked-list node values.
Return a dictionary with is_palindrome, a boolean, and values, the modified list.
Reverse the first floor(len(values) / 2) values in place.