brightlightkim

2.2 Implement an algorithm to find the kth to last element of a singly linked list. public Node returnKthToLast(Node node, int k){ Node n = node; int i = 0; while (n.next != null){ if (i == k-1){ break; } i++; n = n.next; } return n; } This was so simple, but I found out that this algorithm is not what the potential interviewer is looking for. It's more like.. int printKthToLast(Node head, int k..

2.1 Write code to remove duplicates from an unsorted linked list. The first algorithm that came to my mind was storing data to Set and see if it shows an error when inserting a value to see if it exists. If it already exists then remove the node. Just checked the last Index. public Node deleteDuplicatedNodes(Node head){ Node n = head; Set set = new HashSet(); set.add(n.data); while(n.next != nul..

A Linked list is a data structure that represents a sequence of nodes. In a singly linked list, each node points to the next node in the linked list. A doubly linked list gives each node pointers to both the next node and the previous one. Unlike an array, a linked list does not provide constant-time access to a particular "index' within the list. This means that if you'd like to find the K'th e..