Submission Title
Remove kth Node From End of Linked List
Submission Type
Data Structure
Submission Description
Given a linked list, remove the Kth node from the end of singly linked list and return its head. A fundamental Linked List problem that helps understand traversal and delete operation on Linked List Nodes. Asked by Amazon, HCL.
Submission Directory
Data_Structures => Linked_List => Singly_Linked_List => Delete_Kth_Node_From_End => Delete_Kth_Node_From_End.ext
Contributors
^ please assign me this in Python, @ahampriyanshu
Nice problem. I honestly can't wrap my head around this problem in Python. Make sure you comment the code well for precedent purposes
I'd be glad to contribute for Java
assign it to me for c++
@ahampriyanshu
can i work on it in c or c++!
I want to contribute to this in C or C++.
:)
@ahampriyanshu Please assign this to me in ruby
assign it to me for c
Hey, Can you assign me with java?
Hey can you assign it to me with C?
Hey, Can you assign it to me with c++?
Hey, Can I work on this in Java?
Hey , can I contribute on this in Ruby ?
PRs would be merged on "First Come, First Serve" basis.
:v:
@ahampriyanshu I have resolved the issue #1260 in C
The code is in the simplest way possible
thanks
thanks everyone :v: