├── .gitignore
├── Algorithms
├── Algorithms.md
├── Blockchain_Consensus_Algorithm.md
└── Search_Algorithms
│ ├── Binary_Search.py
│ └── Linear_Search.py
├── Coding Practice
└── Leetcode.md
├── Cyber Attacks
└── Cyber_Attacks.md
├── Data Structures
└── Data_Structures.md
├── Design Patterns
└── Design_Patterns.md
├── Programming Languages
├── JavaScript.md
└── Python.md
├── README.md
└── books
└── Erich Gamma, Richard Helm, Ralph Johnson, John M. Vlissides-Design Patterns_ Elements of Reusable Object-Oriented Software -Addison-Wesley Professional (1994).pdf
/.gitignore:
--------------------------------------------------------------------------------
1 | .vscode
--------------------------------------------------------------------------------
/Algorithms/Algorithms.md:
--------------------------------------------------------------------------------
1 |
2 | # Algorithms
3 |
4 | ## Search Algorithms
5 | * Linear Search
6 | * Binary Search
7 |
8 | ## Sorting Algorithms
9 | * Quicksort
10 | * Mergesort
11 | * Bubble Sort
12 | * Insertion Sort
13 | * Selection Sort
14 | * Heapsort
15 | * Bucket Sort
16 | * Counting Sort
17 | * Cubesort
18 | * Tree Sort
19 | * Shell Sort
20 | * Timsort
21 | * Radix Sort
22 |
23 | ## Greedy Algorithms
24 |
25 | ## Dynamic Programming
26 |
27 | ## Pattern Searching
28 | * KMP (Knuth–Morris–Pratt) string search
29 |
30 | ## Backtracking
31 |
32 | ## Divide and Conquer
33 |
34 | ## Geometric Algorithms
35 |
36 | ## Mathematical Algorithms
37 |
38 | ## Bit Algorithms
39 |
40 | ## Graph Algorithms
41 | * Dijkstra
42 |
43 |
44 |
45 |
46 | Source: http://bigocheatsheet.com/
--------------------------------------------------------------------------------
/Algorithms/Blockchain_Consensus_Algorithm.md:
--------------------------------------------------------------------------------
1 | # Blockchain Protocal and Consensus Algorithm 😃
2 |
3 | ## Protocal
4 |
5 | * Bitcoin (PoW)
6 | * Ethereum (PoW)
7 | * NANO (Block-lattice + DPoS + DAG)
8 | * EOS (DPoS)
9 | * IOTA (DAG + Tangle)
10 |
11 | ## consensus algorithm
12 |
13 | * PoW (Proof of Work)
14 | * PoS (Proof of Stake)
15 | * DPoS (Delegated Proof of Stake)
16 | * DBFT
17 | * SBFT
18 | * DAG
19 | * PoB
20 |
--------------------------------------------------------------------------------
/Algorithms/Search_Algorithms/Binary_Search.py:
--------------------------------------------------------------------------------
1 | """
2 | Binary Search:
3 |
4 | Search a sorted array by repeatedly dividing the search interval in half.
5 | Begin with an interval covering the whole array.
6 | If the value of the search key is less than the item in the middle of the interval, narrow the interval to the lower half.
7 | Otherwise narrow it to the upper half. Repeatedly check until the value is found or the interval is empty.
8 |
9 | complexity to O(log n).
10 |
11 | We basically ignore half of the elements just after one comparison.
12 |
13 | Compare x with the middle element.
14 | If x matches with middle element, we return the mid index.
15 | Else If x is greater than the mid element, then x can only lie in right half subarray after the mid element. So we recur for right half.
16 | Else (x is smaller) recur for the left half.
17 |
18 | """
19 | import math
20 |
21 | # Iterative implementation of Binary Search
22 | def binarySearchIterative(arr, x):
23 | l = 0
24 | r = len(arr) - 1
25 | while l < r:
26 | mid = math.floor((l+r)/2) + 1
27 | if arr[mid] == x:
28 | return mid
29 | # target is small than current mid
30 | elif x < arr[mid]:
31 | r = mid - 1
32 | else:
33 | l = mid + 1
34 |
35 | return -1
36 |
37 |
38 | # Test array
39 | int_arr = [ 2, 3, 4, 10, 40 ]
40 | target = 10
41 |
42 | """
43 | idx 0 1 2 3 4
44 | [ 2, 3, 4, 10, 40 ]
45 |
46 | """
47 | # Function call
48 | result = binarySearchIterative(int_arr, target)
49 |
50 |
51 | if result != -1:
52 | print("(Iterative) Element is present at index {}".format(result))
53 | else:
54 | print("(Iterative) Element is not present in array")
55 |
56 | # Recursive implementation of Binary Search
57 | def binarySearchRecursive(arr, x, l, r):
58 | if r >= 1:
59 | mid = int((l+r)/2)
60 |
61 | if arr[mid] == x:
62 | return mid
63 | elif arr[mid] < x:
64 | return binarySearchRecursive(arr, x, mid+1, r)
65 | else:
66 | return binarySearchRecursive(arr, x, l, mid-1)
67 | else:
68 | return -1
69 |
70 | # Function call
71 | result2 = binarySearchRecursive(int_arr, target, 0, len(int_arr)-1)
72 |
73 |
74 | if result2 != -1:
75 | print("(Recursive) Element is present at index {}".format(result2))
76 | else:
77 | print("(Recursive) Element is not present in array")
78 |
--------------------------------------------------------------------------------
/Algorithms/Search_Algorithms/Linear_Search.py:
--------------------------------------------------------------------------------
1 | """
2 | linear search
3 |
4 | complexity O(n)
5 |
6 | Start from the leftmost element of arr[] and one by one compare x with each element of arr[]
7 | If x matches with an element, return the index.
8 | If x doesn’t match with any of elements, return -1.
9 | """
10 |
11 | def linearSearch(arr, n, x):
12 | for i in range(0, n):
13 | if arr[i] == x:
14 | return i
15 | return -1
16 |
17 | str_arr = input('Input an array with number and space (ex: XXX XX XX XXX): ').split(' ')
18 | int_arr = list(map(int, str_arr))
19 | target = input('The number you are searching for: ')
20 |
21 | print('----------------------------')
22 | print('Your array will be: ', int_arr)
23 | print('Your target will be: ', target)
24 |
25 | result = linearSearch(int_arr, len(int_arr), target)
26 | if result == -1:
27 | print('The number you are looking for is not in array')
28 | else:
29 | print('Found at index: ', result)
30 |
--------------------------------------------------------------------------------
/Coding Practice/Leetcode.md:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/dalindev/Study-Notes/9143394fdd033c63c460220f3caca1cbee21268c/Coding Practice/Leetcode.md
--------------------------------------------------------------------------------
/Cyber Attacks/Cyber_Attacks.md:
--------------------------------------------------------------------------------
1 | # Cyber Attacks
2 |
3 | ## Common Attacks:
4 | * Denial-of-service (DoS) and distributed denial-of-service (DDoS) attacks
5 | * Man-in-the-middle (MitM) attack
6 | * Phishing and spear phishing attacks
7 | * Drive-by attack
8 | * Password attack
9 | * SQL injection attack
10 | * Cross-site scripting (XSS) attack
11 | * Eavesdropping attack
12 | * Birthday attack
13 | * Malware attack
14 |
15 |
16 |
17 | Source: https://blog.netwrix.com/2018/05/15/top-10-most-common-types-of-cyber-attacks/
18 |
--------------------------------------------------------------------------------
/Data Structures/Data_Structures.md:
--------------------------------------------------------------------------------
1 | # Data Structures
2 |
3 | ## Must have:
4 | * Array
5 | * Stack
6 | * Queue
7 | * Singly-Linked List
8 | * Doubly-Linked List
9 | * Binary Search Tree
10 | * B-Tree (self-balancing tree)
11 | * Hash Table
12 | * Hash-Set
13 | * Hash-maps
14 | * Dictionary
15 | * Trie
16 | * Graphs
17 |
18 | ## Nice to know:
19 | * Red-Black Tree
20 | * Splay Tree
21 | * AVL Tree
22 | * KD Tree
23 | * Cartesian Tree
24 | * [Skip List](https://www.youtube.com/watch?v=ypod5jeYzAU)
25 |
26 |
27 | Source: http://bigocheatsheet.com/
28 |
--------------------------------------------------------------------------------
/Design Patterns/Design_Patterns.md:
--------------------------------------------------------------------------------
1 | # Types of Design Patterns
2 |
3 | As per the design pattern reference book [Design Patterns - Elements of Reusable Object-Oriented Software](https://github.com/dalinhuang99/Study-Notes/blob/master/books/Erich%20Gamma%2C%20Richard%20Helm%2C%20Ralph%20Johnson%2C%20John%20M.%20Vlissides-Design%20Patterns_%20Elements%20of%20Reusable%20Object-Oriented%20Software%20%20-Addison-Wesley%20Professional%20(1994).pdf) , there are 23 design patterns which can be classified in three categories:
4 | * Creational
5 | * These design patterns provide a way to create objects while hiding the creation logic, rather than instantiating objects directly using new operator. This gives program more flexibility in deciding which objects need to be created for a given use case.
6 | * Structural
7 | * These design patterns concern class and object composition. Concept of inheritance is used to compose interfaces and define ways to compose objects to obtain new functionalities.
8 | * Behavioral patterns
9 | * These design patterns are specifically concerned with communication between objects.
10 |
11 | # Design Principles
12 | These authors are collectively known as Gang of Four (GOF). According to these authors design patterns are primarily based on the following principles of object orientated design.
13 |
14 | * Program to an interface not an implementation
15 | * Favor object composition over inheritance
16 |
17 | Also:
18 | * The Open/Close Principle
19 | * Principle of Least Knowledge
20 | * Dependency Inversion
21 | * Hollywood Principle
22 |
23 | # Design Patterns
24 |
25 | >Note: ❗ == important
26 |
27 | ### Creational Patterns
28 | > "How should objects be created"
29 |
30 | | Name | Description | Example | Important |
31 | | -------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------- | :-------: |
32 | | Abstract Factor | Provide an interface for creating families of related or dependent objects without specifying their concrete classes | | ❗❗ |
33 | | Builder | Separate the construction of a complex object from its representation, allowing the same construction process to create various representations. | | ❗ |
34 | | Dependency Injection | A class accepts the objects it requires from an injector instead of creating the objects directly. | | |
35 | | Factory method | Define an interface for creating a single object, but let subclasses decide which class to instantiate. Factory Method lets a class defer instantiation to subclasses. | | ❗❗ |
36 | | Prototype | Specify the kinds of objects to create using a prototypical instance, and create new objects from the 'skeleton' of an existing object, thus boosting performance and keeping memory footprints to a minimum. | | ❗ |
37 | | Singleton | Ensure a class has only one instance, and provide a global point of access to it. | | ❗❗ |
38 |
39 |
40 |
41 |
42 |
43 | ### Structural Patterns
44 | > "How should classes behave and interact with each other?"
45 |
46 | | Name | Description | Example | Important |
47 | | ------------------------------- | ------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------- | :-------: |
48 | | Adapter, Wrapper, or Translator | Convert the interface of a class into another interface clients expect. An adapter lets classes work together that could not otherwise because of incompatible interfaces. The enterprise integration pattern equivalent is the translator. | | ❗❗ |
49 | | Bridge | Decouple an abstraction from its implementation allowing the two to vary independently. | | ❗❗ |
50 | | Composite | Compose objects into tree structures to represent part-whole hierarchies. Composite lets clients treat individual objects and compositions of objects uniformly. | | ❗❗ |
51 | | Decorator | Attach additional responsibilities to an object dynamically keeping the same interface. Decorators provide a flexible alternative to subclassing for extending functionality. | | ❗❗ |
52 | | Facade | Provide a unified interface to a set of interfaces in a subsystem. Facade defines a higher-level interface that makes the subsystem easier to use. | | ❗❗ |
53 | | Flyweight | Use sharing to support large numbers of similar objects efficiently. | | ❗ |
54 | | Proxy | Provide a surrogate or placeholder for another object to control access to it. | | ❗ |
55 |
56 |
57 | ### Behavioral Patterns
58 | > "How should objects behave and interact with each other?"
59 |
60 | | Name | Description | Example | Important |
61 | | ----------------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------- | :-------: |
62 | | Chain of Responsibility | Avoid coupling the sender of a request to its receiver by giving more than one object a chance to handle the request. Chain the receiving objects and pass the request along the chain until an object handles it. | | ❗❗ |
63 | | Command | Encapsulate a request as an object, thereby allowing for the parameterization of clients with different requests, and the queuing or logging of requests. It also allows for the support of undoable operations. | | ❗ |
64 | | Interpreter | Given a language, define a representation for its grammar along with an interpreter that uses the representation to interpret sentences in the language. | | ❗ |
65 | | Iterator | Provide a way to access the elements of an aggregate object sequentially without exposing its underlying representation. | | ❗ |
66 | | Mediator | Define an object that encapsulates how a set of objects interact. Mediator promotes loose coupling by keeping objects from referring to each other explicitly, and it allows their interaction to vary independently. | | ❗ |
67 | | Memento | Without violating encapsulation, capture and externalize an object's internal state allowing the object to be restored to this state later. | | ❗ |
68 | | Observer or Publish/subscribe | Define a one-to-many dependency between objects where a state change in one object results in all its dependents being notified and updated automatically. | | ❗ ❗ |
69 | | State | Allow an object to alter its behavior when its internal state changes. The object will appear to change its class. | | ❗ |
70 | | Strategy | Define a family of algorithms, encapsulate each one, and make them interchangeable. Strategy lets the algorithm vary independently from clients that use it. | | ❗❗ |
71 | | Template method | Define the skeleton of an algorithm in an operation, deferring some steps to subclasses. Template method lets subclasses redefine certain steps of an algorithm without changing the algorithm's structure. | | ❗ ❗ |
72 | | Visitor | Represent an operation to be performed on the elements of an object structure. Visitor lets a new operation be defined without changing the classes of the elements on which it operates. | | ❗ |
73 |
74 |
75 | ### Concurrency Patterns
76 | > "How should a specific situation be handled under multi-threading?"
77 |
78 | | Name | Description | Example | Important |
79 | | ----------------------- | --------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------------- | ------- | :-------: |
80 | | Active Object | Decouples method execution from method invocation that reside in their own thread of control. The goal is to introduce concurrency, by using asynchronous method invocation and a scheduler for handling requests. | | |
81 | | Monitor object | An object whose methods are subject to mutual exclusion, thus preventing multiple objects from erroneously trying to use it at the same time. | | |
82 | | Reactor | A reactor object provides an asynchronous interface to resources that must be handled synchronously. | | |
83 | | Scheduler | Explicitly control when threads may execute single-threaded code. | | |
84 | | Thread pool | A number of threads are created to perform a number of tasks, which are usually organized in a queue. Typically, there are many more tasks than threads. Can be considered a special case of the object pool pattern. | | |
85 | | Thread-specific storage | Static or "global" memory local to a thread. | | |
86 |
87 |
88 | ### Model–View–Controller Pattern
89 | > Model–view–controller is an architectural pattern commonly used for developing user interfaces that divides an application into three interconnected parts. This is done to separate internal representations of information from the ways information is presented to and accepted from the user.[1][2] The MVC design pattern decouples these major components allowing for efficient code reuse and parallel development.
90 |
91 |
92 | ### Sources
93 | [Software design pattern (Wikipedia)](https://en.wikipedia.org/wiki/Software_design_pattern)
94 | [Design Patterns (www.tutorialspoint.com)](https://www.tutorialspoint.com/design_pattern/index.htm)
95 | [Design Patterns Questions and Answers](https://www.tutorialspoint.com/design_pattern/design_pattern_questions_answers.htm)
96 | [Design Pattern - Interview Questions](https://www.tutorialspoint.com/design_pattern/design_pattern_interview_questions.htm)
97 |
98 |
99 | ### Criticism
100 | Inappropriate use of patterns may unnecessarily increase complexity
101 |
--------------------------------------------------------------------------------
/Programming Languages/JavaScript.md:
--------------------------------------------------------------------------------
1 | ##### An introduction
2 | * [An Introduction to JavaScript](https://javascript.info/intro)
3 | * [Code editors](https://javascript.info/code-editors)
4 | * [Developer console](https://javascript.info/devtools)
5 | ##### JavaScript Fundamentals
6 | * [Hello, world!](https://javascript.info/hello-world)
7 | * [Code structure](https://javascript.info/structure)
8 | * [The modern mode, "use strict"](https://javascript.info/strict-mode)
9 | * [Variables](https://javascript.info/variables)
10 | * [Data types](https://javascript.info/types)
11 | * [Type Conversions](https://javascript.info/type-conversions)
12 | * [Operators](https://javascript.info/operators)
13 | * [Comparisons](https://javascript.info/comparison)
14 | * [Interaction: alert, prompt, confirm](https://javascript.info/alert-prompt-confirm)
15 | * [Conditional operators: if, '?'](https://javascript.info/ifelse)
16 | * [Logical operators](https://javascript.info/logical-operators)
17 | * [Loops: while and for](https://javascript.info/while-for)
18 | * [The "switch" statement](https://javascript.info/switch)
19 | * [Functions](https://javascript.info/function-basics)
20 | * [Function expressions and arrows](https://javascript.info/function-expressions-arrows)
21 | * [JavaScript specials](https://javascript.info/javascript-specials)
22 | ##### Code quality
23 | * [Debugging in Chrome](https://javascript.info/debugging-chrome)
24 | * [Coding style](https://javascript.info/coding-style)
25 | * [Comments](https://javascript.info/comments)
26 | * [Ninja code](https://javascript.info/ninja-code)
27 | * [Automated testing with mocha](https://javascript.info/testing-mocha)
28 | * [Polyfills](https://javascript.info/polyfills)
29 | ##### Objects: the basics
30 | * [Objects](https://javascript.info/object)
31 | * [Garbage collection](https://javascript.info/garbage-collection)
32 | * [Symbol type](https://javascript.info/symbol)
33 | * [Object methods, "this"](https://javascript.info/object-methods)
34 | * [Object to primitive conversion](https://javascript.info/object-toprimitive)
35 | * [Constructor, operator "new"](https://javascript.info/constructor-new)
36 | ##### Data types
37 | * [Methods of primitives](https://javascript.info/primitives-methods)
38 | * [Numbers](https://javascript.info/number)
39 | * [Strings](https://javascript.info/string)
40 | * [Arrays](https://javascript.info/array)
41 | * [Array methods](https://javascript.info/array-methods)
42 | * [Iterables](https://javascript.info/iterable)
43 | * [Map, Set, WeakMap and WeakSet](https://javascript.info/map-set-weakmap-weakset)
44 | * [Object.keys, values, entries](https://javascript.info/keys-values-entries)
45 | * [Destructuring assignment](https://javascript.info/destructuring-assignment)
46 | * [Date and time](https://javascript.info/date)
47 | * [JSON methods, toJSON](https://javascript.info/json)
48 | ##### Advanced working with functions
49 | * [Recursion and stack](https://javascript.info/recursion)
50 | * [Rest parameters and spread operator](https://javascript.info/rest-parameters-spread-operator)
51 | * [Closure](https://javascript.info/closure)
52 | * [The old "var"](https://javascript.info/var)
53 | * [Global object](https://javascript.info/global-object)
54 | * [Function object, NFE](https://javascript.info/function-object)
55 | * [The "new Function" syntax](https://javascript.info/new-function)
56 | * [Scheduling: setTimeout and setInterval](https://javascript.info/settimeout-setinterval)
57 | * [Decorators and forwarding, call/apply](https://javascript.info/call-apply-decorators)
58 | * [Function binding](https://javascript.info/bind)
59 | * [Currying and partials](https://javascript.info/currying-partials)
60 | * [Arrow functions revisited](https://javascript.info/arrow-functions)
61 | ##### Objects, classes, inheritance
62 | * [Property flags and descriptors](https://javascript.info/property-descriptors)
63 | * [Property getters and setters](https://javascript.info/property-accessors)
64 | * [Prototypal inheritance](https://javascript.info/prototype-inheritance)
65 | * [F.prototype](https://javascript.info/function-prototype)
66 | * [Native prototypes](https://javascript.info/native-prototypes)
67 | * [Methods for prototypes](https://javascript.info/prototype-methods)
68 | * [Class patterns](https://javascript.info/class-patterns)
69 | * [Classes](https://javascript.info/class)
70 | * [Class inheritance, super](https://javascript.info/class-inheritance)
71 | * [Class checking: "instanceof"](https://javascript.info/instanceof)
72 | * [Mixins](https://javascript.info/mixins)
73 | ##### Error handling
74 | * [Error handling, "try..catch"](https://javascript.info/try-catch)
75 | * [Custom errors, extending Error](https://javascript.info/custom-errors)
76 | ##### Document
77 | * [Browser environment, specs](https://javascript.info/browser-environment)
78 | * [DOM tree](https://javascript.info/dom-nodes)
79 | * [Walking the DOM](https://javascript.info/dom-navigation)
80 | * [Searching: getElement* and querySelector*](https://javascript.info/searching-elements-dom)
81 | * [Node properties: type, tag and contents](https://javascript.info/basic-dom-node-properties)
82 | * [Attributes and properties](https://javascript.info/dom-attributes-and-properties)
83 | * [Modifying the document](https://javascript.info/modifying-document)
84 | * [Styles and classes](https://javascript.info/styles-and-classes)
85 | * [Element size and scrolling](https://javascript.info/size-and-scroll)
86 | * [Window sizes and scrolling](https://javascript.info/size-and-scroll-window)
87 | * [Coordinates](https://javascript.info/coordinates)
88 | ##### Introduction into Events
89 | * [Introduction to browser events](https://javascript.info/introduction-browser-events)
90 | * [Bubbling and capturing](https://javascript.info/bubbling-and-capturing)
91 | * [Event delegation](https://javascript.info/event-delegation)
92 | * [Browser default actions](https://javascript.info/default-browser-action)
93 | * [Dispatching custom events](https://javascript.info/dispatch-events)
94 | ##### Events in details
95 | * [Mouse events basics](https://javascript.info/mouse-events-basics)
96 | * [Moving: mouseover/out, mouseenter/leave](https://javascript.info/mousemove-mouseover-mouseout-mouseenter-mouseleave)
97 | * [Drag'n'Drop with mouse events](https://javascript.info/mouse-drag-and-drop)
98 | * [Keyboard: keydown and keyup](https://javascript.info/keyboard-events)
99 | * [Scrolling](https://javascript.info/onscroll)
100 | * [Page lifecycle: DOMContentLoaded, load, beforeunload, unload](https://javascript.info/onload-ondomcontentloaded)
101 | * [Resource loading: onload and onerror](https://javascript.info/onload-onerror)
102 | ##### Forms, controls
103 | * [Form properties and methods](https://javascript.info/form-elements)
104 | * [Focusing: focus/blur](https://javascript.info/focus-blur)
105 | * [Events: change, input, cut, copy, paste](https://javascript.info/events-change-input)
106 | * [Form submission: event and method submit](https://javascript.info/forms-submit)
107 | ##### Animation
108 | * [Bezier curve](https://javascript.info/bezier-curve)
109 | * [CSS-animations](https://javascript.info/css-animations)
110 | * [JavaScript animations](https://javascript.info/js-animation)
111 | ##### Frames and windows
112 | * [Popups and window methods](https://javascript.info/popup-windows)
113 | * [Cross-window communication](https://javascript.info/cross-window-communication)
114 | * [The clickjacking attack](https://javascript.info/clickjacking)
115 | ##### Regular expressions
116 | * [Patterns and flags](https://javascript.info/regexp-introduction)
117 | * [Methods of RegExp and String](https://javascript.info/regexp-methods)
118 | * [Character classes](https://javascript.info/regexp-character-classes)
119 | * [Escaping, special characters](https://javascript.info/regexp-escaping)
120 | * [Sets and ranges [...]](https://javascript.info/regexp-character-sets-and-ranges)
121 | * [The unicode flag](https://javascript.info/regexp-unicode)
122 | * [Quantifiers +, *, ? and {n}](https://javascript.info/regexp-quantifiers)
123 | * [Greedy and lazy quantifiers](https://javascript.info/regexp-greedy-and-lazy)
124 | * [Capturing groups](https://javascript.info/regexp-groups)
125 | * [Backreferences: \n and $n](https://javascript.info/regexp-backreferences)
126 | * [Alternation (OR) |](https://javascript.info/regexp-alternation)
127 | * [String start ^ and finish $](https://javascript.info/regexp-anchors)
128 | * [Multiline mode, flag "m"](https://javascript.info/regexp-multiline-mode)
129 | * [Lookahead (in progress)](https://javascript.info/regexp-lookahead)
130 | * [Infinite backtracking problem](https://javascript.info/regexp-infinite-backtracking-problem)
131 | ##### Promises, async/await
132 | * [Introduction: callbacks](https://javascript.info/callbacks)
133 | * [Promise](https://javascript.info/promise-basics)
134 | * [Promises chaining](https://javascript.info/promise-chaining)
135 | * [Promise API](https://javascript.info/promise-api)
136 | * [Async/await](https://javascript.info/async-await)
--------------------------------------------------------------------------------
/Programming Languages/Python.md:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/dalindev/Study-Notes/9143394fdd033c63c460220f3caca1cbee21268c/Programming Languages/Python.md
--------------------------------------------------------------------------------
/README.md:
--------------------------------------------------------------------------------
1 | # Study Notes 😃
2 | ---
3 |
4 | ### Algorithms
5 | * [Algorithms](https://github.com/dalinhuang99/Study-Notes/blob/master/Algorithms/Algorithms.md)
6 | - Search Algorithms
7 | - Sorting Algorithms
8 | - Greedy Algorithms
9 | - Dynamic Programming
10 | - Pattern Searching
11 | - Backtracking
12 | - Divide and Conquer
13 | - Geometric Algorithms
14 | - Mathematical Algorithms
15 | - Bit Algorithms
16 | - Graph Algorithms
17 | * [Blockchain Consensus Algorithm](https://github.com/dalinhuang99/Study-Notes/blob/master/Algorithms/Blockchain_Consensus_Algorithm.md)
18 |
19 | ### Books
20 | * [Design Patterns: Elements of Reusable Object-Oriented Software](https://github.com/dalinhuang99/Study-Notes/blob/master/books/Erich%20Gamma%2C%20Richard%20Helm%2C%20Ralph%20Johnson%2C%20John%20M.%20Vlissides-Design%20Patterns_%20Elements%20of%20Reusable%20Object-Oriented%20Software%20%20-Addison-Wesley%20Professional%20(1994).pdf)
21 |
22 | ### Coding Skills
23 | * [LeetCode](https://github.com/dalinhuang99/LeetCode) (My github repo for solved problems)
24 | * [LintCode](https://www.lintcode.com/)
25 |
26 | ### Cyber Attacks 🐱💻
27 | * [Cyber Attacks](https://github.com/dalinhuang99/Study-Notes/blob/master/Cyber%20Attacks/Cyber_Attacks.md)
28 |
29 | ### Data Structures
30 | * [Data Structures](https://github.com/dalinhuang99/Study-Notes/blob/master/Data%20Structures/Data_Structures.md)
31 |
32 | ### Design Patterns
33 | * [Design Patterns](https://github.com/dalinhuang99/Study-Notes/blob/master/Design%20Patterns/Design_Patterns.md)
34 |
35 | ### Programming Languages
36 | * [Python](https://github.com/dalinhuang99/Study-Notes/blob/master/Programming%20Languages/Python.md)
37 | * [JavaScript](https://github.com/dalinhuang99/Study-Notes/blob/master/Programming%20Languages/JavaScript.md)
38 |
39 |
40 |
41 | ---
42 |
43 | Other:
44 |
45 | * HTTP 2.0 (Bidirectional) https://http2.github.io/faq/ ✅
46 | - HPACK Header compression
47 | - Server-side resource pushing
48 | - Multiplexing via streams and frames
49 | - Client/server prioritization
50 | * HTTPS
51 | * Socket
52 | * SSL / OpenSSL
53 | * Web Latency
54 | * (QUIC protocol)
55 | * Microservices https://www.youtube.com/watch?v=CZ3wIuvmHeM
56 |
57 | NodeJS:
58 | * [High Performance JS in V8 [I] - Peter Marshall, Google](https://www.youtube.com/watch?v=YqOhBezMx1o)
59 | * [Getting Your PageSpeed Score Up](https://www.youtube.com/watch?v=pNKnhBIVj4w)
60 |
--------------------------------------------------------------------------------
/books/Erich Gamma, Richard Helm, Ralph Johnson, John M. Vlissides-Design Patterns_ Elements of Reusable Object-Oriented Software -Addison-Wesley Professional (1994).pdf:
--------------------------------------------------------------------------------
https://raw.githubusercontent.com/dalindev/Study-Notes/9143394fdd033c63c460220f3caca1cbee21268c/books/Erich Gamma, Richard Helm, Ralph Johnson, John M. Vlissides-Design Patterns_ Elements of Reusable Object-Oriented Software -Addison-Wesley Professional (1994).pdf
--------------------------------------------------------------------------------