Skip to content

19441 #87

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

Sign up for GitHub

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
actuallyroy wants to merge 1 commit into
base: master
Choose a base branch
from
Open

19441 #87

Show file tree
Hide file tree
Changes from all commits
Commits
Show all changes
1 commit
Select commit
File filter

Filter by extension

Filter by extension
Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
12 changes: 12 additions & 0 deletions index.html
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,12 @@
<!DOCTYPE html>
<html lang="en">
<head>
<meta charset="UTF-8">
<meta http-equiv="X-UA-Compatible" content="IE=edge">
<meta name="viewport" content="width=device-width, initial-scale=1.0">
<title>Document</title>
</head>
<body>
<script src="practice.js"></script>
</body>
</html>
80 changes: 80 additions & 0 deletions practice.js
View file
Open in desktop
Original file line number Diff line number Diff line change
@@ -0,0 +1,80 @@
const foods = ["pizza", "burger", "fingerChips", "donuts", "springRoll"];
var modifiedFood = foods.slice(1,4)
console.log(modifiedFood);
modifiedFood = foods
modifiedFood.splice(2, 0, "noodles", "icecream")
console.log(modifiedFood);

const numberArray = [12,324,213,4,2,3,45,4234];


function isEven(arr){
evenNumArray = arr.filter((number)=>{
return number%2 == 0;
})
return evenNumArray;
}

console.log(isEven(numberArray));

function isPrime(arr){
primeNumArray = arr.filter((number)=>{
var flag = true;
for(var i = 2; i < number -1; i++){
if(number%i == 0) flag = false;
break;
}
if(flag) return number;
})
return primeNumArray;
}

console.log(isPrime(numberArray));

function notPrime(arr){
primeNumArray = arr.filter((number)=>{
for(var i = 2; i < number -1; i++){
if(number%i == 0) return number;
break;
}
})
return primeNumArray;
}

console.log(notPrime(numberArray))

isEven = (arr)=>{
evenNumArray = arr.filter((number)=>{
return number%2 == 0;
})
return evenNumArray;
}

console.log(isEven(numberArray))

const myArray = [11, 34, 20, 5, 53, 16];

function findSquareOfNumbers(arr){
return arr.map(item=>{
return item**2;
})
}

console.log(findSquareOfNumbers(myArray))
const myArray1 = [2, 3, 5, 10];

function multiply(arr){
var result = 1;
arr.map(item=>{
return result * item;
})
return result;
}

console.log(multiply(myArray1))

function multiply(arr){
return arr.reduce((result, item)=>{return result * item; }, 1);
}

console.log(multiply(myArray1))