Recursion learning/practice Katas

[powderham]

Hello everyone,

Background We raised this issue in order to lay out a project that a number of us are undertaking (join us) and to ask for direction from our community. I would recommend reading the first issue, but the basic points are below:

We are looking to compile a list of Codewars Katas that can be used to practice/self-study concepts in JavaScript (e.g. RegEx, Recursion, Filter function).

The end product for a given concept would be something along the lines of:

• A curated list of Kata starting with basics of the concept ending with advanced applications
• Katas increasing with incremental difficulty such that no two adjacent Katas in difficulty are so different that significant self study/other resources are required to fill the knowledge gap
• A further list of Kata that are hard, fun, puzzling (or any combination) to solve where users can go and apply their new knowledge

Having received suggestions and votes, we will now curate the first topic recursion before moving on to others.

The issue In order to curate the list of Kata to be used for learning and practicing key JavaScript topics, we need your help with gathering and rating the Kata against the below list of criteria. So, the ask is two-fold.

• Please submit any Kata that you are aware of that either teach or require recursion to be solved. Please submit Kata in the below format to allow us to discuss and curate them appropriately.

• Title: Recursion #2 - Fibonacci
• Description: A task to return the fibonacci sequence to n places
• Kyu: 7
• URL:https://www.codewars.com/kata/recursion-number-2-fibonacci
• For the Below submitted Kata, please consider the below criteria and give it a thumbs up if you believe it satisfies enough of the criteria (note: It wouldn't need to satisfy them all). Please also leave any comments you have on the Kata in a comment below. Finally, if you know of a resource (e.g. a YouTube video) that would compliment the list of Kata or a specific Kata, please also submit it.

Criteria

• Recursion is clearly a way to solve the kata, ideally the only way
• The Kata desription is clear - we want to practice recursion, not interpretation!
• For easier Katas, the kata description ideally contains an explanation of recursion and guidance on how to apply it
• The complexity/difficulty of the Kata is largely the application of recursion
• Approved/out of Beta

[powderham]

• Title: Recursion #2 - Fibonacci
• Description: A task to return the fibonacci sequence to n places
• Kyu: 7
• URL:https://www.codewars.com/kata/recursion-number-2-fibonacci

Contains tests to ensure that the function calls itself, therefore a for loop cannot be used.

[lucymonie]

This README is great for learning basic recursion and has links to a couple of topical katas:

• Fibonacci Reloaded 6kyu
• Complete Fibonacci Series 6kyu

[powderham]

• Title: Recursive Replication
• Description: Recursively add a number n to an array x amount of times
• Kyu: 7
• URL: https://www.codewars.com/kata/57547f9182655569ab0008c4/solutions/javascript

Note: lacking any real explanation on what recursion is

[mattlub]

looks like recursion could be used here ... :wink: https://www.codewars.com/kata/57b64627d2415635ac000529

Title: Just Adding and Multiplying