Skip to content

Latest commit

 

History

History
54 lines (44 loc) · 2.99 KB

linked-lists.md

File metadata and controls

54 lines (44 loc) · 2.99 KB
Raw

Linked Lists

  1. Remove duplicates: Write code to remove duplicates from an unsorted linked list. How would you solve this problem if a temporary buffer is not allowed?

  2. Return Kth to Last: Implement an algorithm to find the kth to last element of a singly linked list. Iteratively and recursively.

  3. Delete Middle Node: Implement an algorithm to delete a node in the middle (i.e., any node but the first and last node, not necessarily the exact middle) of a singly linked list, given only access to that node.

    • EXAMPLE:
      • Input: the node c from the linked list a -> b -> c -> d -> e -> f.
      • Output: nothing is returned, but the new linked list looks like a -> b-> d -> e -> f.

  4. Partition: Write code to partition a linked list around a value x, such that all nodes less than x come before all nodes greater than or equal to x. If x is contained within the list, the values of x only need to be after the elements less than x (see below). The partition element x can appear anywhere in the "right partition"; it does not need to appear between the left and right partitions.

    • EXAMPLE:
      • Input: 3 -> 5 -> 8 -> 5 -> 10 -> 2 -> 1 [partition= 5].
      • Output: 3 -> 1 -> 2 -> 10 -> 5 -> 5 -> 8.

  5. Sum Lists: You have two numbers represented by a linked list, where each node contains a single digit. The digits are stored in reverse order, such that the 1's digit is at the head of the list. Write a function that adds the two numbers and returns the sum as a linked list.

    • EXAMPLE:
      • Input: (7-> 1 -> 6) + (5 -> 9 -> 2). That is, 617 + 295.
      • Output: 2 -> 1 -> 9. That is, 912.

  6. Palindrome: Implement a function to check if a linked list is a palindrome.

  7. Intersection: Given two (singly) linked lists, determine if the two lists intersect. Return the intersecting node. Note that the intersection is defined based on reference, not value. That is, if the kth node of the first linked list is the exact same node (by reference) as the jth node of the second linked list, then they are intersecting.

  8. Loop Detection: Given a circular linked list, implement an algorithm that returns the node at the beginning of the loop. A circular linked list is a corrupt linked list in which a node's next pointer points to an earlier node, so as to make a loop in the linked list.

    • EXAMPLE
      • Input: A -> B -> C -> D -> E -> C [the same C as earlier].
      • Output: C.