| nvm install --lts |
| /** | |
| * Interivew Tips: | |
| * | |
| * - Write examples and clarify the question | |
| * - Ask questions that unearth the actual problem the interviewer wants you to solve. | |
| * - Come up with solutions and explain them to the interviewer. | |
| * - Once the interviewer seems to settle on one, write down simple steps, not more than a few lines. | |
| * - Doing this makes it clear (to both of you) what you will code for the rest of the interview. | |
| * - Write down test cases, when an interviewer sees you do this, they know you are legit. | |
| * - Make liberal use of helper functions. |
Write a function that takes in the heads of two Singly Linked Lists that are in sorted order, respectively. The function should merge the lists in place (i.e., it shouldn't create a brand new list) and return the head of the merged list; the merged list should be in sorted order.
Each LinkedList node has an integer value as well as a next node pointing to the next node in the list or to null if it's the tail of the list.
The main purpose of this lecture is to identify moments in problems that will lead us to decide on these data types/data structures as useful approaches in interviewing problems.
Given an array arr consisting of N integers, sorted in ascending order (least to greatest), and a separate number (a sum), determine if any 2 numbers in the array add up to the sum. Return true if any 2 different numbers within the array add up to sum. Return false if no 2 numbers in the array add up to sum.
Given an string str, create a function that returns a boolean, corresponding to whether that string is a palindrome (spelled the same backwards and forwards). Our palindrome check should be case-insensitive.
isPal('car') => false
isPal('racecar') => true
It's how we compare the efficiency of different approaches to a problem.
With big O notation we express the runtime in terms of how quickly it grows relative to the input, as the input gets large.
how quickly the runtime grows—It's hard to pin down the exact runtime of an algorithm. It depends on the speed of the processor, what else the computer is running, etc. So instead of talking about the runtime directly, we use big O notation to talk about how quickly the runtime grows.
relative to the input—If we were measuring our runtime directly, we could express our speed in seconds. Since we're measuring how quickly our runtime grows, we use the size of the input, which we call "n." So we can say things like the runtime grows "on the order of the size of the input" (O(n) or "on the order of the square of the size of the input" (O(n2).
When you create an event handler, you need to associate it with an element in the DOM. For example, the user may click a button. You then register an event handler on the button to run when the button's click event fires.
The mechanism that detects the event is called an event listener. An event listener contains an event name and an event handler. When the event fires, the event handler is executed.
const firstBtn = document.querySelector("button");
MongoDB is the most popular non-relational database in use today. It is a document-oriented database that can store data in the form of documents, which are similar to objects in javascript. Instead of tables in SQL, we have collections. Instead of columns in SQL, we have keys. Instead of rows in SQL, we have documents.
NoSQL databases like MongoDB are inherently more flexible than SQL databases as they do not need to follow a model. While a SQL table can only contain rows that conform to the specific schema of columns, collections in a NoSQL database