Move problems to subfolders (#92)

ignacio-chiazzo · Oct 30, 2023 · 21e198d · 21e198d
2 parents 3c0d8f4 + 21e9249
commit 21e198d
Show file tree

Hide file tree

Showing 174 changed files with 235 additions and 209 deletions.
diff --git a/LeetcodeProblems/Algorithms/2Sum.js → LeetcodeProblems/Algorithms/easy/2Sum.js b/LeetcodeProblems/Algorithms/2Sum.js → LeetcodeProblems/Algorithms/easy/2Sum.js
diff --git a/...eProblems/Algorithms/Award_Budget_Cuts.js → ...lems/Algorithms/easy/Award_Budget_Cuts.js b/...eProblems/Algorithms/Award_Budget_Cuts.js → ...lems/Algorithms/easy/Award_Budget_Cuts.js
diff --git a/...ms/Algorithms/Backspace_String_Compare.js → ...gorithms/easy/Backspace_String_Compare.js b/...ms/Algorithms/Backspace_String_Compare.js → ...gorithms/easy/Backspace_String_Compare.js
diff --git a/LeetcodeProblems/Algorithms/Binary_Gap.js → ...odeProblems/Algorithms/easy/Binary_Gap.js b/LeetcodeProblems/Algorithms/Binary_Gap.js → ...odeProblems/Algorithms/easy/Binary_Gap.js
diff --git a/...eProblems/Algorithms/Deletion_Distance.js → ...lems/Algorithms/easy/Deletion_Distance.js b/...eProblems/Algorithms/Deletion_Distance.js → ...lems/Algorithms/easy/Deletion_Distance.js
diff --git a/LeetcodeProblems/Algorithms/Flood_Fill.js → ...odeProblems/Algorithms/easy/Flood_Fill.js b/LeetcodeProblems/Algorithms/Flood_Fill.js → ...odeProblems/Algorithms/easy/Flood_Fill.js
diff --git a/LeetcodeProblems/Algorithms/Happy_Number.js → ...eProblems/Algorithms/easy/Happy_Number.js b/LeetcodeProblems/Algorithms/Happy_Number.js → ...eProblems/Algorithms/easy/Happy_Number.js
diff --git a/...lgorithms/Implement_stack_using_queues.js → ...thms/easy/Implement_stack_using_queues.js b/...lgorithms/Implement_stack_using_queues.js → ...thms/easy/Implement_stack_using_queues.js
diff --git a/...blems/Algorithms/Longest_Common_Prefix.js → .../Algorithms/easy/Longest_Common_Prefix.js b/...blems/Algorithms/Longest_Common_Prefix.js → .../Algorithms/easy/Longest_Common_Prefix.js
diff --git a/...deProblems/Algorithms/Majority_Element.js → ...blems/Algorithms/easy/Majority_Element.js b/...deProblems/Algorithms/Majority_Element.js → ...blems/Algorithms/easy/Majority_Element.js
diff --git a/...deProblems/Algorithms/Maximun_Subarray.js → ...blems/Algorithms/easy/Maximun_Subarray.js b/...deProblems/Algorithms/Maximun_Subarray.js → ...blems/Algorithms/easy/Maximun_Subarray.js
diff --git a/LeetcodeProblems/Algorithms/Min_Stack.js → ...codeProblems/Algorithms/easy/Min_Stack.js b/LeetcodeProblems/Algorithms/Min_Stack.js → ...codeProblems/Algorithms/easy/Min_Stack.js
diff --git a/...orithms/Number_of_Segments_in_a_String.js → ...ms/easy/Number_of_Segments_in_a_String.js b/...orithms/Number_of_Segments_in_a_String.js → ...ms/easy/Number_of_Segments_in_a_String.js
diff --git a/...eProblems/Algorithms/Reverse_String_II.js → ...lems/Algorithms/easy/Reverse_String_II.js b/...eProblems/Algorithms/Reverse_String_II.js → ...lems/Algorithms/easy/Reverse_String_II.js
diff --git a/LeetcodeProblems/Algorithms/Same_Tree.js → ...codeProblems/Algorithms/easy/Same_Tree.js b/LeetcodeProblems/Algorithms/Same_Tree.js → ...codeProblems/Algorithms/easy/Same_Tree.js
diff --git a/...codeProblems/Algorithms/Shuffle_String.js → ...roblems/Algorithms/easy/Shuffle_String.js b/...codeProblems/Algorithms/Shuffle_String.js → ...roblems/Algorithms/easy/Shuffle_String.js
diff --git a/...blems/Algorithms/Sum_Of_Square_Numbers.js → .../Algorithms/easy/Sum_Of_Square_Numbers.js b/...blems/Algorithms/Sum_Of_Square_Numbers.js → .../Algorithms/easy/Sum_Of_Square_Numbers.js
diff --git a/...codeProblems/Algorithms/Symmetric_Tree.js → ...roblems/Algorithms/easy/Symmetric_Tree.js b/...codeProblems/Algorithms/Symmetric_Tree.js → ...roblems/Algorithms/easy/Symmetric_Tree.js
diff --git a/LeetcodeProblems/Algorithms/Tic_Tac_Toe.js → ...deProblems/Algorithms/easy/Tic_Tac_Toe.js b/LeetcodeProblems/Algorithms/Tic_Tac_Toe.js → ...deProblems/Algorithms/easy/Tic_Tac_Toe.js
diff --git a/...eProblems/Algorithms/Valid_Parentheses.js → ...lems/Algorithms/easy/Valid_Parentheses.js b/...eProblems/Algorithms/Valid_Parentheses.js → ...lems/Algorithms/easy/Valid_Parentheses.js
diff --git a/LeetcodeProblems/Algorithms/Edit_Distance.js → ...Problems/Algorithms/hard/Edit_Distance.js b/LeetcodeProblems/Algorithms/Edit_Distance.js → ...Problems/Algorithms/hard/Edit_Distance.js
diff --git a/...lgorithms/Longest_Consecutive_Sequence.js → ...thms/hard/Longest_Consecutive_Sequence.js b/...lgorithms/Longest_Consecutive_Sequence.js → ...thms/hard/Longest_Consecutive_Sequence.js
diff --git a/...ms/Algorithms/Minimum_Window_Substring.js → ...gorithms/hard/Minimum_Window_Substring.js b/...ms/Algorithms/Minimum_Window_Substring.js → ...gorithms/hard/Minimum_Window_Substring.js
diff --git a/LeetcodeProblems/Algorithms/NQueens.js → LeetcodeProblems/Algorithms/hard/NQueens.js b/LeetcodeProblems/Algorithms/NQueens.js → LeetcodeProblems/Algorithms/hard/NQueens.js
diff --git a/...Algorithms/Regular_Expression_Matching.js → ...ithms/hard/Regular_Expression_Matching.js b/...Algorithms/Regular_Expression_Matching.js → ...ithms/hard/Regular_Expression_Matching.js
diff --git a/.../Algorithms/Remove_Invalid_Parentheses.js → ...rithms/hard/Remove_Invalid_Parentheses.js b/.../Algorithms/Remove_Invalid_Parentheses.js → ...rithms/hard/Remove_Invalid_Parentheses.js
diff --git a/...eProblems/Algorithms/Set_Matrix_Zeroes.js → ...lems/Algorithms/hard/Set_Matrix_Zeroes.js b/...eProblems/Algorithms/Set_Matrix_Zeroes.js → ...lems/Algorithms/hard/Set_Matrix_Zeroes.js
diff --git a/...oblems/Algorithms/merge_k_sorted_lists.js → ...s/Algorithms/hard/merge_k_sorted_lists.js b/...oblems/Algorithms/merge_k_sorted_lists.js → ...s/Algorithms/hard/merge_k_sorted_lists.js
diff --git a/LeetcodeProblems/Algorithms/3Sum.js → LeetcodeProblems/Algorithms/medium/3Sum.js b/LeetcodeProblems/Algorithms/3Sum.js → LeetcodeProblems/Algorithms/medium/3Sum.js
diff --git a/LeetcodeProblems/Algorithms/3SumClosest.js → ...Problems/Algorithms/medium/3SumClosest.js b/LeetcodeProblems/Algorithms/3SumClosest.js → ...Problems/Algorithms/medium/3SumClosest.js
diff --git a/...odeProblems/Algorithms/Add_Two_Numbers.js → ...lems/Algorithms/medium/Add_Two_Numbers.js b/...odeProblems/Algorithms/Add_Two_Numbers.js → ...lems/Algorithms/medium/Add_Two_Numbers.js
@@ -21,7 +21,7 @@ Explanation: 342 + 465 = 807.
  *     this.next = null;
  * }
  */
