✨ Added. index.md per subfolder and updater script.

KristoferSoler · KristoferSoler · commit f92d8e2eaadf · 2019-10-08T21:54:27.000+02:00
diff --git a/algorithms/dynamic_programming/index.md b/algorithms/dynamic_programming/index.md
@@ -0,0 +1,4 @@
+# Index of dynamic_programming
+
+* longest_common_subsequence.py
+* rod_cutting.py
diff --git a/algorithms/math/index.md b/algorithms/math/index.md
@@ -0,0 +1,3 @@
+# Index of math
+
+* greatest_common_divisor.py
diff --git a/algorithms/sorting/index.md b/algorithms/sorting/index.md
@@ -0,0 +1,4 @@
+# Index of sorting
+
+* insertion_sort.py
+* select_sort.py
diff --git a/data_structures/array/index.md b/data_structures/array/index.md
@@ -0,0 +1,34 @@
+# Index of array
+
+* permutations_of_word.py
+* sorted_array_three_common_elements.py
+* dutch_flag_problem.py
+* partition_three_parts_equal_sum.py
+* binary_search_infinite_array.py
+* largest_element.py
+* right_place.py
+* rotation.py
+* find_missing_numbers.py
+* three_largest_elements.py
+* triplet_sum.py
+* max_product.py
+* moves_zeros_to_end.py
+* pivot_index.py
+* intersection_sorted_array.py
+* max_triplet_sum.py
+* number_of_1_in_sorted_array.py
+* square_of_sorted_array.py
+* max_consecutive_ones.py
+* max_product_three_elements.py
+* kadane_algorithm.py
+* all_numbers_divisible.py
+* duplicates.py
+* majority_element.py
+* find_sum.py
+* quick_sort.py
+* peak_element.py
+* union_sorted_array.py
+* min_product.py
+* sort_by_parity.py
+* duplicate.py
+* product_of_array_except_self.py
diff --git a/data_structures/binary_trees/index.md b/data_structures/binary_trees/index.md
@@ -0,0 +1,3 @@
+# Index of binary_trees
+
+* symmetric_binary_tree.py
diff --git a/data_structures/bst/index.md b/data_structures/bst/index.md
@@ -0,0 +1,31 @@
+# Index of bst
+
+* deletion.py
+* sorted_array_to_bst.py
+* print_left_node.py
+* diameter.py
+* bfs.py
+* check_if_bt_if_bst.py
+* trim_bst.py
+* bt_to_bst.py
+* binary_search_tree.py
+* convert_bst_to_right_node_tree.py
+* kth_largest_in_bst.py
+* range_sum.py
+* dfs_iterative.py
+* print_ancestor.py
+* min_max_value_in_bst.py
+* check_bt_is_subtree_of_another_bt.py
+* ceil.py
+* closest_element.py
+* kth_smallest_in_bst.py
+* insertion_iterative.py
+* lowest_common_ancestor.py
+* dfs_recursion.py
+* search.py
+* insertion_recursive.py
+* duplicate_keys.py
+* merge_sum.py
+* linked_list_to_bst.py
+* reverse_inorder_traversal.py
+* average_of_levels.py
diff --git a/data_structures/circular_linked_list/index.md b/data_structures/circular_linked_list/index.md
@@ -0,0 +1,5 @@
+# Index of circular_linked_list
+
+* check_circular_linked_list.py
+* delete.py
+* traversal.py
diff --git a/data_structures/doubly_linked_list/index.md b/data_structures/doubly_linked_list/index.md
@@ -0,0 +1,3 @@
+# Index of doubly_linked_list
+
+* doubly_linked_list.py
diff --git a/data_structures/graphs/index.md b/data_structures/graphs/index.md
@@ -0,0 +1,3 @@
+# Index of graphs
+
+* adjeceny_list.py
diff --git a/data_structures/linked_list/index.md b/data_structures/linked_list/index.md
@@ -0,0 +1,11 @@
+# Index of linked_list
+
+* remove.py
+* pair_swap.py
+* reverse.py
+* linked_list.py
+* cycle_detection.py
+* remove_nth_node_from_end.py
+* odd_even_arrangement.py
+* merge_linked_list.py
+* remove_duplicates.py
diff --git a/data_structures/stack/index.md b/data_structures/stack/index.md
@@ -0,0 +1,6 @@
+# Index of stack
+
+* valid_parenthesis.py
+* Largest Rectangle area in a Histogram.py
+* remove_duplicates_adjacent.py
+* validate_stack_sequence.py
diff --git a/data_structures/strings/index.md b/data_structures/strings/index.md
@@ -0,0 +1,3 @@
+# Index of strings
+
+* check_permutations.py
diff --git a/index_updater.py b/index_updater.py
@@ -0,0 +1,27 @@
+#!/usr/bin/env python3
+
+import sys
+import os
+
+# Terminal parameters.
+if len(sys.argv[1:]) == 0:
+    print('Please, give a path')
+    sys.exit()
+else:
+    mypath = sys.argv[1]
+
+# Going trought folders and subfolders.
+for root, dirs, files in os.walk(mypath):
+    curr_files = list()
+    curr_folder = os.path.basename(root)
+
+    for name in files:
+        if name.endswith('.py') and not name == '__init__py' and not dirs:
+            curr_files.append(name)
+
+    # If we have files, write "index.md"
+    if curr_files:
+        with open(os.path.join(root, 'index.md'), mode='w') as md_file:
+            md_file.write('# Index of {}\n\n'.format(curr_folder))
+            for line in curr_files:
+                md_file.write('* ' + line + '\n')

Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Index of math`
	`2`	`+`
	`3`	`+* greatest_common_divisor.py`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Index of binary_trees`
	`2`	`+`
	`3`	`+* symmetric_binary_tree.py`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Index of doubly_linked_list`
	`2`	`+`
	`3`	`+* doubly_linked_list.py`
Original file line number	Diff line number	Diff line change
`@@ -0,0 +1,3 @@`
	`1`	`+# Index of graphs`
	`2`	`+`
	`3`	`+* adjeceny_list.py`