Update readme

Author: ignacio-chiazzo

README.md

@@ -1,62 +1,60 @@
 # Algorithms-Javascript
 
-
+Solutions of algorithm problems using Javascript
 
 ### Leetcode Problems
 
 | Name | Level | Link | 
 | - | - | - |
+| [Edit Distance ](/LeetcodeProblems/Edit_Distance.js)                                                 | Hard   | https://leetcode.com/problems/edit-distance/ |
+| [Longest Consecutive Sequence ](/LeetcodeProblems/Longest_Consecutive_Sequence.js)                   | Hard   | https://leetcode.com/problems/longest-consecutive-sequence/ |
+| [Minimum Window Substring ](/LeetcodeProblems/Minimum_Window_Substring.js)                           | Hard   | https://leetcode.com/problems/minimum-window-substring/ |
+| [Regular Expression Matching ](/LeetcodeProblems/Regular_Expression_Matching.js)                     | Hard   | https://leetcode.com/problems/regular-expression-matching/ |
+| [NQueens ](/LeetcodeProblems/NQueens.js)                                                             | Hard   | https://leetcode.com/problems/n-queens/ |
+| [merge k sorted lists ](/LeetcodeProblems/merge_k_sorted_lists.js)                                   | Hard   | https://leetcode.com/problems/merge-k-sorted-lists/ |
 | [3Sum ](/LeetcodeProblems/3Sum.js)                                                                   | Medium | https://leetcode.com/problems/3sum/ | 
 | [Add Two Numbers ](/LeetcodeProblems/Add_Two_Numbers.js)                                             | Medium | https://leetcode.com/problems/add-two-numbers/  |
-| [Backspace String Compare ](/LeetcodeProblems/Backspace_String_Compare.js)                           | Easy   | https://leetcode.com/problems/backspace-string-compare/ |
-| [Binary Gap ](/LeetcodeProblems/Binary_Gap.js)                                                       | Easy   | https://leetcode.com/problems/binary-gap/ |
 | [Clone Graph ](/LeetcodeProblems/Clone_Graph.js)                                                     | Medium | https://leetcode.com/problems/clone-graph/ |
 | [Coin Change ](/LeetcodeProblems/Coin_Change.js)                                                     | Medium | https://leetcode.com/problems/coin-change/ |
-| [Construct Binary Tree from Preorder and Inorder Traversal ](/LeetcodeProblems/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.js)   | Medium | https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ | 
 | [Design Circular Deque ](/LeetcodeProblems/Design_Circular_Deque.js)                                 | Medium | https://leetcode.com/problems/design-circular-deque/
-| [Edit Distance ](/LeetcodeProblems/Edit_Distance.js)                                                 | Hard   | https://leetcode.com/problems/edit-distance/ |
 | [Escape The Ghosts ](/LeetcodeProblems/Escape_The_Ghosts.js)                                         | Medium | https://leetcode.com/problems/escape-the-ghosts/ |
-| [Flood Fill ](/LeetcodeProblems/Flood_Fill.js)                                                       | Easy   | https://leetcode.com/problems/flood-fill/ |
 | [Generate Parenthesis ](/LeetcodeProblems/Generate_Parenthesis.js)                                   | Medium | https://leetcode.com/problems/generate-parentheses | 
 | [Group Anagrams ](/LeetcodeProblems/Group_Anagrams.js)                                               | Medium | https://leetcode.com/problems/group-anagrams/
-| [Implement stack using queues ](/LeetcodeProblems/Implement_stack_using_queues.js)                   | Easy   | https://leetcode.com/problems/implement-stack-using-queues/ |
 | [Kth Largest Element in an Array ](/LeetcodeProblems/Kth_Largest_Element_in_an_Array.js)             | Medium | https://leetcode.com/problems/kth-largest-element-in-an-array/ |
 | [Linked List Cycle II ](/LeetcodeProblems/Linked_List_Cycle_II.js)                                   | Medium | https://leetcode.com/problems/linked-list-cycle-ii/ |
