keon · keon · May 31, 2018 · May 29, 2018 · May 29, 2018 · May 29, 2018
diff --git a/README.md b/README.md
@@ -37,11 +37,11 @@ If you want to use the API algorithms in your code, it is as simple as:
 You can test by creating a python file: (Ex: use `merge_sort` in `sort`)
 
 ```python3
-from sort import merge_sort
+from algorithms.sort import merge_sort
 
 if __name__ == "__main__":
     my_list = [1, 8, 3, 5, 6]
-    my_list = merge_sort.merge_sort(my_list)
+    my_list = merge_sort(my_list)
     print(my_list)
 ```
 

diff --git a/backtrack/anagram.py → algorithms/backtrack/anagram.py b/backtrack/anagram.py → algorithms/backtrack/anagram.py
diff --git a/backtrack/array_sum_combinations.py → ...ithms/backtrack/array_sum_combinations.py b/backtrack/array_sum_combinations.py → ...ithms/backtrack/array_sum_combinations.py
diff --git a/backtrack/combination_sum.py → algorithms/backtrack/combination_sum.py b/backtrack/combination_sum.py → algorithms/backtrack/combination_sum.py
diff --git a/backtrack/expression_add_operators.py → ...hms/backtrack/expression_add_operators.py b/backtrack/expression_add_operators.py → ...hms/backtrack/expression_add_operators.py
diff --git a/backtrack/factor_combinations.py → algorithms/backtrack/factor_combinations.py b/backtrack/factor_combinations.py → algorithms/backtrack/factor_combinations.py
diff --git a/backtrack/general_solution.md → algorithms/backtrack/general_solution.md b/backtrack/general_solution.md → algorithms/backtrack/general_solution.md
diff --git a/backtrack/generate_abbreviations.py → ...ithms/backtrack/generate_abbreviations.py b/backtrack/generate_abbreviations.py → ...ithms/backtrack/generate_abbreviations.py
diff --git a/backtrack/generate_parenthesis.py → algorithms/backtrack/generate_parenthesis.py b/backtrack/generate_parenthesis.py → algorithms/backtrack/generate_parenthesis.py
diff --git a/backtrack/letter_combination.py → algorithms/backtrack/letter_combination.py b/backtrack/letter_combination.py → algorithms/backtrack/letter_combination.py
diff --git a/backtrack/palindrome_partitioning.py → ...thms/backtrack/palindrome_partitioning.py b/backtrack/palindrome_partitioning.py → ...thms/backtrack/palindrome_partitioning.py
diff --git a/backtrack/pattern_match.py → algorithms/backtrack/pattern_match.py b/backtrack/pattern_match.py → algorithms/backtrack/pattern_match.py
diff --git a/backtrack/permute.py → algorithms/backtrack/permute.py b/backtrack/permute.py → algorithms/backtrack/permute.py
diff --git a/backtrack/permute_unique.py → algorithms/backtrack/permute_unique.py b/backtrack/permute_unique.py → algorithms/backtrack/permute_unique.py
diff --git a/backtrack/subsets.py → algorithms/backtrack/subsets.py b/backtrack/subsets.py → algorithms/backtrack/subsets.py
diff --git a/backtrack/subsets_unique.py → algorithms/backtrack/subsets_unique.py b/backtrack/subsets_unique.py → algorithms/backtrack/subsets_unique.py
diff --git a/backtrack/word_search.py → algorithms/backtrack/word_search.py b/backtrack/word_search.py → algorithms/backtrack/word_search.py
diff --git a/bfs/shortest_distance_from_all_buildings.py → ...s/shortest_distance_from_all_buildings.py b/bfs/shortest_distance_from_all_buildings.py → ...s/shortest_distance_from_all_buildings.py
diff --git a/bfs/word_ladder.py → algorithms/bfs/word_ladder.py b/bfs/word_ladder.py → algorithms/bfs/word_ladder.py
diff --git a/algorithms/bit/__init__.py b/algorithms/bit/__init__.py
@@ -0,0 +1,15 @@
+from .add_bitwise_operator import *
+from .count_ones import *
+from .find_missing_number import *
+from .power_of_two import *
+from .reverse_bits import *
+from .single_number import *
+from .single_number2 import *
+from .single_number3 import *
+from .subsets import *
+from .bit_operation import *
+from .swap_pair import *
+from .find_difference import *
+from .has_alternative_bit import *
+from .insert_bit import *
+from .remove_bit import *
diff --git a/bit/add_bitwise_operator.py → algorithms/bit/add_bitwise_operator.py b/bit/add_bitwise_operator.py → algorithms/bit/add_bitwise_operator.py
diff --git a/bit/bit_operation.py → algorithms/bit/bit_operation.py b/bit/bit_operation.py → algorithms/bit/bit_operation.py
diff --git a/bit/bytes_int_conversion.py → algorithms/bit/bytes_int_conversion.py b/bit/bytes_int_conversion.py → algorithms/bit/bytes_int_conversion.py
diff --git a/bit/count_ones.py → algorithms/bit/count_ones.py b/bit/count_ones.py → algorithms/bit/count_ones.py
diff --git a/bit/find_difference.py → algorithms/bit/find_difference.py b/bit/find_difference.py → algorithms/bit/find_difference.py
diff --git a/bit/find_missing_number.py → algorithms/bit/find_missing_number.py b/bit/find_missing_number.py → algorithms/bit/find_missing_number.py
diff --git a/bit/has_alternative_bit.py → algorithms/bit/has_alternative_bit.py b/bit/has_alternative_bit.py → algorithms/bit/has_alternative_bit.py
diff --git a/bit/insert_bit.py → algorithms/bit/insert_bit.py b/bit/insert_bit.py → algorithms/bit/insert_bit.py
diff --git a/bit/power_of_two.py → algorithms/bit/power_of_two.py b/bit/power_of_two.py → algorithms/bit/power_of_two.py
diff --git a/bit/remove_bit.py → algorithms/bit/remove_bit.py b/bit/remove_bit.py → algorithms/bit/remove_bit.py
diff --git a/bit/reverse_bits.py → algorithms/bit/reverse_bits.py b/bit/reverse_bits.py → algorithms/bit/reverse_bits.py
diff --git a/bit/single_number.py → algorithms/bit/single_number.py b/bit/single_number.py → algorithms/bit/single_number.py
diff --git a/bit/single_number2.py → algorithms/bit/single_number2.py b/bit/single_number2.py → algorithms/bit/single_number2.py
@@ -17,22 +17,6 @@
 the remaining should be the exact bit of the single number.
 In this way, you get the 32 bits of the single number.
 """
-def single_number(nums):
-    """
-    :type nums: List[int]
-    :rtype: int
-    """
-    res = 0
-    for i in range(0, 32):
-        count = 0
-        for num in nums:
-            if (num >> i) & 1:
-                count += 1
-        res |= ((count % 3) << i)
-    if res >= 2**31:
-        res -= 2**32
-    return res
-
 
 # Another awesome answer
 def single_number2(nums):

diff --git a/bit/single_number3.py → algorithms/bit/single_number3.py b/bit/single_number3.py → algorithms/bit/single_number3.py
diff --git a/bit/subsets.py → algorithms/bit/subsets.py b/bit/subsets.py → algorithms/bit/subsets.py
diff --git a/bit/swap_pair.py → algorithms/bit/swap_pair.py b/bit/swap_pair.py → algorithms/bit/swap_pair.py
diff --git a/calculator/math_parser.py → algorithms/calculator/math_parser.py b/calculator/math_parser.py → algorithms/calculator/math_parser.py
diff --git a/dfs/all_factors.py → algorithms/dfs/all_factors.py b/dfs/all_factors.py → algorithms/dfs/all_factors.py
diff --git a/dfs/count_islands.py → algorithms/dfs/count_islands.py b/dfs/count_islands.py → algorithms/dfs/count_islands.py
diff --git a/dfs/pacific_atlantic.py → algorithms/dfs/pacific_atlantic.py b/dfs/pacific_atlantic.py → algorithms/dfs/pacific_atlantic.py
diff --git a/dfs/sudoku_solver.py → algorithms/dfs/sudoku_solver.py b/dfs/sudoku_solver.py → algorithms/dfs/sudoku_solver.py
diff --git a/dfs/walls_and_gates.py → algorithms/dfs/walls_and_gates.py b/dfs/walls_and_gates.py → algorithms/dfs/walls_and_gates.py
diff --git a/dp/buy_sell_stock.py → algorithms/dp/buy_sell_stock.py b/dp/buy_sell_stock.py → algorithms/dp/buy_sell_stock.py
diff --git a/dp/climbing_stairs.py → algorithms/dp/climbing_stairs.py b/dp/climbing_stairs.py → algorithms/dp/climbing_stairs.py
diff --git a/dp/coin_change.py → algorithms/dp/coin_change.py b/dp/coin_change.py → algorithms/dp/coin_change.py
diff --git a/dp/combination_sum.py → algorithms/dp/combination_sum.py b/dp/combination_sum.py → algorithms/dp/combination_sum.py
diff --git a/dp/egg_drop.py → algorithms/dp/egg_drop.py b/dp/egg_drop.py → algorithms/dp/egg_drop.py
diff --git a/dp/fib.py → algorithms/dp/fib.py b/dp/fib.py → algorithms/dp/fib.py
diff --git a/dp/house_robber.py → algorithms/dp/house_robber.py b/dp/house_robber.py → algorithms/dp/house_robber.py
diff --git a/dp/job_scheduling.py → algorithms/dp/job_scheduling.py b/dp/job_scheduling.py → algorithms/dp/job_scheduling.py
diff --git a/dp/knapsack.py → algorithms/dp/knapsack.py b/dp/knapsack.py → algorithms/dp/knapsack.py
diff --git a/dp/longest_increasing.py → algorithms/dp/longest_increasing.py b/dp/longest_increasing.py → algorithms/dp/longest_increasing.py
diff --git a/dp/matrix_chain_order.py → algorithms/dp/matrix_chain_order.py b/dp/matrix_chain_order.py → algorithms/dp/matrix_chain_order.py
diff --git a/dp/max_product_subarray.py → algorithms/dp/max_product_subarray.py b/dp/max_product_subarray.py → algorithms/dp/max_product_subarray.py
diff --git a/dp/max_subarray.py → algorithms/dp/max_subarray.py b/dp/max_subarray.py → algorithms/dp/max_subarray.py
diff --git a/dp/min_cost_path.py → algorithms/dp/min_cost_path.py b/dp/min_cost_path.py → algorithms/dp/min_cost_path.py
diff --git a/dp/num_decodings.py → algorithms/dp/num_decodings.py b/dp/num_decodings.py → algorithms/dp/num_decodings.py
diff --git a/dp/regex_matching.py → algorithms/dp/regex_matching.py b/dp/regex_matching.py → algorithms/dp/regex_matching.py
diff --git a/dp/rod_cut.py → algorithms/dp/rod_cut.py b/dp/rod_cut.py → algorithms/dp/rod_cut.py
diff --git a/dp/word_break.py → algorithms/dp/word_break.py b/dp/word_break.py → algorithms/dp/word_break.py
diff --git a/graph/Transitive_Closure_DFS.py → algorithms/graph/Transitive_Closure_DFS.py b/graph/Transitive_Closure_DFS.py → algorithms/graph/Transitive_Closure_DFS.py
diff --git a/algorithms/graph/__init__.py b/algorithms/graph/__init__.py
@@ -0,0 +1 @@
+from .tarjan import *
diff --git a/graph/checkDiGraphStronglyConnected.py → ...ms/graph/checkDiGraphStronglyConnected.py b/graph/checkDiGraphStronglyConnected.py → ...ms/graph/checkDiGraphStronglyConnected.py
diff --git a/graph/clone_graph.py → algorithms/graph/clone_graph.py b/graph/clone_graph.py → algorithms/graph/clone_graph.py
diff --git a/graph/cycle_detection.py → algorithms/graph/cycle_detection.py b/graph/cycle_detection.py → algorithms/graph/cycle_detection.py
diff --git a/graph/dijkstra.py → algorithms/graph/dijkstra.py b/graph/dijkstra.py → algorithms/graph/dijkstra.py
diff --git a/graph/find_all_cliques.py → algorithms/graph/find_all_cliques.py b/graph/find_all_cliques.py → algorithms/graph/find_all_cliques.py
diff --git a/graph/find_path.py → algorithms/graph/find_path.py b/graph/find_path.py → algorithms/graph/find_path.py
diff --git a/graph/graph.py → algorithms/graph/graph.py b/graph/graph.py → algorithms/graph/graph.py
diff --git a/graph/markov_chain.py → algorithms/graph/markov_chain.py b/graph/markov_chain.py → algorithms/graph/markov_chain.py
diff --git a/graph/minimum_spanning_tree.py → algorithms/graph/minimum_spanning_tree.py b/graph/minimum_spanning_tree.py → algorithms/graph/minimum_spanning_tree.py
diff --git a/graph/pathBetweenTwoVerticesInDiGraph.py → .../graph/pathBetweenTwoVerticesInDiGraph.py b/graph/pathBetweenTwoVerticesInDiGraph.py → .../graph/pathBetweenTwoVerticesInDiGraph.py
diff --git a/graph/satisfiability.py → algorithms/graph/satisfiability.py b/graph/satisfiability.py → algorithms/graph/satisfiability.py
diff --git a/graph/tarjan.py → algorithms/graph/tarjan.py b/graph/tarjan.py → algorithms/graph/tarjan.py
@@ -3,7 +3,7 @@
 in a graph.
 https://en.wikipedia.org/wiki/Tarjan%27s_strongly_connected_components_algorithm
 """
