Rosetta Code

Last letter-first letter

Build a word chain where each next word starts with the previous word's last letter.

Edit the source, then Run. Checks start after your first Run. Ctrl/⌘ + Enter runs; Tab indents. Preview services use sample data and never contact a real service.

Sourcerosettacode/popular/last_letter_first_letter.vibe
def remove_at(values: array<string>, skip_index: int) -> array<string>
  out: array<string> = []
  index = 0

  while index < values.length
    if index != skip_index
      out = out + [values.fetch(index)]
    end
    index = index + 1
  end

  out
end

def chain_words(current: string, remaining: array<string>, chain: array<string>) -> array<string>
  current_chars = current.chars
  if remaining.empty?
    return chain
  end

  next_first = current_chars.fetch(current.length - 1)
  index = 0
  while index < remaining.length
    candidate = remaining.fetch(index)
    if candidate.chars.fetch(0) == next_first
      return chain_words(candidate, remove_at(remaining, index), chain + [candidate])
    end
    index = index + 1
  end

  chain
end

def run -> array<string>
  words = ["audino", "bagon", "nidoking", "goldeen", "nosepass", "seaking"]
  first = words.fetch(0)
  chain_words(first, remove_at(words, 0), [first])
end

Output

Click Run example to see the result.

Code checks

Run once to load the checker. Your code stays in this browser.