[React] Lists, Conditionals and HOC
Conditionals12345678910111213141516return ( <div className="App"> <button onClick={this.toggleHandler}>Toggle</bu
...
[React] React Basic I
install npm install -g create-react-appcreate create-react-app APPNAMEstart npm start
ConceptsImmutabilityReact forces immutability.
Strings are immu
...
[ES6] ES6 Syntax
ES6 Syntaxlet & const
let used on variable values
const constant values
Arrow Functionssolves issues with this keyword
12345const myFunc = () =&g
...
[Data Mining] Itemsets
Association RuleAssociation Rules: Find all the rules X -> Y with minimum support and confidence
Support: s, probability that a transaction contai
...
[Leetcode] Graph
Intro to GraphVideo: https://www.youtube.com/watch?v=zaBhtODEL0w&t=261s
Definetion A directed graph is a set V of vertices and a set E of edges. G
...
[Leetcode] Set
287. Find the Duplicate NumberLeetcode: https://leetcode.com/problems/find-the-duplicate-number/solution/
Solution 1. Using a set to detect duplicates
...
[Leetcode] Heaps & Priority Queue
IntroductionPriority Queuehttps://www.youtube.com/watch?v=t0Cq6tVNRBA&list=PLUL4IRMCZfeXjd5AzDyry39Mf_pn1YLjQ
Time Complexity
Find min/max: O(1)
...
[Leetcode] Intervals
Template:The intersection of two intervals:
12345start = max(a.start, b.start)end = min(a.end, b.end)if start <= end: # there exist interval
...
[Leetcode] Math
Maximum Common Divisor (最大公约数)Source
123456789101112131415// Function to return gcd of a and bstatic int gcd(int a, int b) { if(a == 0 || b == 0
...
[Leetcode]Sorting
OverviewbigO cheat sheet
Algorithm
Time Complexity
QuickSort
O(n^2)
MergeSort
O(n(logn))
HeapSort
O(n(logn))
BubbleSort
O(n^2)
Inserti
...