linked-list-kth

solution

• Find k’th node from the end of a linked list calculate the total number of nodes n in the linked list first, then the K Th node from the end will be (n-k+1) node from the beginning.

BIG O_____

• time(Kth) –> O(n)

• space(Kth) –> O(1)

Testing

• Where k is greater than the length of the linked list

• Where k and the length of the list are the same

• Where k is not a positive integer

• Where the linked list is of a size 1

• “Happy Path” where k is not at the end, but somewhere in the middle of the linked list

---

whiteboard proces