# LeetCode Note

Problems solved: 80

## Foreword
> I have no job so I Leet.
I wanna show off so I HackMD.
[name=Dan] [time=Thu, Oct 14, 2021 10:20 PM]
> [ Update ]
> I got a job.
> But I still Leet.
[name=Dan] [time=Sat, April 24, 2022 05:46 PM]
> I lied last time.
> But not this time.
[name=Dan] [time=Sat, July 09, 2022 02:58 PM]

## Resources
I have no idea where to start at first, hence I referenced the following notes:
- [LeetCode 題解 by CyC2018](https://github.com/CyC2018/CS-Notes/blob/master/notes/Leetcode%20%E9%A2%98%E8%A7%A3%20-%20%E7%9B%AE%E5%BD%95.md)
- [LeetCode Note by Jhang God](https://hackmd.io/Oi-SxOs-SbKg1XLTTexIBA?view)
- [God of All Time - Marsgoat](https://hackmd.io/@Marsgoat)

## Algorithm

### Double Pointer
* [167. Two Sum II - Input array is sorted](/QQuwbwLWS5GY9_K1HMKu3Q)
* [189. Rotate Array](/t4l_WfkoSl20dNqtfx2yJg)
* [283. Move Zeroes](/2Ij_7pr8Sz-KU4b9n2dcEg)
* [633. Sum of Square Numbers](/kInhXuXDRIuEYe9njo_JyQ)
* [345. Reverse Vowels of a String](/bOfWLKAPSKGBr9tu7TLq-A)
* [977. Squares of a Sorted Array](/mF1vRxatSIyi2PDJpz4fBg)
* [31. Next Permutation](/id3kqi_2Qy-STF5f8c6Qmg)
* [42. Trapping Rain Water](/WnKRgDf3Tqa3gTOHTxHOwQ)
* [28. Implement strStr](/DRwqDz3MT66bKWFHDGGXzw)
### Sorting
* [215. Kth Largest Element in an Array](/a0ifXoRMSfSRImJl7Ir5cQ)
* [217. Contains Duplicate](/dGi3bwhuRVyvpWNIBQSHVQ)
### Greedy
* [45. Jump Game II](/X5HDv6TYSuO4dzlGPpJLug)
### Binary Search
* [4. Median of Two Sorted Arrays](/4HL9eQVAQ9uqQ7O7OUGpOQ)
* [33. Search in Rotated Sorted Array](/lePkDyo-QVaVl-5OhjXBzg)
* [34. Find First and Last Position of Element in Sorted Array](/aoGBgKgUR7CEL_AE2vu61w)
* [74. Search a 2D Matrix](/b_q5TqekQtiViywJlbMaIw)
* [704. Binary Search](/x3ZFSJCDQxmmu4j-1wmGpQ)
### Divide and Conquer

### Dynamic Programming
* [5. Longest Palindromic Substring](/y-cus9NDTHq91rGFg71vdg)
* [10. Regular Expression Matching](/ZA_2HDSTQZqgOA08-2ODUQ)
* [53. Maximum Subarray](/lc_Wq9JzQJ290RztSg_fmw)
* [55. Jump Game](/Hst2_hICQZGUnFJPtV837A)
* [62. Unique Paths](/d7XCZlkNTwGXADnpZtFn-A)
* [64. Minimum Path Sum](/fBPY-yRUTiKpBHgvCjlyEA)
* [70. Climbing Stairs](/1ioDG0KWRrqGlqOHfql5Tw)
* [509. Fibonacci Number](/Za_SyzUaSG-3AuR_6F4UTQ)
* [542. 01 Matrix](/hoWqqlXQTu6PtLfTzpO2Vg)
* [695. Max Area of Island](/ZhmLvF1fReOFWDItFRr4bQ)
* [733. Flood Fill](/jKHrhmKMTcKuTJrPNAJ4rw)
* [746. Min Cost Climbing Stairs](/woECaVnWSMqGtVbbP6LeFQ)
* [1137. N-th Tribonacci Number](/nn-S3GCaSJGAfxkOFm5mvg)
### DFS
* [46. Permutations](/AogxWG2UROSI3uGArHFaSA)
* [543. Diameter of Binary Tree](/w4R4PaVeSJiZYVxowL62Pg)
### BFS
* [102. Binary Tree Level Order Traversal](/Gd01Q9kNRZ2cQJJHJupOgg)
* [994. Rotting Oranges](/BcMo8XCnS1CfXw4l4TSt_Q)
### Backtracking
* [22. Generate Parentheses](/WGK7QiDwQ4GNwrEIXCcucQ)
* [37. Sudoku Solver](/R8MRQ3juQ8Gz-zcf0rneig)
* [78. Subsets](/CsV9ZqajRGGE4MUhSdMK_w)
* [79. Word Search](/RPvo8fdKSRmhiqJkD6N2fA)
* [784. Letter Case Permutation](/vrGN_XTBS7mRCr8VdV_D4w)

## Data Structure

### Linked List
* [19. Remove Nth Node From End of List](/2oaGf3AHSNq1f0yzyL6jxQ)
* [21. Merge Two Sorted Lists](/jz21d1RoTGmRT8WSdYUddw)
* [160. Intersection of Two Linked Lists](/lqeA6GSOTfGw8UbnLx8YsA)
* [206. Reverse Linked List](/VydzeBIaQSKO7qaOv0qOBA)
* [876. Middle of the Linked List](/2zGufirPT2eAlGBPTKM58g)
### Tree
* [94. Binary Tree Inorder Traversal](/uBk8r3-DQyGWo-k-W8NpdA)
* [98. Validate Binary Search Tree](/KYNJ27qUT36GRupbWtgygQ)
* [96. Unique Binary Search Trees](/jAtgnV_FQyKbbvOTm8Ep3w)
* [100. Same Tree](/bB1jpMxWSH6O5paCd_kBEg)
* [101. Symmetric Tree](/UJ8Usrr2S0ehCVCg45wjQg)
* [104. Maximum Depth of Binary Tree](/EU3ompERRuqUicT6eaEUnA)
* [114. Flatten Binary Tree to Linked List](/lpveRafQS4CQC3xwhB7SAw)
* [116. Populating Next Right Pointers in Each Node](/qjzTPGl7R1aVhpCIQ4Xqyg)
* [144. Binary Tree Preorder Traversal](/1T3YDVpiQkS4m38eefEevQ)
* [145. Binary Tree Postorder Traversal](/2o1L151eTJGSHxTNiEszmg)
* [226. Invert Binary Tree](/RxgIH-9WTyGCwEmCoTc_ew)
* [617. Merge Two Binary Trees](/r1SXtFWCRdKCd3ngnYDXkA)
* [938. Range Sum of BST](/TiXBVf4hS9izk4ioUiQ-7A)
### Stack and Queue
* [20. Valid Parentheses](/Phv66Hr7Qi2F66h6BRKGTA)
* [155. Min Stack](/SGJKi2rdTu-k9yIiVY4UjA)
* [232. Implement Queue using Stacks](/3WeRfB7KQR-KCPui3rMJzA)
* [907. Sum of Subarray Minimums](/1HvJlND-QKeyiqLjQMR_kQ)
### Hash
* [1. Two Sum](/6Q7W0beORP6L--zueZYEuA)
* [3. Longest Substring Without Repeating Characters](/Y3aknmdRQU-QzgnfSwpKig)
* [169. Majority Element](/RByKAS9gRLe-Un_a1ebNSw)
* [567. Permutation in String](/A4WyNEeBRj6pkMkagLlYlg)
### String
* [6. Zigzag Conversion](/Emz0uwRmRaWxGqqZ_DMAdg)
* [14. Longest Common Prefix](/j8KSQoqHRRCNglsiAOuLxw)
* [151. Reverse Words in a String](/ga6hS4cTSweXloHxjj3CKw)
* [344. Reverse String](/OCOurtPVRUubCosOfnxURA)
* [557. Reverse Words in a String III](/GqpEdanwThyKhRYgQ8eEMg)
### Array
* [48. Rotate Image](/9G2DDGLHTTmgsy3RSd3DPA)
* [56. Merge Intervals](/FO3D3tqIT763_iC0t2GdZg)
* [77. Combinations](/OF9lC0cgTneiNtSzP-iStA)
* [88. Merge Sorted Array](/8hmb0wfaTL2d4ITK4jC7OA)
* [121. Best Time to Buy and Sell Stock](/oXeuXz03Rcq4SnQfkeFA7w)
* [136. Single Number](/W-hNKacBQJ-7_9QZLYHerQ)
* [350. Intersection of Two Arrays II](/6HGbUoneT3i3FcqmjvKm2A)
* [73. Set Matrix Zeroes](/_YZmz1UDR-6FBCx3HrCSaw)
### Graph
### Bitwise Operation
### No Idea What Method I Utilized, But It Just Worked
* [9. Palindrome Number](/MHvpDezBRIao71uhBOvh6g)
* [15. 3Sum](/YS4YdnktR3a-3KqAlo5D3w)

<iframe src="https://replit.com/@DanTang3/MonthlySubmitCounter#main.py" width="100%" height="356" frameborder="0" marginwidth="0" marginheight="0" allowfullscreen></iframe>