Skip to content

Instantly share code, notes, and snippets.

Show Gist options
  • Save JacksonRMC/73e45366b968f4ac344034bda11b293c to your computer and use it in GitHub Desktop.
Save JacksonRMC/73e45366b968f4ac344034bda11b293c to your computer and use it in GitHub Desktop.
var isSubsequence = function(s, t) {
let slit = s.split('');
for ( let i = 0 ; i < slit.length ; i ++ ) {
if ( !t.includes(slit[i]) ) {
return false;
}
}
return true;
};
// let sr = "abc";
// let tr = "ahbgdc";
// //true
// let s = "axc";
// let t = "ahbgdc";
// //Return false.
// console.log(isSubsequence(sr, tr));
// console.log(isSubsequence(s, t));
var frequencySort = function(string) {
let letterArray = string.split('');
let results = {};
for ( let i = 0 ; i < letterArray.length; i ++ ) {
if ( Object.keys(results).includes(letterArray[i] ) ) {
results[letterArray[i]] += 1;
} else {
results[letterArray[i]] = 1;
}
}
let largest = Object.values(results).sort().reverse();
let final = [];
let j = 0;
while ( j < largest.length ){
for ( let key in results ) {
if ( results[key] === largest[j] ) {
for ( let k = 0 ; k < largest[j] ; k ++ ) {
final.push(key);
}
j++;
}
}
}
return final.join('');
};
// var word = "tree";
// var anwser = "eetr";
// let word2 = "Aabb";
// let anwser2 = "bbAa";
// console.log(frequencySort(word) === anwser);
// console.log(frequencySort(word2) === anwser2);
Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment