-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathproblemSolving.js
More file actions
392 lines (270 loc) · 7.77 KB
/
problemSolving.js
File metadata and controls
392 lines (270 loc) · 7.77 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
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
//Based on knowladage (JavaScript 1 to 30)
//1st Problem
//How to get output from 1 to 6 number
{
console.log(my_number(1,6))
function my_number(min,max){
return Math.floor(Math.random()*(max-min+1))+min;
}
}
//2nd problem
//How to sort an array alphabetically
{
const students_name =["Shawn","Zahin","Ashik","Dristy","Rahim","Fahad"];
console.log(students_name.sort());
}
//3rd problem
//How to sort students roll number in ascending order
{
const all_students = [ 9,5,10,1,4,3,2,6,7,8];
console.log(all_students.sort(function(a,b){
return a - b;
}));
}
//4th problem
//How to know that,the declare year is 'leap year' or not
function notLeapYear(year){
if ((year % 400 === 0) || ((year % 4 === 0) && (year % 100 !== 0))){
console.log(`${year} is a leap year`)
}
else{
console.log(`${year} is not a leap year`)
}
}
notLeapYear(2026);
{
function leap_year(years){
if( (years % 400 === 0) || ((years % 4 === 0) && (years % 100 !== 0))){
console.log(`${years} is leap year`)
}
else{
console.log(`${years} not a leap year`)
}
};
leap_year(2032);
}
//5th problem
//How to compare two friends birth year?
let text = "";
const shain_Birthday = new Date();
shain_Birthday.setFullYear(1996,01,15);
const Shawn_Birthday = new Date;
Shawn_Birthday.setFullYear(1999,11,22);
if(Shawn_Birthday > shain_Birthday){
text = "Shain born before Shawn"
}
else{
text = "Shain born after Shawn"
}
console.log(text);
//6th problem
//how to findout how many vowels have in a sentence
{
const vowels = ["a","e","i","o","u","A","E","I","O","U"];
function count_vowels(sentence){
let count = 0;
const letters = Array.from(sentence);
letters.forEach(function(value){
if(vowels.includes(value)){
count++;
}
});
return count;
}
console.log(count_vowels("I love Bangladesh"))
}
{
const vowels = ["a","e","i","o","u","A","E","I","O","U"];
function all_vowels(sentence){
let count = 0;
const letter = Array.from(sentence);
letter.forEach(function(value){
if(vowels.includes(value)){
count++;
}
})
return count;
}
console.log(all_vowels("Hi there,I'm Shawn"));
}
{
const vowels = ["a", "e", "i", "o", "u", "A", "E", "I", "O", "U"];
function count_all_vowels(sentence){
let count = 0;
const converting_to_array = Array.from(sentence);
converting_to_array.forEach(function(value){
if(vowels.includes(value)){
count++;
}
});
return count;
}
console.log(count_all_vowels("I'm studying Computer Science at Southwest Forestry University"));
}
{
const vowel = ["a", "e", "i", "o", "u", "A", "E", "I", "O", "U"];
function my_vowels(sentence){
let count = 0;
const countAllVowels = Array.from(sentence);
countAllVowels.forEach(function(value){
if(vowel.includes(value)){
count++;
}
});
return count;
}
console.log(my_vowels("What to do I don't know"));
}
{
const vowel = ["a", "e", "i", "o", "u", "A", "E", "I", "O", "U"];
function my_thinking_sucks(sentence){
let count = 0;
const countallVowels = Array.from(sentence);
countallVowels.forEach(function(value){
if(vowel.includes(value)){
count++;
}
});
return count;
}
console.log(my_thinking_sucks("Hi there"));
}
//7th problem
//How to returns the duplicate numbers from an Array
{
const numbers = [1,2,4,4,5,6,7,8,6,2];
const duplicate = numbers.filter(function(value,index,array){
return array.indexOf(value) !== index
});
console.log(duplicate);
}
{
const numbers_of = [ 1,1,2,3,2,4,5,6,3,7,8,9,5];
const duplicates = numbers_of.filter(function(value,index,array){
return array.indexOf(value) !== index
});
console.log(duplicates);
}
{
const n = [1,2,1,3,4,5,2,6,7,8,9,3];
const duplicating = n.filter(function(value,index,array){
return array.indexOf(value) !== index
});
console.log(duplicating);
}
//Again practice
{
//1st problem
//How to get output from 1 to 6
{
console.log(myRandom_num(1,6));
function myRandom_num(min,max){
return Math.floor(Math.random()*(max-min+1))+min;
};
}
//Sort all students name alphabetically
{
const sN = ["Shawn","Ashik","Dristy","Rabby"];
console.log(sN.sort());
}
//Sort students roll numbers in ascending order\
{
const rN = [201901024,201901008,201901016,201901037];
console.log(rN.sort(function(a,b){
return a - b;
}));
}
//Findout a year is a leap year or not
{
function leapYearORnot(year){
if((year % 400 === 0) || ((year % 4 === 0) && (year % 100 !== 0))){
console.log(`${year} is a leap year`);
}
else{
console.log(`${year} is not a leap year`)
}
};
leapYearORnot(2026);
}
{
function mustbeLeapYearNeed(year){
if(year % 400 === 0 || year % 4 === 0 && year % 100 !== 0){
console.log(`${year} is a leap year`)
}
else{
console.log(`${year} not a leap year`)
}
};
mustbeLeapYearNeed(2024);
}
{
function L_Y(year){
if((year % 400 === 0) || ((year % 4 === 0) && (year % 100 !== 0))){
console.log(`${year} is a leap year`)
}
else{
console.log(`${year} is not a leap year`)
}
};
L_Y(2028);
}
//count the vowels in a sentence
{
const vowels = ["a","e","i","o","u","A","E","I","O","U"];
function vowels_function(sentence){
let count = 0;
const creating_array = Array.from(sentence);
creating_array.forEach(function(value){
if(vowels.includes(value)){
count++;
}
});
return count;
}
console.log(vowels_function("I'm new programmer,My name is Shawn"));
}
{
const vowels = ["a","e","i","o","u","A","E","I","O","U"];
function c_vowels(sentence){
let count = 0;
const c_a = Array.from(sentence);
c_a.forEach(function(value){
if(vowels.includes(value)){
count++;
}
});
return count;
};
console.log(c_vowels("I'm Shawn and I'm 21 years old"));
}
{
const vowels = ["a","e","i","o","u","A","E","I","O","U"];
function n_numbers_vowels(sentence){
let count = 0;
const v = Array.from(sentence);
v.forEach(function(value){
if(vowels.includes(value)){
count++;
}
});
return count;
}
console.log(n_numbers_vowels("Hello JavaScript"));
}
////7th problem
//How to returns the duplicate numbers from an Array
{
const n = [1,2,1,3,4,5,2,6,7,8,9,3];
const d_n = n.filter(function(value,index,array){
return array.indexOf(value) !==index
});
console.log(d_n);
}
{
const num = [1,2,3,4,2,4,5,6,7,8,9,5];
const dp_num = num.filter(function(value,index,array){
return array.indexOf(value) !==index
})
console.log(dp_num);
}
}