Practice Binary Trees With Factors

Read the task, work through the examples, and check your approach against the constraints. Use the original LeetCode task for coding and submissions.

Medium#823

LeetCode Problem

Binary Trees With Factors

Array Hash Table Dynamic Programming Sorting

Problem Statement

Given an array of unique integers, arr, where each integer arr[i] is strictly greater than 1. We make a binary tree using these integers, and each number may be used for any number of times. Each non-leaf node's value should be equal to the product of the values of its children. Return the number of binary trees we can make. The answer may be too large so return the answer modulo 10^9 + 7.

Source: Binary Trees With Factors on LeetCode. Use the original task for its coding environment and submissions.

Examples

# Example 1

Input

arr = [2,4]

Output

# Example 2

Input

arr = [2,4,5,10]

Output

Constraints

1 <= arr.length <= 1000

2 <= arr[i] <= 10^9

All the values of arr are unique.

Review your practice with PhantomCodeAI

After trying the problem yourself, use the app to discuss your approach, complexity, and edge cases.

Start Free