刷題＋ System Design + 面试准备的路上

ＣＮＹ懶了一回 決定每天記錄 以免懈怠 目標一個月能去面所有想面的公司 努力努力
1. Leetcode
2. System Design
3. 其他

Material:
- Udemy, paid courses:
1. Amazon Web Services (AWS) Certified https://www.udemy.com/aws-certif ... n/learn/v4/overview
2. Docker Mastery: https://www.udemy.com/docker-mastery/learn/v4/overview
System Design:
1. https://github.com/checkcheckzz/system-design-interview#intro
2. book: https://www.amazon.com/gp/produc ... 13572JFMQDPZ5&psc=1
刷題:
https://www.educative.io/collect ... id=5749180081373184
Leetcode: https://leetcode.com/explore/int ... iew-questions-easy/
Side Project with Swift:
https://www.amazon.com/gp/produc ... 0_s00?ie=UTF8&psc=1

2/17:
Reading material:
-geohash vs S2
https://www.jianshu.com/p/7332dcb978b2
http://www.learn4master.com/inte ... -design/poi-geohash
https://github.com/halfrost/Half ... _common_ancestor.md
-Polling, Comet, Long Polling, WebSocket
https://blog.gtwang.org/web-development/websocket-protocol/
https://blog.niclin.tw/2017/10/2 ... -polling-websocket/

LC:
22. Generate Parentheses (Recursion + Iteration)
991. Broken Calculator
995. Minimum Number of K Consecutive Bit Flips

2/18:
Reading:
http://wiki.c2.com/?TailRecursion
AWS - intro to db service
LC:
993. Cousins in Binary Tree
988. Smallest String Starting From Leaf
100. same tree
160. Intersection of Two Linked Lists
69. Sqrt(x)
70. Climbing Stairs
746. Min Cost Climbing Stairs

educative.io
Binary Search
Sum of Two Values
Reverse a singly linked list
Intersection Point of Two Lists
Check if two binary trees are identical
Fibonacci Numbers
Boggle: cannot pass test case but the print result is the same(different order)

1. class boggle {
   
2.   char[][] mGrid;
   
3.   HashSet<String> mDic;
   
4.   boggle(char[][] grid, HashSet<String> dictionary){
   
5.     mGrid = grid;
   
6.     mDic = dictionary;
   
7.   }
   
8.   
   
9.   public HashSet<String> find_all_words(){
   
10.      //TODO: Write - Your - Code
    
11.       HashSet<String> result = new HashSet<String>();
    
12.       for (String word: mDic) {
    
13.         for (int i = 0; i < mGrid.length; i++) {
    
14.           for (int j = 0; j < mGrid[0].length; j++) {
    
15.             if (found(word, new boolean[mGrid.length][mGrid[0].length], i, j, 0)) result.add(word);
    
16.           }
    
17.         }
    
18.       }
    
19.       return result;
    
20.   }
    
21.   
    
22.   public boolean found(String word, boolean[][] used, int i, int j, int k) {
    
23.       if (i < 0 || i >= mGrid.length || j < 0 || j >= mGrid[0].length || used[i][j]) return false;
    
24.       if (k == word.length()) return true;
    
25.       if (mGrid[i][j] == word.charAt(k)) {
    
26.         used[i][j] = true;
    
27.         for (int m = -1; m < 2; m++) {
    
28.           for (int n = -1; n < 2; n++) {
    
29.             if (found(word, used, i + m, j + n, k + 1)) return true;
    
30.           }
    
31.         }
    
32.         used[i][j] = false;
    
33.       }
    
34.       return false;
    
35.   }
    
36. }

复制代码

Result        Input        Expected Output        Actual Output        Reason
find_all_words(c,a,t,r,r,e,t,o,n)        art,ton,not,cater,cat,        art,not,ton,cater,cat,        Incorrect Output

2/19:
Reading:
https://github.com/henryr/cap-faq
->Possibility of Partitions => Not (C and A)
Still need to understand "A partition is when the network fails to deliver some messages to one or more nodes by losing them. The proof of CAP relied on a total partition.

LC:
151. Reverse Words in a String
112. Path Sum
15. 3Sum
259. 3Sum Smaller
16. 3Sum Closest

Education.io
Reverse words in a sentence
Sum of Three Values

能否加下好友 有兴趣组队学习么， id即是微信

2/20:
Reading:
A Plain English Introduction to CAP Theorem http://ksat.me/a-plain-english-introduction-to-cap-theorem/
Numbers Everyone Should Know(2009)
Designing Data-Intensive Applications: chp1, keyword: fan-out - twitter's 2 approaches, p50, p95, p99, tail latency, scale up and scale out

LC:
225. Implement Stack using Queues
232. Implement Queue using Stacks
133. Clone Graph, recursion and iteration
46. Permutations
47. Permutations II
60. Permutation Sequence

Education.io
Stack using Queues
Clone a Directed Graph
find Kth Permutation