The problems read as follows, for contains duplicates:

Given an integer array `nums`

, return `true`

if any value appears **at least twice** in the array, and return `false`

if every element is distinct.

**Example 1:**

**Input:** nums = [1,2,3,1]

**Output:** true

**Example 2:**

**Input:** nums = [1,2,3,4]

**Output:** false

**Example 3:**

**Input:** nums = [1,1,1,3,3,4,3,2,4,2]

**Output:** true

**Constraints:**

`1 <= nums.length <= 105`

`-109 <= nums[i] <= 109`

And for remove duplicates:

Given a sorted array (nums), remove the duplicates **in-place** such that each element appears only *once* and returns the new length.

You are given an array `prices`

where `prices[i]`

is the price of a given stock on the `ith`

day.

Find the maximum profit you can achieve. You may complete **as many transactions as you like** (i.e., buy one and sell one share of the stock multiple times).

**Note:** You may not engage in multiple transactions simultaneously (i.e., you must sell the stock before you buy again).

**Example 1:**

**Input:** prices = [7,1,5,3,6,4]

**Output:** 7

**Explanation:** Buy on day 2 (price = 1) and sell on day 3 (price = 5), profit = 5-1 = 4. …

Our problem is asking us to return the largest possible integer after adding a 5 among the digits. For example, when given the number 268 our expected output is 5268, and when given 670 we are expected to return 6750. When given 0 our output is 50, when given a negative number like -999 our output is expected to -5999.

In order for us to solve this problem, we must first plan where and why we will place our 5. In order for us to have the largest possible integer, we must look at the first integer. If the first…

The missing integer problem asks for the return of the smallest positive integer (greater than 0) that does not occur in the given array. For example, given A = [1, 3, 6, 4, 1, 2], the function should return 5. Given A = [1, 2, 3], the function should return 4. Given A = [−1, −3], the function should return 1.

To start we set a variable for our smallest number.

`let min = 1`

We set the minimum to 1 because the problem stats greater than 0. Next, we can sort our array from lowest to highest.

`A.sort(function(a,b){a …`

A linked list is a sequence of data structures connected through links. This means that each element in the linked list points to the next element. Linked lists are the second most used after arrays. Here are terms commonly used with a linked list.

**Link**− Each link of a linked list can store data called an element.**Next**− Each link of a linked list contains a link to the next link called Next.**LinkedList**− A Linked List contains the connection link to the first link called First.

Here is an illustration of a linked list.

- Linked List…

The “Min-Max” problem description is as follows when given an array A the length N, we must find the sum of the minimum and maximum elements in the array. It is also asked that we make the least amount of comparisons as necessary.

Our input format is the only argument, our array, and our expected output is an integer denoting the sum Maximum and Minimum element in the given array.

Here are some examples of input.

// First input exampleA = [-2, 1, -4, 5, 3]// Second input exampleA = [1, 3, 4, 1]

Here are their…

Stacks are a useful data structure that holds a list of elements. A stack works in a “last in”, “first out” principle meaning that the most recently added element is the first one to remove. The stack has two main methods that we use, .push() and .pop().

const reverse = (str) => {

let stack = [];// push letter into stackfor (let i = 0; i < str.length; i++) {

stack.push(str[i]);

}// pop letter from the stacklet reverseStr = ''; while (stack.length > 0) {

reverseStr += stack.pop();

}

return reverseStr;

} console.log(reverse('JavaScript Stack'));//kcatS tpircSavaJ

…

Big O notation is a mathematical notation that describes the limiting behavior of a function when the argument tends towards a particular value or infinity. In computer science, big O notation is used to classify algorithms according to how their run time or space requirements grow as the input size grows. In analytic number theory, big O notation is often used to express a bound on the difference between an arithmetical function and a better-understood approximation; a famous example of such a difference is the remainder term in the prime number theorem. …

Pseudo Classes

Anchor Pseudo-classes

Hover on <div>

Matching First Child Elements

Pseudo-classes are used in order to define a specific state of an element. Examples for uses of pseudo-classes are as follows: styling a specific element with a mover hover, or whether a link was visited or not, as well as when an element is focused on. The syntax for a pseudo-class is as follows:

`selector:pseudo-class {`

property: value;

}

Anchor pseudo-classes are specifically for links and the syntax is as follows:

`/* unvisited link */`

a:link {

color: #FF0000;

}

/* visited link */

a:visited {

color: #00FF00;

}

/* mouse over link…

Intro:

This is a part 2, if you want to see part 1 here is the link and come back :). https://medium.com/@mjhorowitz714/understanding-css-part-1-62d6aba3ce42

How to insert your CSS:

There are three ways you can attach CSS to your application. The first is inline CSS, internal CSS, and external CSS.

Inline CSS:

An inline style can be used to target and style a specific element in your HTML. In order to use inline styling, add the “style” attribute to the element.

`<h1 style="color:blue;text-align:center;">This is a heading</h1>`

<p style="color:red;">This is a paragraph.</p>

Now, using inline styling is very tedious, because you have to…