-from graph.graph import DirectedGraph
+from algorithms.graph.graph import DirectedGraph
 
 class Tarjan(object):
     def __init__(self, dict_graph):
@@ -54,4 +54,4 @@ def strongconnect(self, v, sccs):
                     break
             scc.sort()
             sccs.append(scc)
-
+
diff --git a/graph/traversal.py → algorithms/graph/traversal.py b/graph/traversal.py → algorithms/graph/traversal.py
diff --git a/algorithms/heap/__init__.py b/algorithms/heap/__init__.py
@@ -0,0 +1,3 @@
+from .binary_heap import *
+from .skyline import *
+from .sliding_window_max import *
diff --git a/heap/binary_heap.py → algorithms/heap/binary_heap.py b/heap/binary_heap.py → algorithms/heap/binary_heap.py
diff --git a/heap/merge_sorted_k_lists.py → algorithms/heap/merge_sorted_k_lists.py b/heap/merge_sorted_k_lists.py → algorithms/heap/merge_sorted_k_lists.py
diff --git a/heap/skyline.py → algorithms/heap/skyline.py b/heap/skyline.py → algorithms/heap/skyline.py
diff --git a/heap/sliding_window_max.py → algorithms/heap/sliding_window_max.py b/heap/sliding_window_max.py → algorithms/heap/sliding_window_max.py
diff --git a/algorithms/linkedlist/__init__.py b/algorithms/linkedlist/__init__.py
@@ -0,0 +1,8 @@
+from .reverse import *
+from .is_sorted import *
+from .remove_range import *
+from .swap_in_pairs import *
+from .rotate_list import *
+from .is_cyclic import *
+from .merge_two_list import *
+from .is_palindrome import *
diff --git a/linkedlist/add_two_numbers.py → algorithms/linkedlist/add_two_numbers.py b/linkedlist/add_two_numbers.py → algorithms/linkedlist/add_two_numbers.py
diff --git a/linkedlist/copy_random_pointer.py → algorithms/linkedlist/copy_random_pointer.py b/linkedlist/copy_random_pointer.py → algorithms/linkedlist/copy_random_pointer.py
diff --git a/linkedlist/delete_node.py → algorithms/linkedlist/delete_node.py b/linkedlist/delete_node.py → algorithms/linkedlist/delete_node.py
diff --git a/linkedlist/first_cyclic_node.py → algorithms/linkedlist/first_cyclic_node.py b/linkedlist/first_cyclic_node.py → algorithms/linkedlist/first_cyclic_node.py
diff --git a/linkedlist/intersection.py → algorithms/linkedlist/intersection.py b/linkedlist/intersection.py → algorithms/linkedlist/intersection.py
diff --git a/linkedlist/is_cyclic.py → algorithms/linkedlist/is_cyclic.py b/linkedlist/is_cyclic.py → algorithms/linkedlist/is_cyclic.py
diff --git a/linkedlist/is_palindrome.py → algorithms/linkedlist/is_palindrome.py b/linkedlist/is_palindrome.py → algorithms/linkedlist/is_palindrome.py
diff --git a/linkedlist/is_sorted.py → algorithms/linkedlist/is_sorted.py b/linkedlist/is_sorted.py → algorithms/linkedlist/is_sorted.py
diff --git a/linkedlist/kth_to_last.py → algorithms/linkedlist/kth_to_last.py b/linkedlist/kth_to_last.py → algorithms/linkedlist/kth_to_last.py
diff --git a/linkedlist/linkedlist.py → algorithms/linkedlist/linkedlist.py b/linkedlist/linkedlist.py → algorithms/linkedlist/linkedlist.py
diff --git a/linkedlist/merge_two_list.py → algorithms/linkedlist/merge_two_list.py b/linkedlist/merge_two_list.py → algorithms/linkedlist/merge_two_list.py
diff --git a/linkedlist/partition.py → algorithms/linkedlist/partition.py b/linkedlist/partition.py → algorithms/linkedlist/partition.py
diff --git a/linkedlist/remove_duplicates.py → algorithms/linkedlist/remove_duplicates.py b/linkedlist/remove_duplicates.py → algorithms/linkedlist/remove_duplicates.py
diff --git a/linkedlist/remove_range.py → algorithms/linkedlist/remove_range.py b/linkedlist/remove_range.py → algorithms/linkedlist/remove_range.py
diff --git a/linkedlist/reverse.py → algorithms/linkedlist/reverse.py b/linkedlist/reverse.py → algorithms/linkedlist/reverse.py
diff --git a/linkedlist/rotate_list.py → algorithms/linkedlist/rotate_list.py b/linkedlist/rotate_list.py → algorithms/linkedlist/rotate_list.py
diff --git a/linkedlist/swap_in_pairs.py → algorithms/linkedlist/swap_in_pairs.py b/linkedlist/swap_in_pairs.py → algorithms/linkedlist/swap_in_pairs.py
diff --git a/map/hashtable.py → algorithms/map/hashtable.py b/map/hashtable.py → algorithms/map/hashtable.py
diff --git a/map/longest_common_subsequence.py → algorithms/map/longest_common_subsequence.py b/map/longest_common_subsequence.py → algorithms/map/longest_common_subsequence.py
diff --git a/map/randomized_set.py → algorithms/map/randomized_set.py b/map/randomized_set.py → algorithms/map/randomized_set.py
diff --git a/map/separate_chaining_hashtable.py → ...rithms/map/separate_chaining_hashtable.py b/map/separate_chaining_hashtable.py → ...rithms/map/separate_chaining_hashtable.py
diff --git a/map/valid_sudoku.py → algorithms/map/valid_sudoku.py b/map/valid_sudoku.py → algorithms/map/valid_sudoku.py
diff --git a/algorithms/maths/__init__.py b/algorithms/maths/__init__.py
@@ -0,0 +1,11 @@
+from .base_conversion import *
+from .extended_gcd import *
+from .gcd import *
+from .generate_strobogrammtic import *
+from .is_strobogrammatic import *
+from .next_perfect_square import *
+from .prime_check import *
+from .primes_sieve_of_eratosthenes import *
+from .pythagoras import *
+from .rabin_miller import *
+from .rsa import *
diff --git a/maths/base_conversion.py → algorithms/maths/base_conversion.py b/maths/base_conversion.py → algorithms/maths/base_conversion.py
diff --git a/maths/extended_gcd.py → algorithms/maths/extended_gcd.py b/maths/extended_gcd.py → algorithms/maths/extended_gcd.py
diff --git a/maths/gcd.py → algorithms/maths/gcd.py b/maths/gcd.py → algorithms/maths/gcd.py
diff --git a/maths/generate_strobogrammtic.py → algorithms/maths/generate_strobogrammtic.py b/maths/generate_strobogrammtic.py → algorithms/maths/generate_strobogrammtic.py
diff --git a/maths/is_strobogrammatic.py → algorithms/maths/is_strobogrammatic.py b/maths/is_strobogrammatic.py → algorithms/maths/is_strobogrammatic.py
diff --git a/maths/next_bigger.py → algorithms/maths/next_bigger.py b/maths/next_bigger.py → algorithms/maths/next_bigger.py
diff --git a/maths/next_perfect_square.py → algorithms/maths/next_perfect_square.py b/maths/next_perfect_square.py → algorithms/maths/next_perfect_square.py
diff --git a/maths/nth_digit.py → algorithms/maths/nth_digit.py b/maths/nth_digit.py → algorithms/maths/nth_digit.py
diff --git a/maths/prime_check.py → algorithms/maths/prime_check.py b/maths/prime_check.py → algorithms/maths/prime_check.py
diff --git a/maths/primes_sieve_of_eratosthenes.py → ...hms/maths/primes_sieve_of_eratosthenes.py b/maths/primes_sieve_of_eratosthenes.py → ...hms/maths/primes_sieve_of_eratosthenes.py
diff --git a/maths/pythagoras.py → algorithms/maths/pythagoras.py b/maths/pythagoras.py → algorithms/maths/pythagoras.py
diff --git a/maths/rabin_miller.py → algorithms/maths/rabin_miller.py b/maths/rabin_miller.py → algorithms/maths/rabin_miller.py
diff --git a/maths/rsa.py → algorithms/maths/rsa.py b/maths/rsa.py → algorithms/maths/rsa.py
diff --git a/maths/sqrt_precision_factor.py → algorithms/maths/sqrt_precision_factor.py b/maths/sqrt_precision_factor.py → algorithms/maths/sqrt_precision_factor.py
diff --git a/maths/summing_digits.py → algorithms/maths/summing_digits.py b/maths/summing_digits.py → algorithms/maths/summing_digits.py
diff --git a/matrix/bomb_enemy.py → algorithms/matrix/bomb_enemy.py b/matrix/bomb_enemy.py → algorithms/matrix/bomb_enemy.py
diff --git a/matrix/copy_transform.py → algorithms/matrix/copy_transform.py b/matrix/copy_transform.py → algorithms/matrix/copy_transform.py
diff --git a/matrix/count_paths.py → algorithms/matrix/count_paths.py b/matrix/count_paths.py → algorithms/matrix/count_paths.py
diff --git a/matrix/matrix_rotation.txt → algorithms/matrix/matrix_rotation.txt b/matrix/matrix_rotation.txt → algorithms/matrix/matrix_rotation.txt
diff --git a/matrix/rotate_image.py → algorithms/matrix/rotate_image.py b/matrix/rotate_image.py → algorithms/matrix/rotate_image.py
diff --git a/matrix/search_in_sorted_matrix.py → algorithms/matrix/search_in_sorted_matrix.py b/matrix/search_in_sorted_matrix.py → algorithms/matrix/search_in_sorted_matrix.py
diff --git a/matrix/sparse_dot_vector.py → algorithms/matrix/sparse_dot_vector.py b/matrix/sparse_dot_vector.py → algorithms/matrix/sparse_dot_vector.py
diff --git a/matrix/sparse_mul.py → algorithms/matrix/sparse_mul.py b/matrix/sparse_mul.py → algorithms/matrix/sparse_mul.py
diff --git a/matrix/spiral_traversal.py → algorithms/matrix/spiral_traversal.py b/matrix/spiral_traversal.py → algorithms/matrix/spiral_traversal.py
diff --git a/matrix/sudoku_validator.py → algorithms/matrix/sudoku_validator.py b/matrix/sudoku_validator.py → algorithms/matrix/sudoku_validator.py
diff --git a/algorithms/queues/__init__.py b/algorithms/queues/__init__.py
@@ -0,0 +1,4 @@
+from .queue import *
+from .max_sliding_window import *
+from .reconstruct_queue import *
+from .priority_queue import *
diff --git a/queues/max_sliding_window.py → algorithms/queues/max_sliding_window.py b/queues/max_sliding_window.py → algorithms/queues/max_sliding_window.py
diff --git a/queues/moving_average.py → algorithms/queues/moving_average.py b/queues/moving_average.py → algorithms/queues/moving_average.py
diff --git a/queues/priority_queue.py → algorithms/queues/priority_queue.py b/queues/priority_queue.py → algorithms/queues/priority_queue.py
diff --git a/queues/queue.py → algorithms/queues/queue.py b/queues/queue.py → algorithms/queues/queue.py
diff --git a/queues/reconstruct_queue.py → algorithms/queues/reconstruct_queue.py b/queues/reconstruct_queue.py → algorithms/queues/reconstruct_queue.py
diff --git a/queues/zigzagiterator.py → algorithms/queues/zigzagiterator.py b/queues/zigzagiterator.py → algorithms/queues/zigzagiterator.py
diff --git a/algorithms/search/__init__.py b/algorithms/search/__init__.py
@@ -0,0 +1,8 @@
+from .binary_search import *
+from .first_occurance import *
+from .last_occurance import *
+from .search_insert import *
+from .two_sum import *
+from .search_range import *
+from .find_min_rotate import *
+from .search_rotate import *
diff --git a/search/binary_search.py → algorithms/search/binary_search.py b/search/binary_search.py → algorithms/search/binary_search.py
diff --git a/search/find_min_rotate.py → algorithms/search/find_min_rotate.py b/search/find_min_rotate.py → algorithms/search/find_min_rotate.py
diff --git a/search/first_occurance.py → algorithms/search/first_occurance.py b/search/first_occurance.py → algorithms/search/first_occurance.py
diff --git a/search/last_occurance.py → algorithms/search/last_occurance.py b/search/last_occurance.py → algorithms/search/last_occurance.py
diff --git a/search/search_insert.py → algorithms/search/search_insert.py b/search/search_insert.py → algorithms/search/search_insert.py
diff --git a/search/search_range.py → algorithms/search/search_range.py b/search/search_range.py → algorithms/search/search_range.py
diff --git a/search/search_rotate.py → algorithms/search/search_rotate.py b/search/search_rotate.py → algorithms/search/search_rotate.py
diff --git a/search/two_sum.py → algorithms/search/two_sum.py b/search/two_sum.py → algorithms/search/two_sum.py
diff --git a/set/randomized_set.py → algorithms/set/randomized_set.py b/set/randomized_set.py → algorithms/set/randomized_set.py
diff --git a/set/set_covering.py → algorithms/set/set_covering.py b/set/set_covering.py → algorithms/set/set_covering.py
diff --git a/algorithms/sort/__init__.py b/algorithms/sort/__init__.py
@@ -0,0 +1,8 @@
+from .bubble_sort import *
+from .comb_sort import *
+from .counting_sort import *
+from .heap_sort import *
+from .insertion_sort import *
+from .merge_sort import *
+from .quick_sort import *
+from .selection_sort import *
diff --git a/sort/bubble_sort.py → algorithms/sort/bubble_sort.py b/sort/bubble_sort.py → algorithms/sort/bubble_sort.py
diff --git a/sort/comb_sort.py → algorithms/sort/comb_sort.py b/sort/comb_sort.py → algorithms/sort/comb_sort.py
diff --git a/sort/counting_sort.py → algorithms/sort/counting_sort.py b/sort/counting_sort.py → algorithms/sort/counting_sort.py
diff --git a/sort/heap_sort.py → algorithms/sort/heap_sort.py b/sort/heap_sort.py → algorithms/sort/heap_sort.py
diff --git a/sort/insertion_sort.py → algorithms/sort/insertion_sort.py b/sort/insertion_sort.py → algorithms/sort/insertion_sort.py
diff --git a/sort/meeting_rooms.py → algorithms/sort/meeting_rooms.py b/sort/meeting_rooms.py → algorithms/sort/meeting_rooms.py
diff --git a/sort/merge_sort.py → algorithms/sort/merge_sort.py b/sort/merge_sort.py → algorithms/sort/merge_sort.py
diff --git a/sort/quick_sort.py → algorithms/sort/quick_sort.py b/sort/quick_sort.py → algorithms/sort/quick_sort.py
diff --git a/sort/selection_sort.py → algorithms/sort/selection_sort.py b/sort/selection_sort.py → algorithms/sort/selection_sort.py
diff --git a/sort/sort_colors.py → algorithms/sort/sort_colors.py b/sort/sort_colors.py → algorithms/sort/sort_colors.py
diff --git a/sort/topsort.py → algorithms/sort/topsort.py b/sort/topsort.py → algorithms/sort/topsort.py
diff --git a/sort/wiggle_sort.py → algorithms/sort/wiggle_sort.py b/sort/wiggle_sort.py → algorithms/sort/wiggle_sort.py
diff --git a/algorithms/stack/__init__.py b/algorithms/stack/__init__.py
@@ -0,0 +1,10 @@
+from .stack import *
+from .is_consecutive import *
+from .is_sorted import *
+from .remove_min import *
+from .stutter import *
+from .switch_pairs import *
+from .valid_parenthesis import *
+from .simplify_path import *
+from .stack import *
+from .ordered_stack import *
diff --git a/stack/is_consecutive.py → algorithms/stack/is_consecutive.py b/stack/is_consecutive.py → algorithms/stack/is_consecutive.py
diff --git a/stack/is_sorted.py → algorithms/stack/is_sorted.py b/stack/is_sorted.py → algorithms/stack/is_sorted.py
diff --git a/stack/longest_abs_path.py → algorithms/stack/longest_abs_path.py b/stack/longest_abs_path.py → algorithms/stack/longest_abs_path.py
diff --git a/stack/ordered_stack.py → algorithms/stack/ordered_stack.py b/stack/ordered_stack.py → algorithms/stack/ordered_stack.py
diff --git a/stack/remove_min.py → algorithms/stack/remove_min.py b/stack/remove_min.py → algorithms/stack/remove_min.py
diff --git a/stack/simplify_path.py → algorithms/stack/simplify_path.py b/stack/simplify_path.py → algorithms/stack/simplify_path.py
diff --git a/stack/stack.py → algorithms/stack/stack.py b/stack/stack.py → algorithms/stack/stack.py
diff --git a/stack/stutter.py → algorithms/stack/stutter.py b/stack/stutter.py → algorithms/stack/stutter.py
diff --git a/stack/switch_pairs.py → algorithms/stack/switch_pairs.py b/stack/switch_pairs.py → algorithms/stack/switch_pairs.py
diff --git a/stack/valid_parenthesis.py → algorithms/stack/valid_parenthesis.py b/stack/valid_parenthesis.py → algorithms/stack/valid_parenthesis.py
diff --git a/algorithms/strings/__init__.py b/algorithms/strings/__init__.py
@@ -0,0 +1,23 @@
+from .add_binary import *
+from .breaking_bad import *
+from .decode_string import *
+from .delete_reoccurring import *
+from .domain_extractor import *
+from .encode_decode import *
+from .group_anagrams import *
+from .int_to_roman import *
+from .is_palindrome import *
+from .is_rotated import *
+from .license_number import *
+from .make_sentence import *
+from .merge_string_checker import *
+from .multiply_strings import *
+from .one_edit_distance import *
+from .rabin_karp import *
+from .reverse_string import *
+from .reverse_vowel import *
+from .reverse_words import *
+from .roman_to_int import *
+from .strip_url_params import *
+from .validate_coordinates import *
+from .word_squares import *
diff --git a/strings/add_binary.py → algorithms/strings/add_binary.py b/strings/add_binary.py → algorithms/strings/add_binary.py
diff --git a/strings/breaking_bad.py → algorithms/strings/breaking_bad.py b/strings/breaking_bad.py → algorithms/strings/breaking_bad.py
diff --git a/strings/decode_string.py → algorithms/strings/decode_string.py b/strings/decode_string.py → algorithms/strings/decode_string.py
diff --git a/strings/delete_reoccurring.py → algorithms/strings/delete_reoccurring.py b/strings/delete_reoccurring.py → algorithms/strings/delete_reoccurring.py
diff --git a/strings/domain_extractor.py → algorithms/strings/domain_extractor.py b/strings/domain_extractor.py → algorithms/strings/domain_extractor.py
diff --git a/strings/encode_decode.py → algorithms/strings/encode_decode.py b/strings/encode_decode.py → algorithms/strings/encode_decode.py
diff --git a/strings/fizzbuzz.py → algorithms/strings/fizzbuzz.py b/strings/fizzbuzz.py → algorithms/strings/fizzbuzz.py
diff --git a/strings/group_anagrams.py → algorithms/strings/group_anagrams.py b/strings/group_anagrams.py → algorithms/strings/group_anagrams.py
diff --git a/strings/int_to_roman.py → algorithms/strings/int_to_roman.py b/strings/int_to_roman.py → algorithms/strings/int_to_roman.py
diff --git a/strings/is_palindrome.py → algorithms/strings/is_palindrome.py b/strings/is_palindrome.py → algorithms/strings/is_palindrome.py
diff --git a/strings/is_rotated.py → algorithms/strings/is_rotated.py b/strings/is_rotated.py → algorithms/strings/is_rotated.py
diff --git a/strings/license_number.py → algorithms/strings/license_number.py b/strings/license_number.py → algorithms/strings/license_number.py
diff --git a/strings/make_sentence.py → algorithms/strings/make_sentence.py b/strings/make_sentence.py → algorithms/strings/make_sentence.py
diff --git a/strings/merge_string_checker.py → algorithms/strings/merge_string_checker.py b/strings/merge_string_checker.py → algorithms/strings/merge_string_checker.py
diff --git a/strings/multiply_strings.py → algorithms/strings/multiply_strings.py b/strings/multiply_strings.py → algorithms/strings/multiply_strings.py
diff --git a/strings/one_edit_distance.py → algorithms/strings/one_edit_distance.py b/strings/one_edit_distance.py → algorithms/strings/one_edit_distance.py
diff --git a/strings/rabin_karp.py → algorithms/strings/rabin_karp.py b/strings/rabin_karp.py → algorithms/strings/rabin_karp.py
diff --git a/strings/reverse_string.py → algorithms/strings/reverse_string.py b/strings/reverse_string.py → algorithms/strings/reverse_string.py
diff --git a/strings/reverse_vowel.py → algorithms/strings/reverse_vowel.py b/strings/reverse_vowel.py → algorithms/strings/reverse_vowel.py
diff --git a/strings/reverse_words.py → algorithms/strings/reverse_words.py b/strings/reverse_words.py → algorithms/strings/reverse_words.py
diff --git a/strings/roman_to_int.py → algorithms/strings/roman_to_int.py b/strings/roman_to_int.py → algorithms/strings/roman_to_int.py
diff --git a/strings/strip_url_params.py → algorithms/strings/strip_url_params.py b/strings/strip_url_params.py → algorithms/strings/strip_url_params.py
diff --git a/strings/validate_coordinates.py → algorithms/strings/validate_coordinates.py b/strings/validate_coordinates.py → algorithms/strings/validate_coordinates.py
diff --git a/strings/word_squares.py → algorithms/strings/word_squares.py b/strings/word_squares.py → algorithms/strings/word_squares.py
diff --git a/bit/__init__.py → algorithms/tree/avl/__init__.py b/bit/__init__.py → algorithms/tree/avl/__init__.py
diff --git a/tree/avl/avl.py → algorithms/tree/avl/avl.py b/tree/avl/avl.py → algorithms/tree/avl/avl.py
diff --git a/tree/binary_tree_paths.py → algorithms/tree/binary_tree_paths.py b/tree/binary_tree_paths.py → algorithms/tree/binary_tree_paths.py
diff --git a/tree/bintree2list.py → algorithms/tree/bintree2list.py b/tree/bintree2list.py → algorithms/tree/bintree2list.py
diff --git a/tree/bst/BSTIterator.py → algorithms/tree/bst/BSTIterator.py b/tree/bst/BSTIterator.py → algorithms/tree/bst/BSTIterator.py
diff --git a/tree/bst/array2bst.py → algorithms/tree/bst/array2bst.py b/tree/bst/array2bst.py → algorithms/tree/bst/array2bst.py
diff --git a/tree/bst/bst.py → algorithms/tree/bst/bst.py b/tree/bst/bst.py → algorithms/tree/bst/bst.py
diff --git a/tree/bst/bst_closest_value.py → algorithms/tree/bst/bst_closest_value.py b/tree/bst/bst_closest_value.py → algorithms/tree/bst/bst_closest_value.py
diff --git a/tree/bst/count_left_node.py → algorithms/tree/bst/count_left_node.py b/tree/bst/count_left_node.py → algorithms/tree/bst/count_left_node.py
diff --git a/tree/bst/delete_node.py → algorithms/tree/bst/delete_node.py b/tree/bst/delete_node.py → algorithms/tree/bst/delete_node.py
diff --git a/tree/bst/depth_sum.py → algorithms/tree/bst/depth_sum.py b/tree/bst/depth_sum.py → algorithms/tree/bst/depth_sum.py
diff --git a/tree/bst/height.py → algorithms/tree/bst/height.py b/tree/bst/height.py → algorithms/tree/bst/height.py
diff --git a/tree/bst/is_bst.py → algorithms/tree/bst/is_bst.py b/tree/bst/is_bst.py → algorithms/tree/bst/is_bst.py
diff --git a/tree/bst/kth_smallest.py → algorithms/tree/bst/kth_smallest.py b/tree/bst/kth_smallest.py → algorithms/tree/bst/kth_smallest.py
diff --git a/tree/bst/lowest_common_ancestor.py → ...rithms/tree/bst/lowest_common_ancestor.py b/tree/bst/lowest_common_ancestor.py → ...rithms/tree/bst/lowest_common_ancestor.py
diff --git a/tree/bst/num_empty.py → algorithms/tree/bst/num_empty.py b/tree/bst/num_empty.py → algorithms/tree/bst/num_empty.py
diff --git a/tree/bst/predecessor.py → algorithms/tree/bst/predecessor.py b/tree/bst/predecessor.py → algorithms/tree/bst/predecessor.py
diff --git a/tree/bst/serialize_deserialize.py → algorithms/tree/bst/serialize_deserialize.py b/tree/bst/serialize_deserialize.py → algorithms/tree/bst/serialize_deserialize.py
diff --git a/tree/bst/successor.py → algorithms/tree/bst/successor.py b/tree/bst/successor.py → algorithms/tree/bst/successor.py
diff --git a/tree/bst/unique_bst.py → algorithms/tree/bst/unique_bst.py b/tree/bst/unique_bst.py → algorithms/tree/bst/unique_bst.py
diff --git a/tree/deepest_left.py → algorithms/tree/deepest_left.py b/tree/deepest_left.py → algorithms/tree/deepest_left.py
diff --git a/tree/invert_tree.py → algorithms/tree/invert_tree.py b/tree/invert_tree.py → algorithms/tree/invert_tree.py
diff --git a/tree/is_balanced.py → algorithms/tree/is_balanced.py b/tree/is_balanced.py → algorithms/tree/is_balanced.py
diff --git a/tree/is_subtree.py → algorithms/tree/is_subtree.py b/tree/is_subtree.py → algorithms/tree/is_subtree.py
diff --git a/tree/is_symmetric.py → algorithms/tree/is_symmetric.py b/tree/is_symmetric.py → algorithms/tree/is_symmetric.py
diff --git a/tree/longest_consecutive.py → algorithms/tree/longest_consecutive.py b/tree/longest_consecutive.py → algorithms/tree/longest_consecutive.py
diff --git a/tree/lowest_common_ancestor.py → algorithms/tree/lowest_common_ancestor.py b/tree/lowest_common_ancestor.py → algorithms/tree/lowest_common_ancestor.py
diff --git a/tree/max_height.py → algorithms/tree/max_height.py b/tree/max_height.py → algorithms/tree/max_height.py
diff --git a/tree/max_path_sum.py → algorithms/tree/max_path_sum.py b/tree/max_path_sum.py → algorithms/tree/max_path_sum.py
diff --git a/tree/min_height.py → algorithms/tree/min_height.py b/tree/min_height.py → algorithms/tree/min_height.py
diff --git a/tree/path_sum.py → algorithms/tree/path_sum.py b/tree/path_sum.py → algorithms/tree/path_sum.py
diff --git a/tree/path_sum2.py → algorithms/tree/path_sum2.py b/tree/path_sum2.py → algorithms/tree/path_sum2.py
diff --git a/tree/pretty_print.py → algorithms/tree/pretty_print.py b/tree/pretty_print.py → algorithms/tree/pretty_print.py
diff --git a/tree/red_black_tree/red_black_tree.py → ...hms/tree/red_black_tree/red_black_tree.py b/tree/red_black_tree/red_black_tree.py → ...hms/tree/red_black_tree/red_black_tree.py
diff --git a/tree/same_tree.py → algorithms/tree/same_tree.py b/tree/same_tree.py → algorithms/tree/same_tree.py
diff --git a/tree/segment_tree/segment_tree.py → algorithms/tree/segment_tree/segment_tree.py b/tree/segment_tree/segment_tree.py → algorithms/tree/segment_tree/segment_tree.py
diff --git a/tree/traversal/inorder.py → algorithms/tree/traversal/inorder.py b/tree/traversal/inorder.py → algorithms/tree/traversal/inorder.py
diff --git a/tree/traversal/level_order.py → algorithms/tree/traversal/level_order.py b/tree/traversal/level_order.py → algorithms/tree/traversal/level_order.py
diff --git a/tree/traversal/zigzag.py → algorithms/tree/traversal/zigzag.py b/tree/traversal/zigzag.py → algorithms/tree/traversal/zigzag.py
diff --git a/tree/tree.py → algorithms/tree/tree.py b/tree/tree.py → algorithms/tree/tree.py
diff --git a/tree/trie/add_and_search.py → algorithms/tree/trie/add_and_search.py b/tree/trie/add_and_search.py → algorithms/tree/trie/add_and_search.py
diff --git a/tree/trie/trie.py → algorithms/tree/trie/trie.py b/tree/trie/trie.py → algorithms/tree/trie/trie.py
diff --git a/union-find/count_islands.py → algorithms/union-find/count_islands.py b/union-find/count_islands.py → algorithms/union-find/count_islands.py
diff --git a/graph/__init__.py b/graph/__init__.py
diff --git a/heap/__init__.py b/heap/__init__.py
diff --git a/linkedlist/__init__.py b/linkedlist/__init__.py
diff --git a/maths/__init__.py b/maths/__init__.py
diff --git a/queues/__init__.py b/queues/__init__.py
diff --git a/search/__init__.py b/search/__init__.py
diff --git a/sort/__init__.py b/sort/__init__.py
diff --git a/stack/__init__.py b/stack/__init__.py
diff --git a/tests/test_bit.py b/tests/test_bit.py
@@ -1,18 +1,20 @@
-from bit.add_bitwise_operator import add_bitwise_operator
-from bit.count_ones import count_ones_iter, count_ones_recur
-from bit.find_missing_number import find_missing_number, find_missing_number2
-from bit.power_of_two import is_power_of_two
-from bit.reverse_bits import reverse_bits
-from bit.single_number import single_number
-from bit.single_number2 import single_number2
-from bit.single_number3 import single_number3
-from bit.subsets import subsets
-from bit.bit_operation import get_bit, set_bit, clear_bit, update_bit
-from bit.swap_pair import swap_pair
-from bit.find_difference import find_difference
-from bit.has_alternative_bit import has_alternative_bit, has_alternative_bit_fast
-from bit.insert_bit import insert_one_bit, insert_mult_bits
-from bit.remove_bit import remove_bit
+from algorithms.bit import (
+    add_bitwise_operator,
+    count_ones_iter, count_ones_recur,
+    find_missing_number, find_missing_number2,
+    is_power_of_two,
+    reverse_bits,
+    single_number,
+    single_number2,
+    single_number3,
+    subsets,
+    get_bit, set_bit, clear_bit, update_bit,
+    swap_pair,
+    find_difference,
+    has_alternative_bit, has_alternative_bit_fast,
+    insert_one_bit, insert_mult_bits,
+    remove_bit
+)
 
 import unittest
 import random

