-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathQUESTION 4
86 lines (77 loc) · 1.51 KB
/
QUESTION 4
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
QUESTION 4
A.Print odd numbers in an array
Arrow Function :
var y=[1,2,3,4,5,6,7]
var odd=(array)=>{
let arr=[];
for(let i=0; i<array.length; i++)
{
if(array[i]%2!==0)
{
arr.push(array[i]);
}
}
return arr;
}
console.log(odd(y));
B.Convert all the strings to title caps in a string array
USING ARROW FUNCTION:
var str="my name is ayesha";
let def= (str)=>{
str = str.toLowerCase().split(' ');
for (var i = 0; i < str.length; i++) {
str[i] = str[i].charAt(0).toUpperCase() + str[i].slice(1);
}
return str.join(' ');
}
console.log(def(str));
c.Sum of all numbers in an array
BY USING ARROW FUNCTION:
var a=[1,2,3,4,5,6,7,8,9];
var sum=0;
let ghi=(a)=>
{
for(let i=0; i<a.length; i++)
{
sum=sum+a[i];
}
return sum;
}
console.log(ghi(a));
D.Return all the prime numbers in an array
BY USING ARROW FUNCTION:
let n=34;
let l=(n)=>
{
for(let i=2; i<=n; i++)
{
let flag=0;
for(let j=2; j<i; j++)
{
if(i%j==0)
{
flag=1;
break;
}
}
if(flag==0)
{
console.log(i);
}
}
}
console.log(l(n));
E.Return all the palindromes in an array
BY USING ARROW FUNCTION:
Palindrome = (arr, n) =>
{
// Traversing each element of the array
// and check if it is palindrome or not
for (let i = 0; i < n; i++)
{
let ans = isPalindrome(arr[i]);
if (ans == false)
return false;
}
return true;
}