| #!/usr/bin/env node | |
| const NKEYS = 4; | |
| function arrayOfSize(size) { | |
| var a = Array(size); | |
| for (var i = 0; i < size; i += 1) | |
| a[i] = null; |
A curated collection of awesome & free JavaScript books to help you learn the JavaScript programming language.
If you know of any other free JavaScript books that you think should be on this list, please let me know in the comments section and I will get them added.
| #include <iostream> | |
| int subsequence(int arr[], int length) | |
| { | |
| // counter the number of Subsequences | |
| int counter = 0; | |
| for (size_t i = 0; i < length; i++) | |
| { |
| // list node constructor | |
| function ListNode(val) { | |
| this.next = null; | |
| this.value = val; | |
| } | |
| const MyLinkedList = function () { | |
| this.head = null; // the head of the linked lsit | |
| this.size = 0; // use the size to have addtional useful validation |
| function deepEquals(value1, value2) { | |
| if(typeof value1 !== typeof value2) return false; | |
| if(value1 === value2) return true; | |
| if (typeof value1 !== "object" && typeof value2 !== "object") { | |
| // NaN type validation; | |
| const [isValue1NaN, isValue2NaN] = [...arguments].map((value) => Number.isNaN(value) && typeof value === "number"); | |
| if (isValue1NaN && isValue2NaN) return true; |
| class TreeNode { | |
| constructor(value) { | |
| this.value = value; | |
| this.left = null; | |
| this.right = null; | |
| } | |
| } | |
| class BainaryTree { | |
| constructor(root) { |