-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathpractice.js
151 lines (143 loc) · 2.53 KB
/
practice.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
console.log("Ankur test")
function dummy () {
return 1;
}
/**
* Reverse an array
*
* @example
*
* reverse([1,2,3]) returns [3,2,1]
*
* @param {array} array
* @returns {array}
*/
function reverse (array) {
const newArr = [];
for (i = array.length -1 ; i >= 0 ; i--){
newArr.push(array[i])
}
console.log(newArr)
return [newArr];
}
// reverse([4, 3, 2])
/**
* Reverse a string
*
* @example
*
* stringReverse('hello') returns 'olleh'
*
* @param {string} text
* @returns {string}
*
*/
function stringReverse (text) {
let revString = '';
text.split('').forEach((char) => {
revString = char + revString
});
console.log(revString);
return revString;
}
stringReverse("hello");
/**
* return a fixed length fibonacci list
*
* @example
*
* fibonacci(5) returns [1,1,2,3,5]
*
* @param {number} length
* @returns {array}
*/
function fibonacci (length) {
a= 0;
b=0;
c = 1;
newArr = []
for (i =0; i< length; i++){
a = b
b = c
c = a + b
newArr.push(c)
}
console.log(newArr);
return [newArr];
}
fibonacci(5);
/**
* return the biggest number in the array
*
* @example
*
* biggest([1,3,5,7,9]) returns 9
*
* @param {array} array
* @returns {number}
*/
function biggest (array) {
let bigg = 0;
for (i = 0 ; i < array.length; i++){
if (bigg >= array[i] ){
bigg = bigg
}
else {
bigg = array[i]
}
}
console.log(bigg);
return bigg;
}
biggest([2, 5, 4])
/**
* Creates an array of numbers progressing from
* start up to, but not including, end
*
* YOU HAVE TO IMPLEMENT YOUR OWN ALGORITHM HERE!!!
* DON'T USE ANY 3RD PARTY LIBRARIES.
*
* @example
*
* range(0,4) returns [0,1,2,3]
*
* @param {number} start
* @param {number} end
* @returns {array}
*/
function range (start, end) {
newArr = []
// time is running out
console.log(newArr);
return [];
}
range(0, 3)
/**
* Recursively flattens array.
*
* YOU HAVE TO IMPLEMENT YOUR OWN ALGORITHM HERE!!!
* DON'T USE ANY 3RD PARTY LIBRARIES.
*
* @example
*
* flatten([1,[2,[3,4],[5,[6]]]]) returns [1,2,3,4,5,6]
*
* @param {array} array
* @returns {array}
*/
function flatten (array) {
array.flat();
console.log(array);
return array;
}
flatten([1,[2,[3,4],[5,[6]]]])
module.exports = {
dummy,
fibonacci,
reverse,
flatten,
biggest,
flatten,
stringReverse,
range
};