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 e601c9c

Browse files
Initialize empty column for C++ solution
1 parent 50386d7 commit e601c9c

File tree

1 file changed

+7
-7
lines changed

1 file changed

+7
-7
lines changed

‎README.md

Lines changed: 7 additions & 7 deletions
Original file line numberDiff line numberDiff line change
@@ -4,16 +4,16 @@ organizing the questions by category and linked to the solution I wrote for each
44

55
| Number | Question | Hints | Python Solution | C++ Solution |
66
|:------:|:--------:|-------|:---------------:|:------------:|
7-
| 1 |[Two Sum](https://leetcode.com/problems/two-sum/) | Use a hash table | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0001_two_sum.py) |
7+
| 1 |[Two Sum](https://leetcode.com/problems/two-sum/) | Use a hash table | [Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0001_two_sum.py) ||
88

9-
| 56 |[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| Use a stack |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0056_merge_intervals.py) |
9+
| 56 |[Merge Intervals](https://leetcode.com/problems/merge-intervals/)| Use a stack |[Python Solution](https://github.com/codethecoffee/leetcode-solutions/blob/master/python_solutions/0056_merge_intervals.py) ||
1010

11-
| 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+
| 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)||
1212

13-
| 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)|
13+
| 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)||
1414

15-
| 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) |
15+
| 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) ||
1616

17-
| 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) |
17+
| 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) ||
1818

19-
| 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)|
19+
| 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)||

0 commit comments

Comments
(0)

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