Breaking News: Grepper is joining You.com. Read the official announcement!

kth node from end of linked list leetcode

YOU.com answered on September 11, 2023 Popularity 3/10 Helpfulness 1/10

answer kth node from end of linked list leetcode

kth node from end of linked list leetcode

Comment

class ListNode:
    def __init__(self, val=0, next=None):
        self.val = val
        self.next = next

def findKthFromEnd(head, k):
    slow = fast = head
    # Move 'fast' pointer k steps ahead of 'slow' pointer
    for _ in range(k):
        fast = fast.next
    # Move both pointers until 'fast' reaches the end of the list
    while fast:
        slow = slow.next
        fast = fast.next
    return slow.val

Popularity 3/10 Helpfulness 1/10 Language python

Source: Grepper

Link to this answer
Share Copy Link

Contributed on Sep 11 2023

YOU.com

0 Answers Avg Quality 2/10

Continue with Google

By continuing, I agree that I have read and agree to Greppers's Terms of Service and Privacy Policy.

kth node from end of linked list leetcode

Contents

More Related Answers

kth node from end of linked list leetcode

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.