Skip to content

Instantly share code, notes, and snippets.

@thuyanduong

thuyanduong/gist:71af3b31e8aa049bbdf9366cc5275967

Last active November 17, 2020 14:02
Show Gist options
  • Save thuyanduong/71af3b31e8aa049bbdf9366cc5275967 to your computer and use it in GitHub Desktop.
Save thuyanduong/71af3b31e8aa049bbdf9366cc5275967 to your computer and use it in GitHub Desktop.
Download ZIP
Tech Discussion
Raw
gistfile1.md
  1. Write a function spinWords that takes in a string of one or more words, and returns the same string, but with all five or more letter words reversed. Strings passed in will consist of only letters and spaces. Spaces will be included only when more than one word is present.
spinWords("Welcome")              // "emocleW"
spinWords("Hey fellow warriors")  // "Hey wollef sroirraw"
spinWords("This is a test")       // "This is a test"
spinWords("This is another test") // "This is rehtona test"
Bonus
  1. Write a function persistence that takes in a positive parameter num and returns its multiplicative persistence, which is the number of times you must multiply the digits in num until you reach a single digit.
persistence(39) === 3   // because 3*9 = 27, 2*7 = 14, 1*4=4
persistence(999) === 4  // because 9*9*9 = 729, 7*2*9 = 126, 1*2*6 = 12, 1*2 = 2
persistence(4) === 0    // because 4 is already a one-digit number
@ChArLi0
Copy link

ChArLi0 commented Nov 17, 2020

Hello, I am Elliana Walmsley from ALDC showcase. I honestly love your git, it has so juch codewords for secret things. @ellianawalmsley

I am so sorry about my spelling! I am typing on my phone and not my computer so it is really hard, lol.

Sign up for free to join this conversation on GitHub. Already have an account? Sign in to comment