1
+ //1- Reverse Number 123, 321
2
+ const reverseNumber = ( num ) => {
3
+ let digits = ( "" + num ) . split ( "" ) . reverse ( ) . join ( "" ) ;
4
+ return digits ;
5
+ }
6
+ console . log ( "Reversed Number: " , reverseNumber ( 123 ) ) ; //reverse metodu
7
+
8
+ //reverse metodu kullanmadan çözüm alternatifi
9
+ const reversedNumber = ( num ) => {
10
+ const str = "" + num ;
11
+ let newStr = "" ;
12
+ for ( let index = str . length - 1 ; i > 0 ; index -- ) {
13
+ newStr = str [ i ] ;
14
+ }
15
+ return Number . parseInt ( newStr ) ;
16
+ }
17
+
18
+ //-------------------------------------------//
19
+ //2 - isPalindrome reverse metodu kullanmadan
20
+ const isPalindrome = ( str ) => {
21
+ let isFalse = true ;
22
+ const strArr = str . toLowerCase ( ) . split ( '' ) ;
23
+
24
+ strArr . forEach ( ( letter , index ) => {
25
+ if ( letter !== strArr [ strArr . length - index - 1 ] ) {
26
+ isFalse = false ;
27
+ }
28
+ } ) ;
29
+ return isFalse ;
30
+ }
31
+
32
+ console . log ( "isPalindrome:" , isPalindrome ( "asdfg" ) ) ;
33
+ console . log ( "isPalindrome:" , isPalindrome ( "abba" ) ) ;
34
+ console . log ( "isPalindrome:" , isPalindrome ( "xoXox" ) ) ;
35
+ console . log ( "isPalindrome:" , isPalindrome ( "kazak" ) ) ;
36
+ //-------------------------------------------//
37
+
38
+ // 3 - biggest number an arr
39
+ const arr = [ 3 , 5 , 8 , 100 , 20 ] ;
40
+ const max = Math . max ( ...arr ) ;
41
+
42
+ const index = arr . indexOf ( max ) ;
43
+ console . log ( "Maximum numaranın indexi: " , index ) ;
44
+
45
+ const biggestNumber = ( arr ) => {
46
+ const max = Math . max ( ...arr ) ;
47
+ return max ;
48
+ }
49
+ console . log ( "The biggest number is: " , biggestNumber ( arr2 = [ 3 , 5 , 8 , 100 , 20 ] ) ) ;
50
+
51
+ const maxNumber = ( arr ) => {
52
+ let max = - Infinity ;
53
+ arr . forEach ( ( elem ) => {
54
+ if ( max < elem ) {
55
+ max = elem ;
56
+ }
57
+ } ) ;
58
+ return max ;
59
+ }
60
+ console . log ( "The max number is: " , maxNumber ( [ 3 , 5 , 8 , 100 , 20 ] ) ) ;
61
+
62
+ // 4- en uzun kelimeyi bulan metot
63
+ function findLongestWordLength ( str ) {
64
+ let word = "" ;
65
+ const arr = str . split ( " " ) ;
66
+ arr . forEach ( element => {
67
+ if ( element . length > word . length ) {
68
+ word = element ;
69
+ }
70
+ } ) ;
71
+ return word ;
72
+ }
73
+ console . log ( "The longest word is: " , findLongestWordLength ( "asadjah fdshjsxxxxxx dfs" ) ) ;
74
+
75
+ //5 - aldıgı argümanın bir array olup olmadığını kontrol eden fonksiyon
76
+ const isArray = ( arr ) => {
77
+ return Array . isArray ( arr ) ;
78
+ }
79
+ console . log ( "Is Array?" , isArray ( arr2 = [ 3 , 5 , 8 , 100 , 20 ] ) ) ;
80
+
81
+ //6- aldığı array içindeki sayıları büyükten küçüğe dizip yeni bir array oluşturan fonksiyon
82
+ const sortedArray = ( array ) => {
83
+ let newArr = [ ] ;
84
+ arr . forEach ( ( ) => {
85
+ let max = arr [ 0 ] ;
86
+ let indexTemp = 0 ;
87
+ arr . forEach ( ( element2 , index2 ) => {
88
+ if ( element2 > max ) {
89
+ max = element2 ;
90
+ indexTemp = index2 ;
91
+ }
92
+ } ) ;
93
+ newArr . push ( max ) ;
94
+ array [ indexTemp ] = Number . NEGATIVE_INFINITY ;
95
+ } ) ;
96
+ return newArr ;
97
+ }
98
+
99
+ console . log ( "Sorted Array" , sortedArray ( [ 3 , 5 , 8 , 100 , 20 , 12 , 15 ] ) ) ;
0 commit comments