Procs All the Way Down

Published by bangyen in
functional_programminghigher_order_functionsrecursion

Create a function which takes a parameter n and returns a function such that it, when called n times, returns the string "edabit".

Examples

lambda_depth(0) ➞ "edabit"

lambda_depth(1)[] ➞ "edabit"

lambda_depth(2)[][] ➞ "edabit"

lambda_depth(2)[].class ➞ Proc

Notes

  • num will always be a non-negative integer.
  • If num == 0, return "edabit".
  • If num > 0, return a function.
  • All non-example test cases come in two forms: checking whether lambda_depth(k), after being called k times, returns a string, and checking whether lambda_depth(k) returns a function.
Watch a quick demo on how Edabit works.