What valence does this APL train have? code-golf sequence decision-problem apl
Context
In APL, trains are tacit sequences of monadic/dyadic functions that can be called with one or two arguments. We'll code something to check if a given train follows the correct structure we need in order to have...
Context
In APL, trains are tacit sequences of monadic/dyadic functions that can be called with one or two arguments. We'll code something to check if a given train follows the correct structure we need in order to have a sound train.
Task
Given the sequence of function arities in the train, deter...
Preface
This is a code-golf question where the technique must search or exclude from search all possibilities. As soon as I figure out how to pose it, there will be a separate code-challenge question for mathematical techniques other than a simple search, so please don't use them here.
Below is q...
The goal of this challenge is to fill a niche that is mostly lacking on this site. In my observations there most parsing verification challenges fall into two categories:
Super easy parsing. This parsing can usually be done with a regex, and regex based answers usually do well.
Super complex...
Somehow, we don't yet have a challenge for finding the inverse of an arbitrarily-sized square matrix, despite having ones for 3x3 and 4x4, as well as a more complex version.
Your task is, given a square \$n\times n\$ non-singular matrix \$M\$, output the matrix \$M^{-1}\$ that satisfies
$$MM^{-1}...
