Note: At the moment this readme is mostly a bunch of disorganized thoughts, so it may or not make much sense. Note that in the following, 'group' is not used in the algebraic sense, but rather in a ...
# You are given two positive integers A and B. For all permutations of [1, 2, …, A], we create a BST. Count how many of these have height B. # Notes: # Values of a permutation are sequentially ...
Some results have been hidden because they may be inaccessible to you
Show inaccessible results