Pythonic Data Structures and Algorithms

Minimal and clean example implementations of data structures and algorithms in Python 3.

Contributing

Thanks for your interest in contributing! There are many ways to contribute to this project. Get started here

Tests

Use unittest

For running all tests write down:

$ python3 -m unittest discover tests

For running some specific tests you can do this as following (Ex: sort):

$ python3 -m unittest tests.test_sort

Use pytest

For running all tests write down:

$ python3 -m pytest tests

List of Implementations

array
- delete_nth
- flatten
- garage
- josephus_problem
- longest_non_repeat
- merge_intervals
- missing_ranges
- plus_one
- rotate_array
- summary_ranges
- three_sum
- two_sum
- move_zeros_to_end
backtrack
- general_solution.md
- anagram
- array_sum_combinations
- combination_sum
- expression_add_operators
- factor_combinations
- generate_abbreviations
- generate_parenthesis
- letter_combination
- palindrome_partitioning
- pattern_match
- permute
- permute_unique
- subsets
- subsets_unique
bfs
- shortest_distance_from_all_buildings
- word_ladder
bit
- bytes_int_conversion
- count_ones
- find_missing_number
- power_of_two
- reverse_bits
- single_number2
- single_number
- subsets
- add_bitwise_operator
- bit_operation
- swap_pair
- find_difference
- has_alternative_bit
- insert_bit
- remove_bit
calculator
- math_parser
dfs
- all_factors
- count_islands
- pacific_atlantic
- sudoku_solver
- walls_and_gates
dp
- buy_sell_stock
- climbing_stairs
- coin_change
- combination_sum
- egg_drop
- house_robber
- job_scheduling
- knapsack
- longest_increasing
- matrix_chain_order
- max_product_subarray
- max_subarray
- min_cost_path
- num_decodings
- regex_matching
- rod_cut
- word_break
graph
- strongly_connected
- clone_graph
- cycle_detection
- find_all_cliques
- find_path
- graph
- markov_chain
- minimum_spanning_tree
- satisfiability
- tarjan
- traversal
heap
- merge_sorted_k_lists
- skyline
- sliding_window_max
- binary_heap
linkedlist
- add_two_numbers
- copy_random_pointer
- delete_node
- first_cyclic_node
- is_cyclic
- is_palindrome
- kth_to_last
- linkedlist
- remove_duplicates
- reverse
- rotate_list
- swap_in_pairs
- is_sorted
- remove_range
map
- hashtable
- separate_chaining_hashtable
- longest_common_subsequence
- randomized_set
- valid_sudoku
maths
- base_conversion
- extended_gcd
- gcd/lcm
- generate_strobogrammtic
- is_strobogrammatic
- next_bigger
- next_perfect_square
- nth_digit
- prime_test
- primes_sieve_of_eratosthenes
- pythagoras
- rabin_miller
- rsa
- sqrt_precision_factor
- summing_digits
matrix
- sudoku_validator
- bomb_enemy
- copy_transform
- count_paths
- matrix_rotation.txt
- rotate_image
- search_in_sorted_matrix
- sparse_dot_vector
- sparse_mul
- spiral_traversal
queues
- max_sliding_window
- moving_average
- queue
- reconstruct_queue
- zigzagiterator
search
- binary_search
- first_occurance
- last_occurance
- search_insert
- two_sum
- search_range
- find_min_rotate
- search_rotate
set
- randomized_set
- set_covering
sort
- bubble_sort
- comb_sort
- counting_sort
- heap_sort
- insertion_sort
- meeting_rooms
- merge_sort
- quick_sort
- selection_sort
- sort_colors
- topsort
- wiggle_sort
stack
- longest_abs_path
- simplify_path
- stack
- valid_parenthesis
- stutter
- switch_pairs
- is_consecutive
- remove_min
- is_sorted
strings
- delete_reoccurring_characters
- strip_url_params
- validate_coordinates
- domain_extractor
- merge_string_checker
- add_binary
- breaking_bad
- decode_string
- encode_decode
- group_anagrams
- int_to_roman
- is_palindrome
- license_number
- make_sentence
- multiply_strings
- one_edit_distance
- rabin_karp
- reverse_string
- reverse_vowel
- reverse_words
- roman_to_int
- word_squares
tree
- bst
  - array2bst
  - bst_closest_value
  - BSTIterator
  - delete_node
  - is_bst
  - kth_smallest
  - lowest_common_ancestor
  - predecessor
  - serialize_deserialize
  - successor
  - unique_bst
  - depth_sum
  - count_left_node
  - num_empty
  - height
- red_black_tree
  - red_black_tree
- segment_tree
  - segment_tree
- traversal
  - inorder
  - level_order
  - zigzag
- trie
  - add_and_search
  - trie
- binary_tree_paths
- bintree2list
- deepest_left
- invert_tree
- is_balanced
- is_subtree
- is_symmetric
- longest_consecutive
- lowest_common_ancestor
- max_height
- max_path_sum
- min_height
- path_sum
- path_sum2
- pretty_print
- same_tree
- tree
union-find
- count_islands

Contributors

The repo is maintained by

Keon Kim
Rahul Goswami
Christian Bender
Ankit Agarwal
Hai Hoang Dang
Saad

And thanks to all the contributors who helped in building the repo.