j-bennet / cracking Public

Notifications You must be signed in to change notification settings
Fork 2
Star 14

Problems from "Cracking the programming interview" book solved in Python

Notifications

Name		Name	Last commit message	Last commit date
Latest commit History 3 Commits
1.0_string_permutations.py		1.0_string_permutations.py
1.1_string_unique.py		1.1_string_unique.py
1.2_reverse_string.py		1.2_reverse_string.py
1.3_remove_duplicate_chars.py		1.3_remove_duplicate_chars.py
1.4_string_anagram.py		1.4_string_anagram.py
1.5_replace_spaces.py		1.5_replace_spaces.py
1.6_rotate_matrix.py		1.6_rotate_matrix.py
1.7_zeros_in_matrix.py		1.7_zeros_in_matrix.py
1.8_is_rotation.py		1.8_is_rotation.py
2.0_linked_list_basics.py		2.0_linked_list_basics.py
2.1_remove_duplicates.py		2.1_remove_duplicates.py
2.2_find_n_before_last.py		2.2_find_n_before_last.py
2.3_delete_node_only.py		2.3_delete_node_only.py
2.4_add_lists.py		2.4_add_lists.py
2.5_find_loop.py		2.5_find_loop.py
3.0_stacks_queues.py		3.0_stacks_queues.py
3.5_hanoi_towers.py		3.5_hanoi_towers.py
4.1_is_tree_balanced.py		4.1_is_tree_balanced.py
4.2_find_route.py		4.2_find_route.py
4.2_x_dijkstra.py		4.2_x_dijkstra.py
4.3_build_minimal_tree.py		4.3_build_minimal_tree.py
README.md		README.md
binary_tree.py		binary_tree.py
binary_tree.pyc		binary_tree.pyc
binary_tree_add_delete.py		binary_tree_add_delete.py
binary_tree_deserialize.py		binary_tree_deserialize.py
binary_tree_traverse.py		binary_tree_traverse.py
birthday_paradox.py		birthday_paradox.py
fibonacci.py		fibonacci.py
graph.py		graph.py
graph.pyc		graph.pyc
heap.py		heap.py
heap.pyc		heap.pyc
knapsack.py		knapsack.py
linked_list.py		linked_list.py
linked_list.pyc		linked_list.pyc
regex.py		regex.py
sorting_tests.py		sorting_tests.py
stack_queue.py		stack_queue.py
stack_queue.pyc		stack_queue.pyc