Some CMCs

[lyxal]

This is a planning repo for CMCs for the upcoming Vyxal Learn You A Language For a Great Good.

Good CMCs:

• will be different from the ones usually posted during LYALs (don't do the usual tasks like "fibonacci numbers" unless you have an interesting twist)
• will not be too trivial (i.e. not just a single element/overload)
• will focus on specific aspects of Vyxal (unless it's a general CMC to test overall knowledge) - it's a good idea to target specific elements in each CMC
• will not be too hard (i.e. they shouldn't take more than 5 minutes to solve)

The CMCs

Already Asked

**VyMC**: Return the nth fibonacci number without using `∆f` or `ÞF`
**VyMC**: Return the factorial of the input without using `¡` or `Π`
**VyMC**: Return whether an input is a prime number without using any of `†æpṗṖǎǏǐ`
**VyMC**: Given a single positive integer n, return a centred pyramid of asterisks with an increasing odd number of asterisks on each line.
**VyMC**: Given a single integer n, return the number of times its digits need to be summed until the result is of length 1. E.g. `453 -> 2 (453 -> 12 -> 3)`, `999999999999999999999999999999999999999999999999999 -> 3 (999999999999999999999999999999999999999999999999999 -> 459 -> 18 -> 9)`
**VyMC**: Given a non-empty list, return a list of the first item, last item, and the length of the list.
**VyMC**: Find the only element in an list that doesn't appear twice.
**VyMC**: Given a non-empty array containing only integers, return the number of triplets (groups of 3 without replacement) where the sum is `0`.
**VyMC**: Given a list of numbers, return itself after removing even or odd depending on their parity.
**VyMC**: Given two strings, return whether one is a rotation of another (i.e. there exists a positive integer n where one string rotated n times equals the other).
**VyMC**: Write a triadic lambda that sums its arguments and multiplies that by the average of the three items.
**VyMC**: Given a list of strings and positive integers, return only items which are palindromic.
**VyMC**: Given a number, return a list of [numerator, denominator]
**VyMC**: Given an algebraic expression including only `+-*/^x` for addition, subtraction, multiplication, division, exponentation and variable x, return a list of the anti-derivative and normal derivative
**VyMC**: Given a string, and a regular expression, replace each match with the reverse of that match. E.g. `"abaaa4949jfa9304jfs908023", "\d+" -> "abaaa9494jfa4039jfs320809"`
**VyMC**: Given a string, return if it is only made of alphanumeric characters.
**VyMC**: Given two lists, return their cartesian product (combinations of each element from both) as a list
**VyMC**: Given a non-empty string, return the percentage of each character. E.g. `"this is a certified bruh moment" -> [["t", 3/31], ["h", 2/31], ["i", 4/31], ["s", 2/31], [" ", 5/31], ["a", 1/31], ["c", 1/31], ["e", 3/31], ["r", 2/31], ["f", 1/31], ["d", 1/31], ["b", 1/31], ["u", 1/31], ["m", 2/31], ["o", 1/31], ["n", 1/31]]`
**VyMC**: Given a list of positive integers, sort it in ascending order without using any of `sṡµ`.
**VyMC**: Without using numbers in your source code, return `10000000000000` in only 5 bytes
**VyMC**: Return the list `[["z", "z"], ["y", "y"], ["x", "x"], ["w", "w"], ["v", "v"], ["u", "u"], ["t", "t"], ["s", "s"], ["r", "r"], ["q", "q"], ["p", "p"], ["o", "o"], ["n", "n"], ["m", "m"], ["l", "l"], ["k", "k"], ["j", "j"], ["i", "i"], ["h", "h"], ["g", "g"], ["f", "f"], ["e", "e"], ["d", "d"], ["c", "c"], ["b", "b"], ["a", "a"]]` in 3 bytes
**VyMC**: Replace all spaces in an input string with asterisks
**VyMC**: Return if the input is a cube number
**VyMC**: Return the string `AEIMQUY` in 4 bytes
**VyMC**: Given two numbers n and m, return the result of rolling m n-sided dice (containing numbers 1 to n)
**VyMC**: Given a string, return the first half then reverse it.

Yet to Be Asked

**VyMC**: Given two lists of (x1,...),(y1,...); where each singly-nested list has the same length m, count how many pairs there are such that xi > yi
**VyMC**: Given a list of strings, reverse every second string, starting with index=1
**VyMC**: Given a list of strings, return only the vowels
**VyMC**: Given a list of integers, return the longest run where the consecutive differences are the same (deltas are the same)
**VyMC**: Given a positive number, return the area of a circle with that radius.
**VyMC**: Given an integral number `n`, return whether there exists numbers 1 to n that add up to some power of two
**VyMC**: Given a number n, return the next integral perfect power of two (i.e. 2^n)
**VyMC**: Given two strings, return the length of the greatest common suffix
**VyMC**: Output the list ⟨ -1 | 0 | 0 | 0 ⟩ in 3 bytes
**VyMC**: Output the list ⟨ 0 | 6 | 10 ⟩ in 3 bytes
**VyMC**: Without using numbers, multiply a number by 18
**VyMC**: Given a list of words, reverse all the vowels in each word
**VyMC**: Return all 3 digit numbers that have an even amount of "on" bits when converted to binary
**VyMC**: Given a list of positive numbers, return the largest number without using `G`
**VyMC**: Return a random element from the input
**VyMC**: Return the number of non-unique characters in a string
**VyMC**: Given a string, return the count of uppercase and lowercase letters. E.g.: `"aAbBcCzD?"` -> [4, 4]`
**VyMC**: Return a rickroll
**VyMC**: Return whether a string has 4 phonetic vowels in it
**VyMC**: Given a list and a string, replace every third item of that list with the string
**VyMC**: Return the longest word in a string - words are defined as `\W+`. The string may contain any printable ascii character.
**VyMC**: Return True if string consists only of digits.
**VyMC**: Given a positive integer n, return [fac(n), fac(power_of_2*n)]
**VyMC**: Return a shortened explanation of two integers and their sum
**VyMC**: Given a string of open parenthesis `(` and closing parenthesis `)`, return the number of balanced bracket groups. `"()()" -> 2`, `(()()()) -> 4`, `(())))() -> 3`
**VyMC**: Return True if each character in the string is unique.
**VyMC**: Implement the functionality of `øc` without using `øc` (that is, base255 string compression)
**VyMC**: Given two integers a and b, display their relationship.
**VyMC**: Return True if an input list of 3 strings has the same all-caps last letter in each string
**VyMC**: Return the longest length of an alphabetic string within a string of printable ascii.
**VyMC**: Return the list `⟨ ⟨ 104 | 116 | 116 | 112 | 115 ⟩ | ⟨ 116 | 116 | 112 | 115 | 58 ⟩ | ⟨ 116 | 112 | 115 | 58 | 47 ⟩ | ⟨ 112 | 115 | 58 | 47 | 47 ⟩ ⟩` in 5 bytes using only ascii. 
**VyMC**: Given an integer n, return a diamond of asterisks such that the first row has 2 asterisks, the second has 4...the nth row has 2n asterisks, the n+1th row has 2n asterisks, the n+2th row has 2n-2 asterisks...the 2nth row has 2 asterisks. E.g [n = 4](https://vyxal.pythonanywhere.com/#WyIiLCIiLCIgICAqKiAgIFxuICAqKioqICBcbiAqKioqKiogXG4qKioqKioqKlxuKioqKioqKipcbiAqKioqKiogXG4gICoqKiogIFxuICAgKiogICAiLCIiLCIiXQ==)
[n = 7](https://vyxal.pythonanywhere.com/#WyIiLCIiLCIgICAgICAqKiAgICAgIFxuICAgICAqKioqICAgICBcbiAgICAqKioqKiogICAgXG4gICAqKioqKioqKiAgIFxuICAqKioqKioqKioqICBcbiAqKioqKioqKioqKiogXG4qKioqKioqKioqKioqKlxuKioqKioqKioqKioqKipcbiAqKioqKioqKioqKiogXG4gICoqKioqKioqKiogIFxuICAgKioqKioqKiogICBcbiAgICAqKioqKiogICAgXG4gICAgICoqKiogICAgIFxuICAgICAgKiogICAgICAiLCIiLCIiXQ==)