Update README.md

Author: das-jishu

README.md

@@ -60,20 +60,20 @@ The questions are not ordered so you might need to search for a bit.
 | :star: | Array of Products | :blue_square: | [array-of-products.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/array-of-products.py) |
 | :star: | First Duplicate Value | :blue_square: | [first-duplicate-value.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/first-duplicate-value.py) |
 | :star: | Merge Overlapping Intervals | :blue_square: | [merge-overlapping-intervals.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/merge-overlapping-intervals.py) |
-| :star: | BST Construction | :blue_square: | [bST-construction.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/bST-construction.py) |
-| :star: | Validate BST | :blue_square: | [validate-bST.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/validate-bST.py) |
-| :star: | BST Traversal | :blue_square: | [bST-traversal.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/bST-traversal.py) |
-| :star: | Min Height BST | :blue_square: | [min-height-bST.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/min-height-bST.py) |
-| :star: | Find Kth Largest Value In BST | :blue_square: | [find-kth-largest-value-in-bST.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/find-kth-largest-value-in-bST.py) |
-| :star: | Reconstruct BST | :blue_square: | [reconstruct-bST.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/reconstruct-bST.py) |
+| :star: | BST Construction | :blue_square: | [bst-construction.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/bst-construction.py) |
+| :star: | Validate BST | :blue_square: | [validate-bst.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/validate-bst.py) |
+| :star: | BST Traversal | :blue_square: | [bst-traversal.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/bst-traversal.py) |
+| :star: | Min Height BST | :blue_square: | [min-height-bst.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/min-height-BST.py) |
+| :star: | Find Kth Largest Value In BST | :blue_square: | [find-kth-largest-value-in-bst.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/find-kth-largest-value-in-bst.py) |
+| :star: | Reconstruct BST | :blue_square: | [reconstruct-bst.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/reconstruct-bst.py) |
 | :star: | Invert Binary Tree | :blue_square: | [invert-binary-tree.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/invert-binary-tree.py) |      
 | :star: | Binary Tree Diameter | :blue_square: | [binary-tree-diameter.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/binary-tree-diameter.py) || :star: | Find Successor | :blue_square: | [find-successor.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/find-successor.py) |
 | :star: | Height Balanced Binary Tree | :blue_square: | [height-balanced-binary-tree.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/height-balanced-binary-tree.py) |
 | :star: | Max Subset Sum No Adjacent | :blue_square: | [max-subset-sum-no-adjacent.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/max-subset-sum-no-adjacent.py) |
-| :star: | Number of Ways to Make Change | :blue_square: | [number-of-ways-to-make-change.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/number-of-ways-to-make-change.py) |
+| :star: | Number of Ways to Make Change | :blue_square: | [ways-to-make-change.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/ways-to-make-change.py) |
 | :star: | Min Number of Coins for Change | :blue_square: | [min-number-of-coins-for-change.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/min-number-of-coins-for-change.py) |
 | :star: | Levenshtein Distance | :blue_square: | [levenshtein-distance.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/levenshtein-distance.py) || :star: | Number of Ways to Traverse Graph | :blue_square: | [number-of-ways-to-traverse-graph.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/number-of-ways-to-traverse-graph.py) |
-| :star: | Kadane's Algorithm | :blue_square: | [kadane's-algorithm.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/kadane's-algorithm.py) |      
+| :star: | Kadane's Algorithm | :blue_square: | [kadane's-algorithm.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/kadane-algorithm.py) |      
 | :star: | Single Cycle Check | :blue_square: | [single-cycle-check.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/single-cycle-check.py) |      
 | :star: | Breadth First Search | :blue_square: | [breadth-first-search.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/breadth-first-search.py) || :star: | River Sizes | :blue_square: | [river-sizes.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/river-sizes.py) |
 | :star: | Youngest Common Ancestor | :blue_square: | [youngest-common-ancestor.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/youngest-common-ancestor.py) |
@@ -98,7 +98,7 @@ The questions are not ordered so you might need to search for a bit.
 | :star: | Sort Stack | :blue_square: | [sort-stack.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/sort-stack.py) |
 | :star: | Next Greater Element | :blue_square: | [next-greater-element.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/next-greater-element.py) || :star: | Longest Palindromic Substring | :blue_square: | [longest-palindromic-substring.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/longest-palindromic-substring.py) |
 | :star: | Group Anagrams | :blue_square: | [group-anagrams.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/group-anagrams.py) |
-| :star: | Valid IP Addresses | :blue_square: | [valid-iP-addresses.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/valid-iP-addresses.py) |      
+| :star: | Valid IP Addresses | :blue_square: | [valid-ip-addresses.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/valid-ip-addresses.py) |      
 | :star: | Reverse Words In String | :blue_square: | [reverse-words-in-string.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/reverse-words-in-string.py) |
 | :star: | Minimum Characters For Words | :blue_square: | [minimum-characters-for-words.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/minimum-characters-for-words.py) |
 | :star: | Suffix Trie Construction | :blue_square: | [suffix-trie-construction.py](https://github.com/das-jishu/algoexpert-data-structures-algorithms/blob/master/Medium/suffix-trie-construction.py) |