Practical Implementation Exercises for Linked Lists in Ruby

Today's lesson will build upon our foundational understanding of linked lists by diving into practical implementation exercises using Ruby. These problems will sharpen your coding skills and prepare you for scenarios you might encounter in technical interviews.

Picture a scenario in which you have a sequence of events stored in a linked list. Your task is to look back in time — essentially, to reverse the chronology of these events. In technical terms, this means traversing a singly linked list in reverse order while keeping its structure intact. This skill is critical, whether for reversing transaction logs or simply navigating through a playlist from end to start.

Consider a browser's back-button functionality, where the most recently visited pages must be revisited in reverse order. This operation mirrors our task of reverse traversal in a linked list, capturing the essence of a real-world application.

One may consider creating a new linked list while iterating over the original list, inserting each element at the head of the new list. Although this approach might work, it is an overcomplicated approach that results in extra processing and memory usage that we can avoid.

A more sophisticated solution would use a Ruby array to simulate a stack. Using an array, we ensure an orderly collection of the nodes' values as we navigate the list. Once the traversal is complete, we extract the values in reverse order using the array's pop method, which simulates a stack's Last-In-First-Out property.

Let's visualize it with a deck of cards: We pick each card from the top (the head of the linked list) and place it into a pile (our array). When we finish, we pick up the cards from the pile now in reverse order.

Let's tackle it with Ruby:

class ListNode
  attr_accessor :value, :next

  def initialize(value = 0, _next = nil)
    @value = value
    @next = _next
  end
end

def reverse_print_linked_list(head)
  # Instantiate an array to simulate a stack.
  stack = []

  # Traverse the linked list and push node values to the array.
  current_node = head
  while current_node
    stack.push(current_node.value)
    current_node = current_node.next
  end

  # Pop from the stack to obtain elements in reversed order.
  while !stack.empty?
    puts stack.pop
  end
end

In this code, we create an array stack to store integers. We then iterate through the linked list using a while loop. For each node visited, we push its value onto the stack. After traversing the entire list, we pop the values off the stack. This reversal is possible because arrays in Ruby can act like stacks due to their Last In, First Out behavior.