-var ListNode = require("../../UtilsClasses/ListNode").ListNode;
+var ListNode = require("../../../UtilsClasses/ListNode").ListNode;
 
 /**
  * @param {ListNode} l1

diff --git a/...hms/Best_Time_To_Buy_And_Sell_Stock_II.js → ...ium/Best_Time_To_Buy_And_Sell_Stock_II.js b/...hms/Best_Time_To_Buy_And_Sell_Stock_II.js → ...ium/Best_Time_To_Buy_And_Sell_Stock_II.js
diff --git a/LeetcodeProblems/Algorithms/Clone_Graph.js → ...Problems/Algorithms/medium/Clone_Graph.js b/LeetcodeProblems/Algorithms/Clone_Graph.js → ...Problems/Algorithms/medium/Clone_Graph.js
diff --git a/LeetcodeProblems/Algorithms/Coin_Change.js → ...Problems/Algorithms/medium/Coin_Change.js b/LeetcodeProblems/Algorithms/Coin_Change.js → ...Problems/Algorithms/medium/Coin_Change.js
diff --git a/...ee_from_Preorder_and_Inorder_Traversal.js → ...ee_from_Preorder_and_Inorder_Traversal.js b/...ee_from_Preorder_and_Inorder_Traversal.js → ...ee_from_Preorder_and_Inorder_Traversal.js
@@ -27,7 +27,7 @@ Return the following binary tree:
  *     this.left = this.right = null;
  * }
  */
