Given a multi-dimensional array containing only primitive data types (strings, booleans, and numbers), write a function that returns whether EACH element within each subarray belongs to the same data type. for example: function checkTypes(arr) { // Code here } const multiD1 = [[1,2,3],["a","b","c"],[true, true, true]] checkTypes(multiD1)
Warm-Up An IP address is a numerical label assigned to each device (e.g., computer, printer) participating in a computer network that uses the Internet Protocol for communication. There are two versions of the Internet protocol, and thus two versions of addresses. One of them is the IPv4 address. IPv4
Warm-Up Given a positive integer n write a function that returns how many unique factors it has. If it only has two (n itself and 1) return "prime". example: factorCount(4); //returns 3 (1, 2, and 4 are factors of 4) factorCount(3); //returns "prime"
Warm up Write a function that returns a 10 X 10 multiplication table (2D array). For example: multTable(); // Output: // [ // [1,2,3,4,5...], // [2,4,6,8,10...], // [3,6,9,12,15...], // ... // ] BONUS: Allow for the function to take a parameter n and return a table with n
We left off last time with the realization that our word-finding algorithm was too slow for large inputs. We can improve its performance by minimizing the number of page turns required to find a word. Amazingly, using binary search we can reduce the runtime from O(n) to O(logN)