Wolfram Language Paclet Repository
Community-contributed installable additions to the Wolfram Language
Wolfram Challenges Algorithms
I am moving onto Wolfram Challenges Algorithms next after Start Here.
Challenges in the Algorithms Track
— takes in a non-negative number and returns its digital root
— finds the fewest number of coins needed to add up to a certain value.
Algorithms Tagged Challenges not in the Algorithms Track
— finds the aliquot sequence starting with a given positive integer
— generates all possible matched sequences of opened and closed parentheses of n pairs.
Helper Functions for Wolfram Challenge functions
— Find the totally balanced binary sequence for a given rank. This forms the basis for BalancedParentheses.
FrameBox["\"XXXX\""]
Open