Logo

Go on. Explore!

lvl 0 • 0 xp

lvl 1

HomeMarketDecksInterests
Coding

Coding

memorize.aimemorize.ai (lvl 286)
Star 0%
Star 0%
Star 0%
Star 0%
Star 0%
(0)
(0)
(0)
14 cards
()
Section 1

Preview this deck

Integer Reversal

Front

1 / 14

Programming
Star 0%
Star 0%
Star 0%
Star 0%
Star 0%

0.0

0 reviews

5
0
4
0
3
0
2
0
1
0

Active users

0

All-time users

0

Favorites

0

Last updated

6 years ago

Date created

Mar 1, 2020

Cards (14)

Section 1

(14 cards)

Integer Reversal

Front

function reverseInt(n) { const reversed = n.toString().split('').reverse().join(''); return parseInt(reversed) * Math.sign(n); }

Back

Fibonacci -- // Print out the n-th entry in the fibonacci series.

Front

function slowFib(n){ if (n < 2){ return n; } return fib(n-1) + fib(n-2); }

Back

Palindromes

Front

function palindrome(str) { const reverse = str.split('').reverse().join(''); return str === reverse; }

Back

FizzBuzz

Front

function fizzBuzz(n) { for(var i = 1; i < n + 1; i++){ if ( i % 5 == 0 && i % 3 == 0){ console.log('fizzbuzz'); } else if (i % 5 == 0){ console.log('buzz'); }else if (i % 3 == 0){ console.log('fizz'); } else { console.log(i); } } }

Back

Matrix Spiral- // Write a function that accepts an integer N // and returns a NxN spiral matrix.

Front

function matrix(n) { let results = []; for ( let i = 0; i < n; i++){ results.push([]); } let counter = 1; let startColumn = 0; let endColumn = n - 1; let startRow = 0; let endRow = n - 1; while (startColumn <= endColumn && startRow <= endRow){ // Top Row for (let i = startColumn; i <= endColumn; i++){ results[startRow][i] = counter; counter++; } startRow++; // Righjt Column for ( let i = startRow; i <= endRow; i++){ results[i][endColumn] = counter; counter++ } endColumn--; // Bottom Row for(let i = endColumn; i >= startColumn; i--){ results[endRow][i] = counter; counter++; } endRow--; //Middle Row for ( let i = endRow; i >= startRow; i--){ results[i][startColumn] = counter; counter++ } startColumn++; } return results; }

Back

Printing Steps

Front

function steps(n) { for(let row = 0; row < n; row++){ let stairs = ''; for(let col = 0; col < n; col++){ if(row >= col){ stairs += "#"; } else { stairs += " "; } } console.log(stairs); } }

Back

String Reversal

Front

function reverse(str){ let arr = str.split(''); let reverseArray = []; for(var i = str.length; i >= 0; i--){ reverseArray.push(arr[i]); } return reverseArray.join(''); }

Back

The Queue - Create a queue data structure.

Front

class Queue { constructor() { this.data = []; } add(record) { this.data.unshift(record); } remove(){ return this.data.pop(); } }

Back

Two Sided Steps Pyramids

Front

function pyramid(n) { const midpoint = Math.floor((2*n-1) / 2); for ( let row = 0; row < n; row++){ let level = ''; for ( let column = 0; column < (n * 2 -1); column++){ if ( midpoint - row <= column && midpoint + row >= column){ level += "#"; } else{ level += " "; } } console.log(level); } }

Back

Array Chunking

Front

function chunk(array,size) { const chunked = []; let index = 0; while(index < array.length){ chunked.push(array.slice(index,index+size)); index += size; } return(chunked); }

Back

Anagrams

Front

function anagrams(stringA, stringB) { return cleanString(stringA) === cleanString(stringB); } function cleanString(str){ return str.replace(/[^\w]/g, '').split('').sort().join(''); }

Back

Find the Vowels

Front

function vowels(str){ const matches = str.match(/[aeiou]/gi); return matches ? matches.length : 0; }

Back

MaxChars

Front

function maxChar(str) { const charMap = {}; let max = 0; let maxChar = ''; for ( let char of str) { charMap[char] ? charMap[char]++ : charMap[char] = 1; } for ( let char in charMap){ if (charMap[char] > max){ max = charMap[char]; maxChar = char; } } return maxChar; }

Back

Sentence capitalization

Front

function capitalize(str){ let result = str[0].toUpperCase(); for( let i = 1; i < str.length; i++){ if(str[i-1] === ' '){ result += str[i].toUpperCase(); } else { result += str[i]; } } return result; }

Back