diff --git a/tests/test_graph.py b/tests/test_graph.py
@@ -1,4 +1,4 @@
-from graph.tarjan import Tarjan
+from algorithms.graph import Tarjan
 
 import unittest
 
@@ -41,4 +41,4 @@ def test_tarjan_example_2(self):
         }
 
         g = Tarjan(example)
-        self.assertEqual(g.sccs, [['A', 'B', 'E'], ['C', 'D'], ['F', 'G'], ['H']])
+        self.assertEqual(g.sccs, [['A', 'B', 'E'], ['C', 'D'], ['F', 'G'], ['H']])
diff --git a/tests/test_heap.py b/tests/test_heap.py
@@ -1,6 +1,8 @@
-from heap.binary_heap import BinaryHeap
-from heap.skyline import get_skyline
-from heap.sliding_window_max import max_sliding_window
+from algorithms.heap import (
+    BinaryHeap,
+    get_skyline,
+    max_sliding_window
+)
 
 import unittest
 

diff --git a/tests/test_linkedlist.py b/tests/test_linkedlist.py
@@ -1,11 +1,13 @@
-from linkedlist.reverse import reverse_list, reverse_list_recursive
-from linkedlist.is_sorted import is_sorted
-from linkedlist.remove_range import remove_range
-from linkedlist.swap_in_pairs import swap_pairs
-from linkedlist.rotate_list import rotate_right
-from linkedlist.is_cyclic import is_cyclic
-from linkedlist.merge_two_list import merge_two_list, merge_two_list_recur
-from linkedlist.is_palindrome import is_palindrome, is_palindrome_stack, is_palindrome_dict
+from algorithms.linkedlist import (
+    reverse_list, reverse_list_recursive,
+    is_sorted,
+    remove_range,
+    swap_pairs,
+    rotate_right,
+    is_cyclic,
+    merge_two_list, merge_two_list_recur,
+    is_palindrome, is_palindrome_stack, is_palindrome_dict
+)
 
 import unittest
 

