Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly
Sign up
Appearance settings

Commit e1a5df9

Browse files 
2 parents a0004e3 + b8e5358 commit e1a5df9

File tree

1 file changed

+19
-6
lines changed

1 file changed

+19
-6
lines changed

‎README.md

Lines changed: 19 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -24,17 +24,27 @@ Stage 2 (Finished in Day 45)
2424

2525
Total: 41 / 41
2626

27-
Stage 3 (Leetcode# <= 200)
27+
Stage 3 (Leetcode# <= 200) (Finished in Day 99)
2828
- [x] [Top 100 Liked Problems - LeetCode](https://leetcode.com/problemset/top-100-liked-questions/) (Start: 43 / 100 Solved, Current: 100 / 100 Solved, Progress: 57 / 57)
29-
- [] [Backtracking - LeetCode](https://leetcode.com/tag/backtracking/) (Start: 6 / 21 Solved, Current: 11 / 21 Solved, Progress: 5 / 15)
29+
- [x] [Backtracking - LeetCode](https://leetcode.com/tag/backtracking/) (Start: 6 / 21 Solved, Current: 21 / 21 Solved, Progress: 15 / 15)
3030
- [x] [Sliding Window - LeetCode](https://leetcode.com/tag/sliding-window/) (Start: 2 / 2 Solved, Current: 2 / 2 Solved)
31-
- [] [Dynamic Programming - LeetCode](https://leetcode.com/tag/dynamic-programming/) (Start: 11 / 27 Solved, Current: 15 / 27 Solved, Progress: 4 / 16)
31+
- [x] [Dynamic Programming - LeetCode](https://leetcode.com/tag/dynamic-programming/) (Start: 11 / 27 Solved, Current: 27 / 27 Solved, Progress: 16 / 16)
3232
- [x] [Divide and Conquer - LeetCode](https://leetcode.com/tag/divide-and-conquer/) (Start: 4 / 4 Solved, Current: 4 / 4 Solved)
3333
- [x] [Graph - LeetCode](https://leetcode.com/tag/graph/) (Start: 1 / 1 Solved, Current: 1 / 1 Solved)
34-
- [] [Breadth-first Search - LeetCode](https://leetcode.com/tag/breadth-first-search/) (Start: 3 / 10 Solved, Current: 8 / 10 Solved, Progress: 5 / 7)
35-
- [] [Depth-first Search - LeetCode](https://leetcode.com/tag/depth-first-search/) (Start: 8 / 21 Solved, Current: 19 / 21 Solved, Progress: 11 / 13)
34+
- [x] [Breadth-first Search - LeetCode](https://leetcode.com/tag/breadth-first-search/) (Start: 3 / 10 Solved, Current: 10 / 10 Solved, Progress: 7 / 7)
35+
- [x] [Depth-first Search - LeetCode](https://leetcode.com/tag/depth-first-search/) (Start: 8 / 21 Solved, Current: 21 / 21 Solved, Progress: 13 / 13)
3636

37-
Total: 89 / 111
37+
Total: 111 / 111
38+
39+
Stage 4
40+
From a reference [here](https://leetcode.com/discuss/interview-experience/904425/facebook-amazon-apple-google-nyc-oct-2020-offerofferghostedoffer)
41+
- [ ] Tackle a topic at once and then go back and solve a bunch of related problems.
42+
- [ ] Made sure to do a lot of mock interviews. Almost 1 mock interview every other weekend or so.
43+
44+
45+
Topics:
46+
- [ ] Recursion
47+
- [ ] 2D Array connectivities
3848

3949
## Paper
4050
- [x] 'Programming pearls: algorithm design techniques' by Jon Bentley (Sep. 1984 Vol. 27 No. 9 Communications of the ACM P885)
@@ -43,6 +53,9 @@ Total: 89 / 111
4353

4454
- [x] E. W. Dijkstra, Some beautiful arguments using mathematical induction, Actu Informat. 13 (1980) 1-8.
4555

56+
## Book
57+
- [x] 'Programming Pearls' by Jon Bentley
58+
4659
## Sequence
4760
- [x] [How to Solve Sliding Window Problems - Outco - Medium](https://medium.com/outco/how-to-solve-sliding-window-problems-28d67601a66)
4861
- [ ] Master the [sliding window technique](https://discuss.leetcode.com/topic/30941/here-is-a-10-line-template-that-can-solve-most-substring-problems) that applies to many substring or subarray problems.

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /