-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathmacTManAlgos.js
1840 lines (1444 loc) · 52.3 KB
/
macTManAlgos.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
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
872
873
874
875
876
877
878
879
880
881
882
883
884
885
886
887
888
889
890
891
892
893
894
895
896
897
898
899
900
901
902
903
904
905
906
907
908
909
910
911
912
913
914
915
916
917
918
919
920
921
922
923
924
925
926
927
928
929
930
931
932
933
934
935
936
937
938
939
940
941
942
943
944
945
946
947
948
949
950
951
952
953
954
955
956
957
958
959
960
961
962
963
964
965
966
967
968
969
970
971
972
973
974
975
976
977
978
979
980
981
982
983
984
985
986
987
988
989
990
991
992
993
994
995
996
997
998
999
1000
//_Testing--JS version...(GitHub Push 1)
//_Test-2--i.e., GitHub
//! Template 1 Starts Below:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//! Template 2 Starts Below:
//*----------------------Day Divider------------------------//
//*_Day X: [Month] DD, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Current Day's Challenge-List Preview; Alternate Between JS & Py, re: 2:1 Ratio Per Day:
/*
?2–[Add Details Here]
?3–[Add Details Here]
?4–[Add Details Here]
*/
//*_Algos & Jrl Self-Challenge 2022
//?_Algo here
//?_Cont'd
//?_Cont'd
//!-------Challenge-Number Divider--------//
//?_Algo here
//?_Cont'd
//?_Cont'd
//!-------Challenge-Number Divider--------//
//?_Algo here
//?_Cont'd
//?_Cont'd
//! Template Ends Below (Delete This Line):
//*----------------------Day Divider------------------------//
//*_First Day Of Challenge on Mac; Some Challenges Are Saved to PC directory and Py file.
//*_Day 5: June 21, 2022
//*_Algos & Jrl Self-Challenge 2022
//*_1)--Print all integers from 1 to 255
//*_Note to Prof. Alex: I'll explain what I mean later, but please note that I am very disappointed with myself, re: my performance on this simple challenge! :-(
// function printNums(){
// for (let i = 0; i <= 255; i++){
// console.log(i);
// }
// }
// console.log(printNums());
//!-------Challenge-Number Divider--------//
//*_2)--MinMaxAvg; given an array, write a function to return said array's "min," "max," and "average."
//*_Note to Prof. Alex: Ditto this challenge; again, details later.
// function minMaxAvg(arr) {
// var min = Infinity;
// var max = -Infinity;
// var sum = 0;
// for (let i = 0; i < arr.length; i++){
// sum = sum + arr[i];
// if (arr[i] < min){
// min = arr[i];
// }
// else if (arr[i] > max){
// max = arr[i];
// }
// }
// var avg = sum / arr.length;
// console.log ("Min: " + min + "; Max: " + max + "; Avg: " + avg+ ". All done! :-)");
// }
// minMaxAvg([1, 2, 3, 4, 5]);
//!3)--FAIL! :-| [/Angry Face Emoji]
//!_The goal is to do **THREE** algos total, per day. Unfortunately, I was so exhausted last night, I only ended at that last one--i.e., #-2, above! Mea culpa.
//*----------------------Day Divider------------------------//
//*_Day 6: June 22, 2022
//*_Algos & Jrl Self-Challenge 2022
//*--1)--Re-attempt of minMaxAvg;
//*--Notes: I was really disappointed in my performance with this algorithm yesterday, considering the fact that I have done it so many times before. And even now, I had to correct a mistake that was causing a bug, i.e., the proper placement of "var avg" and "console.log" in the right space between the last partition and the function-closing curly brace.
// function mma(arr){
// let min = Infinity;
// let max = -Infinity;
// let sum = 0;
// for (let i = 0; i < arr.length; i++){
// sum = sum + arr[i];
// if (arr[i] < min){
// min = arr[i];
// }
// else if (arr[i] > max){
// max = arr[i];
// }
// }
// var avg = sum / arr.length;
// console.log ("Hi! Please note that your min is " + min + ", and your max is " + max + ", and finally, your average is " + avg + "! :-) Good job!");
// }
// mma([1, 2, 3, 4, 5]);
//!-------Challenge-Number Divider--------//
//*--2)--New challenge; source of challenge and particular algorithm-answer: the "Leaflet" iOS app. Details of challenge/question: given a binary search tree and a number "n", return "true" if you can find two numbers in the tree that sum up to n.
//*--Notes--1: N/A ("No Comment")--as of 11:33 PM, first completion-attempt.
//*--Notes--2: After finishing the write-up of the given solution, I'm now stuck, v-z-v how to test it! :-| Challenge suspended for now, with self-awarded credit for the attempt (i.e., "grade" = PASS). I'm somewhat suspicious of this solution, but I'm not sure why.
// var findTarget = function(root, k){
// const helper = (root) => {
// if (!root){
// return;
// }
// helper(root.left);
// res.push(root.val);
// helper(root.right);
// }
// let res = [];
// helper(root);
// let left = 0;
// let right = res.length - 1;
// while (left < right){
// let target = res[left] + res[right];
// return true;
// }
// if (target < k){
// letf++;
// } else {
// right--;
// }
// return false;
// };
//console.log(findTarget_//!_(Not sure what or how to put said what, here, to test the algo!))
//!-------Challenge-Number Divider--------//
// function waveSort(arr) {
// arr = arr.sort(function (a, b) {
// return a - b;
// });
// for (var i = 1; i < arr.length; i += 2) {
// if (arr[i - 1] < arr[i]) {
// var temp = arr[i];
// arr[i] = arr[i - 1];
// arr[i - 1] = temp;
// }
// if (i + 1 < arr.length && arr[i + 1] < arr[i]) {
// temp = arr[i];
// arr[i] = arr[i + 1];
// arr[i + 1] = temp;
// }
// }
// return arr;
// }
// var waved = waveSort([1, 2, 3, 5, 6, 7]);
// console.log(JSON.stringify(waved));
//*----------------------Day Divider------------------------//
//*_Day 7: June 23, 2022
//*_Algos & Jrl Self-Challenge 2022
//*--1)--"Mean, Median and Mode";
//*--Notes: Question and answer source: CoderByte Bootcamp- & Job-Interview Prep
//*--For actual text of answer-attempt, please look at the relevant entry in this directory/folder's Python (`mcaTManAlgos...`) file.
//!-------Challenge-Number Divider--------//
//*--2)--"Implement Map and Filter--Part 1: Map";
//*--Notes: Question and answer source: CoderByte Bootcamp- & Job-Interview Prep
//*--11:58 PM: Unfortunately, the solution isn't working the way it's supposed to; instead of returning [1, 4, 9, 16] and [100, 200, 300, 400] respectively for fn(s) "square" and "addZeros", I get the following result:
//?_Line 1 of result = [2,1,5,3,7,6]
//?_Line 2 of result = [Function: map]
//*--Notes conclusion: I guess I just have to do another tactical retreat! **Shrugs**
// function map(arr, fn) {
// let result = [];
// //Apply the function to each element and store the result
// for (let i of arr) {
// let applied = fn(i);
// result.push(applied);
// }
// return result;
// //Usage
// let square = (x) => x * x;
// let addZeros = (x) => parseInt((x += "00"));
// map([1, 2, 3, 4], square);
// map([1, 2, 3, 4], addZeros);
// }
// console.log(map);
//!-------Challenge-Number Divider--------//
//*--3)--"Implement Map and Filter--Part 2: Filter";
//*--Notes: Question and answer source: CoderByte Bootcamp- & Job-Interview Prep
//?_Incomplete! (Bad Seif!)
//!-------Challenge-Number Divider--------//
//*----------------------Day Divider------------------------//
//*_Day 8: June 24, 2022
//*_Algos & Jrl Self-Challenge 2022
//?_Please Note: This day's challenges have been done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//*----------------------Day Divider------------------------//
//*_Day 9: June 25, 2022
//*_Algos & Jrl Self-Challenge 2022
//?_Please Note: This day's challenges have been done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//*----------------------Day Divider------------------------//
//*_Day 11: June 27, 2022
//*_Algos & Jrl Self-Challenge 2022
//*--1)--"Find Majority Element (Appearing More Than n/2 times)";
//*--Note 1: Question source: https://afteracademy.com/problems/merge-two-sorted-lists
//*--Note 2: Answer source: https://towardsdev.com/how-to-solve-min-stack-optimally-with-javascript-eb81a7ae3bb5
//*--Note 3: Code testing suspended till tomorrow.
// function last(stack){
// return stack[stack.length - 1]
// }
// class minStack {
// constructor(){
// this.stack = []
// this.minStack = []
// }
// push(x){
// if(this.minStack.length === 0 || x <= last(this.minStack)){
// this.minStack.push(x)
// }
// this.stack.push(x)
// }
// pop(){
// if(last(this.minStack) === last(this.stack)){
// this.minStack.pop()
// }
// return this.stack.pop()
// }
// top(){
// return last(this.stack)
// }
// getMin(){
// return last(this.minStack)
// }
// }
//!-------Challenge-Number Divider--------//
//*--2)--"Merge Two Sorted Lists";
//*--Note 1: Question source: https://afteracademy.com/problems/merge-two-sorted-lists
//*--Note 2: Answer source: Talhadev; https://www.codegrepper.com/profile/talha-bin-khalil
//*--Note 3: Code testing suspended till tomorrow.
// let arrOne = [0, 3, 4, 31];
// let arrTwo = [4, 6, 30, 31, 33];
// let j = 0;
// let k = 0;
// let mergedArray = [];
// let length = arrOne.length + arrTwo.length;
// console.log(lenght)
// for(let i = 0; i <= length - 1; i++){
// if(arrOne[j] < arrTwo[k]){
// mergedArray.push(arrOne[j]);
// j++;
// }
// else if (arrOne[j] > arrTwo[k]){
// mergedArray.push(arrTwo[k]);
// k++;
// }
// else if (arrOne[j] == arrTwo[k]){
// mergedArray.push(arrOne[j]);
// mergedArray.push(arrTwo[k]);
// j++;
// k++;
// }
// }
// console.log(mergedArray);
//!-------Challenge-Number Divider--------//
//*--3)--"Find the Majority Element (Which Appears < n/2 Times)";
//*--Note 1: Question and answer source: CoderByte Bootcamp- & Job-Interview Prep
//*--Note 2: Code testing suspended till tomorrow.
// function majorityElement(arr){
// let candidate = null;
// var count = 0;
// for (let i = 0; i < arr.length; i++){
// if(candidate === null || count === 0){
// candidate = arr[i];
// count = 1;
// } else if (arr[i === candidate){
// count += 1;
// } else {
// count -= 1;
// }
// }
// count = 0;
// for (let el of arr){
// if (el === candidate){
// count += 1;
// }
// }
// return (count > Math.floor(arr.length / 2)) ? candidate : null;
// }
//*----------------------Day Divider------------------------//
//*_Day 12: June 28, 2022
//*_Algos & Jrl Self-Challenge 2022
//!--1)--"Sorted Array to Balanced BST";
//*--Note 1: Answer source: https://www.geeksforgeeks.org/sorted-array-to-balanced-bst/
//*--Note 2: Code testing suspended.
// class Node
// {
// constructor(d)
// {
// this.data = d;
// this.left = null;
// this.right = null;
// }
// }
// var root = null;
// function sortedArraytoBST(arr, start, end)
// {
// if (start > end)
// {
// return null;
// }
// var mid = parseInt((start + end) / 2);
// var node = new Node(arr[mid]);
// node.left = sortedArraytoBST(arr, start, mid - 1);
// node.right = sortedArraytoBST(arr, mid + 1, end);
// return node;
// }
// function preOrder(node)
// {
// if (none == null)
// {
// return;
// }
// document.write(node.data + " ");
// preOrder(node.left);
// preOrder(node.right);
// }
// var arr = [1, 2, 3, 4, 5, 6, 7];
// var n = arr.length;
// root = sortedArraytoBST(arr, 0, n - 1);
// document.write("Preorder traversal of constructed BST<br>");
// preOrder(root);
//*----------------------Day Divider------------------------//
//*_Day 13: June 29, 2022//*_Algos & Jrl Self-Challenge 2022
//!_Challenge-1 Placeholder:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//!-------Challenge-Number Divider--------//
//!_Challenge-2 Placeholder:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//!-------Challenge-Number Divider--------//
//!_Challenge-3 Placeholder:
//!_Challenge-3 Note: Answer-Source: https://towardsdev.com/how-to-solve-min-stack-optimally-with-javascript-eb81a7ae3bb5.
// function last(stack){
// return stack[stack.length - 1]
// }
// class minStack {
// constructor(){
// this.stack = []
// this.minStack = []
// }
// }
// push(x){
// if (this.minStack.length === 0 || x <= last(this.minStack)){
// this.minStack.push(x)
// }
// this.stack.push(x)
// }
// pop(){
// if(last(this.minStack) === last(this.stack)){
// this.minStack.pop()
// }
// return this.stack.pop()
// }
// top(){
// return last(this.stack)
// }
// getMin(){
// return last(this.minStack)
// }
//*----------------------Day Divider------------------------//
//*_Day 14: June 30, 2022//*_Algos & Jrl Self-Challenge 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Current Day's Challenge-List Preview; Alternate Between JS & Py, re: 2:1 Ratio Per Day:
/*
?2–Calculate power function--JS
?3–Wave Array--JS
?4–Move zeros to an end--Py
*/
//!_Challenge-1:
//!_Challege-1 Note 1: For some reason, running the code below in the terminal returns "Infinity"! :-(
//!_Challenge-1 Note 2; Answer Src: https://www.geeksforgeeks.org/write-a-c-program-to-calculate-powxn/
// function power(x, y)
// {
// var temp;
// if (y == 0)
// return 1;
// temp = power(x, y/2);
// if (y % 2 == 0)
// return temp*temp;
// else
// return x*temp*temp;
// }
// console.log(power(5, 2));
//!-------Challenge-Number Divider--------//
//!_Challenge-2:
//!_Challenge-2 Note 1: "Whoo-hoo!" I just tested this particular challenge, and it works! :-)
//!_Challenge-2 Note 2; Answer Src: https://www.geeksforgeeks.org/sort-array-wave-form-2/
// function swap(arr, x, y){
// let temp = arr[x];
// arr[x] = arr[y];
// arr[y] = temp;
// }
// function sortInWave(arr, n){
// arr.sort((a, b) => a - b);
// for (let i = 0; i < n - 1; i += 2)
// swap (arr, i, i + 1);
// }
// arr = [10, 90, 49, 2, 1, 5, 23];
// let n = arr.length;
// sortInWave(arr, n);
// for(let i = 0; i < n; i++)
// console.log(arr[i] + " ");
//!-------Challenge-Number Divider--------//
//!_Challenge-3 Placeholder:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//*----------------------Day Divider------------------------//
//*_Day 15: July 1, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Current Day's Challenge-List Preview; Alternate Between JS & Py, re: 2:1 Ratio Per Day:
/*
?–Swapping Nodes In A Linked List Without Swapping Data--JS
?–Find first and last positions of an element in a sorted array--Py
*/
//!_Challenge-1:
//!_Challenge-1 note-1, July 1: https://www.geeksforgeeks.org/javascript-program-for-swapping-nodes-in-a-linked-list-without-swapping-data/.
//!_Challenge-1 note-2, ``: Because of the adjustments I had to make--especially, re: trying to properly get the program to work via "console.log" vs. the "document.write" that the author(s) use(s) on the site shared above, unfortunately, the code below isn't working when I test it here: https://jsfiddle.net/.
// class Node {
// constructor(val){
// this.data = val;
// this.next = null;
// }
// }
// var head = null;
// var tail = null;
// function addNote(data){
// var newNode = new Node(data);
// if (head === null){
// head = newNode;
// tail = newNode;
// }
// else {
// tail.next = newNode;
// tail = newNode;
// }
// }
// function swap(n1, n2){
// var prevNode1 = null;
// var prevNode2 = null;
// node1 = head, node2 = head;
// if (head == null){
// return;
// }
// if (n1 == n2);
// return;
// while (node1 != null && node1.data != n1){
// prevNode1 = node1;
// node1 = node1.next;
// }
// while(node2 != null && node2.data != n2){
// prevNode2 = node2;
// node2 = node2.next;
// }
// if (node1 != null && node2 != null){
// if (prevNode1 != null)
// prevNode1.next = node2;
// else
// head = node1;
// var temp = node1.next;
// node1.next = node2.next;
// node2.next = temp;
// }
// else {
// console.log("Sorry, no can't do! :-(")
// return;
// }
// while (current != null){
// console.log(current.data + " ");
// current = current.next;
// }
// return;
// }
// node1 = 1;
// node2 = 2
// node3 = 3;
// node4 = 4;
// node5 = 5;
// node6 = 6;
// console.log();
// display();
// swap(6, 1)
// console.log();
// display();
//!-------Challenge-Number Divider--------//
//!_Challenge-2 Placeholder:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//*----------------------Day Divider------------------------//
//*_Day 16: June 4, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Current Day's Challenge-List Preview; Alternate Between JS & Py, re: 2:1 Ratio Per Day:
/*
?2–0--Not on my list, but added ad-hoc iteration vs. recursion and time-complexity learning: Fibonacci algorithm using both iterative and recursive solutions. To be done later. Source: https://medium.com/quick-code/fibonacci-sequence-javascript-interview-question-iterative-and-recursive-solutions-6a0346d24053
?_1--Merge Two Sorted Lists; You are given two sorted lists having head as head1 and head2 , write a program to merge them into one big sorted list
?_2-xx
?_3–xx
*/
//*_Algos & Jrl Self-Challenge 2022
//!_Challenge 1:
//!_Note: Note tested as of 11:42 PM, completion time.
// function sortedMerge(a, b){
// let result = null;
// }
// let lastPtrRef = result;
// while (1){
// if (a == null){
// lastPtrRef = b;
// break;
// }
// else if (b == null){
// lastPtrRef = a;
// break;
// }
// if (a.data <= b.data){
// moveNode(lastPtrRef, a);
// } else {
// moveNode(lastPtrRef, b);
// }
// lastPtrRef = ((lastPtrRef).next);
// }
// return (result);
//!-------Challenge-Number Divider--------//
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//!-------Challenge-Number Divider--------//
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//*----------------------Day Divider------------------------//
//*_Day 17: July 5, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Current Day's Challenge-List Preview; Alternate Between JS & Py, re: 2:1 Ratio Per Day:
/*
?2--Merge two binary tree (#-12 on "Easy List")--JS;
?3--Sorted Array To Balanced BST (#-13 '')--JS;
?4--Minimum absolute difference in BST (#-14 '')--Py.
*/
//*_Algos & Jrl Self-Challenge 2022
//!_Challenge 1: Given two binary trees and imagine that when you put one of them to cover the other, some nodes of the two trees are overlapped while the others are not. Write a program to merge them into a new binary tree.
//!_Testing Suspended.
// var mergeTrees = function(t1, t2){
// if (t1 === null)
// return t2;
// if (t2 === null)
// return t1;
// t1.val += t2.val;
// t1.left = mergeTrees(t1.left, t2.left);
// t1.right = mergeTrees(t1.right, t2.right);
// return t1;
// }
// console.log(mergeTrees(t1, t2));
//!-------Challenge-Number Divider--------//
//!_Challenge 2: Given an array, arr[] having all the elements sorted in ascending order, write a program to convert it to a height balanced BST.
//!_Testing Suspended.
// var sortedArr = function(nums){
// if (nums.length === 0) retun null;
// let middle = Math.floor(nums.length / 2);
// let root = new TreeNode(nums[middle]);
// root.left = sortedArr(nums(0, middle));
// root.right = sortedArr(nums.slice(middle + 1));
// return root;
// }
//!-------Challenge-Number Divider--------//
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//*----------------------Day Divider------------------------//
//*_Day 18: July 7, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//*_Another note: for today, I will split the current challenges' write up over two days.
//!_Current Day's Challenge-List Preview; Alternate Between JS & Py, re: 2:1 Ratio Per Day:
//?_15–Lowest Common Ancestor of a BST--Py
//?_16–Check if two arrays are equal or not--JS
//?_17–First Unique Character in a String--Py
//!_Challenge 1:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//!-------Challenge-Number Divider--------//
//!_Challenge 2:
// function areEqual(arr1, arr2){
// let n = arr1.length;
// let m = arr2.length;
// }
// if (n != m)
// return false;
// let map
// = new Map();
// let count = 0;
// for (let i = 0; i < n; i++){
// if (map.get(arr1[i]) == null)
// map.set(arr1[i], 1)
// else {
// count = map.get(arr1[i]);
// count++;
// map.set(arr1[i], count);
// }
// }
// for (let i = 0; i < n; i++){
// if (map.get(arr2[i] == 0))
// return false;
// count = map.get(arr2[i]);
// --count;
// map.set(arr2[i], count);
// }
// return true;
// let arr1 = [3, 5, 2, 5, 2];
// let arr2 = [2, 3, 5, 5, 2];
// if (areEqual(arr1, arr2))
// document.write("Yes");
// else
// document.write("No");
//!-------Challenge-Number Divider--------//
//!_Challenge 3:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//*----------------------Day Divider------------------------//
//*_Day 19: July 8, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//*_Another note: concluding yesterday's challenges.
//!_Current Day's Challenge-List Preview; Alternate Between JS & Py, re: 2:1 Ratio Per Day:
//?_15–Lowest Common Ancestor of a BST--Py
//?_16–Check if two arrays are equal or not--JS
//?_17–First Unique Character in a String--Py
//!_Challenge 1:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein.
//!-------Challenge-Number Divider--------//
//!_Challenge 2:
//?_Done Yesterday.
//!-------Challenge-Number Divider--------//
//!_Challenge 3:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein. Done yesterday.
//*----------------------Day Divider------------------------//
//*_Day 20 & 21 Combined: July 11 and July 12, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
/*
?_18–Climbing Stairs Problem.
?_19–Distribute Candy Problem.
*/
//!_Challenge 1:
// var climbStairs = function(n){
// if(n == 1 || n == 0) return 1
// let first = 1;
// let second = 2;
// for (let i = 3; i <= n; i++){
// let third = first + second
// first = second;
// second = third;
// }
// return second;
// };
// console.log(climbStairs(10));
//!-------Challenge-Number Divider--------//
//!_Number 2:
//?_Please Note: (Some or all) challenge(s) done via current (Algorithms-And-DS-main) directory's Python file; refer to relevant (day's) entry therein. Done yesterday.
//*----------------------Day Divider------------------------//
//*_Day 34: July 22, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Challenge 1:
/*
?_Min, Max, & Avg.
?_Testing (of solution[s] suspended.)
*/
// let myArr = [];
// var min = -Infinity;
// var max = Infinity;
// let sum = 0;
// for (let i = 0; i < myArr.length; i++){
// sum = 0 + arr[i];
// if (arr[i] > max){
// max = arr[i];
// }
// if (arr[i] < min){
// min = arr[i];
// }
// avg = sum / myArr.length;
// }
// console.log("Min is : " + min);
// console.log("Max is : " + max);
// console.log("Average is : " + avg);
//*----------------------Day Divider------------------------//
//*_Day 35: July 23, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Challenge 1:
//?"Min, Max, & Avg" Algo:
//?_Unfortunately, the algo isn't working! But I'll have to move on for now.
//_?_Could some1 plz help T-man run this via VSCode or somethin'?! :|
// function minMaxAvg ([arr]){
// let arr = [];
// var min = Infinity;
// var max = -Infinity;
// var sum = 0;
// for (let arr[i] = 0; arr[i] < arr.length; i++){
// sum = sum + arr[i];
// if (arr[i] < min){
// min = arr[i];
// }
// if (arr[i] > max){
// max = arr[i];
// }
// let avg = sum / arr.length;
// return ("[Using British Accent: ] Ola! :-) Please note madam/sire, that min = ; " + min + " and guess what [?!], max = " + max + " and finally, avg = " + avg " ! Thanks, and have a lovely day!")
// }
// }
// console.log(minMaxAvg([1, 2, 3]));
//*----------------------Day Divider------------------------//
//*_Day 36: July 24, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Challenge 1:
//!_Also Review Corresponding Challenge in Python File.
//!_Test Successful.
//?_Just Print Something. :-(
//? console.log("Hi. Have a great day!");
//*----------------------Day Divider------------------------//
//*_Day 37 & 38: Jul 25 & 26, 2022
//!_Please note: these days' challenges are in Py file. "'See you' tomorrow! :-)"
//*----------------------Day Divider------------------------//
//*_Day 39: July 27, 2022
//*(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//!_Challenge 1:
// for (let i = 1; i <= 255; i++){
// console.log(i);
// }
//!_Challenge 2:
//!_Source: Grepper
// var myArray = [];
// for (var i = 1; i <= 5; i++){
// myArray.push(i);
// }
// console.log(myArray) // console output [ 1, 2, 3, 4, 5 ]
//!_Challenge 3:
//!_Note: This is very frustrating, still being unable to do this after 100s or 1000s of practice.
// let myArray = [1, 2, 3, 4, 5];
// function minMaxEtc(myArray){
// var min = myArray[0];
// var max = myArray[0];
// var avg = 0;
// for (let i = 0; i < myArray.length; i++){
// if (myArray[i] < min) min = myArray[i];
// if (myArray[i] > max) max = myArray[i];
// avg += myArray[i];
// }
// avg /= myArray.length;
// }
// console.log("Min is : " + min);
// console.log("Max is : " + max);
// console.log("Average is : " + avg);
// minMaxEtc([1, 2, 3, 4, 5]);
//*----------------------Day Divider------------------------//
//*_Day 40: Jul 28, 2022
//!_Please note: these days' challenges are in Py file. "'See you' tomorrow! :-)"
//*----------------------Day Divider------------------------//
//*_Day 41: July 29, 2022
//*_(Important Note[!!!]: Pay Attn to the Solution-Options' Complexity Analyses!)
//*_Note: Requirement of three total algos suspended; only 1 required today.
//!_Challenge 1: "Min, Max, Avg"; Solution-Testing To Be Implemented
//!_Note: Requirement of three total algos suspended; only 1 required today.
//!_Challenge 1 Note: Test failed.
// function minMaxAvg(arr){
// var min = Infinity;
// var max = -Infinity;
// var sum = 0;
// for (var i = 0; i < arr.length; i++){
// sum = sum + arr[i];
// if (arr[i] > max){
// max = arr[i];
// }
// else if (arr[i] < min){
// min = arr[i];
// }
// }
// var avg = sum / arr.length;
// console.log ("Hi! Please note that your min is " + min + " ; your max is " + max + " ; and finally, your avg is " + avg + " . Have a great day!")
// }
// minMaxAvg([1, 2, 3, 4, 5]);
//*----------------------Day Divider------------------------//
//*_Day 42: Jul 30, 2022
//!_Please note: these days' challenges are in Py file. "'See you' tomorrow! :-)"
//*----------------------Day Divider------------------------//
//*_Day 48: Aug 4, 2022
//*_Note: Testing briefly suspended today, and the same measure will be used on an ad-hoc basis in the future.
//!_Challenge 1: Implement Map & Filter.
// function map(arr, fn){
// let result = [];
// for (let i of arr){
// let applied = fn(i);
// result.push(applied);
// }
// return result;
// }
// let square = (x) => x * x;
// let addZeros = (x) => parseInt(x += '00')
// map ([1, 2, 3, 4], square);
// map ([1, 2, 3, 4], addZeros);
//!-------Challenge-Number Divider--------//
//!_Challenge 2: Switching Light Bulbs.
// function lightBulbs(N){
// let lightBulbs = [];
// for (let i = 0; i < N; i++){
// lightBulbs.push(false);
// }
// for (let i = 1; i <= N; i++){
// let w = 1;
// let k = w * i;
// while (k <= N){
// lightBulbs[k - 1] = !lightBulbs[k - 1];
// w += 1;
// k = w * i;
// }
// }
// return lightBulbs;
// }
//!-------Challenge-Number Divider--------//
//!_Challenge 3: Convert Array of Strings Into An Object
// function convert(string){
// //?_Create empty object: