-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathscript.js
More file actions
179 lines (135 loc) · 4.43 KB
/
script.js
File metadata and controls
179 lines (135 loc) · 4.43 KB
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
// Question 1. All Anonymous function problrms:
//Print odd numbers in an arry
var odd = function (num){
var arr=[];
for (var i=0;i<num.length;i++){
if(num[i]%2 !==0){
arr.push(num[i]);
}
}
console.log(arr);
}
var num = [1,2,3,4,5,6,7,8,9,10];
odd(num);
//ouput [1,3,5,7,9]
//-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
//Question 2. convert all string in the tittle caps in string array;
var tittle_Caps = function(str){
for(var i=0; i<str.length; i++){
str[i] = str[i].toLowerCase();
str[i] = str[i].charAt(0).toUpperCase() + str[i].slice(1);
}
console.log(str.join(" "));
}
var str = ["I", "am", "Vasanth","-", "FSD","DEVELOPER"];
tittle_Caps(str);
//output I Am Vasanth -Fsd Developer
//-------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------
//3.Sum of all numbers in an array
//using anonymous function
var add = function (n){
let sum = 0;
for(let i = 0; i<n.length; i++){
sum+=n[i];
}
console.log(sum);
};
var n= [1,2,3,4,5,6,7];
add(n);
//output :28
//--------------------------------------------------------------------------------------------------
//4.Return all the prime numbers in an array
// Anonymous fucntion
var prime=function(a){
var reslt=[];
for(i=0;i<a.length;i++)
{
var count=0;
for(j=1;j<=a[i];j++)
{
if(a[i]%j===0)
{
count++;
}
}
if(count==2)
{
reslt.push(a[i]);
}
}
console.log(reslt);
};
prime([1,2,3,4,5,6,7,8,9,11,12,13]);
//output [2, 3, 5, 7, 11,13]
//------------------------------------------------------------------------------------------------------------------------------
//5.Return all the palindromes in an array
//anonymous function
var palindrome = function(arr){
var out =[];
for(var i=0;i<arr.length;i++){
var final = arr[i];
var str = final.split('').reverse().join('');
if(str==arr[i])
out.push(arr[i]);
}
console.log(out);
};
var arr =["abc", "mom", "dad", "madam", "teacher","level","refer"];
palindrome(arr);
//output, ['mom', 'dad', 'madam','level','refer']
//------------------------------------------------------------------------------------------------------------------------------
//6.Return median of two sorted arrays of the same size. anonymous function
var median = function (arr1,arr2){
var arr = [...arr1, ...arr2];
arr.sort((a,b) => a-b);
var len = arr.length;
if(len%2!==0){
var ans = arr[Math.round(len/2)-1];
var final = ans;
}else{
ans = arr[Math.round(len/2)-1]+arr[Math.round(len/2)];
final = ans;
}
console.log(final);
};
var arr1 = [3,2,1,4,5];
var arr2 = [8,6,7,9,10];
median(arr1,arr2);
//output: 11
//------------------------------------------------------------------------------------------------------------------------------
//7.Remove duplicates from an array
var removeDuplicates = function (array) {
return array.filter((value, index, self) => {
return self.indexOf(value) === index;
});
}
// Example
var originalArray = [1, 2, 3, 4, 2, 3,3,4,5,5,10,11,10,12,11];
var newArrayWithoutDuplicates = removeDuplicates(originalArray);
console.log(newArrayWithoutDuplicates); // Output: [1, 2, 3, 4,5,10,11,12]
//------------------------------------------------------------------------------------------------------------------------------
//8.Rotate an array by k times
// anonymous function
var rotation = function (arr,n,k)
{
var p = 1;
while (p <= k) {
var last = arr[0];
for (var i = 0; i < n - 1; i++) {
arr[i] = arr[i + 1];
}
arr[n - 1] = last;
p++;
}
var out = [];
for (var i = 0; i < n; i++) {
out.push(arr[i]);
}
console.log(out);
};
var arr =[4,5,6,1,2,3];
var n = arr.length;
var k = 3;
rotation(arr, n,k);
//output
//[ 1, 2, 3, 4, 5, 6 ]