This is a problem from Leetcode - Satisfiability of Equality Equations.

Given an array equations of strings that represent relationships between variables, each string equations[i] has length 4 and takes one of two different forms: “a==b” or “a!=b”. Here, a and b are lowercase letters (not necessarily different) that represent one-letter variable names.

Return true if and only if it is possible to assign integers to variable names so as to satisfy all the given equations.

- Feb 14, 2019...more
## Broken Calculator

Feb 13, 2019...moreThis is a problem from Leetcode - Broken Calculator.

On a broken calculator that has a number showing on its display, we can perform two operations:

- Double: Multiply the number on the display by 2, or;
- Decrement: Subtract 1 from the number on the display.

Initially, the calculator is displaying the number X.

Return the minimum number of operations needed to display the number Y.

## Add to Array-Form of Integer

Feb 12, 2019...moreThis is a problem from Leetcode - Add to Array-Form of Integer.

For a non-negative integer X, the array-form of X is an array of its digits in left to right order. For example, if X = 1231, then the array form is [1,2,3,1].

Given the array-form A of a non-negative integer X, return the array-form of the integer X+K.

## Convert Sorted Array to Binary Search Tree

Jan 24, 2019...moreThis is a problem in Leetcode - Convert Sorted Array to Binary Search Tree.

Given an array where elements are sorted in ascending order, convert it to a height balanced BST.

For this problem, a height-balanced binary tree is defined as a binary tree in which the depth of the two subtrees of every node never differ by more than 1.

## Binary Trees With Factors

Jan 23, 2019...moreThis is a problem from Leetcode - Binary Trees With Factors.

Given an array of unique integers, each integer 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 it’s children.

How many binary trees can we make? Return the answer modulo

`10 ** 9 + 7`

.