palind list
class Solution {
public boolean isPalindrome(ListNode head) {
if (head == null || head.next == null) return true;
// Step 1: Find middle using slow and fast pointers
ListNode slow = head;
ListNode fast = head;
...
yesamitsingh.hashnode.dev1 min read