-| [Longest Consecutive Sequence ](/LeetcodeProblems/Longest_Consecutive_Sequence.js)                   | Hard   | https://leetcode.com/problems/longest-consecutive-sequence/ |
 | [Longest Palindromic Substring ](/LeetcodeProblems/Longest_Palindromic_Substring.js)                 | Medium | https://leetcode.com/problems/longest-palindromic-substring/ |
-| [Lowest Common Ancestor of a Binary Tree ](/LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree.js) | Medium | https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/ |
 | [Maximal Square ](/LeetcodeProblems/Maximal_Square.js)                                               | Medium | https://leetcode.com/problems/maximal-square/ |
-| [Maximun Subarray ](/LeetcodeProblems/Maximun_Subarray.js)                                           | Easy   | https://leetcode.com/problems/maximum-subarray |
-| [Min Stack ](/LeetcodeProblems/Min_Stack.js)                                                         | Easy   | https://leetcode.com/problems/min-stack/ |  
-| [Minimum Window Substring ](/LeetcodeProblems/Minimum_Window_Substring.js)                           | Hard   | https://leetcode.com/problems/minimum-window-substring/ |
-| [NQueens ](/LeetcodeProblems/NQueens.js)                                                             | Hard   | https://leetcode.com/problems/n-queens/ |
-| [Number of Segments in a String ](/LeetcodeProblems/Number_of_Segments_in_a_String.js)               | Easy   | https://leetcode.com/problems/number-of-segments-in-a-string/ |
 | [Permutations ](/LeetcodeProblems/Permutations.js)                                                   | Medium | https://leetcode.com/problems/permutations/ |
 | [Permutations II ](/LeetcodeProblems/Permutations_II.js)                                             | Medium | https://leetcode.com/problems/permutations-ii/ |
 | [Permutations Without Duplicates ](/LeetcodeProblems/Permutations_Without_Duplicates.js)             | Medium | https://leetcode.com/problems/permutations/ |
-| [Regular Expression Matching ](/LeetcodeProblems/Regular_Expression_Matching.js)                     | Hard   | https://leetcode.com/problems/regular-expression-matching/ |
 | [Restore IP Addresses ](/LeetcodeProblems/Restore_IP_Addresses.js)                                   | Medium | https://leetcode.com/problems/restore-ip-addresses/ |
-| [Reverse String II ](/LeetcodeProblems/Reverse_String_II.js)                                         | Easy   | https://leetcode.com/problems/reverse-string-ii/ | 
-| [Same Tree ](/LeetcodeProblems/Same_Tree.js)                                                         | Easy   | https://leetcode.com/problems/same-tree/ |
 | [SearchIng Rotated Sorted Array ](/LeetcodeProblems/SearchIng_Rotated_Sorted_Array.js)               | Medium | https://leetcode.com/problems/search-in-rotated-sorted-array/ |
 | [Search a 2D Matrix ](/LeetcodeProblems/Search_a_2D_Matrix.js)                                       | Medium | https://leetcode.com/problems/search-a-2d-matrix/ |
 | [Search a 2D Matrix II ](/LeetcodeProblems/Search_a_2D_Matrix_II.js)                                 | Medium | https://leetcode.com/problems/search-a-2d-matrix/ |
 | [Simplify Path ](/LeetcodeProblems/Simplify_Path.js)                                                 | Medium | https://leetcode.com/problems/simplify-path/ |
 | [Spiral Matrix ](/LeetcodeProblems/Spiral_Matrix.js)                                                 | Medium | https://leetcode.com/problems/spiral-matrix/ |
 | [Subsets ](/LeetcodeProblems/Subsets.js)                                                             | Medium | https://leetcode.com/problems/subsets/ |
