| Name | Time Complexity | Sapce Complexity |
|---|---|---|
| Bubble Sort | O(n^2) | O(1) |
| Selection Sort | O(n^2) | O(1) |
| Insertion Sort | O(n^2) | O(1) |
| Merge Sort | O(n log(n)) | O(n) |
| Quick Sort | O(n^2) | O(log(n)) |
| Heap Sort | O(n log(n)) | O(1) |
| Counting Sort | O(n+k) | O(k) |
| Radix Sort | O(nk) | O(n+k) |
Algorithm - Tree (2)
Leetcode Tree problem collection (2)
- 199.Binary Tree Right Side View
- 105.Construct Binary Tree from Preorder and Inorder Traversal
- 236.Lowest Common Ancestor of a Binary Tree
- 987.Vertical Order Traversal of a Binary Tree
- 103.Binary Tree Zigzag Level Order Traversal
Algorithm - Tree (1)
Leetcode Tree problem collection (1)
- 104.Maximum Depth of Binary Tree
- 98.Validate Binary Search Tree
- 101.Symmetric Tree
- 102.Binary Tree Level Order Traversal
- 108.Convert Sorted Array to Binary Search Tree
Inorder (Left, Root, Right)
Preorder (Root, Left, Right)
Postorder (Left, Right, Root)
Algorithm - Linked List (1)
Leetcode linked list problem collection (1)
- 19.Remove Nth Node From End of List
- 206.Reverse Linked List
- 21.Merge Two Sorted Lists
- 234.Palindrome Linked List
- 141.Linked List Cycle
- 203.Remove Linked List Elements
- 83.Remove Duplicates from Sorted List
- 2.Add Two Numbers
- 876.Middle of the Linked List
- 369.Plus One Linked List
Docker Container
I heard the words, container, and docker a lot. I know they refer to a tool related to Dev/Ops, but I never use one before. Recently I am writing a tool to find the best apartment (rent goes down since COVID19). Then I I think probably I should use docker in the apt finder project. This article is the first glimpse of docker. I would say it’s magical.
Closure and Decorator in Python
About Closure and Decorator in Python with examples.
第 1 篇 - 关于停更，状态更新，续更，和一些屁话
Bash Notes
Bash stands for “Bourne Again SHell”, is a replacement/improvement of the original Bourne shell (sh).
MongoDB Notes
NoSQL Notes
NoSQL = Not Only SQL