Update README.md

Author: safrannn

README.md

@@ -1,5 +1,67 @@
 # leetcode_rust
 leetcode practise solution in rust
 
-### Test:
-example: `cargo test --lib n0001_two_sum`
+### Finished problems:
+|id|Solution| 
+|---|---|
+||[](src/.rs)|
+|1|[Two Sum](src/_0001_two_sum.rs)|
+|2|[Add Two Numbers](src/_0002_add_two_numbers.rs)|
+|3|[Longest Substring Without Repeating Characters](src/_0003_longest_substring_without_repeating_characters.rs)|
+|5|[Longest Palindromic Substring](src/_0005_longest_palindromic_substring.rs)|
+|7|[Reverse Integer    ](src/_0007_reverse_integer.rs)|
+|9|[Palindrome Number ](src/_0009_palindrome_number.rs)|
+|11|[Container With Most Water](src/_0011_container_with_most_water.rs)|
+|14|[Longest Common Prefix](src/_0014_longest_common_prefix.rs)|
+|15|[3Sum](src/_0015_3sum.rs)|
+|17|[Letter Combinations of a Phone Number](src/_0017_letter_combinations_of_a_phone_number.rs)|
+|20|[Valid Parentheses](src/_0020_valid_parentheses.rs)|
+|21|[Merge Two Sorted Lists ](src/_0021_merge_two_sorted_lists.rs)|
+|22|[Generate Parentheses ](src/_0022_generate_parentheses.rs)|
+|34|[Find First and Last Position of Element in Sorted Array](src/_0034_find_first_and_last_position_of_element_in_sorted_array.rs)|
+|36|[Valid Sudoku  ](src/_0036_valid_sudoku.rs)|
+|38|[Count and Say](src/_0038_count_and_say.rs)|
+|46|[Permutations](src/_0046_permutations.rs)|
+|49|[Group Anagrams](src/_0049_group_anagrams.rs)|
+|53|[Maximum Subarray](src/_0053_maximum_subarray.rs)|
+|56|[Merge Intervals](src/_0056_merge_intervals.rs)|
+|66|[Plus One](src/_0066_plus_one.rs)|
+|67|[Add Binary](src/_0067_add_binary.rs)|
+|70|[Climbing Stairs](src/_0070_climbing_stairs.rs)|
+|74|[Search a 2D Matrix](src/_0074_search_a_2d_matrix.rs)|
+|78|[Subsets](src/_0078_subsets.rs)|
+|79|[Word Search](src/_0079_word_search)|
+|83|[Remove Duplicates from Sorted List](src/_0083_remove_duplicates_from_sorted_list.rs)|
+|88|[Merge Sorted Array](src/_0088_merge_sorted_array.rs)|
+|91|[Decode Ways](src/_0091_decode_ways.rs)|
+|101|[Symmetric Tree](src/_0101_symmetric_tree.rs)|
+|103|[Binary Tree Zigzag Level Order Traversal](src/_0103_binary_tree_zigzag_level_order_traversal.rs)|
+|104|[Maximum Depth of Binary Tree](src/_0104_maximum_depth_of_binary_tree.rs)|
+|110|[Balanced Binary Tree](src/_0110_balanced_binary_tree.rs)|
+|121|[Best Time to Buy and Sell Stock](src/_0121_best_time_to_buy_and_sell_stock.rs)|
+|122|[Best Time to Buy and Sell Stock II](src/_0122_best_time_to_buy_and_sell_stock_ii.rs)|
+|125|[Valid Palindrome](src/_0125_valid_palindrome.rs)|
+|127|[Word Ladder](src/_0127_word_ladder.rs)|
+|136|[Single Number](src/_0136_single_number.rs)|
+|155|[Min Stack](src/_0155_min_stack.rs)|
+|167|[Two Sum II - Input array is sorted](src/_0167_two_sum_ii.rs)|
+|169|[Majority Element](src/_0169_majority_element.rs)|
+|189|[Rotate Array](src/_0189_rotate_array.rs)|
+|198|[House Robber](src/_0198_house_robber.rs)|
+|200|[Number of Islands](src/_0200_number_of_islands.rs)|
+|202|[Happy Number](src/_0202_happy_number.rs)|
+|204|[Count Primes](src/_0204_count_primes.rs)|
+|205|[Isomorphic Strings](src/_0205_isomorphic_strings.rs)|
+|206|[Reverse Linked List](src/_0206_reverse_linked_list.rs)|
+|207|[Course Schedule](src/_0207_course_schedule.rs)|
+|210|[Course Schedule II](src/_0210_course_schedule_ii.rs)|
+|211|[Design Add and Search Words Data Structure](src/_0211_add_and_search_word_data_structure_design.rs)|
+|213|[House Robber II](src/_0213_house_robber_ii.rs)|
+|215|[Kth Largest Element in an Array](src/_0215_kth_largest_element_in_an_array.rs)|
+|219|[Contains Duplicate II](src/_0219_contains_duplicate_ii.rs)|
+|221|[Maximal Square](src/_0221_maximal_square.rs)|
+|234|[Palindrome Linked List](src/_0234_palindrome_linked_list.rs)|
+|238|[Product of Array Except Self](src/_0238_product_of_array_except_self.rs)|
+|242|[Valid Anagram](src/_0242_valid_anagram.rs)|
+|243|[Shortest Word Distance](src/_0243_shortest_word_distance.rs)|
+|252|[Meeting Rooms](src/_0252_meeting_rooms.rs)|