Automatic commit - write stats to README

README.md

@@ -15,3 +15,72 @@ be functions that starts with `simple_` keyword.
 After the solution is correct, I should iterate more to find better or different implementation. This will force me 
 to think more about problem and to obtain better understanding.
 
+
+### Problems solved
+
+:white_circle: Easy: 8
+
+::large_blue_circle: Medium: 8
+
+:red_circle: Hard: 1
+
+__Total__: 17
+
+### Solutions
+
+1. :white_circle: [Best Time To Buy And Sell Stock](./leetCode/121_best_time_to_buy_and_sell_stock.py)
+2. :white_circle: [Single Number](./leetCode/136_single_number.py)
+3. :large_blue_circle: [Two Sum II - Input Array Is Sorted](./leetCode/167_two_sum_ii.py)
+4. :white_circle: [Two Sum](./leetCode/1_two_sum.py)
+5. :white_circle: [Merge Two Sorted Lists](./leetCode/21_merge_two_sorted_lists.py)
+6. :white_circle: [Remove Duplicates From Sorted Array](./leetCode/26_remove_duplicates_sorted_array.py)
+7. :large_blue_circle: [Add Two Numbers](./leetCode/2_add_two_numbers.py)
+8. :large_blue_circle: [Rotate Image](./leetCode/48_rotate_image.py)
+9. :large_blue_circle: [Maximum Subarray](./leetCode/53_maximum_subarray.py)
+10. :large_blue_circle: [Spiral Matrix](./leetCode/54_spiral_matrix.py)
+11. :large_blue_circle: [Longest Palindromic Substring](./leetCode/5_longest_palindromic_substring.py)
+12. :large_blue_circle: [Search A 2D Matrix](./leetCode/74_search_2d_matrix.py)
+13. :white_circle: [Palindrome Number](./leetCode/9_palindrome_number.py)
+14. :large_blue_circle: [Sort List](./leetCode/linked-list/148_sort_list.py)
+15. :white_circle: [Palindrome Linked List](./leetCode/linked-list/234_palindrome_linked_list.py)
+16. :red_circle: [Merge K Sorted Lists](./leetCode/linked-list/23_merge_k_sorted_lists.py)
+17. :white_circle: [Middle Of The Linked List](./leetCode/linked-list/876_middle_of_the_linked_list.py)
+
+### Tags by count
+
+1. **Array**: 9
+
+2. **Linked List**: 6
+
+3. **Two Pointers**: 5
+
+4. **Dynamic Programming**: 3
+
+5. **Recursion**: 3
+
+6. **Math**: 3
+
+7. **Matrix**: 3
+
+8. **Binary Search**: 2
+
+9. **Divide And Conquer**: 2
+
+10. **Merge Sort**: 2
+
+11. **Bit Manipulation**: 1
+
+12. **Hash Table**: 1
+
+13. **Simulation**: 1
+
+14. **String**: 1
+
+15. **Divider And Conquer**: 1
+
+16. **Sorting**: 1
+
+17. **Stack**: 1
+
+18. **Heap (Priority Queue)**: 1
+