diff --git a/tests/test_maths.py b/tests/test_maths.py
@@ -1,14 +1,16 @@
-from maths.base_conversion import int2base, base2int
-from maths.extended_gcd import extended_gcd
-from maths.gcd import gcd, lcm
-from maths.generate_strobogrammtic import gen_strobogrammatic, strobogrammatic_in_range
-from maths.is_strobogrammatic import is_strobogrammatic, is_strobogrammatic2
-from maths.next_perfect_square import find_next_square, find_next_square2
-from maths.prime_check import prime_check, prime_check2
-from maths.primes_sieve_of_eratosthenes import primes
-from maths.pythagoras import pythagoras
-from maths.rabin_miller import is_prime
-from maths.rsa import encrypt, decrypt, generate_key
+from algorithms.maths import (
+    int2base, base2int,
+    extended_gcd,
+    gcd, lcm,
+    gen_strobogrammatic, strobogrammatic_in_range,
+    is_strobogrammatic, is_strobogrammatic2,
+    find_next_square, find_next_square2,
+    prime_check, prime_check2,
+    primes,
+    pythagoras,
+    is_prime,
+    encrypt, decrypt, generate_key
+)
 
 import unittest
 

diff --git a/tests/test_queues.py b/tests/test_queues.py
@@ -1,7 +1,10 @@
-from queues.queue import ArrayQueue, LinkedListQueue
-from queues.max_sliding_window import max_sliding_window
-from queues.reconstruct_queue import reconstruct_queue
-from queues.priority_queue import PriorityQueue, PriorityQueueNode
+from algorithms.queues import (
+    ArrayQueue, LinkedListQueue,
+    max_sliding_window,
+    reconstruct_queue,
+    PriorityQueue, PriorityQueueNode
+)
+
 import unittest
 
 class TestQueue(unittest.TestCase):

