Dane David danedavid
This file contains hidden or 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
| // returns an array containing all permutations of a given string | |
| const permute = str => { | |
| let permutations = []; | |
| if ( str.length <= 1 ) { | |
| return [str]; | |
| } | |
| for ( let i = 0; i < str.length; i++ ) { | |
| let char = str[i]; |
danedavid
/ balancedParanthesis.js
Created
April 4, 2018 05:51
Function to check for balanced parenthesis in any string using Array.prototype.reduce(). Inspiration: https://medium.freecodecamp.org/check-out-these-useful-ecmascript-2015-es6-tips-and-tricks-6db105590377
This file contains hidden or 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
| const isBalanced = str => { | |
| const arr = str.split(''); | |
| const res = arr.reduce((acc, item) => { | |
| if ( acc.slice(-1)[0] === '(' ) { | |
| if ( item === ')' ) { | |
| acc.pop(); | |
| return acc; | |
| } | |
| } | |
| if ( item === '(' || item === ')' ) { |
NewerOlder