< Summary

Information
Class: LeetCode.Algorithms.PalindromeLinkedList.PalindromeLinkedListTwoPointers
Assembly: LeetCode
File(s): D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PalindromeLinkedList\PalindromeLinkedListTwoPointers.cs
Line coverage
100%
Covered lines: 22
Uncovered lines: 0
Coverable lines: 22
Total lines: 57
Line coverage: 100%
Branch coverage
90%
Covered branches: 9
Total branches: 10
Branch coverage: 90%
Method coverage

Feature is only available for sponsors

Upgrade to PRO version

Metrics

MethodBranch coverage Crap Score Cyclomatic complexity Line coverage
IsPalindrome(...)90%1010100%

File(s)

D:\a\LeetCode-CS\LeetCode-CS\source\LeetCode\Algorithms\PalindromeLinkedList\PalindromeLinkedListTwoPointers.cs

#LineLine coverage
 1// --------------------------------------------------------------------------------
 2// Copyright (C) 2025 Eugene Eremeev (also known as Yevhenii Yeriemeieiv).
 3// All Rights Reserved.
 4// --------------------------------------------------------------------------------
 5// This software is the confidential and proprietary information of Eugene Eremeev
 6// (also known as Yevhenii Yeriemeieiv) ("Confidential Information"). You shall not
 7// disclose such Confidential Information and shall use it only in accordance with
 8// the terms of the license agreement you entered into with Eugene Eremeev (also
 9// known as Yevhenii Yeriemeieiv).
 10// --------------------------------------------------------------------------------
 11
 12using LeetCode.Core.Models;
 13
 14namespace LeetCode.Algorithms.PalindromeLinkedList;
 15
 16/// <inheritdoc />
 17public class PalindromeLinkedListTwoPointers : IPalindromeLinkedList
 18{
 19    /// <summary>
 20    ///     Time complexity - O(n)
 21    ///     Space complexity - O(n)
 22    /// </summary>
 23    /// <param name="head"></param>
 24    /// <returns></returns>
 25    public bool IsPalindrome(ListNode? head)
 1326    {
 1327        if (head?.next == null)
 128        {
 129            return true;
 30        }
 31
 1232        var values = new List<int>();
 33
 6234        while (head != null)
 5035        {
 5036            values.Add(head.val);
 37
 5038            head = head.next;
 5039        }
 40
 1241        var left = 0;
 1242        var right = values.Count - 1;
 43
 2844        while (left < right)
 2045        {
 2046            if (values[left] != values[right])
 447            {
 448                return false;
 49            }
 50
 1651            left++;
 1652            right--;
 1653        }
 54
 855        return true;
 1356    }
 57}