All tags

All Possible Full Binary Trees

A full binary tree is a binary tree where each node has exactly 0 or 2 children.

Return a list of all possible full binary trees with N nodes. Each element of the answer is the root node of one possible tree.

Feb 29, 2020

Split Array Into Consecutive Subsequences

Given an array nums sorted in ascending order, return true if and only if you can split it into 1 or more subsequences such that each subsequence consists of consecutive integers and has length at least 3.

Feb 28, 2020

Integer Break

Given a positive integer n, break it into the sum of at least two positive integers and maximize the product of those integers.

Feb 24, 2020