🎉 Exercism Research is now launched. Help Exercism, help science and have some fun at research.exercism.io 🎉
Avatar of JaeHyoLee

JaeHyoLee's solution

to Kindergarten Garden in the Lua Track

Published at Jul 13 2018 · 0 comments
Test suite

Given a diagram, determine which plants each child in the kindergarten class is responsible for.

The kindergarten class is learning about growing plants. The teacher thought it would be a good idea to give them actual seeds, plant them in actual dirt, and grow actual plants.

They've chosen to grow grass, clover, radishes, and violets.

To this end, the children have put little cups along the window sills, and planted one type of plant in each cup, choosing randomly from the available types of seeds.

........................ # each dot represents a cup

There are 12 children in the class:

  • Alice, Bob, Charlie, David,
  • Eve, Fred, Ginny, Harriet,
  • Ileana, Joseph, Kincaid, and Larry.

Each child gets 4 cups, two on each row. Their teacher assigns cups to the children alphabetically by their names.

The following diagram represents Alice's plants:


In the first row, nearest the windows, she has a violet and a radish. In the second row she has a radish and some grass.

Your program will be given the plants from left-to-right starting with the row nearest the windows. From this, it should be able to determine which plants belong to each student.

For example, if it's told that the garden looks like so:


Then if asked for Alice's plants, it should provide:

  • Violets, radishes, violets, radishes

While asking for Bob's plants would yield:

  • Clover, grass, clover, clover

Running the tests

To run the tests, run the command busted from within the exercise directory.

Further information

For more detailed information about the Lua track, including how to get help if you're having trouble, please visit the exercism.io Lua language page.


Random musings during airplane trip. http://jumpstartlab.com

Submitting Incomplete Solutions

It's possible to submit an incomplete solution so you can see how others have completed the exercise.


local Garden = require('kindergarten-garden')

describe('kindergarten-garden', function()
  it('should be able to parse a garden with only one student', function()
    local garden = Garden('RC\nGG')
    assert.same({ 'radishes', 'clover', 'grass', 'grass' }, garden.alice)

  it('should be able to parse a graden with more than one student', function()
    local garden = Garden('VVCG\nVVRC')
    assert.same({ 'violets', 'violets', 'violets', 'violets' }, garden.alice)
    assert.same({ 'clover', 'grass', 'radishes', 'clover' }, garden.bob)

  it('should be able to parse a garden with plants for all students', function()
    assert.same({ 'violets', 'radishes', 'violets', 'radishes' }, garden.alice)
    assert.same({ 'clover', 'grass', 'clover', 'clover' }, garden.bob)
    assert.same({ 'violets', 'violets', 'clover', 'grass' }, garden.charlie)
    assert.same({ 'radishes', 'violets', 'clover', 'radishes' }, garden.david)
    assert.same({ 'clover', 'grass', 'radishes', 'grass' }, garden.eve)
    assert.same({ 'grass', 'clover', 'violets', 'clover' }, garden.fred)
    assert.same({ 'clover', 'grass', 'grass', 'clover' }, garden.ginny)
    assert.same({ 'violets', 'radishes', 'radishes', 'violets' }, garden.harriet)
    assert.same({ 'grass', 'clover', 'violets', 'clover' }, garden.ileana)
    assert.same({ 'violets', 'clover', 'violets', 'grass' }, garden.joseph)
    assert.same({ 'grass', 'clover', 'clover', 'grass' }, garden.kincaid)
    assert.same({ 'grass', 'violets', 'clover', 'violets' }, garden.larry)

  it('should return an empty result for students that are not present', function()
    local garden = Garden('RC\nGG')
    assert.same({}, garden.bob)

  it('should return an empty result for students that do not exist', function()
    local garden = Garden('RC\nGG')
    assert.same({}, garden.katrina)

  it('should ignore case for gardens', function()
    local garden = Garden('Rc\ngG')
    assert.same({ 'radishes', 'clover', 'grass', 'grass' }, garden.alice)

  it('should ignore case for students', function()
    local garden = Garden('RC\nGG')
    assert.same({ 'radishes', 'clover', 'grass', 'grass' }, garden.ALICE)
local plants = {
  v = 'violets',
  r = 'radishes',
  g = 'grass',
  c = 'clover' }

local name_list ={ 'alice', 'bob', 'charlie', 'david', 'eve', 'fred', 'ginny', 'harriet', 'ileana', 'joseph', 'kincaid', 'larry' }

local function get_plants(self, name)
  return self.plant_list[name:lower()] or {}

return function (input)
  local input = input:lower()
  local o = setmetatable({}, {__index = get_plants})
  local plant_list ={}
  for line in input:gmatch('[%a ]+') do
    local student_index = 1
    for i=1, #line, 2 do
      if plant_list[name_list[student_index]] == nil then plant_list[name_list[student_index]] = {} end
      table.insert(plant_list[name_list[student_index]] , plants[line:sub(i,i)])
      table.insert(plant_list[name_list[student_index]], plants[line:sub(i+1,i+1)])
      student_index = student_index + 1
  o.plant_list = plant_list
  return o

Community comments

Find this solution interesting? Ask the author a question to learn more.

What can you learn from this solution?

A huge amount can be learned from reading other people’s code. This is why we wanted to give exercism users the option of making their solutions public.

Here are some questions to help you reflect on this solution and learn the most from it.

  • What compromises have been made?
  • Are there new concepts here that you could read more about to improve your understanding?