package main

// Find all letter combinations from a word.
// Number of letters to be deleted can be added
// in breaking condition of recursion.

// Result:
// [a b c d]
// [ab ac ad bc bd cd]
// [abc abd acd bcd]
// [abcd]
