Leetcode Problem 823. Binary Trees With Factors

823. Binary Trees With Factors

Leetcode Solutions

Sort the input array arr.
Initialize a hashmap index to store the indices of the elements in arr.
Initialize an array dp of the same length as arr to store the number of trees with each element as the root.
Iterate over the sorted array, and for each element v, set dp[v] to 1 (since each element can form a tree by itself).
For each element v, iterate over the array again to find all pairs x and y such that x * y == v.
For each valid pair, add dp[x] * dp[y] to dp[v].
After processing all elements, sum up all values in dp to get the total number of trees.
Return the total number of trees modulo 10^9 + 7.

Programming Language

Purpose:

General Question

Debug My Code

image/screenshot of info(optional)

Full Screen