Collin Argo SCollinA
SCollinA
/ letterCombos.js
Created
April 15, 2019 18:21
get possible letter combinations from a string of digits 2-9 inclusive
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| /** | |
| * @param {string} digits | |
| * @return {string[]} | |
| */ | |
| // 2 = abc | |
| // 3 = def | |
| // 4 = ghi | |
| // 5 = jkl | |
| // 6 = mno | |
| // 7 = pqrs |
SCollinA
/ recoverFromPreorder.js
Last active
April 15, 2019 17:21
restores a binary tree from a string containing positive integers (representing nodes) separated by dashes (representing branches) (e.g. in: "1-2--3--4-5--6--7", out: [1,2,5,3,4,6,7]
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
| //* Definition for a binary tree node. | |
| function TreeNode(val) { | |
| this.val = val; | |
| this.left = this.right = null; | |
| } | |
| /** | |
| * @param {string} S | |
| * @return {TreeNode} |