-
Notifications
You must be signed in to change notification settings - Fork 0
/
scripts.js
200 lines (168 loc) · 3.19 KB
/
scripts.js
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
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
// let arr=[11,12,13,14,15]
// let result=[];
// for(var i=0; i<=arr.length-1; i++){
// result.push(arr[i]*2)
// }
// console.log(result)
// using map in annonyomus function
/*let fruits=["apple","mangoe","orange"]
let result=fruits.map(function(key){
return key+"s"
})
console.log(result)
*/
// using map in arrow function
/*let result1=fruits.map((key)=>key+"s")
console.log(result1)*/
//Filter
// normal method
/*let arr=[11,12,13,14,15]
let result=[];
for( var i=0; i<=arr.length-1; i++)
{
if(arr[i]%2===0)
{
result.push(arr[i])
}
}console.log(result)
*/
//using filter in normal function
/*let array=[11,12,13,14,15,16];
function even(key){
return key%2===0
}
const result=array.filter(even)
console.log(result)
*/
//using filter in annoymous function
/*let arr=[11,12,13,14,15,16]
const result=arr.filter(function(key){
return key%2===0
})
console.log(result)
*/
//using filter in arrow function
/*
let arr=[1,2,3,4,5,6]
const result=arr.filter((value)=>value%2===0)
console.log(result)
*/
//Task
// using normal for loop method
/*let number=[1,2,3,4,5,6,7,8]
const result=[];
for(var i=0; i<=number.length-1; i=i+1)
{
if(number[i]>3)
{
result.push(number[i])
}
}console.log(result)
*/
//using filter in normal function
/*let number=[1,2,3,4,5,6,7,8]
function big(key){
return key>3
}
const result=number.filter(big)
console.log(result)
*/
// using filter in arrow function
/*
let number=[1,2,3,4,5,6,7,8]
const result=number.filter((key)=>key>3)
console.log(result)
*/
// using filter in annonyomus function
/*
let number=[1,2,3,4,5,6,7,8]
const result=number.filter(function(value) {
return value>3
})
console.log(result)
*/
//Reduce
// normal method to find the maximum value in the given array
/*
let arr=[1,2,3,8,4,5]
let max=0;
for (let i=0; i<arr.length; i=i+1)
{
if(arr[i]>max)
{
max=arr[i]
}
}
console.log(max)
*/
// Normal method, sum of array
/*
let arr=[1,2,3,4,5]
let sum=0;
for(let i=0; i<arr.length; i=i+1)
{
sum=sum+arr[i]
}
console.log(sum);
*/
// Normal method,Multiply of the array
/*
let arr=[1,2,3,4,5]
let sum=1;
for(let i=0; i<arr.length; i=i+1)
{
sum=sum*arr[i]
}
console.log(sum);
*/
//Multiply of array using reduce
/*
let arr=[1,2,3,4,5]
const result=arr.reduce((mul,i)=>{
return mul*i
})
console.log(result)
*/
// Find the greatest number in array using reduce method
/*let arr=[1,2,3,10,4,5,9]
let max=0;
const result=arr.reduce((ini,i)=>{
if(i>max)
max=i
return max
})
console.log(result)
*/
// Rotate and Arry by K times.
//rotate an array by k times
/*
const arr = [1,2,3,4,5]
const k =3;
function rotate(arr,k){
for(let i=0;i<k;i++){
arr.push(arr[i])
}
for(let i=0;i<k;i++){
arr.shift()
}
return arr
}
console.log(rotate(arr,k));
*/
// Given array expected output ["apple","mango","orange"]
let arr=["apple","mango","orange"]
const result=arr.filter((key)=>key ==="mango" || key !=="mango")
console.log(result)
const result1=arr.map((key)=>{
if(key==="mango")
{
return key+"e"
}
else
{
return key
}
})
console.log(result1)
const result2=result1.map((key)=>key+"s")
console.log(result2)