{ "info": { "author": "Omar Shalla", "author_email": "omarhassangul@gmail.com", "bugtrack_url": null, "classifiers": [ "Programming Language :: Python :: 3", "Programming Language :: Python :: 3.4", "Programming Language :: Python :: 3.5", "Programming Language :: Python :: 3.6", "Programming Language :: Python :: 3.7" ], "description": "\nData Structures and Algorithms\n==============================\n\nThis repository contains my implementations of data structures and algorithms using Python 3. Most of the algorithm questions are taken from LeetCode. This is a work in progress.\n\n## Install\nYou can use this as an API in your code as follows:\n\n $ pip3 install algorithms3\n\nAn example of running an algorithm:\n\n```python3\n#Check if a string containing brackets is valid or not\n\nfrom algorithms.stack import validate_parantheses\n\nif __name__ == '__main__':\n test = validate_parantheses('()[]')\n print(test)\n```\n\nIf an algorithm is listed in this repository but is not in the pip package, it means that I have not uploaded the latest version. I will be doing that once a week. \n\n## Uninstall\nIf you want to uninstall, simply run:\n\n $pip3 uninstall algorithms3\n\n## Tests\nI have written basic tests for most of the modules. To run all the tests at once run the following from the base directory of the project:\n\n $python3 -m unittest discover tests\n\n## Progress\n**Data Structures** : 13 \n**Algorithms**         : 482\n\n## List of Implementations\n\n\n\n* [**Arrays**](/algorithms/arrays) \n - [*Dynamic Array Implementation*](/algorithms/arrays/dynamic_array_implementation.py) \n - [Add To Array Form](/algorithms/arrays/add_to_array_form.py) \n - [Array Partition](/algorithms/arrays/array_partition.py) \n - [Assign Cookies](/algorithms/arrays/assign_cookies.py) \n - [Best Time To Buy Stock Ii](/algorithms/arrays/best_time_to_buy_stock_II.py) \n - [Best Time To Buy Stock](/algorithms/arrays/best_time_to_buy_stock.py) \n - [Contains Duplicate One](/algorithms/arrays/contains_duplicate_one.py) \n - [Contains Duplicate Range](/algorithms/arrays/contains_duplicate_range.py) \n - [Degree Array](/algorithms/arrays/degree_array.py) \n - [Distribute Candies](/algorithms/arrays/distribute_candies.py) \n - [Find All Dissapeared Numbers](/algorithms/arrays/find_all_dissapeared_numbers.py) \n - [Find All Duplicates](/algorithms/arrays/find_all_duplicates.py) \n - [Find Pivot Index](/algorithms/arrays/find_pivot_index.py) \n - [First Missing Positive](/algorithms/arrays/first_missing_positive.py) \n - [Friends Of Ages](/algorithms/arrays/friends_of_ages.py) \n - [Increasing Triplets](/algorithms/arrays/increasing_triplets.py) \n - [Intersection Two Arrays Ii](/algorithms/arrays/intersection_two_arrays_II.py) \n - [Is Monotonic](/algorithms/arrays/is_monotonic.py) \n - [K Diff Pairs](/algorithms/arrays/k_diff_pairs.py) \n - [Largest Number Twice Of Others](/algorithms/arrays/largest_number_twice_of_others.py) \n - [Longest Continuous Increasing Subsequence](/algorithms/arrays/longest_continuous_increasing_subsequence.py) \n - [Max Average Subarray](/algorithms/arrays/max_average_subarray.py) \n - [Max Consecutive Ones](/algorithms/arrays/max_consecutive_ones.py) \n - [Max Product Three Numbers](/algorithms/arrays/max_product_three_numbers.py) \n - [Maximize Distance To Nearest Person](/algorithms/arrays/maximize_distance_to_nearest_person.py) \n - [Maximum Subarray](/algorithms/arrays/maximum_subarray.py) \n - [Merge Intervals](/algorithms/arrays/merge_intervals.py) \n - [Merge Sorted Array](/algorithms/arrays/merge_sorted_array.py) \n - [Minimum Moves To Equal Array](/algorithms/arrays/minimum_moves_to_equal_array.py) \n - [Move Zeroes](/algorithms/arrays/move_zeroes.py) \n - [Next Greater Element](/algorithms/arrays/next_greater_element.py) \n - [Non Decreasing Array](/algorithms/arrays/non_decreasing_array.py) \n - [Number Plus One](/algorithms/arrays/number_plus_one.py) \n - [Partition Array In Three](/algorithms/arrays/partition_array_in_three.py) \n - [Place Flowers](/algorithms/arrays/place_flowers.py) \n - [Positions Large Groups](/algorithms/arrays/positions_large_groups.py) \n - [Product Of Array Except Self](/algorithms/arrays/product_of_array_except_self.py) \n - [Remove Duplicates Two](/algorithms/arrays/remove_duplicates_two.py) \n - [Rotate Array](/algorithms/arrays/rotate_array.py) \n - [Set Mismatch](/algorithms/arrays/set_mismatch.py) \n - [Shortest Unsorted Subarray](/algorithms/arrays/shortest_unsorted_subarray.py) \n - [Smallest Range I](/algorithms/arrays/smallest_range_I.py) \n - [Sum After Queries](/algorithms/arrays/sum_after_queries.py) \n - [Summary Ranges](/algorithms/arrays/summary_ranges.py) \n - [Third Max Number](/algorithms/arrays/third_max_number.py) \n - [Two Sum Sorted Array](/algorithms/arrays/two_sum_sorted_array.py) \n\n* [**Backtracking**](/algorithms/backtracking) \n - [Binary Watch](/algorithms/backtracking/binary_watch.py) \n - [Combinations Sum Three](/algorithms/backtracking/combinations_sum_three.py) \n - [Combinations Sum Two](/algorithms/backtracking/combinations_sum_two.py) \n - [Combinations Sum](/algorithms/backtracking/combinations_sum.py) \n - [Combinations](/algorithms/backtracking/combinations.py) \n - [Generate Paranthesis](/algorithms/backtracking/generate_paranthesis.py) \n - [Letter Case Permutations](/algorithms/backtracking/letter_case_permutations.py) \n - [Letter Combinations](/algorithms/backtracking/letter_combinations.py) \n - [Matchsticks To Square](/algorithms/backtracking/matchsticks_to_square.py) \n - [N Queens Ii](/algorithms/backtracking/n_queens_II.py) \n - [N Queens](/algorithms/backtracking/n_queens.py) \n - [Permutation Sequence](/algorithms/backtracking/permutation_sequence.py) \n - [Permutations One](/algorithms/backtracking/permutations_one.py) \n - [Permutations Two](/algorithms/backtracking/permutations_two.py) \n - [Subsets Duplicates](/algorithms/backtracking/subsets_duplicates.py) \n - [Subsets](/algorithms/backtracking/subsets.py) \n - [Valid Time](/algorithms/backtracking/valid_time.py) \n\n* [**Bash**](/algorithms/bash) \n - [Tenth Line](/algorithms/bash/tenth_line.sh) \n - [Valid Phone Number](/algorithms/bash/valid_phone_number.sh) \n\n* [**Binarysearch**](/algorithms/binarysearch) \n - [4Sum Ii](/algorithms/binarysearch/4sum_II.py) \n - [Arranging Coins](/algorithms/binarysearch/arranging_coins.py) \n - [Binary Search](/algorithms/binarysearch/binary_search.py) \n - [Find K Closest](/algorithms/binarysearch/find_k_closest.py) \n - [Find Peak](/algorithms/binarysearch/find_peak.py) \n - [Find Right Interval](/algorithms/binarysearch/find_right_interval.py) \n - [First Bad](/algorithms/binarysearch/first_bad.py) \n - [Guess Number](/algorithms/binarysearch/guess_number.py) \n - [H Index](/algorithms/binarysearch/h_index.py) \n - [Heaters](/algorithms/binarysearch/heaters.py) \n - [Min In Rotated Sorted Array](/algorithms/binarysearch/min_in_rotated_sorted_array.py) \n - [Minimum Size Subarray](/algorithms/binarysearch/minimum_size_subarray.py) \n - [Next Greater Letter](/algorithms/binarysearch/next_greater_letter.py) \n - [Peak Index Mountain Array](/algorithms/binarysearch/peak_index_mountain_array.py) \n - [Search 2D Matrix Ii](/algorithms/binarysearch/search_2d_matrix_II.py) \n - [Search 2D Matrix](/algorithms/binarysearch/search_2d_matrix.py) \n - [Search Insert Position](/algorithms/binarysearch/search_insert_position.py) \n - [Search Range](/algorithms/binarysearch/search_range.py) \n - [Search Rotated Array Ii](/algorithms/binarysearch/search_rotated_array_II.py) \n - [Search Rotated Array](/algorithms/binarysearch/search_rotated_array.py) \n - [Sqrt Number](/algorithms/binarysearch/sqrt_number.py) \n - [Valid Perfect Square](/algorithms/binarysearch/valid_perfect_square.py) \n\n* [**Bits**](/algorithms/bits) \n - [Binary Gap](/algorithms/bits/binary_gap.py) \n - [Complement Base 10 Integer](/algorithms/bits/complement_base_10_integer.py) \n - [Count 1 Bits](/algorithms/bits/count_1_bits.py) \n - [Count Set Bits Prime](/algorithms/bits/count_set_bits_prime.py) \n - [Is One Bit Character](/algorithms/bits/is_one_bit_character.py) \n - [Number With Alternating Bits](/algorithms/bits/number_with_alternating_bits.py) \n - [Prefix Divisible 5](/algorithms/bits/prefix_divisible_5.py) \n - [Reverse Bits](/algorithms/bits/reverse_bits.py) \n - [Single Number](/algorithms/bits/single_number.py) \n - [Sum Two Numbers](/algorithms/bits/sum_two_numbers.py) \n\n* [**Binary Search Tree**](/algorithms/bst) \n - [*Bst Implementation*](/algorithms/bst/bst_implementation.py) \n - [Bst Iterator](/algorithms/bst/bst_iterator.py) \n - [Bst To Greater Sum Tree](/algorithms/bst/bst_to_greater_sum_tree.py) \n - [Delete Node](/algorithms/bst/delete_node.py) \n - [Find Mode Bst](/algorithms/bst/find_mode_bst.py) \n - [Increasing Order Search Tree](/algorithms/bst/increasing_order_search_tree.py) \n - [Kth Smallest Element](/algorithms/bst/kth_smallest_element.py) \n - [List To Bst](/algorithms/bst/list_to_bst.py) \n - [Lowest Common Ancestor Bst](/algorithms/bst/lowest_common_ancestor_bst.py) \n - [Min Distance Bst](/algorithms/bst/min_distance_bst.py) \n - [Minimum Diff Bst](/algorithms/bst/minimum_diff_bst.py) \n - [Range Sum Bst](/algorithms/bst/range_sum_bst.py) \n - [Recover Bst](/algorithms/bst/recover_bst.py) \n - [Search Bst](/algorithms/bst/search_bst.py) \n - [Two Sum Bst](/algorithms/bst/two_sum_bst.py) \n - [Validate Bst](/algorithms/bst/validate_bst.py) \n\n* [**Dynamic Programming**](/algorithms/dp) \n - [Best Sight Seeing Pair](/algorithms/dp/best_sight_seeing_pair.py) \n - [Capacity To Ship Packages](/algorithms/dp/capacity_to_ship_packages.py) \n - [Climbing Stairs](/algorithms/dp/climbing_stairs.py) \n - [Continuous Subarray Sum](/algorithms/dp/continuous_subarray_sum.py) \n - [Delete Operations For Two Strings](/algorithms/dp/delete_operations_for_two_strings.py) \n - [Edit Distance](/algorithms/dp/edit_distance.py) \n - [Fibonacci](/algorithms/dp/fibonacci.py) \n - [House Robber](/algorithms/dp/house_robber.py) \n - [Integer Replacement](/algorithms/dp/integer_replacement.py) \n - [Jump Game](/algorithms/dp/jump_game.py) \n - [Kth Grammar](/algorithms/dp/kth_grammar.py) \n - [Longest Common Subsequence](/algorithms/dp/longest_common_subsequence.py) \n - [Longest Increasing Subsequence](/algorithms/dp/longest_increasing_subsequence.py) \n - [Max Crossed Lines](/algorithms/dp/max_crossed_lines.py) \n - [Max Product Subarray](/algorithms/dp/max_product_subarray.py) \n - [Maximum Sum Two Non Overlapping Subarray](/algorithms/dp/maximum_sum_two_non_overlapping_subarray.py) \n - [Min Cost Climbing Stairs](/algorithms/dp/min_cost_climbing_stairs.py) \n - [Minimum Path Sum](/algorithms/dp/minimum_path_sum.py) \n - [Nth Ugly Number](/algorithms/dp/nth_ugly_number.py) \n - [Partition Equal Subset](/algorithms/dp/partition_equal_subset.py) \n - [Pascal Row](/algorithms/dp/pascal_row.py) \n - [Pascal](/algorithms/dp/pascal.py) \n - [Pow](/algorithms/dp/pow.py) \n - [Range Sum Query 2D](/algorithms/dp/range_sum_query_2d.py) \n - [Range Sum Query Mutable](/algorithms/dp/range_sum_query_mutable.py) \n - [Range Sum Query](/algorithms/dp/range_sum_query.py) \n - [Super Ugly Number](/algorithms/dp/super_ugly_number.py) \n - [Triangle Min Path](/algorithms/dp/triangle_min_path.py) \n - [Unique Paths With Obstacle](/algorithms/dp/unique_paths_with_obstacle.py) \n - [Unique Paths](/algorithms/dp/unique_paths.py) \n - [Zero One Matrix](/algorithms/dp/zero_one_matrix.py) \n\n* [**Graphs**](/algorithms/graphs) \n - [*Graph Implementation*](/algorithms/graphs/graph_implementation.py) \n - [Bt Right View](/algorithms/graphs/bt_right_view.py) \n - [Clone Graph](/algorithms/graphs/clone_graph.py) \n - [Color The Border](/algorithms/graphs/color_the_border.py) \n - [Concatenated Words](/algorithms/graphs/concatenated_words.py) \n - [Course Order](/algorithms/graphs/course_order.py) \n - [Employee Importance](/algorithms/graphs/employee_importance.py) \n - [Flood Fill](/algorithms/graphs/flood_fill.py) \n - [Flower Planting With No Adjacent](/algorithms/graphs/flower_planting_with_no_adjacent.py) \n - [Friend Circle](/algorithms/graphs/friend_circle.py) \n - [House Robber Three](/algorithms/graphs/house_robber_three.py) \n - [Is Bipartate](/algorithms/graphs/is_bipartate.py) \n - [Jump Game Ii](/algorithms/graphs/jump_game_II.py) \n - [Keys And Rooms](/algorithms/graphs/keys_and_rooms.py) \n - [Longest Increasing Path Matrix](/algorithms/graphs/longest_increasing_path_matrix.py) \n - [Make Larger Island](/algorithms/graphs/make_larger_island.py) \n - [Max Area Island](/algorithms/graphs/max_area_island.py) \n - [Minesweeper](/algorithms/graphs/minesweeper.py) \n - [Minimum Height Trees](/algorithms/graphs/minimum_height_trees.py) \n - [Network Delay Time](/algorithms/graphs/network_delay_time.py) \n - [Number Islands](/algorithms/graphs/number_islands.py) \n - [Number Of Enclaves](/algorithms/graphs/number_of_enclaves.py) \n - [Pacific Atlantic Water Flow](/algorithms/graphs/pacific_atlantic_water_flow.py) \n - [Perfect Squares](/algorithms/graphs/perfect_squares.py) \n - [Redundant Connection](/algorithms/graphs/redundant_connection.py) \n - [Rotton Oranges](/algorithms/graphs/rotton_oranges.py) \n - [Shortest Bridge](/algorithms/graphs/shortest_bridge.py) \n - [Surround Region](/algorithms/graphs/surround_region.py) \n - [Town Judge](/algorithms/graphs/town_judge.py) \n - [Word Ladder Two](/algorithms/graphs/word_ladder_two.py) \n - [Word Ladder](/algorithms/graphs/word_ladder.py) \n - [Word Search](/algorithms/graphs/word_search.py) \n\n* [**Greedy**](/algorithms/greedy) \n - [Burst Balloons](/algorithms/greedy/burst_balloons.py) \n - [Di String Match](/algorithms/greedy/di_string_match.py) \n - [Dota2 Senate](/algorithms/greedy/dota2_senate.py) \n - [Fair Candy Swap](/algorithms/greedy/fair_candy_swap.py) \n - [Is Subsequence](/algorithms/greedy/is_subsequence.py) \n - [Make Paran Valid](/algorithms/greedy/make_paran_valid.py) \n - [Max Chunks To Make Sorted Ii](/algorithms/greedy/max_chunks_to_make_sorted_II.py) \n - [Max Chunks To Make Sorted](/algorithms/greedy/max_chunks_to_make_sorted.py) \n - [Maximize Sum Array](/algorithms/greedy/maximize_sum_array.py) \n - [Moving Stones](/algorithms/greedy/moving_stones.py) \n - [Non Overlapping Intervals](/algorithms/greedy/non_overlapping_intervals.py) \n - [Queue Reconstruction By Height](/algorithms/greedy/queue_reconstruction_by_height.py) \n - [Relative Ranks](/algorithms/greedy/relative_ranks.py) \n - [Remove Outermost Parantheses](/algorithms/greedy/remove_outermost_parantheses.py) \n - [Reorganize String](/algorithms/greedy/reorganize_string.py) \n - [Two City Scheduling](/algorithms/greedy/two_city_scheduling.py) \n\n* [**Hash Tables**](/algorithms/hashtables) \n - [*Hashmap Implementation*](/algorithms/hashtables/hashmap_implementation.py) \n - [Banned Words](/algorithms/hashtables/banned_words.py) \n - [Boomerang Points](/algorithms/hashtables/boomerang_points.py) \n - [Bulls And Cows](/algorithms/hashtables/bulls_and_cows.py) \n - [Deck Of Cards](/algorithms/hashtables/deck_of_cards.py) \n - [Distant Barcodes](/algorithms/hashtables/distant_barcodes.py) \n - [Encode Decode](/algorithms/hashtables/encode_decode.py) \n - [Expressive Words](/algorithms/hashtables/expressive_words.py) \n - [Find And Replace Pattern](/algorithms/hashtables/find_and_replace_pattern.py) \n - [Find Common Characters](/algorithms/hashtables/find_common_characters.py) \n - [Four Sum](/algorithms/hashtables/four_sum.py) \n - [Fraction To Decimal](/algorithms/hashtables/fraction_to_decimal.py) \n - [Group Anagrams](/algorithms/hashtables/group_anagrams.py) \n - [Hashmap](/algorithms/hashtables/hashmap.py) \n - [Hashset](/algorithms/hashtables/hashset.py) \n - [Insert Delete Random Duplicates](/algorithms/hashtables/insert_delete_random_duplicates.py) \n - [Insert Delete Random](/algorithms/hashtables/insert_delete_random.py) \n - [Keyboard Row](/algorithms/hashtables/keyboard_row.py) \n - [Largest Triangle Area](/algorithms/hashtables/largest_triangle_area.py) \n - [Lemonade Change](/algorithms/hashtables/lemonade_change.py) \n - [Longest Word Dictionary](/algorithms/hashtables/longest_word_dictionary.py) \n - [Lru Cache](/algorithms/hashtables/lru_cache.py) \n - [Magic Dictionary](/algorithms/hashtables/magic_dictionary.py) \n - [Minimum Index Sum Of Two Lists](/algorithms/hashtables/minimum_index_sum_of_two_lists.py) \n - [N Repeated Elements](/algorithms/hashtables/n_repeated_elements.py) \n - [Pairs With Sum](/algorithms/hashtables/pairs_with_sum.py) \n - [Powerful Integers](/algorithms/hashtables/powerful_integers.py) \n - [Repeated Dna Sequences](/algorithms/hashtables/repeated_dna_sequences.py) \n - [Shortest Completing Word](/algorithms/hashtables/shortest_completing_word.py) \n - [Shuffle Array](/algorithms/hashtables/shuffle_array.py) \n - [Sort By Count](/algorithms/hashtables/sort_by_count.py) \n - [Subdomain Visit Count](/algorithms/hashtables/subdomain_visit_count.py) \n - [Substring Concat](/algorithms/hashtables/substring_concat.py) \n - [Three Sum](/algorithms/hashtables/three_sum.py) \n - [Two Sum](/algorithms/hashtables/two_sum.py) \n - [Uncommon Words](/algorithms/hashtables/uncommon_words.py) \n - [Valid Sudoku](/algorithms/hashtables/valid_sudoku.py) \n - [Verifying Alien Dictionary](/algorithms/hashtables/verifying_alien_dictionary.py) \n - [Word Pattern](/algorithms/hashtables/word_pattern.py) \n - [Word Subsets](/algorithms/hashtables/word_subsets.py) \n\n* [**Heaps**](/algorithms/heaps) \n - [*Heap Implementation*](/algorithms/heaps/heap_implementation.py) \n - [*Priority Queue Implementation*](/algorithms/heaps/priority_queue_implementation.py) \n - [Check Valid Triangle](/algorithms/heaps/check_valid_triangle.py) \n - [Design Twitter](/algorithms/heaps/design_twitter.py) \n - [K Most Frequent](/algorithms/heaps/k_most_frequent.py) \n - [K Pairs With Smallest Sums](/algorithms/heaps/k_pairs_with_smallest_sums.py) \n - [Kth Largest In Stream](/algorithms/heaps/kth_largest_in_stream.py) \n - [Kth Largest](/algorithms/heaps/kth_largest.py) \n - [Kth Smallest In Sorted Matrix](/algorithms/heaps/kth_smallest_in_sorted_matrix.py) \n - [Last Stone Weight](/algorithms/heaps/last_stone_weight.py) \n - [Median Of Stream](/algorithms/heaps/median_of_stream.py) \n - [Top K Frequent Words](/algorithms/heaps/top_k_frequent_words.py) \n\n* [**Linked List**](/algorithms/linkedlist) \n - [*Singly Linked List Implementation*](/algorithms/linkedlist/singly_linked_list_implementation.py) \n - [Add Two Numbers Ii](/algorithms/linkedlist/add_two_numbers_II.py) \n - [Add Two Numbers](/algorithms/linkedlist/add_two_numbers.py) \n - [Delete Duplicates All](/algorithms/linkedlist/delete_duplicates_all.py) \n - [Delete Duplicates](/algorithms/linkedlist/delete_duplicates.py) \n - [Delete Node Without Head](/algorithms/linkedlist/delete_node_without_head.py) \n - [Intersection](/algorithms/linkedlist/intersection.py) \n - [Linked Cycle](/algorithms/linkedlist/linked_cycle.py) \n - [Linked List Cycle Ii](/algorithms/linkedlist/linked_list_cycle_II.py) \n - [Linkedlist](/algorithms/linkedlist/linkedlist.py) \n - [List Palindrome](/algorithms/linkedlist/list_palindrome.py) \n - [Merge K Lists](/algorithms/linkedlist/merge_k_lists.py) \n - [Merge Two Lists](/algorithms/linkedlist/merge_two_lists.py) \n - [Middle Linked List](/algorithms/linkedlist/middle_linked_list.py) \n - [Next Greater Node](/algorithms/linkedlist/next_greater_node.py) \n - [Odd Even Linked List](/algorithms/linkedlist/odd_even_linked_list.py) \n - [Partition List](/algorithms/linkedlist/partition_list.py) \n - [Remove Element](/algorithms/linkedlist/remove_element.py) \n - [Remove Nth End](/algorithms/linkedlist/remove_nth_end.py) \n - [Reorder List](/algorithms/linkedlist/reorder_list.py) \n - [Reverse K Groups](/algorithms/linkedlist/reverse_k_groups.py) \n - [Reverse Linkedlist](/algorithms/linkedlist/reverse_linkedlist.py) \n - [Reverse Mn](/algorithms/linkedlist/reverse_mn.py) \n - [Rotate List](/algorithms/linkedlist/rotate_list.py) \n - [Sort List](/algorithms/linkedlist/sort_list.py) \n - [Split List In Parts](/algorithms/linkedlist/split_list_in_parts.py) \n - [Swap Pairs](/algorithms/linkedlist/swap_pairs.py) \n\n* [**Math**](/algorithms/math) \n - [Add Binary](/algorithms/math/add_binary.py) \n - [Add Digits](/algorithms/math/add_digits.py) \n - [Basic Calculator I](/algorithms/math/basic_calculator_I.py) \n - [Basic Calculator Ii](/algorithms/math/basic_calculator_II.py) \n - [Construct Rectangle](/algorithms/math/construct_rectangle.py) \n - [Convert To Base 7](/algorithms/math/convert_to_base_7.py) \n - [Convert To Hex](/algorithms/math/convert_to_hex.py) \n - [Convert To Number](/algorithms/math/convert_to_number.py) \n - [Count Primes](/algorithms/math/count_primes.py) \n - [Count Zeroes Factorial](/algorithms/math/count_zeroes_factorial.py) \n - [Divide Two Numbers](/algorithms/math/divide_two_numbers.py) \n - [Game Of Nim](/algorithms/math/game_of_nim.py) \n - [Hamming Distance](/algorithms/math/hamming_distance.py) \n - [Happy Numbers](/algorithms/math/happy_numbers.py) \n - [Integer To English Words](/algorithms/math/integer_to_english_words.py) \n - [Intersection Two Arrays](/algorithms/math/intersection_two_arrays.py) \n - [Largest Triangle Area](/algorithms/math/largest_triangle_area.py) \n - [Majority Element](/algorithms/math/majority_element.py) \n - [Min Time Difference](/algorithms/math/min_time_difference.py) \n - [Minimum Area Rectangle](/algorithms/math/minimum_area_rectangle.py) \n - [Missing Number](/algorithms/math/missing_number.py) \n - [Next Greater Iii](/algorithms/math/next_greater_III.py) \n - [Next Permutation](/algorithms/math/next_permutation.py) \n - [Nth Digit](/algorithms/math/nth_digit.py) \n - [Num To Col](/algorithms/math/num_to_col.py) \n - [Perfect Number](/algorithms/math/perfect_number.py) \n - [Power Of Two](/algorithms/math/power_of_two.py) \n - [Reach A Number](/algorithms/math/reach_a_number.py) \n - [Rectangle Overlap](/algorithms/math/rectangle_overlap.py) \n - [Self Dividing Numbers](/algorithms/math/self_dividing_numbers.py) \n - [Smallest Integer Divisible By K](/algorithms/math/smallest_integer_divisible_by_k.py) \n - [Total Time](/algorithms/math/total_time.py) \n - [Ugly Numbers](/algorithms/math/ugly_numbers.py) \n - [Valid Boomerang](/algorithms/math/valid_boomerang.py) \n - [Valid Number](/algorithms/math/valid_number.py) \n\n* [**Matrix**](/algorithms/matrix) \n - [Brick Wall](/algorithms/matrix/brick_wall.py) \n - [Flip Image](/algorithms/matrix/flip_image.py) \n - [Game Of Life](/algorithms/matrix/game_of_life.py) \n - [Image Smoother](/algorithms/matrix/image_smoother.py) \n - [Island Perimeter](/algorithms/matrix/island_perimeter.py) \n - [Magic Squares In Grid](/algorithms/matrix/magic_squares_in_grid.py) \n - [Matrix Cells Distance](/algorithms/matrix/matrix_cells_distance.py) \n - [Range Addition](/algorithms/matrix/range_addition.py) \n - [Reshape Matrix](/algorithms/matrix/reshape_matrix.py) \n - [Robot Bounded Circle](/algorithms/matrix/robot_bounded_circle.py) \n - [Rook Captures](/algorithms/matrix/rook_captures.py) \n - [Rotate Image](/algorithms/matrix/rotate_image.py) \n - [Set Matrix Zeros](/algorithms/matrix/set_matrix_zeros.py) \n - [Spiral Matrix Generate](/algorithms/matrix/spiral_matrix_generate.py) \n - [Spiral Matrix Iii](/algorithms/matrix/spiral_matrix_III.py) \n - [Spiral Matrix](/algorithms/matrix/spiral_matrix.py) \n - [Toeplitz Matrix](/algorithms/matrix/toeplitz_matrix.py) \n - [Transpose Matrix](/algorithms/matrix/transpose_matrix.py) \n - [Walking Robot Simulation](/algorithms/matrix/walking_robot_simulation.py) \n\n* [**Mysql**](/algorithms/mysql) \n - [Big Countries.](/algorithms/mysql/big_countries.sql) \n - [Classes More Than 5.](/algorithms/mysql/classes_more_than_5.sql) \n - [Combine Two Tables.](/algorithms/mysql/combine_two_tables.sql) \n - [Customers Who Never Order.](/algorithms/mysql/customers_who_never_order.sql) \n - [Delete Duplicate Emails.](/algorithms/mysql/delete_duplicate_emails.sql) \n - [Duplicate Emails.](/algorithms/mysql/duplicate_emails.sql) \n - [Employee Earning More Than Managers.](/algorithms/mysql/employee_earning_more_than_managers.sql) \n - [Not Boring Movies.](/algorithms/mysql/not_boring_movies.sql) \n - [Rising Temperature.](/algorithms/mysql/rising_temperature.sql) \n - [Second Highest Salary.](/algorithms/mysql/second_highest_salary.sql) \n - [Swap Salary.](/algorithms/mysql/swap_salary.sql) \n\n* [**Queues**](/algorithms/queues) \n - [*Circular Deque Implementation*](/algorithms/queues/circular_deque_implementation.py) \n - [*Circular Queue Implementation*](/algorithms/queues/circular_queue_implementation.py) \n - [*Queue Implementation*](/algorithms/queues/queue_implementation.py) \n - [Gas Station](/algorithms/queues/gas_station.py) \n - [Max Sliding Window](/algorithms/queues/max_sliding_window.py) \n - [Queue Using Stacks](/algorithms/queues/queue_using_stacks.py) \n - [Rotate String](/algorithms/queues/rotate_string.py) \n - [Stack Using Queues](/algorithms/queues/stack_using_queues.py) \n\n* [**Sort**](/algorithms/sort) \n - [Bubble Sort](/algorithms/sort/bubble_sort.py) \n - [Delete Columns To Make Sorted](/algorithms/sort/delete_columns_to_make_sorted.py) \n - [Height Checker](/algorithms/sort/height_checker.py) \n - [Insertion Sort](/algorithms/sort/insertion_sort.py) \n - [Longest Harmonious Sequence](/algorithms/sort/longest_harmonious_sequence.py) \n - [Max Gap](/algorithms/sort/max_gap.py) \n - [Merge Sort](/algorithms/sort/merge_sort.py) \n - [Most Profit Workers](/algorithms/sort/most_profit_workers.py) \n - [Quick Sort](/algorithms/sort/quick_sort.py) \n - [Reorder Logs](/algorithms/sort/reorder_logs.py) \n - [Selection Sort](/algorithms/sort/selection_sort.py) \n - [Sort Array Parity Ii](/algorithms/sort/sort_array_parity_II.py) \n - [Sort By Parity](/algorithms/sort/sort_by_parity.py) \n - [Sort Three Colors](/algorithms/sort/sort_three_colors.py) \n\n* [**Stack**](/algorithms/stack) \n - [Baseball Game](/algorithms/stack/baseball_game.py) \n - [Duplicate Removal](/algorithms/stack/duplicate_removal.py) \n - [Evaluate Reverse Polish Notation](/algorithms/stack/evaluate_reverse_polish_notation.py) \n - [Exclusive Fuction Time](/algorithms/stack/exclusive_fuction_time.py) \n - [Min Stack](/algorithms/stack/min_stack.py) \n - [Next Greater Element Ii](/algorithms/stack/next_greater_element_II.py) \n - [One Three Two Pattern](/algorithms/stack/one_three_two_pattern.py) \n - [Remove K Digits](/algorithms/stack/remove_k_digits.py) \n - [Simplify Path](/algorithms/stack/simplify_path.py) \n - [Valid Paran](/algorithms/stack/valid_paran.py) \n - [Validate Stack Sequence](/algorithms/stack/validate_stack_sequence.py) \n\n* [**Strings**](/algorithms/strings) \n - [Add Binary](/algorithms/strings/add_binary.py) \n - [Add Strings](/algorithms/strings/add_strings.py) \n - [Backspace Compare](/algorithms/strings/backspace_compare.py) \n - [Buddy Strings](/algorithms/strings/buddy_strings.py) \n - [Camelcase Matching](/algorithms/strings/camelcase_matching.py) \n - [Compare Version Numbers](/algorithms/strings/compare_version_numbers.py) \n - [Complex Number Multiplication](/algorithms/strings/complex_number_multiplication.py) \n - [Count Binary Strings](/algorithms/strings/count_binary_strings.py) \n - [Count Say](/algorithms/strings/count_say.py) \n - [Decode String](/algorithms/strings/decode_string.py) \n - [Detect Capital](/algorithms/strings/detect_capital.py) \n - [Find All Anagrams](/algorithms/strings/find_all_anagrams.py) \n - [Find And Replace](/algorithms/strings/find_and_replace.py) \n - [Find Duplicate Files](/algorithms/strings/find_duplicate_files.py) \n - [First Unique Character](/algorithms/strings/first_unique_character.py) \n - [Goat Latin](/algorithms/strings/goat_latin.py) \n - [Int To Roman](/algorithms/strings/int_to_roman.py) \n - [Isomorphic](/algorithms/strings/isomorphic.py) \n - [Jewels](/algorithms/strings/jewels.py) \n - [Largest Number](/algorithms/strings/largest_number.py) \n - [Length Of Last Word](/algorithms/strings/length_of_last_word.py) \n - [Licence Key Reformatting](/algorithms/strings/licence_key_reformatting.py) \n - [Long Pressed Name](/algorithms/strings/long_pressed_name.py) \n - [Longest Common Prefix](/algorithms/strings/longest_common_prefix.py) \n - [Longest Palin Substring](/algorithms/strings/longest_palin_substring.py) \n - [Longest Palindrome](/algorithms/strings/longest_palindrome.py) \n - [Longest Substring With K Chars](/algorithms/strings/longest_substring_with_k_chars.py) \n - [Longest Substring Without Repeating](/algorithms/strings/longest_substring_without_repeating.py) \n - [Longest Uncommon Seq](/algorithms/strings/longest_uncommon_seq.py) \n - [Minimum Window String](/algorithms/strings/minimum_window_string.py) \n - [Multiply Strings](/algorithms/strings/multiply_strings.py) \n - [Number Of Segments String](/algorithms/strings/number_of_segments_string.py) \n - [Optimal Division](/algorithms/strings/optimal_division.py) \n - [Palindrome](/algorithms/strings/palindrome.py) \n - [Permutations In String](/algorithms/strings/permutations_in_string.py) \n - [Ransom Note](/algorithms/strings/ransom_note.py) \n - [Remove Comments](/algorithms/strings/remove_comments.py) \n - [Repeated String Match](/algorithms/strings/repeated_string_match.py) \n - [Repeated Substring Pattern](/algorithms/strings/repeated_substring_pattern.py) \n - [Reverse Int](/algorithms/strings/reverse_int.py) \n - [Reverse Only Letters](/algorithms/strings/reverse_only_letters.py) \n - [Reverse String Ii](/algorithms/strings/reverse_string_II.py) \n - [Reverse String Words](/algorithms/strings/reverse_string_words.py) \n - [Reverse String](/algorithms/strings/reverse_string.py) \n - [Reverse Vowels Strings](/algorithms/strings/reverse_vowels_strings.py) \n - [Reverse Words Iii](/algorithms/strings/reverse_words_III.py) \n - [Robot Origin](/algorithms/strings/robot_origin.py) \n - [Roman To Int](/algorithms/strings/roman_to_int.py) \n - [Rotated Digits](/algorithms/strings/rotated_digits.py) \n - [Shifting Letters](/algorithms/strings/shifting_letters.py) \n - [Shortest Distance To Character](/algorithms/strings/shortest_distance_to_character.py) \n - [String Compression](/algorithms/strings/string_compression.py) \n - [String To Integer](/algorithms/strings/string_to_integer.py) \n - [Strstr](/algorithms/strings/strstr.py) \n - [To Lower](/algorithms/strings/to_lower.py) \n - [Unique Email](/algorithms/strings/unique_email.py) \n - [Unique Morse Code](/algorithms/strings/unique_morse_code.py) \n - [Valid Anagram](/algorithms/strings/valid_anagram.py) \n - [Valid Ip](/algorithms/strings/valid_ip.py) \n - [Valid Palin](/algorithms/strings/valid_palin.py) \n - [Valid Palindrome Ii](/algorithms/strings/valid_palindrome_II.py) \n - [Valid String After Subs](/algorithms/strings/valid_string_after_subs.py) \n - [Zigzag Conversion](/algorithms/strings/zigzag_conversion.py) \n\n* [**Trees**](/algorithms/trees) \n - [*Tree Implementation*](/algorithms/trees/tree_implementation.py) \n - [*Trie Implementation*](/algorithms/trees/trie_implementation.py) \n - [Array Bst](/algorithms/trees/array_bst.py) \n - [Average Levels](/algorithms/trees/average_levels.py) \n - [Bst To Greater Tree](/algorithms/trees/bst_to_greater_tree.py) \n - [Build Tree Postorder](/algorithms/trees/build_tree_postorder.py) \n - [Construct Pre In](/algorithms/trees/construct_pre_in.py) \n - [Count Complete Tree Nodes](/algorithms/trees/count_complete_tree_nodes.py) \n - [Cousins In Binary Trees](/algorithms/trees/cousins_in_binary_trees.py) \n - [Diameter Binary Tree](/algorithms/trees/diameter_binary_tree.py) \n - [Find Bottom Left](/algorithms/trees/find_bottom_left.py) \n - [Flatten Binary Tree To Linked List](/algorithms/trees/flatten_binary_tree_to_linked_list.py) \n - [Inorder](/algorithms/trees/inorder.py) \n - [Invert Tree](/algorithms/trees/invert_tree.py) \n - [Is Balanced](/algorithms/trees/is_balanced.py) \n - [Largest Value Level](/algorithms/trees/largest_value_level.py) \n - [Left Similar Trees](/algorithms/trees/left_similar_trees.py) \n - [Level Order One](/algorithms/trees/level_order_one.py) \n - [Level Order Two](/algorithms/trees/level_order_two.py) \n - [Lowest Common Ancestor](/algorithms/trees/lowest_common_ancestor.py) \n - [Max Depth N Ary](/algorithms/trees/max_depth_n_ary.py) \n - [Max Depth](/algorithms/trees/max_depth.py) \n - [Max Subtree](/algorithms/trees/max_subtree.py) \n - [Maximum Diff Between Ancestor And Node](/algorithms/trees/maximum_diff_between_ancestor_and_node.py) \n - [Maximum Path Sum](/algorithms/trees/maximum_path_sum.py) \n - [Merge Two Trees](/algorithms/trees/merge_two_trees.py) \n - [Min Depth](/algorithms/trees/min_depth.py) \n - [Most Frequent Subtree Sum](/algorithms/trees/most_frequent_subtree_sum.py) \n - [N Ary Postorder](/algorithms/trees/n_ary_postorder.py) \n - [N Ary Preorder](/algorithms/trees/n_ary_preorder.py) \n - [Nary Level Order](/algorithms/trees/nary_level_order.py) \n - [Nodes At Distance K](/algorithms/trees/nodes_at_distance_k.py) \n - [Path Sum All](/algorithms/trees/path_sum_all.py) \n - [Path Sum Iii](/algorithms/trees/path_sum_III.py) \n - [Path Sum](/algorithms/trees/path_sum.py) \n - [Populate Next Right Pointer](/algorithms/trees/populate_next_right_pointer.py) \n - [Postorder](/algorithms/trees/postorder.py) \n - [Preorder](/algorithms/trees/preorder.py) \n - [Same Tree](/algorithms/trees/same_tree.py) \n - [Second Minimum Node](/algorithms/trees/second_minimum_node.py) \n - [Serialize Tree](/algorithms/trees/serialize_tree.py) \n - [Subtree Of Another Tree](/algorithms/trees/subtree_of_another_tree.py) \n - [Sum Of Left Leaves](/algorithms/trees/sum_of_left_leaves.py) \n - [Sum Root To Leaf Paths](/algorithms/trees/sum_root_to_leaf_paths.py) \n - [Sum Root To Leafs](/algorithms/trees/sum_root_to_leafs.py) \n - [Symmetric](/algorithms/trees/symmetric.py) \n - [Tilt Tree](/algorithms/trees/tilt_tree.py) \n - [Tree Paths](/algorithms/trees/tree_paths.py) \n - [Univalue Tree](/algorithms/trees/univalue_tree.py) \n - [Verify Tree Serialization](/algorithms/trees/verify_tree_serialization.py) \n - [Zigzag Level Order](/algorithms/trees/zigzag_level_order.py) \n\n* [**Trie**](/algorithms/trie) \n - [*Trie Implementation*](/algorithms/trie/trie_implementation.py) \n - [Longest Word Dictionary](/algorithms/trie/longest_word_dictionary.py) \n - [Replace Words](/algorithms/trie/replace_words.py) \n - [Word Search Ii](/algorithms/trie/word_search_II.py) \n\n* [**Two Pointers**](/algorithms/twopointers) \n - [Container With Most Water](/algorithms/twopointers/container_with_most_water.py) \n - [Find Duplicate Number](/algorithms/twopointers/find_duplicate_number.py) \n - [Longest Repeating Character Replacement](/algorithms/twopointers/longest_repeating_character_replacement.py) \n - [Longest Word In Dictionary](/algorithms/twopointers/longest_word_in_dictionary.py) \n - [Remove Duplicates](/algorithms/twopointers/remove_duplicates.py) \n - [Remove Element](/algorithms/twopointers/remove_element.py) \n - [Squares Of Sorted Array](/algorithms/twopointers/squares_of_sorted_array.py) \n - [Three Sum Closest](/algorithms/twopointers/three_sum_closest.py) \n\n\n\n", "description_content_type": "text/markdown", "docs_url": null, "download_url": "", "downloads": { "last_day": -1, "last_month": -1, "last_week": -1 }, "home_page": "https://github.com/gulshalla/algorithms", "keywords": "", "license": "MIT", "maintainer": "", "maintainer_email": "", "name": "algorithms3", "package_url": "https://pypi.org/project/algorithms3/", "platform": "", "project_url": "https://pypi.org/project/algorithms3/", "project_urls": { "Homepage": "https://github.com/gulshalla/algorithms" }, "release_url": "https://pypi.org/project/algorithms3/0.1.9/", "requires_dist": null, "requires_python": "", "summary": "Data Structures and Algorithms using Python", "version": "0.1.9" }, "last_serial": 5324772, "releases": { "0.1.0": [ { "comment_text": "", "digests": { "md5": "78c3b1819bad7b864e290c486fd3e408", "sha256": "0d5ce25180e7c2ee841ee3aa0422de048991148cf3461a0eeb1643616a2d9734" }, "downloads": -1, "filename": "algorithms3-0.1.0-py3-none-any.whl", "has_sig": false, "md5_digest": "78c3b1819bad7b864e290c486fd3e408", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 3617, "upload_time": "2019-03-06T00:32:46", "url": "https://files.pythonhosted.org/packages/03/6c/5ee76ab2c66f506bb5d2eaacc5a28f5c19ee7e3dabf0fbb06529ffcc2df4/algorithms3-0.1.0-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "1f211d0db682fcf654c8d128b5713316", "sha256": "52a61c6e4353e176e35d9023d002a827b7bd43b54e34c8d2e912c39b7dee3b59" }, "downloads": -1, "filename": "algorithms3-0.1.0.tar.gz", "has_sig": false, "md5_digest": "1f211d0db682fcf654c8d128b5713316", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 2004, "upload_time": "2019-03-06T00:32:48", "url": "https://files.pythonhosted.org/packages/d2/99/3949346ffbc77036df72dfe611f264265f9514f3ab13213ff083c88bf57a/algorithms3-0.1.0.tar.gz" } ], "0.1.1": [ { "comment_text": "", "digests": { "md5": "44fd3c3d98d8519bd1cd3889b2ea9cd6", "sha256": "b0f85f91caf9054fab954226756cf32b0793c4dad0e1ed9a83cfa0978f258aa8" }, "downloads": -1, "filename": "algorithms3-0.1.1-py3-none-any.whl", "has_sig": false, "md5_digest": "44fd3c3d98d8519bd1cd3889b2ea9cd6", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 3643, "upload_time": "2019-03-06T00:58:17", "url": "https://files.pythonhosted.org/packages/35/0a/a0d329bb1d8506aeac3f0bf82188c097309a12bf686c988772146839e14b/algorithms3-0.1.1-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "e236080c9af56d86690efc0f87356b28", "sha256": "ca86207ba58c8bf39ac960dd56425b5fd91493f575b2b2962d71a109b06e9364" }, "downloads": -1, "filename": "algorithms3-0.1.1.tar.gz", "has_sig": false, "md5_digest": "e236080c9af56d86690efc0f87356b28", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 2018, "upload_time": "2019-03-06T00:58:18", "url": "https://files.pythonhosted.org/packages/5a/42/d0f29ea8d5756be49a87860e14ef384a711bf9c12328c48286e058376e23/algorithms3-0.1.1.tar.gz" } ], "0.1.3": [ { "comment_text": "", "digests": { "md5": "b32415692fe227cf59be521b583a95c0", "sha256": "d50fc7df94ca3e8bc4c6e60813c29c1ed6c88a6457308da15645b6c464ebc7d9" }, "downloads": -1, "filename": "algorithms3-0.1.3-py3-none-any.whl", "has_sig": false, "md5_digest": "b32415692fe227cf59be521b583a95c0", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 3635, "upload_time": "2019-03-06T01:17:25", "url": "https://files.pythonhosted.org/packages/77/37/80d02e8283b7900c0003c110e45bc7af539abc2995f954541f8eee1153ef/algorithms3-0.1.3-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "a3b2cc0443144a79bcfee369c077fca1", "sha256": "69a8bf27dd3615364adfd01c032fa198120064eea9518a7e3cf2a8bf2889ffa4" }, "downloads": -1, "filename": "algorithms3-0.1.3.tar.gz", "has_sig": false, "md5_digest": "a3b2cc0443144a79bcfee369c077fca1", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 2015, "upload_time": "2019-03-06T01:17:26", "url": "https://files.pythonhosted.org/packages/a9/76/a288b1dc8fd2d7e0bc4521804480e5f8bb928895147be42a352e4b284a20/algorithms3-0.1.3.tar.gz" } ], "0.1.4": [ { "comment_text": "", "digests": { "md5": "b2b7c5c3b459883b00e9e181ed189c74", "sha256": "da238f443b929063c38d4879a323a0b466cfc8ac341ea3c18237c604280a451f" }, "downloads": -1, "filename": "algorithms3-0.1.4-py3-none-any.whl", "has_sig": false, "md5_digest": "b2b7c5c3b459883b00e9e181ed189c74", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 12715, "upload_time": "2019-03-07T01:51:15", "url": "https://files.pythonhosted.org/packages/3f/44/e6901541bf3c9ed6f37dec8068b0be7650c1e1fa2fcc780b5cc47c66c820/algorithms3-0.1.4-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "5aaa37b639194d3ad613544345474855", "sha256": "b09f759f4de69e79e79a2eb12999d77285ac28b4e92769f29f8e98360d2b3c4e" }, "downloads": -1, "filename": "algorithms3-0.1.4.tar.gz", "has_sig": false, "md5_digest": "5aaa37b639194d3ad613544345474855", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 6958, "upload_time": "2019-03-07T01:51:17", "url": "https://files.pythonhosted.org/packages/ae/38/0a9fe965617db4e6ef8631fab351e87bf26ea217e155e861ff0ed467cf3c/algorithms3-0.1.4.tar.gz" } ], "0.1.5": [ { "comment_text": "", "digests": { "md5": "696c241f2cb5afc02e4b8b0d24813dc1", "sha256": "e32ad7d62510cc4445d490248f9f3dfe82b13346dc7dc5f0f1c6f79adbe2109d" }, "downloads": -1, "filename": "algorithms3-0.1.5-py3-none-any.whl", "has_sig": false, "md5_digest": "696c241f2cb5afc02e4b8b0d24813dc1", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 12708, "upload_time": "2019-03-07T02:12:03", "url": "https://files.pythonhosted.org/packages/4f/d0/2fe4f43e47369ea34a13fd3bad85d399a75bab390a4550aadd3653d5f933/algorithms3-0.1.5-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "ad5a9631c9058ef2cb052cacf41aa3e4", "sha256": "4c7bb1c1a9dcf7331ff9836598d49fd8064d47ffd69852faf1e551a8d0d7d766" }, "downloads": -1, "filename": "algorithms3-0.1.5.tar.gz", "has_sig": false, "md5_digest": "ad5a9631c9058ef2cb052cacf41aa3e4", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 6924, "upload_time": "2019-03-07T02:12:05", "url": "https://files.pythonhosted.org/packages/9f/e6/fb2b2d99f93547d27aeaafbdca65ef5aa978be5598584cfd11994c69f1be/algorithms3-0.1.5.tar.gz" } ], "0.1.6": [ { "comment_text": "", "digests": { "md5": "da46a95657896a2236bfe84bfda37621", "sha256": "2cdeea97ad34d75dcfbf11985e0d47a6a0dc456a2f236a8e62ebaad176e83402" }, "downloads": -1, "filename": "algorithms3-0.1.6-py3-none-any.whl", "has_sig": false, "md5_digest": "da46a95657896a2236bfe84bfda37621", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 31756, "upload_time": "2019-03-09T12:51:35", "url": "https://files.pythonhosted.org/packages/fd/ae/fefd2e87803796125191630652739ef0b3f22bdd5b61dd8371a8e4d56990/algorithms3-0.1.6-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "ffc3250f7bbb47df1a0d0b2653a86c98", "sha256": "340b1575996e6a84ada5ff626f31ef9af890acbdcff72610ff3a94c8f7a64756" }, "downloads": -1, "filename": "algorithms3-0.1.6.tar.gz", "has_sig": false, "md5_digest": "ffc3250f7bbb47df1a0d0b2653a86c98", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 14938, "upload_time": "2019-03-09T12:51:36", "url": "https://files.pythonhosted.org/packages/bc/70/127fffdefd77ecc379ea6245a97c79cce48590bcadba340fa94755637649/algorithms3-0.1.6.tar.gz" } ], "0.1.7": [ { "comment_text": "", "digests": { "md5": "bd62fa2495b7a2e42c5019a4ed3b8676", "sha256": "b65559715d59bb6c085d4325113abdc95ce034d3b6943834fbee1c13808eae34" }, "downloads": -1, "filename": "algorithms3-0.1.7-py3-none-any.whl", "has_sig": false, "md5_digest": "bd62fa2495b7a2e42c5019a4ed3b8676", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 67818, "upload_time": "2019-03-26T16:25:41", "url": "https://files.pythonhosted.org/packages/7e/2c/4ca2aa8d1a89c4bedba3d28acf7d6c16b198776e31e510554d03982d5af0/algorithms3-0.1.7-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "1e1243feda856fa6f7baf6856c6a8284", "sha256": "61464694facd608ca97a0abcd00b12b6b43f31c5798623e6467c3efd73ef0690" }, "downloads": -1, "filename": "algorithms3-0.1.7.tar.gz", "has_sig": false, "md5_digest": "1e1243feda856fa6f7baf6856c6a8284", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 32839, "upload_time": "2019-03-26T16:25:42", "url": "https://files.pythonhosted.org/packages/eb/43/3262ef3d940d49ecb280d060f7268caba34430510c87e3033bd926a11157/algorithms3-0.1.7.tar.gz" } ], "0.1.8": [ { "comment_text": "", "digests": { "md5": "1b19883ad5f777c434c5602b254d0f19", "sha256": "d91ef93904b8f9c32be625f36ffa1f8ee6ac29394b0ea295e62fb38af9255f4f" }, "downloads": -1, "filename": "algorithms3-0.1.8-py3-none-any.whl", "has_sig": false, "md5_digest": "1b19883ad5f777c434c5602b254d0f19", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 190498, "upload_time": "2019-04-15T14:09:00", "url": "https://files.pythonhosted.org/packages/a4/2c/b02d84a3a4bee083b9b3e7ab2472459aa8b8db2dd5119da4371b440185dc/algorithms3-0.1.8-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "ee005864bd351e245b10863883ef07b6", "sha256": "b5099939a3025427aac35ae81baffb273d43443c54ff3a892f1d29c36465ea46" }, "downloads": -1, "filename": "algorithms3-0.1.8.tar.gz", "has_sig": false, "md5_digest": "ee005864bd351e245b10863883ef07b6", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 104036, "upload_time": "2019-04-15T14:09:02", "url": "https://files.pythonhosted.org/packages/ce/16/4605be058439417b5a1e641db92e5f369844d02ea0079a76ea986411f3d4/algorithms3-0.1.8.tar.gz" } ], "0.1.9": [ { "comment_text": "", "digests": { "md5": "9854b98bf76ddece1311d8b1bb58277f", "sha256": "f1b309529588f74b473af467551b81942a139772d411322bf416777a54bf7153" }, "downloads": -1, "filename": "algorithms3-0.1.9-py3-none-any.whl", "has_sig": false, "md5_digest": "9854b98bf76ddece1311d8b1bb58277f", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 354199, "upload_time": "2019-05-28T03:46:13", "url": "https://files.pythonhosted.org/packages/43/68/f549b43a2e8012831300693ca4b93a0cfff253f6ff31082f580907d1c3ee/algorithms3-0.1.9-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "3ae67bc1a53cc857a313a1d636b79f79", "sha256": "4f8f44914bfa49a78cce5d2d58c95299abbf5cfd695b64b460b71f0ab1d5d41c" }, "downloads": -1, "filename": "algorithms3-0.1.9.tar.gz", "has_sig": false, "md5_digest": "3ae67bc1a53cc857a313a1d636b79f79", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 209621, "upload_time": "2019-05-28T03:46:15", "url": "https://files.pythonhosted.org/packages/08/d2/e4727c8610ddad98affccddf721222fc9b8926dabc6f6f0189646ebd41bc/algorithms3-0.1.9.tar.gz" } ] }, "urls": [ { "comment_text": "", "digests": { "md5": "9854b98bf76ddece1311d8b1bb58277f", "sha256": "f1b309529588f74b473af467551b81942a139772d411322bf416777a54bf7153" }, "downloads": -1, "filename": "algorithms3-0.1.9-py3-none-any.whl", "has_sig": false, "md5_digest": "9854b98bf76ddece1311d8b1bb58277f", "packagetype": "bdist_wheel", "python_version": "py3", "requires_python": null, "size": 354199, "upload_time": "2019-05-28T03:46:13", "url": "https://files.pythonhosted.org/packages/43/68/f549b43a2e8012831300693ca4b93a0cfff253f6ff31082f580907d1c3ee/algorithms3-0.1.9-py3-none-any.whl" }, { "comment_text": "", "digests": { "md5": "3ae67bc1a53cc857a313a1d636b79f79", "sha256": "4f8f44914bfa49a78cce5d2d58c95299abbf5cfd695b64b460b71f0ab1d5d41c" }, "downloads": -1, "filename": "algorithms3-0.1.9.tar.gz", "has_sig": false, "md5_digest": "3ae67bc1a53cc857a313a1d636b79f79", "packagetype": "sdist", "python_version": "source", "requires_python": null, "size": 209621, "upload_time": "2019-05-28T03:46:15", "url": "https://files.pythonhosted.org/packages/08/d2/e4727c8610ddad98affccddf721222fc9b8926dabc6f6f0189646ebd41bc/algorithms3-0.1.9.tar.gz" } ] }