-var TreeNode = require("../../UtilsClasses/TreeNode").TreeNode;
+var TreeNode = require("../../../UtilsClasses/TreeNode").TreeNode;
 
 /**
  * @param {number[]} preorder

diff --git a/...s/Algorithms/Container_With_Most_Water.js → ...ithms/medium/Container_With_Most_Water.js b/...s/Algorithms/Container_With_Most_Water.js → ...ithms/medium/Container_With_Most_Water.js
diff --git a/...blems/Algorithms/Design_Circular_Deque.js → ...lgorithms/medium/Design_Circular_Deque.js b/...blems/Algorithms/Design_Circular_Deque.js → ...lgorithms/medium/Design_Circular_Deque.js
diff --git a/...eProblems/Algorithms/Escape_The_Ghosts.js → ...ms/Algorithms/medium/Escape_The_Ghosts.js b/...eProblems/Algorithms/Escape_The_Ghosts.js → ...ms/Algorithms/medium/Escape_The_Ghosts.js
diff --git a/LeetcodeProblems/Algorithms/Find_Anagrams.js → ...oblems/Algorithms/medium/Find_Anagrams.js b/LeetcodeProblems/Algorithms/Find_Anagrams.js → ...oblems/Algorithms/medium/Find_Anagrams.js
diff --git a/...gorithms/Find_Subarrays_With_Equal_Sum.js → ...s/medium/Find_Subarrays_With_Equal_Sum.js b/...gorithms/Find_Subarrays_With_Equal_Sum.js → ...s/medium/Find_Subarrays_With_Equal_Sum.js
diff --git a/LeetcodeProblems/Algorithms/Gas_Station.js → ...Problems/Algorithms/medium/Gas_Station.js b/LeetcodeProblems/Algorithms/Gas_Station.js → ...Problems/Algorithms/medium/Gas_Station.js
diff --git a/...oblems/Algorithms/Generate_Parenthesis.js → ...Algorithms/medium/Generate_Parenthesis.js b/...oblems/Algorithms/Generate_Parenthesis.js → ...Algorithms/medium/Generate_Parenthesis.js
diff --git a/...codeProblems/Algorithms/Group_Anagrams.js → ...blems/Algorithms/medium/Group_Anagrams.js b/...codeProblems/Algorithms/Group_Anagrams.js → ...blems/Algorithms/medium/Group_Anagrams.js
diff --git a/.../Algorithms/K_Closest_Points_to_Origin.js → ...thms/medium/K_Closest_Points_to_Origin.js b/.../Algorithms/K_Closest_Points_to_Origin.js → ...thms/medium/K_Closest_Points_to_Origin.js
diff --git a/...rithms/Kth_Largest_Element_in_an_Array.js → ...medium/Kth_Largest_Element_in_an_Array.js b/...rithms/Kth_Largest_Element_in_an_Array.js → ...medium/Kth_Largest_Element_in_an_Array.js
diff --git a/...oblems/Algorithms/Linked_List_Cycle_II.js → ...Algorithms/medium/Linked_List_Cycle_II.js b/...oblems/Algorithms/Linked_List_Cycle_II.js → ...Algorithms/medium/Linked_List_Cycle_II.js
diff --git a/...gorithms/Longest_Palindromic_Substring.js → ...s/medium/Longest_Palindromic_Substring.js b/...gorithms/Longest_Palindromic_Substring.js → ...s/medium/Longest_Palindromic_Substring.js
diff --git a/...eProblems/Algorithms/Longest_Substring.js → ...ms/Algorithms/medium/Longest_Substring.js b/...eProblems/Algorithms/Longest_Substring.js → ...ms/Algorithms/medium/Longest_Substring.js
diff --git a/...owest_Common_Ancestor_of_a_Binary_Tree.js → ...owest_Common_Ancestor_of_a_Binary_Tree.js b/...owest_Common_Ancestor_of_a_Binary_Tree.js → ...owest_Common_Ancestor_of_a_Binary_Tree.js
diff --git a/...Problems/Algorithms/Max_Area_Of_Island.js → ...s/Algorithms/medium/Max_Area_Of_Island.js b/...Problems/Algorithms/Max_Area_Of_Island.js → ...s/Algorithms/medium/Max_Area_Of_Island.js
diff --git a/...ms/Algorithms/Max_Consecutive_Ones_III.js → ...rithms/medium/Max_Consecutive_Ones_III.js b/...ms/Algorithms/Max_Consecutive_Ones_III.js → ...rithms/medium/Max_Consecutive_Ones_III.js
diff --git a/...codeProblems/Algorithms/Maximal_Square.js → ...blems/Algorithms/medium/Maximal_Square.js b/...codeProblems/Algorithms/Maximal_Square.js → ...blems/Algorithms/medium/Maximal_Square.js
diff --git a/...ems/Algorithms/Maximise_Hour_Glass_Sum.js → ...orithms/medium/Maximise_Hour_Glass_Sum.js b/...ems/Algorithms/Maximise_Hour_Glass_Sum.js → ...orithms/medium/Maximise_Hour_Glass_Sum.js
diff --git a/...hms/Minimize_Maximum_Pair_Sum_In_Array.js → ...ium/Minimize_Maximum_Pair_Sum_In_Array.js b/...hms/Minimize_Maximum_Pair_Sum_In_Array.js → ...ium/Minimize_Maximum_Pair_Sum_In_Array.js
diff --git a/.../Minimum_Add_To_Make_Parentheses_Valid.js → .../Minimum_Add_To_Make_Parentheses_Valid.js b/.../Minimum_Add_To_Make_Parentheses_Valid.js → .../Minimum_Add_To_Make_Parentheses_Valid.js
diff --git a/...blems/Algorithms/Minimum_Size_Subarray.js → ...lgorithms/medium/Minimum_Size_Subarray.js b/...blems/Algorithms/Minimum_Size_Subarray.js → ...lgorithms/medium/Minimum_Size_Subarray.js
diff --git a/...deProblems/Algorithms/Next_Permutation.js → ...ems/Algorithms/medium/Next_Permutation.js b/...deProblems/Algorithms/Next_Permutation.js → ...ems/Algorithms/medium/Next_Permutation.js
diff --git a/...eProblems/Algorithms/Number_of_Islands.js → ...ms/Algorithms/medium/Number_of_Islands.js b/...eProblems/Algorithms/Number_of_Islands.js → ...ms/Algorithms/medium/Number_of_Islands.js
diff --git a/LeetcodeProblems/Algorithms/Permutations.js → ...roblems/Algorithms/medium/Permutations.js b/LeetcodeProblems/Algorithms/Permutations.js → ...roblems/Algorithms/medium/Permutations.js
diff --git a/...odeProblems/Algorithms/Permutations_II.js → ...lems/Algorithms/medium/Permutations_II.js b/...odeProblems/Algorithms/Permutations_II.js → ...lems/Algorithms/medium/Permutations_II.js
diff --git a/...lems/Algorithms/Permutations_In_String.js → ...gorithms/medium/Permutations_In_String.js b/...lems/Algorithms/Permutations_In_String.js → ...gorithms/medium/Permutations_In_String.js
diff --git a/...lgorithms/Permutations_With_Duplicates.js → ...ms/medium/Permutations_With_Duplicates.js b/...lgorithms/Permutations_With_Duplicates.js → ...ms/medium/Permutations_With_Duplicates.js
diff --git a/...rithms/Permutations_Without_Duplicates.js → ...medium/Permutations_Without_Duplicates.js b/...rithms/Permutations_Without_Duplicates.js → ...medium/Permutations_Without_Duplicates.js
diff --git a/...oblems/Algorithms/Restore_IP_Addresses.js → ...Algorithms/medium/Restore_IP_Addresses.js b/...oblems/Algorithms/Restore_IP_Addresses.js → ...Algorithms/medium/Restore_IP_Addresses.js
diff --git a/...odeProblems/Algorithms/Reverse_Integer.js → ...lems/Algorithms/medium/Reverse_Integer.js b/...odeProblems/Algorithms/Reverse_Integer.js → ...lems/Algorithms/medium/Reverse_Integer.js
diff --git a/...orithms/SearchIng_Rotated_Sorted_Array.js → .../medium/SearchIng_Rotated_Sorted_Array.js b/...orithms/SearchIng_Rotated_Sorted_Array.js → .../medium/SearchIng_Rotated_Sorted_Array.js
diff --git a/...Problems/Algorithms/Search_a_2D_Matrix.js → ...s/Algorithms/medium/Search_a_2D_Matrix.js b/...Problems/Algorithms/Search_a_2D_Matrix.js → ...s/Algorithms/medium/Search_a_2D_Matrix.js
diff --git a/...blems/Algorithms/Search_a_2D_Matrix_II.js → ...lgorithms/medium/Search_a_2D_Matrix_II.js b/...blems/Algorithms/Search_a_2D_Matrix_II.js → ...lgorithms/medium/Search_a_2D_Matrix_II.js
diff --git a/LeetcodeProblems/Algorithms/Simplify_Path.js → ...oblems/Algorithms/medium/Simplify_Path.js b/LeetcodeProblems/Algorithms/Simplify_Path.js → ...oblems/Algorithms/medium/Simplify_Path.js
diff --git a/LeetcodeProblems/Algorithms/Spiral_Matrix.js → ...oblems/Algorithms/medium/Spiral_Matrix.js b/LeetcodeProblems/Algorithms/Spiral_Matrix.js → ...oblems/Algorithms/medium/Spiral_Matrix.js
diff --git a/...blems/Algorithms/Subarray_Sum_Equals_K.js → ...lgorithms/medium/Subarray_Sum_Equals_K.js b/...blems/Algorithms/Subarray_Sum_Equals_K.js → ...lgorithms/medium/Subarray_Sum_Equals_K.js
diff --git a/LeetcodeProblems/Algorithms/Subsets.js → ...codeProblems/Algorithms/medium/Subsets.js b/LeetcodeProblems/Algorithms/Subsets.js → ...codeProblems/Algorithms/medium/Subsets.js
diff --git a/...roblems/Algorithms/Swap_Nodes_In_Pairs.js → .../Algorithms/medium/Swap_Nodes_In_Pairs.js b/...roblems/Algorithms/Swap_Nodes_In_Pairs.js → .../Algorithms/medium/Swap_Nodes_In_Pairs.js
diff --git a/...ms/Time_Needed_Rearrange_Binary_String.js → ...um/Time_Needed_Rearrange_Binary_String.js b/...ms/Time_Needed_Rearrange_Binary_String.js → ...um/Time_Needed_Rearrange_Binary_String.js
diff --git a/...ems/Algorithms/Top_K_Frequent_Elements.js → ...orithms/medium/Top_K_Frequent_Elements.js b/...ems/Algorithms/Top_K_Frequent_Elements.js → ...orithms/medium/Top_K_Frequent_Elements.js
diff --git a/.../Algorithms/Unique_Binary_Search_Trees.js → ...thms/medium/Unique_Binary_Search_Trees.js b/.../Algorithms/Unique_Binary_Search_Trees.js → ...thms/medium/Unique_Binary_Search_Trees.js
diff --git a/LeetcodeProblems/Algorithms/Unique_Paths.js → ...roblems/Algorithms/medium/Unique_Paths.js b/LeetcodeProblems/Algorithms/Unique_Paths.js → ...roblems/Algorithms/medium/Unique_Paths.js
diff --git a/...reorder_Serialization_of_a_Binary_Tree.js → ...reorder_Serialization_of_a_Binary_Tree.js b/...reorder_Serialization_of_a_Binary_Tree.js → ...reorder_Serialization_of_a_Binary_Tree.js
diff --git a/...atabases/Classes_More_Than_5_Students.sql → ...ses/easy/Classes_More_Than_5_Students.sql b/...atabases/Classes_More_Than_5_Students.sql → ...ses/easy/Classes_More_Than_5_Students.sql
diff --git a/...Problems/Databases/Combine_Two_Tables.sql → ...ems/Databases/easy/Combine_Two_Tables.sql b/...Problems/Databases/Combine_Two_Tables.sql → ...ems/Databases/easy/Combine_Two_Tables.sql
diff --git a/...s/Databases/Customers_Who_Never_Order.sql → ...abases/easy/Customers_Who_Never_Order.sql b/...s/Databases/Customers_Who_Never_Order.sql → ...abases/easy/Customers_Who_Never_Order.sql
diff --git a/...ems/Databases/Delete_Duplicate_Emails.sql → ...atabases/easy/Delete_Duplicate_Emails.sql b/...ems/Databases/Delete_Duplicate_Emails.sql → ...atabases/easy/Delete_Duplicate_Emails.sql
diff --git a/...deProblems/Databases/Duplicate_emails.sql → ...blems/Databases/easy/Duplicate_emails.sql b/...deProblems/Databases/Duplicate_emails.sql → ...blems/Databases/easy/Duplicate_emails.sql
diff --git a/...yees_Earning_More_Than_Their_Managers.sql → ...yees_Earning_More_Than_Their_Managers.sql b/...yees_Earning_More_Than_Their_Managers.sql → ...yees_Earning_More_Than_Their_Managers.sql
diff --git a/...s/Databases/Reformat_Department_Table.sql → ...abases/easy/Reformat_Department_Table.sql b/...s/Databases/Reformat_Department_Table.sql → ...abases/easy/Reformat_Department_Table.sql
diff --git a/...Problems/Databases/Rising_Temperature.sql → ...ems/Databases/easy/Rising_Temperature.sql b/...Problems/Databases/Rising_Temperature.sql → ...ems/Databases/easy/Rising_Temperature.sql
diff --git a/...blems/Databases/Second_highest_salary.sql → .../Databases/easy/Second_highest_salary.sql b/...blems/Databases/Second_highest_salary.sql → .../Databases/easy/Second_highest_salary.sql
diff --git a/...ms/Databases/Human_Traffic_of_Stadium.sql → ...tabases/hard/Human_Traffic_of_Stadium.sql b/...ms/Databases/Human_Traffic_of_Stadium.sql → ...tabases/hard/Human_Traffic_of_Stadium.sql
diff --git a/...odeProblems/Databases/Trips_and_Users.sql → ...oblems/Databases/hard/Trips_and_Users.sql b/...odeProblems/Databases/Trips_and_Users.sql → ...oblems/Databases/hard/Trips_and_Users.sql
diff --git a/...roblems/Databases/Consecutive_Numbers.sql → .../Databases/medium/Consecutive_Numbers.sql b/...roblems/Databases/Consecutive_Numbers.sql → .../Databases/medium/Consecutive_Numbers.sql
diff --git a/...s/Databases/Department_Highest_Salary.sql → ...ases/medium/Department_Highest_Salary.sql b/...s/Databases/Department_Highest_Salary.sql → ...ases/medium/Department_Highest_Salary.sql
diff --git a/...codeProblems/Databases/Exchange_Seats.sql → ...blems/Databases/medium/Exchange_Seats.sql b/...codeProblems/Databases/Exchange_Seats.sql → ...blems/Databases/medium/Exchange_Seats.sql
diff --git a/LeetcodeProblems/Databases/Rank_Scores.sql → ...Problems/Databases/medium/Rank_Scores.sql b/LeetcodeProblems/Databases/Rank_Scores.sql → ...Problems/Databases/medium/Rank_Scores.sql
diff --git a/...Problems/Databases/nth_Highest_Salary.sql → ...s/Databases/medium/nth_Highest_Salary.sql b/...Problems/Databases/nth_Highest_Salary.sql → ...s/Databases/medium/nth_Highest_Salary.sql
diff --git a/...codeProblemsTests/Algorithms/2Sum_Test.js → ...roblemsTests/Algorithms/easy/2Sum_Test.js b/...codeProblemsTests/Algorithms/2Sum_Test.js → ...roblemsTests/Algorithms/easy/2Sum_Test.js
@@ -1,7 +1,6 @@
 const assert = require("assert");
-const twoSum = require("../../LeetcodeProblems/Algorithms/2Sum").twoSum;
-const twoSum2 = require("../../LeetcodeProblems/Algorithms/2Sum").twoSum2;
-
+const twoSum = require("../../../LeetcodeProblems/Algorithms/easy/2Sum").twoSum;
+const twoSum2 = require("../../../LeetcodeProblems/Algorithms/easy/2Sum").twoSum2;
 
 var testFirstSolution = function () {
   assert.deepEqual([0,1], twoSum([2,7,11,15], 9));

diff --git a/...ests/Algorithms/Award_Budget_Cuts_Test.js → ...Algorithms/easy/Award_Budget_Cuts_Test.js b/...ests/Algorithms/Award_Budget_Cuts_Test.js → ...Algorithms/easy/Award_Budget_Cuts_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const cutAwardBadges = require("../../LeetcodeProblems/Algorithms/Award_Budget_Cuts").cutAwardBadges;
+const cutAwardBadges = require("../../../LeetcodeProblems/Algorithms/easy/Award_Budget_Cuts").cutAwardBadges;
 
 function test() {
   assert.deepEqual(

diff --git a/...gorithms/Backspace_String_Compare_Test.js → ...hms/easy/Backspace_String_Compare_Test.js b/...gorithms/Backspace_String_Compare_Test.js → ...hms/easy/Backspace_String_Compare_Test.js
@@ -1,6 +1,6 @@
 const assert = require("assert");
-const backspaceCompare = require("../../LeetcodeProblems/Algorithms/Backspace_String_Compare").backspaceCompare;
-const backspaceCompare2 = require("../../LeetcodeProblems/Algorithms/Backspace_String_Compare").backspaceCompare2;
+const backspaceCompare = require("../../../LeetcodeProblems/Algorithms/easy/Backspace_String_Compare").backspaceCompare;
+const backspaceCompare2 = require("../../../LeetcodeProblems/Algorithms/easy/Backspace_String_Compare").backspaceCompare2;
 
 function test() {
   assert.equal(backspaceCompare("ab#c", "ad#c"), true); // true

diff --git a/...oblemsTests/Algorithms/Binary_Gap_Test.js → ...sTests/Algorithms/easy/Binary_Gap_Test.js b/...oblemsTests/Algorithms/Binary_Gap_Test.js → ...sTests/Algorithms/easy/Binary_Gap_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const binaryGap = require("../../LeetcodeProblems/Algorithms/Binary_Gap").binaryGap;
+const binaryGap = require("../../../LeetcodeProblems/Algorithms/easy/Binary_Gap").binaryGap;
 
 function test() {
   assert.equal(binaryGap(22), 2); // 10110

diff --git a/...ests/Algorithms/Deletion_Distance_Test.js → ...Algorithms/easy/Deletion_Distance_Test.js b/...ests/Algorithms/Deletion_Distance_Test.js → ...Algorithms/easy/Deletion_Distance_Test.js
@@ -1,7 +1,7 @@
 const assert = require("assert");
-var deletionDistance = require("../../LeetcodeProblems/Algorithms/Deletion_Distance").deletionDistance;
-var deletionDistance2 = require("../../LeetcodeProblems/Algorithms/Deletion_Distance").deletionDistance2;
-var deletionDistanceDP = require("../../LeetcodeProblems/Algorithms/Deletion_Distance").deletionDistanceDP;
+var deletionDistance = require("../../../LeetcodeProblems/Algorithms/easy/Deletion_Distance").deletionDistance;
+var deletionDistance2 = require("../../../LeetcodeProblems/Algorithms/easy/Deletion_Distance").deletionDistance2;
+var deletionDistanceDP = require("../../../LeetcodeProblems/Algorithms/easy/Deletion_Distance").deletionDistanceDP;
 
 function test() {
   assert.equal(deletionDistance("dog", "frog"), 3);

diff --git a/...oblemsTests/Algorithms/Flood_Fill_Test.js → ...sTests/Algorithms/easy/Flood_Fill_Test.js b/...oblemsTests/Algorithms/Flood_Fill_Test.js → ...sTests/Algorithms/easy/Flood_Fill_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const floodFill = require("../../LeetcodeProblems/Algorithms/Flood_Fill").floodFill;
+const floodFill = require("../../../LeetcodeProblems/Algorithms/easy/Flood_Fill").floodFill;
 
 function test() {
   assert.deepEqual(

diff --git a/...lemsTests/Algorithms/Happy_Number_Test.js → ...ests/Algorithms/easy/Happy_Number_Test.js b/...lemsTests/Algorithms/Happy_Number_Test.js → ...ests/Algorithms/easy/Happy_Number_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const isHappy = require("../../LeetcodeProblems/Algorithms/Happy_Number").isHappy;
+const isHappy = require("../../../LeetcodeProblems/Algorithms/easy/Happy_Number").isHappy;
 
 var test = function () {
   assert.equal(isHappy(19),true);

diff --git a/...thms/Implement_stack_using_queues_Test.js → ...easy/Implement_stack_using_queues_Test.js b/...thms/Implement_stack_using_queues_Test.js → ...easy/Implement_stack_using_queues_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const MyStack = require("../../LeetcodeProblems/Algorithms/Implement_stack_using_queues").MyStack;
+const MyStack = require("../../../LeetcodeProblems/Algorithms/easy/Implement_stack_using_queues").MyStack;
 
 var test = function () {
   var myStack = new MyStack();

diff --git a/.../Algorithms/Longest_Common_Prefix_Test.js → ...rithms/easy/Longest_Common_Prefix_Test.js b/.../Algorithms/Longest_Common_Prefix_Test.js → ...rithms/easy/Longest_Common_Prefix_Test.js
@@ -1,6 +1,6 @@
 
 const assert = require("assert");
-const longestCommonPrefix = require("../../LeetcodeProblems/Algorithms/Longest_Common_Prefix").longestCommonPrefix;
+const longestCommonPrefix = require("../../../LeetcodeProblems/Algorithms/easy/Longest_Common_Prefix").longestCommonPrefix;
 
 function test() {
   assert.equal(longestCommonPrefix(["flower","flow","flight"]), "fl");

diff --git a/...Tests/Algorithms/Majority_Element_Test.js → .../Algorithms/easy/Majority_Element_Test.js b/...Tests/Algorithms/Majority_Element_Test.js → .../Algorithms/easy/Majority_Element_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const majorityElement = require("../../LeetcodeProblems/Algorithms/Majority_Element").majorityElement;
+const majorityElement = require("../../../LeetcodeProblems/Algorithms/easy/Majority_Element").majorityElement;
 
 function test() {
   assert.equal(majorityElement([2,2,3]), 2);

diff --git a/...Tests/Algorithms/Maximun_Subarray_Test.js → .../Algorithms/easy/Maximun_Subarray_Test.js b/...Tests/Algorithms/Maximun_Subarray_Test.js → .../Algorithms/easy/Maximun_Subarray_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const maxSubArray = require("../../LeetcodeProblems/Algorithms/Maximun_Subarray").maxSubArray;
+const maxSubArray = require("../../../LeetcodeProblems/Algorithms/easy/Maximun_Subarray").maxSubArray;
 
 function test() {
   assert.equal(maxSubArray([]), 0);

diff --git a/...roblemsTests/Algorithms/Min_Stack_Test.js → ...msTests/Algorithms/easy/Min_Stack_Test.js b/...roblemsTests/Algorithms/Min_Stack_Test.js → ...msTests/Algorithms/easy/Min_Stack_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const MinStack = require("../../LeetcodeProblems/Algorithms/Min_Stack").MinStack;
+const MinStack = require("../../../LeetcodeProblems/Algorithms/easy/Min_Stack").MinStack;
 
 function test() {
   var minStack = new MinStack();

diff --git a/...ms/Number_of_Segments_in_a_String_Test.js → ...sy/Number_of_Segments_in_a_String_Test.js b/...ms/Number_of_Segments_in_a_String_Test.js → ...sy/Number_of_Segments_in_a_String_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const countSegments = require("../../LeetcodeProblems/Algorithms/Number_of_Segments_in_a_String").countSegments;
+const countSegments = require("../../../LeetcodeProblems/Algorithms/easy/Number_of_Segments_in_a_String").countSegments;
 
 function test() {
   assert.equal(countSegments(" "), 0);

diff --git a/...ests/Algorithms/Reverse_String_II_Test.js → ...Algorithms/easy/Reverse_String_II_Test.js b/...ests/Algorithms/Reverse_String_II_Test.js → ...Algorithms/easy/Reverse_String_II_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const reverseStr = require("../../LeetcodeProblems/Algorithms/Reverse_String_II").reverseStr;
+const reverseStr = require("../../../LeetcodeProblems/Algorithms/easy/Reverse_String_II").reverseStr;
 
 var test = function() {
   assert.equal(reverseStr("abcdefg", 2), "bacdfeg");

diff --git a/...roblemsTests/Algorithms/Same_Tree_Test.js → ...msTests/Algorithms/easy/Same_Tree_Test.js b/...roblemsTests/Algorithms/Same_Tree_Test.js → ...msTests/Algorithms/easy/Same_Tree_Test.js
diff --git a/...msTests/Algorithms/Shuffle_String_Test.js → ...ts/Algorithms/easy/Shuffle_String_Test.js b/...msTests/Algorithms/Shuffle_String_Test.js → ...ts/Algorithms/easy/Shuffle_String_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const restoreString = require("../../LeetcodeProblems/Algorithms/Shuffle_String").restoreString;
+const restoreString = require("../../../LeetcodeProblems/Algorithms/easy/Shuffle_String").restoreString;
 
 var test = function () {
   assert.equal(restoreString("codeleet",[4,5,6,7,0,2,1,3]),"leetcode");

diff --git a/.../Algorithms/Sum_Of_Square_Numbers_Test.js → ...rithms/easy/Sum_Of_Square_Numbers_Test.js b/.../Algorithms/Sum_Of_Square_Numbers_Test.js → ...rithms/easy/Sum_Of_Square_Numbers_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const judgeSquareSum = require("../../LeetcodeProblems/Algorithms/Sum_Of_Square_Numbers").judgeSquareSum;
+const judgeSquareSum = require("../../../LeetcodeProblems/Algorithms/easy/Sum_Of_Square_Numbers").judgeSquareSum;
 
 var test = function() {
   assert.strictEqual(judgeSquareSum(0), true);

diff --git a/...msTests/Algorithms/Symmetric_Tree_Test.js → ...ts/Algorithms/easy/Symmetric_Tree_Test.js b/...msTests/Algorithms/Symmetric_Tree_Test.js → ...ts/Algorithms/easy/Symmetric_Tree_Test.js
diff --git a/...blemsTests/Algorithms/Tic_Tac_Toe_Test.js → ...Tests/Algorithms/easy/Tic_Tac_Toe_Test.js b/...blemsTests/Algorithms/Tic_Tac_Toe_Test.js → ...Tests/Algorithms/easy/Tic_Tac_Toe_Test.js
@@ -1,4 +1,4 @@
-const TicTacToe = require("../../LeetcodeProblems/Algorithms/Tic_Tac_Toe").TicTacToe;
+const TicTacToe = require("../../../LeetcodeProblems/Algorithms/easy/Tic_Tac_Toe").TicTacToe;
 
 var test = function() {
   let ticTacToe = new TicTacToe();

diff --git a/...ests/Algorithms/Valid_Parentheses_Test.js → ...Algorithms/easy/Valid_Parentheses_Test.js b/...ests/Algorithms/Valid_Parentheses_Test.js → ...Algorithms/easy/Valid_Parentheses_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const isValid = require("../../LeetcodeProblems/Algorithms/Valid_Parentheses").isValid;
+const isValid = require("../../../LeetcodeProblems/Algorithms/easy/Valid_Parentheses").isValid;
 
 var test = function () {
   assert.strictEqual(isValid(""), true);

diff --git a/...emsTests/Algorithms/Edit_Distance_Test.js → ...sts/Algorithms/hard/Edit_Distance_Test.js b/...emsTests/Algorithms/Edit_Distance_Test.js → ...sts/Algorithms/hard/Edit_Distance_Test.js
@@ -1,6 +1,6 @@
 const assert = require("assert");
-var minDistance = require("../../LeetcodeProblems/Algorithms/Edit_Distance").minDistance;
-var minDistance2 = require("../../LeetcodeProblems/Algorithms/Edit_Distance").minDistance2;
+var minDistance = require("../../../LeetcodeProblems/Algorithms/hard/Edit_Distance").minDistance;
+var minDistance2 = require("../../../LeetcodeProblems/Algorithms/hard/Edit_Distance").minDistance2;
 
 function test() {
   assert.equal(minDistance("ros", "horse"), 3);

diff --git a/...thms/Longest_Consecutive_Sequence_Test.js → ...hard/Longest_Consecutive_Sequence_Test.js b/...thms/Longest_Consecutive_Sequence_Test.js → ...hard/Longest_Consecutive_Sequence_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const longestConsecutive = require("../../LeetcodeProblems/Algorithms/Longest_Consecutive_Sequence").longestConsecutive;
+const longestConsecutive = require("../../../LeetcodeProblems/Algorithms/hard/Longest_Consecutive_Sequence").longestConsecutive;
 
 function test() {
   assert.equal(longestConsecutive([100, 1, 200, 3, 2, 400, 201]), 3);

diff --git a/...gorithms/Minimum_Window_Substring_Test.js → ...hms/hard/Minimum_Window_Substring_Test.js b/...gorithms/Minimum_Window_Substring_Test.js → ...hms/hard/Minimum_Window_Substring_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const minWindow = require("../../LeetcodeProblems/Algorithms/Minimum_Window_Substring").minWindow;
+const minWindow = require("../../../LeetcodeProblems/Algorithms/hard/Minimum_Window_Substring").minWindow;
 
 function test() {
   assert.equal(minWindow("ADOBECODEBANC", "ABC"), "BANC");

diff --git a/...eProblemsTests/Algorithms/NQueens_Test.js → ...lemsTests/Algorithms/hard/NQueens_Test.js b/...eProblemsTests/Algorithms/NQueens_Test.js → ...lemsTests/Algorithms/hard/NQueens_Test.js
@@ -1,5 +1,5 @@
 // const assert = require("assert");
-const solveNQueens = require("../../LeetcodeProblems/Algorithms/NQueens").solveNQueens;
+const solveNQueens = require("../../../LeetcodeProblems/Algorithms/hard/NQueens").solveNQueens;
 
 // TODO: Add assertions
 

diff --git a/...ithms/Regular_Expression_Matching_Test.js → .../hard/Regular_Expression_Matching_Test.js b/...ithms/Regular_Expression_Matching_Test.js → .../hard/Regular_Expression_Matching_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const isMatch = require("../../LeetcodeProblems/Algorithms/Regular_Expression_Matching").isMatch;
+const isMatch = require("../../../LeetcodeProblems/Algorithms/hard/Regular_Expression_Matching").isMatch;
 
 var test = function() {
   assert.equal(isMatch("aa", "a"), false);

diff --git a/...rithms/Remove_Invalid_Parentheses_Test.js → ...s/hard/Remove_Invalid_Parentheses_Test.js b/...rithms/Remove_Invalid_Parentheses_Test.js → ...s/hard/Remove_Invalid_Parentheses_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const removeInvalidParentheses = require("../../LeetcodeProblems/Algorithms/Remove_Invalid_Parentheses").removeInvalidParentheses;
+const removeInvalidParentheses = require("../../../LeetcodeProblems/Algorithms/hard/Remove_Invalid_Parentheses").removeInvalidParentheses;
 
 var test = function() {
   assert.equal(removeInvalidParentheses("))))(()"), "()");

diff --git a/...ests/Algorithms/Set_Matrix_Zeroes_Test.js → ...Algorithms/hard/Set_Matrix_Zeroes_Test.js b/...ests/Algorithms/Set_Matrix_Zeroes_Test.js → ...Algorithms/hard/Set_Matrix_Zeroes_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const setZeroes = require("../../LeetcodeProblems/Algorithms/Set_Matrix_Zeroes").setZeroes;
+const setZeroes = require("../../../LeetcodeProblems/Algorithms/hard/Set_Matrix_Zeroes").setZeroes;
 
 var test = function() {
   assert.deepEqual(

diff --git a/...s/Algorithms/merge_k_sorted_lists_Test.js → ...orithms/hard/merge_k_sorted_lists_Test.js b/...s/Algorithms/merge_k_sorted_lists_Test.js → ...orithms/hard/merge_k_sorted_lists_Test.js
@@ -1,7 +1,7 @@
 const assert = require("assert");
-const ListNodeTestHelper = require("../../UtilsClasses/ListNodeTestHelper");
-var ListNode = require("../../UtilsClasses/ListNode").ListNode;
-const mergeKLists = require("../../LeetcodeProblems/Algorithms/merge_k_sorted_lists").mergeKLists;
+const ListNodeTestHelper = require("../../../UtilsClasses/ListNodeTestHelper");
+var ListNode = require("../../../UtilsClasses/ListNode").ListNode;
+const mergeKLists = require("../../../LeetcodeProblems/Algorithms/hard/merge_k_sorted_lists").mergeKLists;
 
 function test() {
   assert.deepEqual(mergeKLists([]), null);

diff --git a/...lemsTests/Algorithms/3Sum_Closest_Test.js → ...ts/Algorithms/medium/3Sum_Closest_Test.js b/...lemsTests/Algorithms/3Sum_Closest_Test.js → ...ts/Algorithms/medium/3Sum_Closest_Test.js
@@ -1,6 +1,6 @@
 const assert = require("assert");
 const threeSumClosest =
-  require("../../LeetcodeProblems/Algorithms/3SumClosest").threeSumClosest;
+  require("../../../LeetcodeProblems/Algorithms/medium/3SumClosest").threeSumClosest;
 
 var test = function () {
   assert.equal(2, threeSumClosest([-1, 2, 1, -4], 1));

diff --git a/...codeProblemsTests/Algorithms/3Sum_Test.js → ...blemsTests/Algorithms/medium/3Sum_Test.js b/...codeProblemsTests/Algorithms/3Sum_Test.js → ...blemsTests/Algorithms/medium/3Sum_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const threeSum = require("../../LeetcodeProblems/Algorithms/3Sum").threeSum;
+const threeSum = require("../../../LeetcodeProblems/Algorithms/medium/3Sum").threeSum;
 
 var test = function () {
   assert.deepEqual(threeSum([]), []);

diff --git a/...sTests/Algorithms/Add_Two_Numbers_Test.js → ...Algorithms/medium/Add_Two_Numbers_Test.js b/...sTests/Algorithms/Add_Two_Numbers_Test.js → ...Algorithms/medium/Add_Two_Numbers_Test.js
@@ -1,6 +1,6 @@
-const addTwoNumbers = require("../../LeetcodeProblems/Algorithms/Add_Two_Numbers").addTwoNumbers;
-const ListNodeTestHelper = require("../../UtilsClasses/ListNodeTestHelper");
-var ListNode = require("../../UtilsClasses/ListNode").ListNode;
+const addTwoNumbers = require("../../../LeetcodeProblems/Algorithms/medium/Add_Two_Numbers").addTwoNumbers;
+const ListNodeTestHelper = require("../../../UtilsClasses/ListNodeTestHelper");
+var ListNode = require("../../../UtilsClasses/ListNode").ListNode;
 
 function test() {
   const list1 = ListNode.linkenList([1,2,3,4]);

diff --git a/...est_Time_To_Buy_And_Sell_Stock_II_Test.js → ...est_Time_To_Buy_And_Sell_Stock_II_Test.js b/...est_Time_To_Buy_And_Sell_Stock_II_Test.js → ...est_Time_To_Buy_And_Sell_Stock_II_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const maxProfit = require("../../LeetcodeProblems/Algorithms/Best_Time_To_Buy_And_Sell_Stock_II").maxProfit;
+const maxProfit = require("../../../LeetcodeProblems/Algorithms/medium/Best_Time_To_Buy_And_Sell_Stock_II").maxProfit;
 
 function test() {
   assert.equal(maxProfit([7,1,5,3,6,4]), 7);

diff --git a/...blemsTests/Algorithms/Clone_Graph_Test.js → ...sts/Algorithms/medium/Clone_Graph_Test.js b/...blemsTests/Algorithms/Clone_Graph_Test.js → ...sts/Algorithms/medium/Clone_Graph_Test.js
diff --git a/...blemsTests/Algorithms/Coin_Change_Test.js → ...sts/Algorithms/medium/Coin_Change_Test.js b/...blemsTests/Algorithms/Coin_Change_Test.js → ...sts/Algorithms/medium/Coin_Change_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const coinChange = require("../../LeetcodeProblems/Algorithms/Coin_Change").coinChange;
+const coinChange = require("../../../LeetcodeProblems/Algorithms/medium/Coin_Change").coinChange;
 
 function test() {
   assert.equal(coinChange([], 3), -1);

diff --git a/...om_Preorder_and_Inorder_Traversal_Test.js → ...om_Preorder_and_Inorder_Traversal_Test.js b/...om_Preorder_and_Inorder_Traversal_Test.js → ...om_Preorder_and_Inorder_Traversal_Test.js
@@ -1,5 +1,5 @@
 // const assert = require("assert");
-var buildTree = require("../../LeetcodeProblems/Algorithms/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal").buildTree;
+var buildTree = require("../../../LeetcodeProblems/Algorithms/medium/Construct_Binary_Tree_from_Preorder_and_Inorder_Traversal").buildTree;
 
 function test() {
   // TODO

diff --git a/...orithms/Container_With_Most_Water_Test.js → .../medium/Container_With_Most_Water_Test.js b/...orithms/Container_With_Most_Water_Test.js → .../medium/Container_With_Most_Water_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const maxArea = require("../../LeetcodeProblems/Algorithms/Container_With_Most_Water").maxArea;
+const maxArea = require("../../../LeetcodeProblems/Algorithms/medium/Container_With_Most_Water").maxArea;
 
 function test() {
   assert.equal(49, maxArea([1,8,6,2,5,4,8,3,7]));

diff --git a/.../Algorithms/Design_Circular_Deque_Test.js → ...thms/medium/Design_Circular_Deque_Test.js b/.../Algorithms/Design_Circular_Deque_Test.js → ...thms/medium/Design_Circular_Deque_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-var MyCircularDeque = require("../../LeetcodeProblems/Algorithms/Design_Circular_Deque").MyCircularDeque;
+var MyCircularDeque = require("../../../LeetcodeProblems/Algorithms/medium/Design_Circular_Deque").MyCircularDeque;
 
 var test =  function() {
   const obj = new MyCircularDeque(3);

diff --git a/...ests/Algorithms/Escape_The_Ghosts_Test.js → ...gorithms/medium/Escape_The_Ghosts_Test.js b/...ests/Algorithms/Escape_The_Ghosts_Test.js → ...gorithms/medium/Escape_The_Ghosts_Test.js
@@ -1,6 +1,6 @@
 
 const assert = require("assert");
-var escapeGhosts = require("../../LeetcodeProblems/Algorithms/Escape_The_Ghosts").escapeGhosts;
+var escapeGhosts = require("../../../LeetcodeProblems/Algorithms/medium/Escape_The_Ghosts").escapeGhosts;
 
 function test() {
   assert.equal(escapeGhosts([[1, 0], [0, 3]], [0, 1]), true);

diff --git a/...emsTests/Algorithms/Find_Anagrams_Test.js → ...s/Algorithms/medium/Find_Anagrams_Test.js b/...emsTests/Algorithms/Find_Anagrams_Test.js → ...s/Algorithms/medium/Find_Anagrams_Test.js
@@ -1,6 +1,6 @@
 
 const assert = require("assert");
-var findAnagrams = require("../../LeetcodeProblems/Algorithms/Find_Anagrams").findAnagrams;
+var findAnagrams = require("../../../LeetcodeProblems/Algorithms/medium/Find_Anagrams").findAnagrams;
 
 function test() {
   assert.deepEqual([], findAnagrams("AA", "BB"));

diff --git a/...hms/Find_Subarrays_With_Equal_Sum_Test.js → ...ium/Find_Subarrays_With_Equal_Sum_Test.js b/...hms/Find_Subarrays_With_Equal_Sum_Test.js → ...ium/Find_Subarrays_With_Equal_Sum_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const findSubarrays = require("../../LeetcodeProblems/Algorithms/Find_Subarrays_With_Equal_Sum").findSubarrays;
+const findSubarrays = require("../../../LeetcodeProblems/Algorithms/medium/Find_Subarrays_With_Equal_Sum").findSubarrays;
 
 var test = function () {
   assert.equal(findSubarrays([4,2,4]), true);

diff --git a/...blemsTests/Algorithms/Gas_Station_Test.js → ...sts/Algorithms/medium/Gas_Station_Test.js b/...blemsTests/Algorithms/Gas_Station_Test.js → ...sts/Algorithms/medium/Gas_Station_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const canCompleteCircuit = require("../../LeetcodeProblems/Algorithms/Gas_Station").canCompleteCircuit;
+const canCompleteCircuit = require("../../../LeetcodeProblems/Algorithms/medium/Gas_Station").canCompleteCircuit;
 
 function test() {
   assert.equal(3, canCompleteCircuit([1,2,3,4,5], [3,4,5,1,2]));

diff --git a/...s/Algorithms/Generate_Parenthesis_Test.js → ...ithms/medium/Generate_Parenthesis_Test.js b/...s/Algorithms/Generate_Parenthesis_Test.js → ...ithms/medium/Generate_Parenthesis_Test.js
diff --git a/...msTests/Algorithms/Group_Anagrams_Test.js → .../Algorithms/medium/Group_Anagrams_Test.js b/...msTests/Algorithms/Group_Anagrams_Test.js → .../Algorithms/medium/Group_Anagrams_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const groupAnagrams = require("../../LeetcodeProblems/Algorithms/Group_Anagrams").groupAnagrams;
+const groupAnagrams = require("../../../LeetcodeProblems/Algorithms/medium/Group_Anagrams").groupAnagrams;
 
 function test() {
   assert.deepEqual(

diff --git a/...rithms/K_Closest_Points_to_Origin_Test.js → ...medium/K_Closest_Points_to_Origin_Test.js b/...rithms/K_Closest_Points_to_Origin_Test.js → ...medium/K_Closest_Points_to_Origin_Test.js
@@ -1,16 +1,17 @@
 const assert = require("assert");
-var kClosest = require("../../LeetcodeProblems/Algorithms/K_Closest_Points_to_Origin").kClosest;
+var kClosest = require("../../../LeetcodeProblems/Algorithms/medium/K_Closest_Points_to_Origin").kClosest;
 
 function test1() {
   var points = [[1,3],[-2,2]];
   var output = [[-2,2]];
-  assert.strictEqual(kClosest(points,1), output);
+  assert.deepStrictEqual(kClosest(points,1), output);
 }
 
 function test2() {
   var points = [[3,3],[5,-1],[-2,4]];
   var output = [[-2,4],[3,3]];
-  assert.strictEqual(kClosest(points,2), output);
+
+  assert.deepStrictEqual(kClosest(points,2).sort, output.sort);
 }
 
 function test() {

diff --git a/...s/Kth_Largest_Element_in_an_Array_Test.js → ...m/Kth_Largest_Element_in_an_Array_Test.js b/...s/Kth_Largest_Element_in_an_Array_Test.js → ...m/Kth_Largest_Element_in_an_Array_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const findKthLargest = require("../../LeetcodeProblems/Algorithms/Kth_Largest_Element_in_an_Array").findKthLargest;
+const findKthLargest = require("../../../LeetcodeProblems/Algorithms/medium/Kth_Largest_Element_in_an_Array").findKthLargest;
 
 function test() {
   assert.equal(findKthLargest([3,2,1,5,6,4], 2), 5);

diff --git a/...s/Algorithms/Linked_List_Cycle_II_Test.js → ...ithms/medium/Linked_List_Cycle_II_Test.js b/...s/Algorithms/Linked_List_Cycle_II_Test.js → ...ithms/medium/Linked_List_Cycle_II_Test.js
@@ -1,6 +1,6 @@
 const assert = require("assert");
-var ListNode = require("../../UtilsClasses/ListNode").ListNode;
-const detectCycle = require("../../LeetcodeProblems/Algorithms/Linked_List_Cycle_II").detectCycle;
+var ListNode = require("../../../UtilsClasses/ListNode").ListNode;
+const detectCycle = require("../../../LeetcodeProblems/Algorithms/medium/Linked_List_Cycle_II").detectCycle;
 
 var test = function() {
   const cycle = buildCycle();

diff --git a/...hms/Longest_Palindromic_Substring_Test.js → ...ium/Longest_Palindromic_Substring_Test.js b/...hms/Longest_Palindromic_Substring_Test.js → ...ium/Longest_Palindromic_Substring_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const longestPalindrome = require("../../LeetcodeProblems/Algorithms/Longest_Palindromic_Substring").longestPalindrome;
+const longestPalindrome = require("../../../LeetcodeProblems/Algorithms/medium/Longest_Palindromic_Substring").longestPalindrome;
 
 function test() {
   assert.equal(longestPalindrome("pabcdcbte"), "bcdcb");

diff --git a/...ests/Algorithms/Longest_Substring_Test.js → ...gorithms/medium/Longest_Substring_Test.js b/...ests/Algorithms/Longest_Substring_Test.js → ...gorithms/medium/Longest_Substring_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const lengthOfLongestSubstring = require("../../LeetcodeProblems/Algorithms/Longest_Substring").lengthOfLongestSubstring;
+const lengthOfLongestSubstring = require("../../../LeetcodeProblems/Algorithms/medium/Longest_Substring").lengthOfLongestSubstring;
 
 function test() {
   assert.equal(4, lengthOfLongestSubstring("abcdbcd"));

diff --git a/..._Common_Ancestor_of_a_Binary_Tree_Test.js → ..._Common_Ancestor_of_a_Binary_Tree_Test.js b/..._Common_Ancestor_of_a_Binary_Tree_Test.js → ..._Common_Ancestor_of_a_Binary_Tree_Test.js
@@ -1,7 +1,7 @@
 // const assert = require("assert");
-var TreeNode = require("../../UtilsClasses/TreeNode").TreeNode;
-const lowestCommonAncestor = require("../../LeetcodeProblems/Algorithms/Lowest_Common_Ancestor_of_a_Binary_Tree").lowestCommonAncestor;
-const lowestCommonAncestor2 = require("../../LeetcodeProblems/Algorithms/Lowest_Common_Ancestor_of_a_Binary_Tree").lowestCommonAncestor2;
+var TreeNode = require("../../../UtilsClasses/TreeNode").TreeNode;
+const lowestCommonAncestor = require("../../../LeetcodeProblems/Algorithms/medium/Lowest_Common_Ancestor_of_a_Binary_Tree").lowestCommonAncestor;
+const lowestCommonAncestor2 = require("../../../LeetcodeProblems/Algorithms/medium/Lowest_Common_Ancestor_of_a_Binary_Tree").lowestCommonAncestor2;
 
 var test = function() {
   var root = new TreeNode(3);

diff --git a/...sts/Algorithms/Max_Area_Of_Island_Test.js → ...orithms/medium/Max_Area_Of_Island_Test.js b/...sts/Algorithms/Max_Area_Of_Island_Test.js → ...orithms/medium/Max_Area_Of_Island_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const { maxAreaOfIsland } = require("../../LeetcodeProblems/Algorithms/Max_Area_Of_Island");
+const { maxAreaOfIsland } = require("../../../LeetcodeProblems/Algorithms/medium/Max_Area_Of_Island");
 
 function test1() {
   var matrix = [

diff --git a/...gorithms/Max_Consecutive_Ones_III_Test.js → ...s/medium/Max_Consecutive_Ones_III_Test.js b/...gorithms/Max_Consecutive_Ones_III_Test.js → ...s/medium/Max_Consecutive_Ones_III_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const longestOnes = require("../../LeetcodeProblems/Algorithms/Max_Consecutive_Ones_III").longestOnes;
+const longestOnes = require("../../../LeetcodeProblems/Algorithms/medium/Max_Consecutive_Ones_III").longestOnes;
 
 function test() {
   assert.equal(1, longestOnes([1], 1));

diff --git a/...msTests/Algorithms/Maximal_Square_Test.js → .../Algorithms/medium/Maximal_Square_Test.js b/...msTests/Algorithms/Maximal_Square_Test.js → .../Algorithms/medium/Maximal_Square_Test.js
@@ -1,5 +1,5 @@
 const assert = require("assert");
-const maximalSquare = require("../../LeetcodeProblems/Algorithms/Maximal_Square").maximalSquare;
+const maximalSquare = require("../../../LeetcodeProblems/Algorithms/medium/Maximal_Square").maximalSquare;
 
 function test() {
   assert.equal(maximalSquare([["1","0"]]), 1);