## One Edit Distance

Given two strings s and t, return true if they are both one edit distance apart, otherwise return false

Given two strings s and t, return true if they are both one edit distance apart, otherwise return false

The count-and-say sequence is a sequence of digit strings defined by the recursive formula

Given an input string s, reverse the order of the words. A word is defined as a sequence of non-space characters. The words in s will be separated by at least one space.

Find the kth largest element in an unsorted array. Note that it is the kth largest element in the sorted order, not the kth distinct element.

Given a binary tree, write a function to get the maximum width of the given tree. The maximum width of a tree is the maximum width among all levels.

Design a coffee machine which makes different beverages based on set ingredients. The quantity of ingredients used for each beverage can vary

Given an N-ary Tree, Serialize and Deserialize it. Serialization is a basically a representation of a tree in a String format which takes much lesser space than storing the tree itself. Deserialization is constructing the actual tree using the serialized format of the tree.

Write a merge function that takes two lists, each of which is sorted in increasing order, and merges the two together into one list which is in increasing order.

Given a positive integer n, generate an n x n matrix filled with elements from 1 to n2 in spiral order.

Given an m x n matrix, return all elements of the matrix in spiral order. The Spiral Matrix problem takes a 2-Dimensional array of N-rows and M-columns as an input, and prints the elements of this matrix in spiral order.