Skip to content

Commit 1e00d6a

Browse files
committed
Update README for problem 115
1 parent 1c95013 commit 1e00d6a

File tree

1 file changed

+2
-1
lines changed

1 file changed

+2
-1
lines changed

README.md

+2-1
Original file line numberDiff line numberDiff line change
@@ -55,7 +55,8 @@ LeetCode solutions in Go programming language.
5555
| 102 | Binary Tree Level Order Traversal | [Solution](problems/tree/binary_tree_level_order_traversal.go) | Medium | Binary Tree, BFS |
5656
| 104 | Maximum Depth Of Binary Tree | [Solution](problems/tree/maximum_depth_of_binary_tree.go) | Easy | Binary Tree, Recursion |
5757
| 105 | Construct Binary Tree From Preorder And Inorder Traversal | [Solution](problems/tree/construct_binary_tree_from_preorder_and_inorder_traversal.go) | Medium | Binary Tree, DFS |
58-
| 110 | Balanced Binary Tree | [Solution](problems/tree/balanced_binary_tree.go) | Easy | Binary Tree, DFs |
58+
| 110 | Balanced Binary Tree | [Solution](problems/tree/balanced_binary_tree.go) | Easy | Binary Tree, DFS |
59+
| 115 | Distinct Subsequences | [Solution](problems/dynamic_programming/distinct_subsequences.go) | Hard | Dynamic Programming |
5960
| 121 | Best Time To Buy And Sell Stocks | [Solution](problems/sliding_window/best_time_to_buy_and_sell_stocks.go) | Easy | Sliding Window |
6061
| 124 | Binary Tree Maximum Path Sum | [Solution](problems/tree/binary_tree_maximum_path_sum.go) | Hard | Binary Tree, DFS |
6162
| 125 | Valid Palindrome | [Solution](problems/strings/valid_palindrome.go) | Medium | String, Two Pointers |

0 commit comments

Comments
 (0)