Data structures and algorithms

This repository contains the compilation of solution of commonly asked Data Strcuture and Algorithm interview questions.

It contains programs on the following topics:

Data Structures

Algorithms

Cracking the Coding Interview

It contains:

Chapter wise solution to questions in the book Cracking the Coding Interview.

Tests

python -m tests.searching_test
python -m tests.sorting_test

Name		Name	Last commit message	Last commit date
Latest commit History 2 Commits
.DS_Store		.DS_Store
.gitignore		.gitignore
README.md		README.md
README.mdown		README.mdown
add_two_numbers_in_linked_list.py		add_two_numbers_in_linked_list.py
alternate_merge.py		alternate_merge.py
binary_tree.py		binary_tree.py
binary_tree_diameter.py		binary_tree_diameter.py
binary_tree_to_doubly_link_list.py		binary_tree_to_doubly_link_list.py
bitonic_search.py		bitonic_search.py
boundary_traversal.py		boundary_traversal.py
bubble_sort.py		bubble_sort.py
bucket_sort.py		bucket_sort.py
check_if_all_leaves_are_at_same_level.py		check_if_all_leaves_are_at_same_level.py
check_if_bst.py		check_if_bst.py
check_if_child_sum_property.py		check_if_child_sum_property.py
check_if_linklist_is_palindrome.py		check_if_linklist_is_palindrome.py
check_if_tree_is_complete_tree.py		check_if_tree_is_complete_tree.py
check_if_tree_is_subtree_of_another.py		check_if_tree_is_subtree_of_another.py
check_if_tree_is_sumtree.py		check_if_tree_is_sumtree.py
common_intersection_of_two_linked_list.py		common_intersection_of_two_linked_list.py
connect_nodes.py		connect_nodes.py
connect_nodes_extending_level_order_traversal.py		connect_nodes_extending_level_order_traversal.py
construct_binary_tree_from_linked_list.py		construct_binary_tree_from_linked_list.py
construct_special_tree_from_inorder.py		construct_special_tree_from_inorder.py
construct_special_tree_from_preorder.py		construct_special_tree_from_preorder.py
construct_tree_from_inorder_preorder.py		construct_tree_from_inorder_preorder.py
construct_tree_from_preorder.py		construct_tree_from_preorder.py
construct_tree_from_preorder_postorder.py		construct_tree_from_preorder_postorder.py
construct_tree_from_sorted_array.py		construct_tree_from_sorted_array.py
convert_binary_tree_to_circular_doubly_linked_list.py		convert_binary_tree_to_circular_doubly_linked_list.py
convert_to_children_sum_property.py		convert_to_children_sum_property.py
convert_to_sumtree.py		convert_to_sumtree.py
convert_tree_to_linked_list.py		convert_tree_to_linked_list.py
count_duplicate.py		count_duplicate.py
count_leaf_nodes.py		count_leaf_nodes.py
deepest_left_leaf_node.py		deepest_left_leaf_node.py
delete_alternate_nodes.py		delete_alternate_nodes.py
delete_m_after_n.py		delete_m_after_n.py
detect_and_remove_loop.py		detect_and_remove_loop.py
diameter.py		diameter.py
double_tree.py		double_tree.py
duplicate_subtree_in_binary_tree.py		duplicate_subtree_in_binary_tree.py
extract_leaves_of_binary_tree.py		extract_leaves_of_binary_tree.py
find_intersection_of_two_linked_list.py		find_intersection_of_two_linked_list.py
find_the_closest_leaf_in_binary_tree.py		find_the_closest_leaf_in_binary_tree.py
first_and_last_occurence_in_sorted_array.py		first_and_last_occurence_in_sorted_array.py
foldable_binary_tree.py		foldable_binary_tree.py
half_tree.py		half_tree.py
heap_sort.py		heap_sort.py
identical_trees.py		identical_trees.py
initialize.py		initialize.py
inorder_successor.py		inorder_successor.py
inorder_without_recursion.py		inorder_without_recursion.py
insertion_sort.py		insertion_sort.py
is_height_balanced_tree.py		is_height_balanced_tree.py
isomorphic_trees.py		isomorphic_trees.py
iterative_postorder_traversal_using_two_stacks.py		iterative_postorder_traversal_using_two_stacks.py
iterative_preorder.py		iterative_preorder.py
iteratively_search_element_in_binary_tree.py		iteratively_search_element_in_binary_tree.py
kth_node_from_end.py		kth_node_from_end.py
left_leaves_sum.py		left_leaves_sum.py
left_view_of_tree.py		left_view_of_tree.py
level_of_node.py		level_of_node.py
level_order_traversal.py		level_order_traversal.py
level_order_traversal_line_by_line.py		level_order_traversal_line_by_line.py
linked_list.py		linked_list.py
lowest_common_ancestor_binary_tree.py		lowest_common_ancestor_binary_tree.py
majority_element.py		majority_element.py
max_width.py		max_width.py
max_width_non_recursive.py		max_width_non_recursive.py
maximum_sum_root_to_leaf_path.py		maximum_sum_root_to_leaf_path.py
merge_sort.py		merge_sort.py
mirror_binary_tree.py		mirror_binary_tree.py
morris_traversal_inorder.py		morris_traversal_inorder.py
morris_traversal_preorder.py		morris_traversal_preorder.py
print_all_ancestors_of_node.py		print_all_ancestors_of_node.py
print_all_nodes_at_k_distance.py		print_all_nodes_at_k_distance.py
print_tree_vertical_order.py		print_tree_vertical_order.py
quick_sort.py		quick_sort.py
radix_sort.py		radix_sort.py
reverse_alternate_k_nodes.py		reverse_alternate_k_nodes.py
reverse_alternate_levels.py		reverse_alternate_levels.py
reverse_level_order_traversal.py		reverse_level_order_traversal.py
root_to_leaf_path.py		root_to_leaf_path.py
root_to_leaf_pathsum_equal_to_a_given_number.py		root_to_leaf_pathsum_equal_to_a_given_number.py
rotate_linked_list.py		rotate_linked_list.py
selection_sort.py		selection_sort.py
spiral_order_traversal.py		spiral_order_traversal.py
swap_alternate_nodes.py		swap_alternate_nodes.py
swap_k_beginning_and_k_end.py		swap_k_beginning_and_k_end.py
vertical_sum.py		vertical_sum.py

vineetpathak/Python-Project2

Folders and files

Latest commit

History