# Problem

`Input: [-4,-1,0,3,10]Output: [0,1,9,16,100]`
`Input: [-7,-3,2,3,11]Output: [4,9,9,49,121]`
1. `1 <= A.length <= 10000`
2. `-10000 <= A[i] <= 10000`
3. `A` is sorted in non-decreasing order.

# Problem

`In a town, there are N people labelled from 1 to N.  There is a rumor that one of these people is secretly the town judge.If the town judge exists, then:1. The town judge trusts nobody.2. Everybody (except for the town judge) trusts the town judge.3. There is exactly one person that satisfies properties 1 and 2.You are given trust, an array of pairs trust[i] = [a, b] representing that the person labelled a trusts the person labelled b.If the town judge exists and can be identified, return the label of the town judge…`

# How To Merge Two Binary Trees In JavaScript🌳

`Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not.You need to merge them into a new binary tree. The merge rule is that if two nodes overlap, then sum node values up as the new value of the merged node. Otherwise, the NOT null node will be used as the node of new tree.`

# JavaScript Solution to Minimum Depth of Binary Tree

`Given a binary tree, find its minimum depth.The minimum depth is the number of nodes along the shortest path from the root node down to the nearest leaf node.Note: A leaf is a node with no children.Example 1:     3…`

# Problem:

`Given a n-ary tree, find its maximum depth.The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node.Nary-Tree input serialization is represented in their level order traversal, each group of children is separated by the null value (See examples).`

# Problem:

`Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much water it is able to trap after raining.`

# JavaScript Solution to Number of Recent Calls 