Q43
How do you efficiently find the kth to last element in a singly linked list?
A.
Using a single pointer to traverse the list
B.
Using two pointers (k steps apart)
AnswerC.
Using a stack to store elements
D.
Using a binary search
Answer: Option B
Solution
Answer: Option B
No explanation is given for this question Let's Discuss on Board