1. Remove duplicates from a linked list with and without temporary buffer.
2. Get kth from last element from a given Single Linked List.
3. Delete any node in middle of a singly linked list (except head or tail).
4. You have two numbers represented by singly linked list, where each node contains a single digit. The digits are stored in reverse order, such that one's digit is at the head of the singly linked list. Write a function to add numbers from such two linked list and return them in the same type of linked list as above.
5. Check if the given SLL is a palindrome.
6. Given two SLL, determine if the lists are intersecting (you can assume they have unqiue elements).
7. Find in the two given SLL if there is a loop or not.