diff --git a/tests/test_search.py b/tests/test_search.py
@@ -1,11 +1,13 @@
-from search.binary_search import binary_search, binary_search_recur
-from search.first_occurance import first_occurance
-from search.last_occurance import last_occurance
-from search.search_insert import search_insert
-from search.two_sum import two_sum, two_sum1, two_sum2
-from search.search_range import search_range
-from search.find_min_rotate import find_min_rotate, find_min_rotate_recur
-from search.search_rotate import search_rotate, search_rotate_recur
+from algorithms.search import (
+    binary_search, binary_search_recur,
+    first_occurance,
+    last_occurance,
+    search_insert,
+    two_sum, two_sum1, two_sum2,
+    search_range,
+    find_min_rotate, find_min_rotate_recur,
+    search_rotate, search_rotate_recur
+)
 
 import unittest
 

diff --git a/tests/test_sort.py b/tests/test_sort.py
@@ -1,11 +1,13 @@
-from sort.bubble_sort import bubble_sort
-from sort.comb_sort import comb_sort
-from sort.counting_sort import counting_sort
-from sort.heap_sort import max_heap_sort, min_heap_sort
-from sort.insertion_sort import insertion_sort
-from sort.merge_sort import merge_sort
-from sort.quick_sort import quick_sort
-from sort.selection_sort import selection_sort
+from algorithms.sort import (
+    bubble_sort,
+    comb_sort,
+    counting_sort,
+    max_heap_sort, min_heap_sort,
+    insertion_sort,
+    merge_sort,
+    quick_sort,
+    selection_sort
+)
 
 import unittest
 

diff --git a/tests/test_stack.py b/tests/test_stack.py
@@ -1,12 +1,14 @@
-from stack.is_consecutive import first_is_consecutive, second_is_consecutive
-from stack.is_sorted import is_sorted
-from stack.remove_min import remove_min
-from stack.stutter import first_stutter, second_stutter
-from stack.switch_pairs import first_switch_pairs, second_switch_pairs
-from stack.valid_parenthesis import is_valid
-from stack.simplify_path import simplify_path
-from stack.stack import ArrayStack, LinkedListStack
-from stack.ordered_stack import OrderedStack
+from algorithms.stack import (
+    first_is_consecutive, second_is_consecutive,
+    is_sorted,
+    remove_min,
+    first_stutter, second_stutter,
+    first_switch_pairs, second_switch_pairs,
+    is_valid,
+    simplify_path,
+    ArrayStack, LinkedListStack,
+    OrderedStack
+)
 
 import unittest
 class TestSuite(unittest.TestCase):