-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathFreecodecamp Algorithm Basic.js
More file actions
185 lines (153 loc) · 3.67 KB
/
Copy pathFreecodecamp Algorithm Basic.js
File metadata and controls
185 lines (153 loc) · 3.67 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
//Reversing a string
function reverseString(str) {
return str.split('').reverse().join('');
}
//Factorialization
function factorialize(num) {
var numbers = [];
if(num === 0){
return 1;
}
for(var i = num; i > 0; i--){
numbers.push(i);
}
function getFactor(total, factor) {
return total * factor;
}
return numbers.reduce(getFactor);
}
//Palindromes
function palindrome(str) {
// Good luck!
var rawString = str.replace(/[\W_]/g, "").toLowerCase();
if (rawString.split("").reverse().join("")===rawString){
return true;
}
else{
return false;
}
}
//Longest Word
var words = str.split(" ");
var wordLength = [];
for(var i = 0; i < words.length; i++){
wordLength.push(words[i].length);
}
wordLength.sort(function(a, b){
return b - a;
});
return wordLength[0];
//Title Case a Sentence
function titleCase(str) {
var rawString = str.toLowerCase().split(" ");
var upperCase = [];
for(var i = 0; i < rawString.length; i++){
upperCase.push(rawString[i][0].toUpperCase() + rawString[i].substring(1, rawString[i].length));
}
return upperCase.join(" ");
}
//Return largest number in arrays
function largestOfFour(arr) {
var largestNum = [];
for(var i = 0; i < arr.length; i++){
arr[i].sort(function(a, b){
return b - a;
});
largestNum.push(arr[i][0]);
}
return largestNum;
}
//Confirm the ending
function confirmEnding(str, target) {
if(str.slice(str.length - target.length, str.length) == target){
return true;
}
else{
return false;
}
}
//Repeating a string
function repeatStringNumTimes(str, num) {
var answer = [];
for(var i = 0; i < num; i++){
answer.push(str);
}
return answer.join("");
}
//Truncate a string
function truncateString(str, num) {
if (str.length <= num) {
return str;
} else {
return str.slice(0, num > 3 ? num - 3 : num) + '...';
}
}
//Chunky Monkey
function chunkArrayInGroups(arr, size) {
var answer = [];
for(var i = 0; i < arr.length/size; i++){
answer.push(arr.slice(i * size, (i + 1) * size));
}
return answer;
}
//Slasher Flick
function slasher(arr, howMany) {
return arr.slice(howMany, arr.length + 1);
}
//Mutations
function mutation(arr) {
var letters = arr[1].toLowerCase().split("");
var answers = [];
for(var i = 0; i < letters.length; i++){
answers.push(arr[0].toLowerCase().includes(letters[i]));
}
return answers.every(function (element) {
return element === true;
} );
}
//Falsy Bouncer
function bouncer(arr) {
return arr.filter(Boolean);;
}
//Seek and Destroy
function destroyer(arr) {
var args = Array.from(arguments).slice(1);
for(var i = 0; i < arr.length; i++){
for(var j = 0; j < args.length; j++){
if(arr[i] == args[j]){
delete arr[i];
}
}
}
return arr.filter(Boolean);
}
//Where do I belong
function getIndexToIns(arr, num) {
var answer = [];
for(var i = 0; i < arr.length; i++){
if(arr[i] < num){
answer.push(arr[i]);
}
}
return answer.length;
}
//Caesars Cipher
function rot13(str) { // LBH QVQ VG!
var answers = [];
var correct = [];
var final = [];
for(var i = 0; i < str.length; i++){
answers.push(str.split("")[i].charCodeAt());
if(answers[i] < 65 || answers[i] > 90){
correct.push(answers[i]);
}
else if(answers[i] <= 77){
correct.push(answers[i] + 13);
}
else if(answers[i] >= 77){
correct.push(answers[i] - 13);
}
final.push(String.fromCharCode(correct[i]));
}
return final.join("");
}