@@ -0,0 +1,1920 @@
+package linked_list;%0A%0Aimport datastructures.lists.CustomLinkedList;%0Aimport datastructures.lists.LinkedListNode;%0A%0Apublic class MergeSortedLinkedListsReverse %7B%0A  CustomLinkedList%3CInteger%3E list = null;%0A  CustomLinkedList%3CInteger%3E list2 = null;%0A%0A  public MergeSortedLinkedListsReverse() %7B%0A    list = new CustomLinkedList%3CInteger%3E();%0A    list2 = new CustomLinkedList%3CInteger%3E();%0A  %7D%0A%0A  public void constructLists(String%5B%5D input, String%5B%5D input2) %7B%0A    for (String e : input) %7B%0A      if (!e.equals(%22NULL%22)) %7B%0A        list.add(Integer.parseInt(e));%0A      %7D%0A    %7D%0A%0A    for (String e : input2) %7B%0A      if (!e.equals(%22NULL%22)) %7B%0A        list2.add(Integer.parseInt(e));%0A      %7D%0A    %7D%0A  %7D%0A%0A  public CustomLinkedList%3CInteger%3E merge() %7B%0A    CustomLinkedList%3CInteger%3E resultList = new CustomLinkedList%3CInteger%3E();%0A    LinkedListNode%3CInteger%3E current = list.head();%0A    LinkedListNode%3CInteger%3E current2 = list2.head();%0A%0A    while (current != null && current2 != null) %7B%0A      if (current.data %3C current2.data) %7B%0A        resultList.add(current.data);%0A        current = current.next;%0A      %7D else %7B%0A        resultList.add(current2.data);%0A        current2 = current2.next;%0A      %7D%0A    %7D%0A%0A    while (current != null) %7B%0A      resultList.add(current.data);%0A      current = current.next;%0A    %7D%0A%0A    while (current2 != null) %7B%0A      resultList.add(current2.data);%0A      current2 = current2.next;%0A    %7D%0A%0A    reverseLinkedList(resultList);%0A%0A    return resultList;%0A  %7D%0A%0A  private void reverseLinkedList(CustomLinkedList%3CInteger%3E linkedList) %7B%0A    if (linkedList.isEmpty()) %7B%0A      return;%0A    %7D%0A    %0A    LinkedListNode%3CInteger%3E current = linkedList.head();%0A    LinkedListNode%3CInteger%3E runner = current.next;%0A    LinkedListNode%3CInteger%3E temp = null;%0A%0A    current.next = null;%0A%0A    while (runner != null) %7B%0A      temp = runner.next;%0A      runner.next = current;%0A      current = runner;%0A      runner = temp;%0A    %7D%0A%0A    linkedList.head(current);%0A  %7D%0A%7D%0A

Add solution for MergeSortedLinkedListsReverse