-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathalgorithms.js
More file actions
152 lines (119 loc) · 3.08 KB
/
algorithms.js
File metadata and controls
152 lines (119 loc) · 3.08 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
// Convert Celsius to Fahrenheit
const convertToF = (celsius) => (celsius * 9/5) + 32;
// Reverse String (without using reverse method)
function reverseString(str) {
let strArr = str.split('');
let reverseArr = [];
for(let i = strArr.length; i > -1; i--) {
reverseArr.push(strArr[i]);
}
return reverseArr.join('');
}
// Factorialize (with recursion)
const factorialize = (num) => num == 0 ? 1 : num * factorialize(num - 1);
// Return length of longest word in a string
function findLongestWordLength(str) {
let wordArr = str.split(' ');
let longest = 0;
for(let i = 0; i < wordArr.length; i++) {
if(wordArr[i].length > longest) longest = wordArr[i].length;
}
return longest;
}
// Using Reduce
function findingLongestWordLength(str) {
return str.split(' ').reduce(function(acc, curr) {
return Math.max(acc, curr.length);
}, 0);
}
function findingLongestWordLength(str) {
return str.split(' ').reduce();
}
// Using Spread Operator to find min and max number in an array
let data = [253, 43, 999, 107, 781, 2];
function getMin(data) {
return Math.min(...data);
}
function getMax(data) {
return Math.max(...data);
}
function largestofFour(arr) {
let largest = [];
for(let i = 0; i < arr.length; i++) {
largest.push(arr[i].reduce((acc, curr) => Math.max(acc, curr), arr[i][0]))
}
return largest;
}
largestOfFour([[4,5,1,3], [13,27,18,26],[32,35,37,39],[1000,1001,857,1]]);
function confirmEnding(str, target) {
return str.slice(target.length - (target.length * 2)) == target;
}
function confirmEnding(str, target) {
return str.slice(-Math.abs(target.length)) == target;
}
function repeatStringNumTimes(str, num) {
let newStr = '';
while(num > 0) {
newStr += str;
num--;
}
return newStr;
}
repeatStringNumTimes("abc", 3);
repeatStringNumTimes("def", 4);
repeatStringNumTimes("ghi", 5);
function truncateString(str, num) {
return num >= str.length ? str : str.slice(0, num) + '...';
}
truncateString("abracadabra", 4); // abra...
function findElement(arr, func) {
let answer = undefined;
for(let i = 0; i < arr.length; i++) {
if(func(arr[i])) {
answer = arr[i];
break;
}
}
return answer;
}
// Sum all numbers in a range
//Basic
function sumAll(arr) {
var max = Math.max(arr[0], arr[1]);
var min = Math.min(arr[0], arr[1]);
var sum = 0;
for (var i = min; i <= max; i++) {
sum += i;
}
return sum;
}
//Intermediate
function sumAll(arr) {
var sortedArr = arr.sort((a,b) => a-b);
return (arr[1] - arr[0] + 1) * (arr[0] + arr[1]) / 2;
}
sumAll([]);
//Advanced
function sumAll(arr) {
let sum = 0;
for (let i = Math.min(...arr); i <= Math.max(...arr); i++) {
sum += i;
}
return sum;
}
sumAll([1, 4]);
//Find the differences between two arrays
function diffArray(arr1, arr2) {
var newArr = [];
function compareArr(first, second) {
for(let i = 0; i < first.length; i++) {
if(!second.includes(first[i]) {
newArr.push(first[i]);
}
}
}
compareArr(arr1, arr2);
compareArr(arr2, arr1);
return newArr;
}
diffArray([1, 2, 3, 5], [1, 2, 3, 4, 5]);