Startup School Module 1: Starting a Startup Why to Not not Start a Startup: Combating Founder Doubts Before the Startup: Counterintuitive Points If you trust your instincts, you’ll make a lot of mistakes. Its not important to be an expert on startups. Do not try to game the system. It won’t work in the startup world. Startups are all-consuming. You have to be prepared to work on them for years. The only way to find out if you can do a startup is to try to do one....

Arrays are a data structure used to store a collection of elements of the same type. They are stored in memory continuously. This means that all the elements of the array can be found sequentially in memory. Arrays in RAM Array elements are stored sequentially in memory. The memory address of the first element of the array is used to access the entire array. The size of the data between each element in the array is determined by the size of the data type of the elements....

Empty Commits You can create an Git commit without any changes by adding the --allow-empty flag to the commit command. It should look like the following command: git commit --allow-empty -m "Commit message" Use Cases Empty commits can be useful for a variety of reasons, such as: Triggering a CI/CD pipeline Marking a point in time Adding a commit message to a branch

Problem https://leetcode.com/problems/two-sum/ Given an array of integers nums and an integer target, return indices of the two numbers such that they add up to target. You may assume that each input would have exactly one solution, and you may not use the same element twice. You can return the answer in any order. Examples Example 1: Input: nums = [2,7,11,15], target = 9 Output: [0,1] Explanation: Because nums[0] + nums[1] == 9, we return [0, 1]....

In Place Algorithms In place algorithms are algorithms that are executed without needing extra memory. They will modify the input data directly and work within the same memory space. In place algorithms can use a amount of extra memory and still be considered in place. As long as the output is stored in the same memory space as the input, the algorithm is considered in place. Algorithms that don’t modify the input data directly and require extra memory are considered out of place or not in place....

Stable Sorting Algorithms Stable sorting algorithms are algorithms that maintain the relative order of equally valued elements in its sorted output. This means that if two elements are equal in value, the element that appears first in the original list will appear first in the sorted list. Use Case One use case when sorting a list of objects by multiple keys. If the list is sorted by one key and then sorted by another key, the relative order of the first key will be maintained in the second sort....

Merge Sort Merge Sort is a divide-and-conquer algorithm that divides the input list into two halves, recursively sorts the halves, and then merges the sorted halves. This algorithm is efficient for larger lists and is a stable sorting algorithm that guarantees $O(n \log n)$ time complexity. Key Points Time Complexity: $O(n \log n)$ Space Complexity: $O(n)$ Process: Divide: The input list is divided into two halves Conquer: The two halves are recursively sorted Merge: The sorted halves are merged back together in sorted order Features:...