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
+12-1Lines changed: 12 additions & 1 deletion
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -10,4 +10,15 @@ organizing the questions by category and linked to the solution I wrote for each
10
10
| 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)||
11
11
| 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)||
12
12
| 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)||
13
-
| 344 |[Reverse String](https://leetcode.com/problems/reverse-string)| Use the two pointer approach. Try implementing an iterative and recursive solution. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0344_reverse_string.py)||
13
+
| 344 |[Reverse String](https://leetcode.com/problems/reverse-string)| Use the two pointer approach. Try implementing an iterative and recursive solution. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0344_reverse_string.py)||
14
+
| 392 |[Is Subsequence](https://leetcode.com/problems/is-subsequence/)| Use two pointers to iterate through the two strings simultaneously. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0392_is_subsequence.py)||
15
+
| 409 |[Longest Palindrome](https://leetcode.com/problems/longest-palindrome/)| Create a hash table keeping track of the number of occurrences of each character. How many of each can we include in our longest palindrome? |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0409_longest_palindrome.py)||
16
+
| 455 |[Assign Cookies](https://leetcode.com/problems/assign-cookies/)| Sort the greed factors and cookies in decreasing (or increasing) order. What can we do with these sorted versions of the inputs? |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0455_assign_cookies.py)||
17
+
| 763 |[Partition Labels](https://leetcode.com/problems/partition-labels/)| How can be apply a modified version of the [merge intervals algorithm](https://leetcode.com/problems/merge-intervals/) to solve this question? |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0763_partition_labels.py)||
18
+
| 771 |[Jewels and Stones](https://leetcode.com/problems/jewels-and-stones/)||[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0771_jewels_and_stones.py)||
19
+
| 921 |[Minimum Add to Make Parentheses Valid](https://leetcode.com/problems/minimum-add-to-make-parentheses-valid/)| Keep track of the number of open "(" parens as you iterate through the sequence. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0921_minimum_add_to_make_parentheses_valid.py)||
20
+
| 1002 |[Find Common Characters](https://leetcode.com/problems/find-common-characters/)| Keep track of the common characters and their occurrences in a hash table. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/1002_find_common_characters.py)||
21
+
| 1207 |[Unique Number of Occurrences](https://leetcode.com/problems/unique-number-of-occurrences/)| Keep track of the numbers and their number of occurrences in a hash table. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/1207_unique_number_of_occurences.py)||
22
+
| 1338 |[Reduce Array Size to The Half](https://leetcode.com/problems/reduce-array-size-to-the-half/)| Create a max heap sorted by the number of occurrences of each number |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/1338_reduce_array_size_to_half.py)||
23
+
| 1338 |[How Many Numbers Are Smaller Than the Current Number](https://leetcode.com/problems/how-many-numbers-are-smaller-than-the-current-number/)| Maintain a running sum in an array |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/1365_how_many_numbers_are_smaller_than_current_number.py)||
24
+
| 1512 |[Number of Good Pairs](https://leetcode.com/problems/number-of-good-pairs/)| Keep track of number of occurrences in a hash table. |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/1512_number_of_good_pairs.py)||
0 commit comments