forked from YovM/Algorithms
* Create minimums_squares_to_represent_a_number.py added a dynamic programming approach of finding the minimum number of square to represent a number. eg : 25 = 5*5 37 = 6*6 + 1*1 21 = 4*4 + 2*2 + 1*1 * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update and rename minimums_squares_to_represent_a_number.py to minimum_squares_to_represent_a_number.py updated the code * Update minimum_squares_to_represent_a_number.py I have added the appropriate checks for 0 and 12.34. It would be great if you could suggest a name for the dp array * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update minimum_squares_to_represent_a_number.py * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update minimum_squares_to_represent_a_number.py updated * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci * Update minimum_squares_to_represent_a_number.py updated * [pre-commit.ci] auto fixes from pre-commit.com hooks for more information, see https://pre-commit.ci Co-authored-by: pre-commit-ci[bot] <66853113+pre-commit-ci[bot]@users.noreply.github.com> |
||
|---|---|---|
| .. | ||
| __init__.py | ||
| abbreviation.py | ||
| all_construct.py | ||
| bitmask.py | ||
| catalan_numbers.py | ||
| climbing_stairs.py | ||
| edit_distance.py | ||
| factorial.py | ||
| fast_fibonacci.py | ||
| fibonacci.py | ||
| floyd_warshall.py | ||
| integer_partition.py | ||
| iterating_through_submasks.py | ||
| k_means_clustering_tensorflow.py_tf | ||
| knapsack.py | ||
| longest_common_subsequence.py | ||
| longest_common_substring.py | ||
| longest_increasing_subsequence.py | ||
| longest_increasing_subsequence_o(nlogn).py | ||
| longest_sub_array.py | ||
| matrix_chain_order.py | ||
| max_non_adjacent_sum.py | ||
| max_sub_array.py | ||
| max_sum_contiguous_subsequence.py | ||
| minimum_coin_change.py | ||
| minimum_cost_path.py | ||
| minimum_partition.py | ||
| minimum_squares_to_represent_a_number.py | ||
| minimum_steps_to_one.py | ||
| optimal_binary_search_tree.py | ||
| rod_cutting.py | ||
| subset_generation.py | ||
| sum_of_subset.py | ||