-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathquestions.js
99 lines (87 loc) · 2.6 KB
/
questions.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
//1- Reverse Number 123, 321
const reverseNumber = (num) => {
let digits = (""+num).split("").reverse().join("") ;
return digits;
}
console.log("Reversed Number: ", reverseNumber(123)); //reverse metodu
//reverse metodu kullanmadan çözüm alternatifi
const reversedNumber = (num) => {
const str = "" + num;
let newStr ="";
for (let index = str.length-1; i > 0; index--) {
newStr = str[i];
}
return Number.parseInt(newStr);
}
//-------------------------------------------//
//2 - isPalindrome reverse metodu kullanmadan
const isPalindrome = (str) => {
let isFalse = true;
const strArr = str.toLowerCase().split('');
strArr.forEach((letter, index) => {
if (letter !== strArr[strArr.length - index - 1]) {
isFalse = false;
}
});
return isFalse;
}
console.log("isPalindrome:", isPalindrome("asdfg"));
console.log("isPalindrome:", isPalindrome("abba"));
console.log("isPalindrome:", isPalindrome("xoXox"));
console.log("isPalindrome:", isPalindrome("kazak"));
//-------------------------------------------//
// 3 - biggest number an arr
const arr = [3, 5, 8, 100, 20];
const max = Math.max(...arr);
const index = arr.indexOf(max);
console.log("Maximum numaranın indexi: ", index);
const biggestNumber = (arr) => {
const max = Math.max(...arr);
return max;
}
console.log("The biggest number is: ", biggestNumber(arr2 = [3, 5, 8, 100, 20]));
const maxNumber = (arr) => {
let max = -Infinity;
arr.forEach((elem) => {
if (max < elem) {
max = elem;
}
});
return max;
}
console.log("The max number is: ", maxNumber([3, 5, 8, 100, 20]));
// 4- en uzun kelimeyi bulan metot
function findLongestWordLength(str) {
let word = "";
const arr = str.split(" ");
arr.forEach(element => {
if(element.length > word.length) {
word = element;
}
});
return word;
}
console.log("The longest word is: ", findLongestWordLength("asadjah fdshjsxxxxxx dfs"));
//5 - aldıgı argümanın bir array olup olmadığını kontrol eden fonksiyon
const isArray = (arr) => {
return Array.isArray(arr);
}
console.log("Is Array?",isArray(arr2 = [3, 5, 8, 100, 20]));
//6- aldığı array içindeki sayıları büyükten küçüğe dizip yeni bir array oluşturan fonksiyon
const sortedArray = (array) => {
let newArr = [];
arr.forEach(() => {
let max = arr[0];
let indexTemp = 0;
arr.forEach((element2, index2) => {
if (element2 > max) {
max = element2;
indexTemp = index2;
}
} );
newArr.push(max);
array[indexTemp] = Number.NEGATIVE_INFINITY;
} );
return newArr;
}
console.log("Sorted Array",sortedArray([3, 5, 8, 100, 20, 12 ,15]));