You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: README.md
+2Lines changed: 2 additions & 0 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -9,6 +9,8 @@ organizing the questions by category and linked to the solution I wrote for each
9
9
| 56 |[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| Sort the intervals by increasing start time. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0056_merge_intervals.py)||
10
10
| 66 |[Plus One](https://leetcode.com/problems/plus-one/)| Try iterating through each digit backwards. What do you do when the digit is a 9? |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0066_plus_one.py)||
11
11
| 88 |[Merge Sorted Array](https://leetcode.com/problems/merge-sorted-array/)| Look at one element from each of the arrays, compare them, and make a decision depending on their relation to each other. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0088_merge_sorted_arrays.py)||
12
+
| 94 |[Binary Tree Inorder Traversal](https://leetcode.com/problems/binary-tree-inorder-traversal/)| Make sure you know how to implement this recursively. The iterative solution is a lot trickier. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/74ae6c933f170aa828fe2d9833a55ff98a3e6642/python_solutions/0094_binary_tree_inorder_traversal.py)||
13
+
| 102 |[Binary Tree Level Order Traversal](https://leetcode.com/problems/binary-tree-level-order-traversal/)| Keep track of the child nodes of ALL the nodes in the current level. That will be the next level you will traverse. Rinse and repeat until none of the nodes in the current level have children. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0122_best_time_to_buy_and_sell_stock_II.py)||
12
14
| 122 |[Best Time to Buy and Sell Stock II](https://leetcode.com/problems/best-time-to-buy-and-sell-stock-ii/solution/)| What should we do every time there is a valley followed by a peak in price? |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0122_best_time_to_buy_and_sell_stock_II.py)||
13
15
| 206 |[Reverse Linked List](https://leetcode.com/problems/reverse-linked-list/)| Try a recursive solution. Split the list up into the first node and the rest of the list. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0206_reverse_linked_list.py)||
14
16
| 217 |[Contains Duplicate](https://leetcode.com/problems/contains-duplicate/)| Maintain a hash set that keeps track of the numbers we've encountered so far. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0217_contains_duplicate.py)||
0 commit comments