Finding kth element from end of linkedlist. (Data Structures and Algorithms #32)(Linked List #6)

preview_player
Показать описание
This video explains how to find kth element from the end of linked list in most efficient manner and also discuss the time and space complexity of the solutions.

Time Complexity: O(n)
Space Complexity: O(1)
Рекомендации по теме
Комментарии
Автор

Been so long since you uploaded .. welcome back

sunguru
Автор

Damn you’re back!! I’ve been Waiting for your videos...

RishabhVerma