Skip to content

Commit f94d4d8

Browse files
Zanger67Zanger67
committed
Finished all path sums series questions
1 parent ec950ad commit f94d4d8

21 files changed

+749
-0
lines changed

Diff for: ‎README.md

+7
Original file line numberDiff line numberDiff line change
@@ -65,6 +65,8 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
6565
| 100 | [Same Tree](<https://leetcode.com/problems/same-tree>) | Easy | B75, N150 | [solution](<markdowns/_100. Same Tree.md>) | py |
6666
| 103 | [Binary Tree Zigzag Level Order Traversal](<https://leetcode.com/problems/binary-tree-zigzag-level-order-traversal>) | Medium | | [solution](<markdowns/_103. Binary Tree Zigzag Level Order Traversal.md>) | py |
6767
| 111 | [Minimum Depth of Binary Tree](<https://leetcode.com/problems/minimum-depth-of-binary-tree>) | Easy | | [solution](<markdowns/_111. Minimum Depth of Binary Tree.md>) | c |
68+
| 112 | [Path Sum](<https://leetcode.com/problems/path-sum>) | Easy | | [solution](<markdowns/_112. Path Sum.md>) | py |
69+
| 113 | [Path Sum II](<https://leetcode.com/problems/path-sum-ii>) | Medium | | [solution](<markdowns/_113. Path Sum II.md>) | py |
6870
| 114 | [Flatten Binary Tree to Linked List](<https://leetcode.com/problems/flatten-binary-tree-to-linked-list>) | Medium | | [solution](<markdowns/_114. Flatten Binary Tree to Linked List.md>) | py, c |
6971
| 118 | [Pascal's Triangle](<https://leetcode.com/problems/pascals-triangle>) | Easy | | [solution](<markdowns/_118. Pascal's Triangle.md>) | py |
7072
| 121 | [Best Time to Buy and Sell Stock](<https://leetcode.com/problems/best-time-to-buy-and-sell-stock>) | Easy | B75, N150 | [solution](<markdowns/_121. Best Time to Buy and Sell Stock.md>) | py |
@@ -139,11 +141,13 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
139141
| 426 | [Convert Binary Search Tree to Sorted Doubly Linked List](<https://leetcode.com/problems/convert-binary-search-tree-to-sorted-doubly-linked-list>) | Medium | | [solution](<markdowns/_426. Convert Binary Search Tree to Sorted Doubly Linked List.md>) | py |
140142
| 430 | [Flatten a Multilevel Doubly Linked List](<https://leetcode.com/problems/flatten-a-multilevel-doubly-linked-list>) | Medium | | [solution](<markdowns/_430. Flatten a Multilevel Doubly Linked List.md>) | java, cpp |
141143
| 431 | [Encode N-ary Tree to Binary Tree](<https://leetcode.com/problems/encode-n-ary-tree-to-binary-tree>) | Hard | | [solution](<markdowns/_431. Encode N-ary Tree to Binary Tree.md>) | java, py |
144+
| 437 | [Path Sum III](<https://leetcode.com/problems/path-sum-iii>) | Medium | | [solution](<markdowns/_437. Path Sum III.md>) | py |
142145
| 450 | [Delete Node in a BST](<https://leetcode.com/problems/delete-node-in-a-bst>) | Medium | | [solution](<markdowns/_450. Delete Node in a BST.md>) | py |
143146
| 451 | [Sort Characters By Frequency](<https://leetcode.com/problems/sort-characters-by-frequency>) | Medium | | [solution](<markdowns/_451. Sort Characters By Frequency.md>) | py |
144147
| 475 | [Heaters](<https://leetcode.com/problems/heaters>) | Medium | | [solution](<markdowns/_475. Heaters.md>) | py |
145148
| 502 | [IPO](<https://leetcode.com/problems/ipo>) | Hard | Daily | [solution](<markdowns/_502. IPO.md>) | py |
146149
| 509 | [Fibonacci Number](<https://leetcode.com/problems/fibonacci-number>) | Easy | | [solution](<markdowns/_509. Fibonacci Number.md>) | c |
150+
| 513 | [Find Bottom Left Tree Value](<https://leetcode.com/problems/find-bottom-left-tree-value>) | Medium | | [solution](<markdowns/_513. Find Bottom Left Tree Value.md>) | java |
147151
| 523 | [Continuous Subarray Sum](<https://leetcode.com/problems/continuous-subarray-sum>) | Medium | Daily | [solution](<markdowns/_523. Continuous Subarray Sum.md>) | py |
148152
| 535 | [Encode and Decode TinyURL](<https://leetcode.com/problems/encode-and-decode-tinyurl>) | Medium | | [solution](<markdowns/_535. Encode and Decode TinyURL.md>) | py |
149153
| 542 | [01 Matrix](<https://leetcode.com/problems/01-matrix>) | Medium | | [solution](<markdowns/_542. 01 Matrix.md>) | py |
@@ -165,7 +169,9 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
165169
| 654 | [Maximum Binary Tree](<https://leetcode.com/problems/maximum-binary-tree>) | Medium | | [solution](<markdowns/_654. Maximum Binary Tree.md>) | py |
166170
| 663 | [Equal Tree Partition](<https://leetcode.com/problems/equal-tree-partition>) | Medium | Daily | [solution](<markdowns/_663. Equal Tree Partition.md>) | py |
167171
| 665 | [Non-decreasing Array](<https://leetcode.com/problems/non-decreasing-array>) | Medium | | [solution](<markdowns/_665. Non-decreasing Array.md>) | java, py |
172+
| 666 | [Path Sum IV](<https://leetcode.com/problems/path-sum-iv>) | Medium | | [solution](<markdowns/_666. Path Sum IV.md>) | py |
168173
| 676 | [Implement Magic Dictionary](<https://leetcode.com/problems/implement-magic-dictionary>) | Medium | | [solution](<markdowns/_676. Implement Magic Dictionary.md>) | py |
174+
| 687 | [Longest Univalue Path](<https://leetcode.com/problems/longest-univalue-path>) | Medium | | [solution](<markdowns/_687. Longest Univalue Path.md>) | py |
169175
| 690 | [Employee Importance](<https://leetcode.com/problems/employee-importance>) | Medium | | [solution](<markdowns/_690. Employee Importance.md>) | java |
170176
| 692 | [Top K Frequent Words](<https://leetcode.com/problems/top-k-frequent-words>) | Medium | | [solution](<markdowns/_692. Top K Frequent Words.md>) | py |
171177
| 695 | [Max Area of Island](<https://leetcode.com/problems/max-area-of-island>) | Medium | N150 | [solution](<markdowns/_695. Max Area of Island.md>) | c |
@@ -357,6 +363,7 @@ Profile: [Zanger](https://leetcode.com/u/Zanger/)
357363
| 3074 | [Apple Redistribution into Boxes](<https://leetcode.com/problems/apple-redistribution-into-boxes>) | Easy | | [solution](<markdowns/_3074. Apple Redistribution into Boxes.md>) | py |
358364
| 3106 | [Lexicographically Smallest String After Operations With Constraint](<https://leetcode.com/problems/lexicographically-smallest-string-after-operations-with-constraint>) | Medium | | [solution](<markdowns/_3106. Lexicographically Smallest String After Operations With Constraint.md>) | py |
359365
| 3110 | [Score of a String](<https://leetcode.com/problems/score-of-a-string>) | Easy | Daily | [solution](<markdowns/_3110. Score of a String.md>) | java, py |
366+
| 3136 | [Valid Word](<https://leetcode.com/problems/valid-word>) | Easy | | [solution](<markdowns/_3136. Valid Word.md>) | py, c |
360367
| 3168 | w contest 400 - q1 | Easy | Contest | [solution](<markdowns/_3168. w contest 400 - q.md>) | py |
361368
| 3169 | w contest 400 - q2 | Medium | Contest | [solution](<markdowns/_3169. w contest 400 - q.md>) | py |
362369
| 3174 | bw contest 132 - q1 | Easy | Contest | [solution](<markdowns/_3174. bw contest 132 - q.md>) | py |

0 commit comments

Comments
 (0)