Challenge #14: 🗃️ Find the gift path

At the North Pole, the elves have simplified their storage system to avoid mistakes.
They now keep the presents in a magical object with limited depth, where each value appears only once.

Santa needs a quick way to know which path of keys he must follow to find a specific present.

Your task is to write a function that, given an object and a value, returns the array of keys that must be traversed to reach that value.

Rules:

• The object has at most 3 levels of depth.
• The value to search for appears at most once.
• The object only contains other objects and primitive values (strings, numbers, booleans).
• If the value does not exist, return an empty array.

Examples:

const workshop = {
  storage: {
    shelf: {
      box1: 'train',
      box2: 'switch'
    },
    box: 'car'
  },
  gift: 'doll'
}

findGiftPath(workshop, 'train')
// ➜ ['storage', 'shelf', 'box1']

findGiftPath(workshop, 'switch')
// ➜ ['storage', 'shelf', 'box2']

findGiftPath(workshop, 'car')
// ➜ ['storage', 'box']

findGiftPath(workshop, 'doll')
// ➜ ['gift']

findGiftPath(workshop, 'plane')
// ➜ []

workshop = {
  'storage': {
    'shelf': {
      'box1': 'train',
      'box2': 'switch'
    },
    'box': 'car'
  },
  'gift': 'doll'
}

find_gift_path(workshop, 'train')
# ➜ ['storage', 'shelf', 'box1']

find_gift_path(workshop, 'switch')
# ➜ ['storage', 'shelf', 'box2']

find_gift_path(workshop, 'car')
# ➜ ['storage', 'box']

find_gift_path(workshop, 'doll')
# ➜ ['gift']

find_gift_path(workshop, 'plane')
# ➜ []