Big-O Notation and Time Complexity

Memory

Space Complexity

Algorithm Analysis

Arrays

Strings

Linked Lists

Hash Maps

You have an array, <code>prices</code>, in which the ith element represents the price of stock on day i. 

Find the maximum profit if you can perform at most one transaction and you must buy the stock before selling.


Example 1:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: [8,1,4,2,8,9]
Output: 8
Explanation: Buy on day 1 (price 1), and sell on day 5 (price 9). maximum profit = 9 - 1 = 8.
</pre>

 

Example 2:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: [10,9, 8, 7]
Output: 0
Explanation: No transaction is done. maximum profit = 0.
</pre>

Maximize Profits In The Stock Market

Given an array of integers, return the index such that the sum of the integers on the left is equal to the sum of the integers on the right. If no index exists, return -1. If there are multiple indexes that exist, return the left-most one.
Example 1:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: 
nums = [1, 7, 3, 6, 5, 6]
Output: 3
Explanation: 
The sum of the integers on the left of index 3 is equal to the sum of integers on the right of index 3.
</pre>
&nbsp;
Example 2:
<pre style="white-space: pre-wrap; word-break: keep-all;">Input: 
nums = [1, 2, 3]
Output: -1
Explanation: 
No index exists that can satisfy the problem statement.</pre>
&nbsp;
Note:
<ul>
<li>The size of the given array is in the&nbsp;range <code>[0, 10000]</code>.</li>
<li>Each integer element in the array is in the range&nbsp;<code>[-1000, 1000]</code>.</li>
</ul>
&nbsp;

Find Pivot Index

First Non Repeating Character

Maximum Absolute Difference In Arrays

Max Product Of Three

Normal Word

Given an array of numbers and a target value, return the indices of two numbers that add up to the target value. You can assume there is always only one correct answer in the given array.
&nbsp;
Example:
<pre style="white-space: pre-wrap; word-break: keep-all;">Given nums = [2, 7, 11, 15], target = 9,
Because nums[0] + nums[1] = 2 + 7 = 9,
return [0, 1].
</pre>
&nbsp;

2sum

Bold String

Given 2 non-empty linked lists that represent non-negative integers, add the two numbers and return it as a linked list in reverse order. 

Note: The 2 given linked lists are in reverse order and each linked list node can only store one digit.

Example:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: (1 -&gt; 2 -&gt; 3) + (4 -&gt; 5 -&gt; 6)
Output: 5 -&gt; 7 -&gt; 9
Explanation: 321 + 654 = 975.
</pre>

Sum Linked List Numbers

Count Slices

Binary Subarray Sums

Optimize Bomberman

Longest Line In Matrix

Find Longest Mountain

Target Max Subarray Sum

Absent Ranges

Count Corner Rectangles

Pour Water

Prison State Changes

Arrays, Linked Lists, Hash Maps Practice Set

Recursion

The Basics of Recursion

Stacks

Queues

Stacks and Queues

You are given a string with the characters <code>&#39;(&#39;</code>, <code>&#39;)&#39;</code>, <code>&#39;{&#39;</code>, <code>&#39;}&#39;</code>, <code>&#39;[&#39;</code> and <code>&#39;]&#39;</code>, determine if the string has a valid sequence of brackets.

An input string is valid if all brackets are be closed by the same type of brackets and in the correct order.

An empty string is&nbsp;also valid.

Example 1:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: &quot;()&quot;
Output: true
</pre>

Example 2:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: &quot;()[]{}&quot;
Output: true
</pre>

Example 3:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: &quot;(]&quot;
Output: false
</pre>

Example 4:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: &quot;([)]&quot;
Output: false
</pre>

Example 5:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: &quot;{[]}&quot;
Output: true
</pre>

Validate Brackets

Warm Temperatures

Parse Ternary Expression

Simple Arithmetic

Count Atoms

Stacks Practice Set

Trees

Graphs

Depth First Search

Breadth First Search

Trees and Graphs

Binary Tree Diff

Binary Tree Diameter

Single Number Path

Binary Tree Max Depth

Binary Tree Min Depth

Binary Tree Left Most Value

Valid Tree

Tree With Largest Bst

Sum Of Paths IV

Smallest String In Tree

Trees Practice Set

Bad Oranges

Schedule Classes

Count Connected Components In Graph

Reconstruct Sequence

Word Transform

Graphs Practice Set

Backtracking

Dynamic Programming

Backtracking and Dynamic Programming

Staircase

Fibonacci

Rob Neighborhood

Lowest Cost To Climb Stairs

Fence Painter

Four Button Keyboard

Exchange Coins

Rob Neighborhood II

Number Of Ways To Sum

Distinct Paths

Home Painter II

Match Regular Expression

Dynamic Programming Practice Set

Divide and Conquer

Given an array of integers <code>nums</code>, find the largest sum of contiguous subarray that has at least one integer. 

Example 1:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: [-3,3,-1,7,-10,5]
Output: 9
Explanation:&nbsp;[3,-1,7] has the largest sum = 9.
</pre>

 

Example 2:

<pre style="white-space: pre-wrap; word-break: keep-all;">
Input: [4,3,2,0,10]
Output: 19
Explanation:&nbsp;[4,3,2,0,10] has the largest sum = 19.
</pre>

 

Next Step:

Can you solve it in O(n)?