Nine notes

Given two words word1 and word2, find the minimum number of steps required to convert word1 to word2. (each operation is counted as 1 step.)

Given n balloons, indexed from 0 to n-1. Each balloon is painted with a number on it represented by array nums. You are asked to burst all the balloons. If the you burst balloon i you will get nums[left] nums[i] nums[right] coins. Here left and right are adjacent indices of i. After the burst, the left and right then becomes adjacent.

Given an integer n, generate all structurally unique BST’s (binary search trees) that store values 1…n.

Given n, how many structurally unique BST’s (binary search trees) that store values 1…n?

Given two strings S and T, determine if they are both one edit distance apart.

Find the sum of all left leaves in a given binary tree.

Given a string s, partition s such that every substring of the partition is a palindrome.

Given a string s, partition s such that every substring of the partition is a palindrome.

Given two integers n and k, return all possible combinations of k numbers out of 1 … n.

Given a collection of numbers that might contain duplicates, return all possible unique permutations.

Given a collection of distinct numbers, return all possible permutations.

Given a collection of integers that might contain duplicates, nums, return all possible subsets.

Given a set of distinct integers, nums, return all possible subsets.

Reverse bits of a given 32 bits unsigned integer.

Write a program to find the n-th ugly number.