Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- // Question 1
- let number = 16
- // should return 9
- //Create an array
- // Push number into array
- // Take last number
- // Put number to string
- // Split
- // Square each digit
- // Combine the values
- // Check if new value is in array
- // If yes, push then return length - if no, push number then start over
- function strangeSequence(number){
- countArray = []
- countArray.push(number)
- let newNumber = 0
- while (countArray.find(number => number === newNumber) === undefined){
- newNumber = 0
- let lastNumberDigits = countArray[countArray.length - 1].toString().split("")
- for (let i=0; i<lastNumberDigits.length; i++){
- newNumber += Math.pow(parseInt(lastNumberDigits[i]), 2)
- }
- if (countArray.find(number => number === newNumber) === undefined){
- countArray.push(newNumber)
- newNumber = 0
- }
- else if (countArray.find(number => number === newNumber) !== undefined){
- countArray.push(newNumber)
- return countArray.length
- }
- }
- }
- // Question 2
- // const array1 = [5, 5, 2, 0, 9, 3, 2, 4]
- // const array2 = [5, 1, 8, 4, 9, 2, 0, 0]
- // let array3 = [3]
- // let array4 = [8]
- // let array6 = [4, 2, 1, 8, 3]
- // let array7 = [8, 3, 0, 1, 6]
- // should return 21
- function largeLock(array1, array2){
- numberofrotations = 0
- for (let i=0; i<array1.length; i++){
- for (let k=0; k<array2.length; k++){
- if (array1[i] !== array2[k]){
- numberofrotations += Math.abs(array1[i] - array2[k])
- i++
- }
- else {
- i++
- }
- }
- }
- return numberofrotations
- }
- // Question 3
- const array1 = ["*", "#", "+"]
- const array2 = ["+", "i", "@"]
- const characterset = ['!', '+', '*', ')', 'i', '=', '@', '#', '&']
- // should return 9
- function largeLock(array1, array2, characterset){
- numberofrotations = 0
- for (let i=0; i<array1.length; i++){
- for (let k=0; k<array2.length; k++){
- if (array1[i] !== array2[k]){
- numberofrotations += Math.abs((characterset.indexOf(array1[i]) + 1) - (characterset.indexOf(array2[k]) +1))
- i++
- }
- else {
- i++
- }
- }
- }
- return numberofrotations
- }
Add Comment
Please, Sign In to add comment