-
Notifications
You must be signed in to change notification settings - Fork 0
/
code.js
849 lines (795 loc) · 20.3 KB
/
code.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
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
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
// REVERSED ARRAY DIGITS
function digitize(n) {
return [...n.toString()].reverse().map(Number);
}
console.log(digitize(139714043));
// MULTIPLY DIGITS
function multilply(a, b) {
return a * b;
}
console.log(multilply(10, 10));
// IS THE STRING UPPERCASE ?
String.prototype.isUpperCase = function () {
return this == this.toUpperCase(); // 2 equals == checking the data-type only so will return true;
};
// FIND NUMBERS WHICH ARE DIVISIBLE BY GIVEN NUMBER || will return even series of even numbers;
function divisibleBy(numbers, divisor) {
// let even = [];
// for (let i = 0; i < numbers.length; i++) {
// if (numbers[i] % divisor === 0) {
// even.push(numbers[i]);
// }
// }
return numbers.filter((n) => n % divisor === 0);
}
console.log("DIVISIBLE", divisibleBy([2, 3, 9, 12, 10], 2));
// NAME ON A BILLBOARD || cannot use '*' operator;
function billboard(name, price = 30) {
return [...name].reduce((acc, curr) => {
return acc + price;
}, 0);
}
console.log(billboard("lara"));
// OPPOSITE ATTRACT
function lovefunc(flower1, flower2) {
return flower1 % 2 !== flower2 % 2;
//value = 0 is not equal to 0 || will return true else false;
}
console.log(lovefunc(1, 2));
console.log(lovefunc(2, 2));
console.log(lovefunc(2, 1));
// SHORT-LONG-SHORT || rearranged the array to length => short + long + short;
function solution(a, b) {
return a.length > b.length ? b + a + b : a + b + a;
}
console.log(solution("lara", "dan"));
//YOU ONLY NEED ONE - Beginner || if the array contains the value,
function check(a, x) {
return a.indexOf(x) > -1;
// if its '-1', meaning there is nothing
// if its greater than '-1', there has the value of x inside the array of 'a'
}
console.log(check([100, 200, 33], 100));
// COUNT BY : (1,10) === [1,2,3,4,5,6,7,8,9,10] || countBy(2,5) === [2,4,6,8,10]
function countBy(x, n) {
let a = [];
for (let i = 1; i <= n; i++) {
a.push(x * i);
}
return a;
}
console.log("countBy", countBy(1, 5));
console.log("countBy", countBy(2, 3));
// FIND MULTIPLES
// For example, if the parameters passeda re (2, 6), the function should return [2, 4, 6] as 2, 4, and 6 are the multiples of 2 up to 6.
function findMultiples(integer, limit) {
const a = [];
for (let i = integer; i <= limit; i += integer) {
a.push(i);
}
return a;
}
console.log(findMultiples(2, 9));
// SORT AND STAR
function twoSort(s) {
// return [...s.sort()[0]].join("***");
return [
...s.reduce((acc, curr) => {
return acc < curr ? acc : curr;
}),
].join("***");
}
console.log(twoSort(["are", "ace", "than", "writing", "out"]));
// RETURNS THE SUM OF ALL THE POSITIVE INTEGERS
function positiveSum(arr) {
return arr
.filter((n) => n > 0)
.reduce((acc, curr) => {
console.log("acc", acc + " " + "+", curr);
return acc + curr;
}, 1);
}
console.log(positiveSum([1, 23, 76, -12]));
// SAFEN USER INPUT - htmlspecialchars
function htmlspecialchars(formData) {
return (
(formData = formData.replace(/&/g, "&")) &&
formData.replace(/</g, "<") &&
formData.replace(/>/g, ">") &&
formData.replace(/"/g, """)
);
}
console.log(htmlspecialchars('Hello, how would you & I fare?"'));
// CONTAMINATION STRING
function contamination(text, char) {
// if (text.length === 0 || char.length === 0) return "";
// let res = "";
// for (const _ of text) {
// res += char;
// }
return char.repeat(text.length) + " !";
}
console.log(contamination("laramarie", "Z"));
// ABBREVIATE A TWO WORD NAME
function abbrevName(name) {
// return (
// name[0].toUpperCase() + "." + name[name.indexOf(" ") + 1].toUpperCase()
// );
let [first, last] = name.split(" ");
return first[0].toUpperCase() + "." + last[0].toUpperCase();
}
console.log(abbrevName("jra mrie"));
// CLOCK SERIES
function past(h, m, s) {
const hours = h * 60 * 60 * 1000;
const mins = m * 60 * 1000;
const secs = s * 1000;
return hours + mins + secs;
}
console.log(past(1, 2, 1));
// NAME SHUFFLER
function nameShuffler(str) {
return str.split(" ").reverse().join(" ");
}
console.log(nameShuffler("lara marie"));
// POWER OF 2
function powersOfTwo(n) {
const res = [];
for (let i = 0; i <= n; i++) {
res.push(Math.pow(2, i));
}
return res;
}
console.log(powersOfTwo(4));
// DOUBLE THE CHARACTER
function doubleChar(str) {
let res = [];
for (let i = 0; i < str.length; i++) {
res.push((str[i] += str[i]));
}
return res.join("");
}
console.log(doubleChar("coldplay"));
// INVERT THE VALUES
function invert(array) {
let res = [];
for (const i of array) {
res.push(i * -1);
}
return res;
}
console.log(invert([1, 2, 3, 5, 67, -10, 0, 88]));
// FAKE BINARY
function fakeBin(x) {
// return x.split("").map((n) => (n < 5 ? "0" : "1"));
x = x.toString().split("");
return x.map((n) => (n < 5 ? 0 : 1)).join("");
}
console.log(fakeBin(45385593107843568));
// SORT DESC
const reverseSeq = (n) => {
let res = [];
for (let i = n; i > 0; i--) {
res.push(i);
}
return new Array(n)
.fill()
.map((d, i) => i + 1)
.reverse();
};
console.log(reverseSeq(10));
// REVERSE AN ARRAY;
function fixTheMeerkat(arr) {
return arr.reverse();
}
console.log(fixTheMeerkat(["ground", "rainbow", "sky"]));
// DIVISIBLE BY X AND Y;
function isDivisible(n, x, y) {
return n % x === 0 && n % y === 0;
}
console.log(isDivisible(10, 2, 1));
// PYTHAGOREAN
function isPythagoreanTriple(integers) {
const nums = integers.sort((a, d) => a - d);
console.log(nums);
return nums[0] ** 2 + nums[1] ** 2 === nums[2] ** 2;
}
console.log(isPythagoreanTriple([3, 5, 4]));
// ALWAYS RETURNS 5
function unusualFive() {
return ".....".length;
}
console.log(unusualFive());
// SUM MIXED VALUES
function sumMix(x) {
return x.map(Number).reduce((acc, curr) => acc + curr, 0);
}
console.log(sumMix([1, 3, 6, 2, "9", "3"]));
// REMOVE THE FIRST AND LAST INDEX VALUES
function removeChar(str) {
return str.slice(1, -1);
// return str.substring(1, str.length - 1);
}
console.log(removeChar("lara marie is all"));
// HOW MUCH I LOVE YOU
function howMuchILoveYou(nbPetals) {
const dics = [
"I love you",
"a little",
"a lot",
"passionately",
"madly",
"not at all",
];
let calc = dics[(nbPetals - 1) % 6];
return calc;
}
console.log(howMuchILoveYou(1));
// CATEGORIZE NEW MEMBER
function openOrSenior(data) {
return data.map(([age, handicap, thing]) => {
return age >= 55 && handicap > 7 ? "Senior" : "Open";
});
}
console.log(
openOrSenior([
[18, 20],
[45, 2],
[61, 12],
[37, 6],
[21, 21],
[78, 9],
])
);
// COMPLEMENTARY DNA
function DNAStrand(dna) {
const dict = { A: "T", C: "G", G: "C", T: "A" };
return [...dna].map((base) => dict[base]).join("");
}
console.log(DNAStrand("ATTGC"));
// SUM ALL WITHOUT THE HIGHEST AND LOWEST NUMBER;
function sumArray(array) {
return Array.isArray(array) && array.length > 1
? array.reduce((acc, curr) => acc + curr, 0) -
Math.min(...array) -
Math.max(...array)
: 0;
}
console.log(sumArray([-6, -20, -1, -10, -12]));
// COUNT SHEEP
var countSheep = function (num) {
let newStr = "";
for (let i = 1; i <= num; i++) {
newStr += `${i}sheep... `;
return newStr;
}
};
console.log(countSheep(10));
// A SQUARE OF SQUARES
var isSquare = function (n) {
const root = Math.sqrt(n);
return root === Math.floor(root);
};
console.log(isSquare(25));
// ROCK PAPER SCISSORS
const rps = (p1, p2) => {
if (p1 === p2) return "Draw!";
let rules = { paper: "scissors", rock: "paper", scissors: "rock" };
if (p1 === rules[p2]) {
return "Player 1 won!";
} else {
return "Player 2 won!";
}
};
console.log(rps("rock", "paper"));
// MAX AND MIN VALUES IN THE LIST;
var min = function (list) {
return Math.min(...list);
};
var max = function (list) {
return Math.max(...list);
};
console.log(min([-52, 56, 30, 29, -54, 0, -110]));
console.log(max([-52, 56, 30, 29, -54, 0, -110]));
// NUMBERS OF BULLETS TO CARRY TO DEFEAT THE DRAGON;
function hero(bullets, dragons) {
return bullets >= dragons * 2;
}
console.log(hero(10, 5));
//EX AND OHS
function XO(str) {
const arr = str.toUpperCase().split("");
let x = "";
let o = "";
return x.length === o.length;
for (let i = 0; i <= arr.length; i++) {
if (arr[i] === "X" || arr[i] === "O") {
x += arr[i] === "X";
o += arr[i] === "O";
}
}
}
console.log(XO("XXoom"));
// GET THE GRADE
function getGrade(s1, s2, s3) {
let grade = Math.floor((s1 + s2 + s3) / 3);
let letterGrade;
switch (true) {
case grade >= 90:
letterGrade = "A";
break;
case grade >= 80:
letterGrade = "B";
break;
case grade >= 70:
letterGrade = "C";
break;
case grade >= 60:
letterGrade = "D";
break;
default:
letterGrade = "F";
break;
}
return letterGrade;
}
console.log(getGrade(95, 90, 93));
// TWO TO ONE
function longest(s1, s2) {
const combined = s1.concat(s2);
const un = [...new Set(combined)];
return un.sort().join("");
}
console.log(longest("loopingisfunbutdangerous", "lessdangerousthancoding"));
// REVERSE WORDS;
function reverseWords(str) {
return str
.split(" ")
.map((word) => [...word].reverse().join(""))
.join(" ");
}
console.log(reverseWords("Lara is the just"));
// SUM OF TWO LOWEST POSITIVE INTEGERS;
function sumTwoSmallestNumbers(numbers) {
return numbers
.sort((a, d) => a - d)
.slice(0, 2)
.reduce((a, c) => a + c, 0);
}
console.log(sumTwoSmallestNumbers([1, 5, 8, 12, 19, 22]));
var summation = function (num) {
let sum = 0; // 1,3
for (let i = 1; i <= num; i++) {
sum = sum + i;
}
return sum;
};
console.log(summation(3));
// Ones && Zeros
const binaryArrayToNumber = (arr) => {
return [...arr][0];
};
console.log(binaryArrayToNumber([12, 1, 1, 1]));
// DUPLICATE ENCODE
function duplicateEncode(word) {
word = word.toLowerCase();
let charCount = {};
for (let i = 0; i < word.length; i++) {
if (word[i] in charCount) {
charCount[word[i]]++;
} else {
charCount[word[i]] = 1;
}
}
let str = "";
for (let i = 0; i < word.length; i++) {
if (charCount[word[i]] > 1) {
str += ")";
} else {
str += "(";
}
}
return str.toLowerCase();
}
// GET THE VOWELS COUNT
const getCount = (str) => {
const vowels = ["a", "e", "i", "o", "u"];
let count = 0;
for (let i = 0; i < str.length; i++) {
console.log(str[i]);
if (vowels.includes(str[i])) {
count++;
}
}
return count;
};
console.log(getCount("lara is the just"));
// SORT ODD NUMBERS || RETAIN EVEN NUMBERS TO THEIR POSITIONS
function sortArray(array) {
const oddNums = array.filter((num) => num % 2 !== 0).sort((a, d) => a - d);
return array.map((num) => (num % 2 !== 0 ? oddNums.shift() : num));
// return array.map((num) => (num % 2 !== 0 ? oddNums.shift() : num));
}
// 1 3 2 8 5 4
console.log(sortArray([5, 3, 2, 8, 1, 4]));
// CALCULATE THE FUEL
const zeroFuel = (distanceToPump, mpg, fuelLeft) => {
return mpg * fuelLeft >= distanceToPump;
};
console.log(zeroFuel(50, 25, 2));
//LOST WITHOUT A MAP
function maps(x) {
return x.map((num) => num * 2);
}
console.log(maps([2, 5, 10, -3]));
// HEXADECIMAL
function hexToDec(hexString) {
return parseInt(hexString, 16);
}
console.log(hexToDec("FF"));
// COUNT POSITIVES AND SUM OF NEGATIVES
function countPositivesSumNegatives(input) {
if (input === null || input.length === 0) {
return [];
}
let countofPositives = input.filter((n) => n > 0 && n !== 0).length;
let countofNegatives = input
.filter((n) => n < 0 && n !== 0)
.reduce((acc, curr) => acc + curr, 0);
return [countofPositives, countofNegatives];
}
console.log(
countPositivesSumNegatives([
1, 2, 3, 4, 5, 6, 7, 8, 9, 10, -11, -12, -13, -14, -15,
])
);
// STRINGS WITH VALUES ON ALPHABET
function high(words) {
const alp = [
"a",
"b",
"c",
"d",
"e",
"f",
"g",
"h",
"i",
"j",
"k",
"l",
"m",
"n",
"o",
"p",
"q",
"r",
"s",
"t",
"u",
"v",
"w",
"x",
"y",
"z",
];
// Split the string into an array of words
const wordArray = words.split(" ");
// Sort the words by score and return the highest scoring one
return wordArray.sort((a, b) => {
const getScore = (word) =>
word
.split("")
.reduce((score, char) => score + char.charCodeAt(0) - 96, 0);
return getScore(b) - getScore(a);
})[0];
}
console.log(high("Lara is the just world"));
// FIND THE UNIQUE NUMBER
function findUniq(arr) {
// let uniqueNumber = 0;
// let numbersCount = {};
// for (let i = 0; i < arr.length; i++) {
// if (numbersCount[arr[i]]) {
// numbersCount[arr[i]]++;
// } else {
// numbersCount[arr[i]] = 1;
// }
// }
// for (let num in numbersCount) {
// if (numbersCount[num] === 1) {
// uniqueNumber = Number(num);
// break;
// }
// }
// return numbersCount;
return Number(arr.filter((val) => arr.indexOf(val) == arr.lastIndexOf(val)));
}
console.log(findUniq([13, 3, 6, 6, 1, 10, 10, 1, 1, 2, 2, 1, 3, 3, 1]));
// TAKE THE DERIVATIVE
function derive(coefficient, exponent) {
const prod = coefficient * exponent;
return `${prod}x^${exponent - 1}`;
}
console.log(derive(5, 9));
// REVERSED STRING
function reverse(str) {
return [...str].reverse().join("");
}
console.log(reverse("lara marie"));
//FIND THE NEEDLE AT WHAT INDEX
function findNeedle(haystack) {
return `found the needle at position ${haystack.indexOf("needle")}`;
}
console.log(
findNeedle(["hay", "junk", "hay", "hay", "moreJunk", "needle", "randomJunk"])
);
// GET CHAR FROM ASCII VALUE
function getChar(c) {
return String.fromCharCode(c);
}
console.log(getChar(65));
// LOOK FOR A TAIL
function correctTail(body, tail) {
return body.slice(-1) === tail;
}
console.log(correctTail("Fox", "x"));
// REPEAT THE STRING
function repeatStr(n, s) {
return s.repeat(n);
}
console.log(repeatStr(5, "dan"));
// VOLUME OF CUBOID
class Kata {
static getVolumeOfCuboid(length, width, height) {
return length * width + height;
}
}
// MERGE TWO SORTED ARRAYS
function mergeArrays(arr1, arr2) {
return [...arr1, ...arr2]
.sort((a, d) => a - d)
.filter((value, index, self) => self.indexOf(value) === index);
}
console.log(
mergeArrays(
["lara", 1, 1, 1, 0, -1, 2, 2, 3, 3, 4, 5, ["dan", "lara"]],
[6, 7, 8, 9, 10]
)
);
// BLUE AND RED MARBLES
function guessBlue(blueStart, redStart, bluePulled, redPulled) {
const blue = blueStart - bluePulled;
const red = redStart - redPulled;
return blue / (blue + red);
}
console.log(guessBlue(5, 5, 2, 3));
// ALTERNATE THE STRING CASE
String.prototype.toAlternatingCase = function () {
let newString = "";
for (const char of this) {
if (char === char.toUpperCase()) {
newString += char.toLowerCase();
} else {
newString += char.toUpperCase();
}
}
return newString;
};
// FIND THE SMALLES INTEGER
class SmallestIntegerFinder {
findSmallestInt(args) {
return Math.min(...args);
}
}
// CAPITALIZE THE STRING
function capitalizeWord(word) {
return word[0].toUpperCase() + word.slice(1);
}
console.log(capitalizeWord("jordan"));
// QUARTER OF THE YEAR
const quarterOf = (month) => {
return Math.ceil(month / 3);
};
console.log(quarterOf(12));
// MULTIPLE IN ORDER
function grow(x) {
return x.reduce((acc, curr) => acc * curr, 1);
}
console.log(grow([1, 2, 3, 4]));
// WELL OF IDES " EASY VERSION"
function well(x) {
let good = x.reduce((count, idea) => {
if (idea === "good") {
count += 1;
}
return count;
}, 0);
if (good === 2 || good === 1) return "Publish!";
if (good > 2) return "I smell a series!";
return "Fail!";
// let good = 0;
// for (const idea of x) {
// if (idea === "good") {
// good += 1;
// }
// }
// if (good === 2 || good === 1) return "Publish!";
// if (good > 2) return "I smell a series!";
// return "Fail!";
}
console.log(well(["good", "good", "good", "bad", "bad", "bad", "bad"]));
// GIVE THE MAXIMUM AND MINIMUM
function minMax(arr) {
return [Math.min(...arr), Math.max(...arr)];
}
console.log(minMax([1, 2, 3, 4, 5]));
// RETURN WHAT IS LEFT
var number = function (busStops) {
let laman = busStops.map((x) => x[0]).reduce((acc, curr) => acc + curr, 0);
let nabawas = busStops.map((x) => x[1]).reduce((acc, curr) => acc + curr, 0);
return laman - nabawas;
};
const args = [
[10, 0],
[3, 5],
[5, 8],
];
console.log(number(args));
// CALCULATE THE TIME REMAINING
function queueTime(customers, n) {
const tills = new Array(n).fill(0);
for (let i = 0; i < customers.length; i++) {
const minTime = Math.min(...tills);
const index = tills.indexOf(minTime);
tills[index] += customers[i];
}
return Math.max(...tills);
}
console.log(queueTime([1, 2, 3, 4, 5], 100));
// FIND THE FIRST NON-CONSECUTIVE
function firstNonConsecutive(arr) {
for (let i = 1; i < arr.length; i++) {
if (arr[i] !== arr[i - 1] + 1) {
return arr[i];
}
}
return null;
}
console.log(firstNonConsecutive([1, 2, 3, 4, 5, 7, 8]));
// ODD OR EVEN
function oddOrEven(array) {
return array.reduce((a, c) => a + c, 0) % 2 !== 0 ? "odd" : "even";
}
console.log(oddOrEven([1, 2, 2]));
// RETURN A MESSAGE
function hoopCount(n) {
return n >= 10
? "Great, now move on to tricks"
: "Keep at it until you get it";
}
console.log(hoopCount(10));
// REMOVES ALL EXCLAMATION POINT
function removeExclamationMarks(s) {
return s.replaceAll("!", "");
}
console.log(removeExclamationMarks("Hello World!"));
// CALCULATE THE AVERAGE
function findAverage(array) {
return array.length > 0
? array.reduce((acc, curr) => acc + curr, 0) / array.length
: 0;
}
console.log(findAverage([1, 2, 3, 4]));
// TRAFFIC LIGHTS
function updateLight(current) {
const matches = { green: "yellow", yellow: "red", red: "green" };
let color = null;
for (const m in matches) {
if (m === current) {
color = matches[m];
}
}
return color;
}
console.log(updateLight("yellow"));
// BREAK CAMEL CASING
function solution(string) {
return string
.split("")
.map((char) => {
if (char === char.toUpperCase()) {
return " ".concat(char);
} else return char;
})
.join("");
}
console.log(solution("camelCasing"));
// DELETE OCCURENCES THAT APPEARS MORE THAN ONCE
function deleteNth(list, n) {
const counts = {};
// const result = [];
// for (let i = 0; i < list.length; i++) {
// const num = list[i];
// if ((counts[num] || 0) < n) {
// result.push(num);
// counts[num] = (counts[num] || 0) + 1;
// }
// }
// return result;
return list.reduce((acc, curr) => {
if ((counts[curr] || 0) < n) {
acc.push(curr);
counts[curr] = (counts[curr] || 0) + 1;
}
return acc;
}, []);
}
console.log(deleteNth([1, 1, 3, 3, 7, 2, 2, 2, 2], 3));
// REMOVE THE SPACE IN BETWEENS
function noSpace(x) {
// return x.replaceAll(" ", "");
let newStr = "";
for (const char of x) {
if (char !== " ") newStr += "" + char;
}
return newStr;
}
console.log(noSpace("lar a marie"));
//WELL OF IDEAS
function well(x) {
// 1 || 2 goods = Publish
// 3 || more = series
let good = x.reduce((acc, curr) => {
if (curr === "good") {
acc += 1;
}
return acc;
}, 0);
if (good === 2 || good === 1) return "Publish!";
if (good > 2) return "I smell a series!";
return "Fail!";
}
console.log(
well(["good", "bad", "bad", "bad", "bad", "good", "bad", "bad", "good"])
);
// CALCULATE THE DISTANCE TIME
function distanceBetweenPoints(a, b) {
function distanceBetweenPoints(a, b) {
const x = a.x - b.x;
const y = a.y - b.y;
return Math.sqrt(x ** 2 + y ** 2);
}
}
console.log(distanceBetweenPoints());
function removeSmallest(numbers) {
const numsCopy = numbers.slice(); // make copy
if (numsCopy.length === 0) return [];
let smallestIndex = 0;
for (let i = 0; i < numsCopy.length; i++) {
if (numsCopy[i] < numsCopy[smallestIndex]) {
smallestIndex = i;
}
}
numsCopy.splice(smallestIndex, 1);
return numsCopy.splice(smallestIndex, 1);
}
let res = removeSmallest([100, 10, 10, 2, 1, 4, 5, 2, 5]);
console.log(res);
function wave(str) {
let newStr = [];
for (let i = 0; i < str.length; i++) {
if (str[i] === " ") continue;
newStr.push(str.slice(0, i) + str[i].toUpperCase() + str.slice(i + 1));
}
return newStr;
}
console.log(wave("hello"));
function sumStr(a, b) {
const one = BigInt(a);
const two = BigInt(b);
let res = String(one + two);
return res;
}
console.log(sumStr("34", "5"));
// 60 - LAST