-| [Sum Of Square Numbers ](/LeetcodeProblems/Sum_Of_Square_Numbers.js)                                 | Easy   | https://leetcode.com/problems/sum-of-square-numbers/ |
-| [Symmetric Tree ](/LeetcodeProblems/Symmetric_Tree.js)                                               | Easy   | https://leetcode.com/problems/symmetric-tree/ |
 | [Unique Binary Search Trees ](/LeetcodeProblems/Unique_Binary_Search_Trees.js)                       | Medium | https://leetcode.com/problems/unique-binary-search-trees/ |
 | [Unique Paths ](/LeetcodeProblems/Unique_Paths.js)                                                   | Medium | https://leetcode.com/problems/unique-paths/ |
-| [Valid Parentheses ](/LeetcodeProblems/Valid_Parentheses.js)                                         | Easy   | https://leetcode.com/problems/valid-parentheses/ |
 | [Verify Preorder Serialization of a Binary Tree ](/LeetcodeProblems/Verify_Preorder_Serialization_of_a_Binary_Tree.js)              | Medium | https://leetcode.com/problems/verify-preorder-serialization-of-a-binary-tree/ |
-| [merge k sorted lists ](/LeetcodeProblems/merge_k_sorted_lists.js)                                   | Hard   | https://leetcode.com/problems/merge-k-sorted-lists/ |
+| [Construct Binary Tree from Preorder and Inorder Traversal ](/LeetcodeProblems/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal.js)   | Medium | https://leetcode.com/problems/construct-binary-tree-from-preorder-and-inorder-traversal/ | 
+| [Lowest Common Ancestor of a Binary Tree ](/LeetcodeProblems/Lowest_Common_Ancestor_of_a_Binary_Tree.js) | Medium | https://leetcode.com/problems/lowest-common-ancestor-of-a-binary-tree/ |
+| [Flood Fill ](/LeetcodeProblems/Flood_Fill.js)                                                       | Easy   | https://leetcode.com/problems/flood-fill/ |
+| [Implement stack using queues ](/LeetcodeProblems/Implement_stack_using_queues.js)                   | Easy   | https://leetcode.com/problems/implement-stack-using-queues/ |
+| [Number of Segments in a String ](/LeetcodeProblems/Number_of_Segments_in_a_String.js)               | Easy   | https://leetcode.com/problems/number-of-segments-in-a-string/ |
+| [Maximun Subarray ](/LeetcodeProblems/Maximun_Subarray.js)                                           | Easy   | https://leetcode.com/problems/maximum-subarray |
+| [Min Stack ](/LeetcodeProblems/Min_Stack.js)                                                         | Easy   | https://leetcode.com/problems/min-stack/ |  
+| [Reverse String II ](/LeetcodeProblems/Reverse_String_II.js)                                         | Easy   | https://leetcode.com/problems/reverse-string-ii/ | 
+| [Same Tree ](/LeetcodeProblems/Same_Tree.js)                                                         | Easy   | https://leetcode.com/problems/same-tree/ |
+| [Sum Of Square Numbers ](/LeetcodeProblems/Sum_Of_Square_Numbers.js)                                 | Easy   | https://leetcode.com/problems/sum-of-square-numbers/ |
+| [Symmetric Tree ](/LeetcodeProblems/Symmetric_Tree.js)                                               | Easy   | https://leetcode.com/problems/symmetric-tree/ |
+| [Valid Parentheses ](/LeetcodeProblems/Valid_Parentheses.js)                                         | Easy   | https://leetcode.com/problems/valid-parentheses/ |
+| [Backspace String Compare ](/LeetcodeProblems/Backspace_String_Compare.js)                           | Easy   | https://leetcode.com/problems/backspace-string-compare/ |
+| [Binary Gap ](/LeetcodeProblems/Binary_Gap.js)                                                       | Easy   | https://leetcode.com/problems/binary-gap/ |
 | [Tic Tac Toe ](/LeetcodeProblems/Tic_Tac_Toe.js)                                                     |        | |
 | [Permutations With Duplicates ](/LeetcodeProblems/Permutations_With_Duplicates.js)                   |        | |
 | [Deleteion Distance](/LeetcodeProblems/Deletion_Distance.js)                                         |        | |
 
-
-
 ### Sorting Algorithms
 | Algoritmhs |
 |      -     |