paradigms

dz / leetcode / paradigms

Subgraphs

• binary_search
• dynamic_programming

Node Tree

• algorithmic_paradigm
  • leetcode/references/algorithmic_paradigm
• array_string
  • leetcode/problems/1071_GCD_of_strings
  • leetcode/problems/1431_kids_with_greatest_number_of_candies
  • leetcode/problems/151_reverse_words_in_a_string
  • leetcode/problems/1768_merge_strings_alternately
  • leetcode/problems/443_string_compression
  • leetcode/problems/605_can_place_flowers
• backtracking
  • leetcode/problems/216_combination_sum_iii
  • leetcode/problems/39_combination_sum
  • leetcode/references/backtracking
• binary_search
  • leetcode/problems/162_find_peak_element
  • leetcode/problems/2300_successful_pairs_potions_spells
  • leetcode/problems/278_first_bad_version
  • leetcode/problems/34_first_last_sorted_array
  • leetcode/problems/374_guess_number_lower_higher
  • leetcode/problems/704_binary_search
  • leetcode/problems/875_koko_eating_bananas
  • leetcode/references/binary_search
  • leetcode/references/binary_search_java
  • leetcode/references/binary_search_leetcode
  • leetcode/references/opionated_guide_binary_search
  • python/docs/stdlib/bisect
• bit_manipulation
  • leetcode/problems/136_single_number
  • leetcode/problems/137_single_number_2
  • leetcode/problems/187_repeated_DNA_sequences
  • leetcode/problems/260_single_number_3
  • leetcode/problems/318_max_product_word_lengths
  • leetcode/problems/338_counting_bits
  • leetcode/problems/67_add_binary
• breadth_first_search
  • leetcode/problems/1161_max_level_sum_binary_tree
  • leetcode/problems/1926_nearest_exit_from_entrance_in_maze
  • leetcode/problems/994_rotting_oranges
  • leetcode/references/breadth_first_search
• depth_first_search
  • leetcode/problems/1372_longest_zigzag_path
  • leetcode/problems/1448_count_good_nodes
  • leetcode/problems/1466_reorder_routes_to_city_zero
  • leetcode/problems/200_number_of_islands
    • breadth_first_search
      • leetcode/problems/1161_max_level_sum_binary_tree
      • leetcode/problems/1926_nearest_exit_from_entrance_in_maze
      • leetcode/problems/994_rotting_oranges
      • leetcode/references/breadth_first_search
  • leetcode/problems/399_evaluate_division
  • leetcode/problems/437_path_sum_iii
  • leetcode/problems/547_number_of_provinces
  • leetcode/problems/841_keys_and_rooms
  • leetcode/references/depth_first_search
• divide_and_conquer
  • leetcode/explore/dynamic_programming/0_intro/1_what_is/kinds_of_problems/overlapping_subproblems
• dynamic_programming
  • leetcode/explore/dynamic_programming
  • 1d
  • 2d
  • leetcode/problems/1137_nth_tribonacci_number
  • leetcode/problems/1143_longest_common_subsequence
  • leetcode/problems/1659_maximize_grid_happiness
  • leetcode/problems/221_maximal_square
  • leetcode/problems/322_coin_change
  • leetcode/problems/70_climbing_stairs
  • leetcode/problems/714_best_time_buy_sell_stock_transaction_free
  • leetcode/problems/72_edit_distance
  • leetcode/problems/740_delete_and_earn
  • leetcode/problems/746_min_cost_climbing_stairs
  • leetcode/problems/790_domino_tromino_tiling
  • leetcode/references/bottom_up_top_down
  • leetcode/references/dynamic_programming
  • leetcode/references/memoization
  • leetcode/references/optimal_substructure
  • leetcode/references/tabulation
• greedy
  • leetcode/explore/dynamic_programming/0_intro/1_what_is/kinds_of_problems/optimal_substructure
  • leetcode/explore/dynamic_programming/0_intro/3_when_to_use/1_find_optimum_value
  • leetcode/explore/dynamic_programming/0_intro/3_when_to_use/2_future_decisions_depend_on_earlier_ones
  • leetcode/problems/121_best_time_to_sell_and_buy_stock
  • leetcode/references/greedy_algorithm
• prefix_sum
  • leetcode/problems/1732_find_highest_altitude
  • leetcode/problems/437_path_sum_iii
  • leetcode/problems/560_subarray_sum_equals_k
  • leetcode/problems/724_pivot_index
• sliding_window
  • leetcode/problems/1004_max_consecutive_ones_iii
  • leetcode/problems/1456_max_vowels_in_substring
  • leetcode/problems/1493_longest_subarray_ones_deleting_elem
  • leetcode/problems/643_maximum_average_subarray
• two_pointer
  • leetcode/problems/125_valid_palindrome
  • leetcode/problems/1679_max_number_of_ksum_pairs
  • leetcode/problems/282_move_zeros
  • leetcode/problems/345_reverse_vowels_stringa
  • leetcode/problems/392_is_subsequence

Nodes

dynamic_programming
content	Dynamic Programming
children	leetcode/problems/70_climbing_stairs, leetcode/references/optimal_substructure (optimal substructure key piece in solving dynamic programming problems), leetcode/problems/1659_maximize_grid_happiness (multidimensional (5 variables)), leetcode/problems/790_domino_tromino_tiling, leetcode/problems/746_min_cost_climbing_stairs, leetcode/problems/1137_nth_tribonacci_number, leetcode/explore/dynamic_programming, leetcode/problems/322_coin_change, leetcode/problems/714_best_time_buy_sell_stock_transaction_free, dynamic_programming/2d, dynamic_programming/1d, leetcode/problems/740_delete_and_earn, leetcode/references/memoization (in DP, used on recursive functions for top-down,solution that starts with the initial problem,,and recursively calls itself to solve smaller problems), leetcode/problems/221_maximal_square, leetcode/references/tabulation (often people use "tabulation" and "dynamic programming",interchangeably.), leetcode/problems/72_edit_distance, leetcode/problems/1143_longest_common_subsequence, leetcode/references/dynamic_programming, leetcode/references/bottom_up_top_down (Dynamic programming can come in top-down or bottoms-up approaches)
location	knowledge/leetcode/leetcode.dz:62

algorithmic_paradigm
content	Algorithmic Paradigms
children	leetcode/references/algorithmic_paradigm
location	knowledge/leetcode/leetcode.dz:109

depth_first_search
content	Depth-First Search
children	leetcode/problems/841_keys_and_rooms, leetcode/problems/1466_reorder_routes_to_city_zero, leetcode/problems/200_number_of_islands, leetcode/problems/1372_longest_zigzag_path, leetcode/problems/547_number_of_provinces, leetcode/problems/1448_count_good_nodes, leetcode/references/depth_first_search, leetcode/problems/399_evaluate_division, leetcode/problems/437_path_sum_iii
location	knowledge/leetcode/leetcode.dz:166

breadth_first_search
content	Breadth-First Search
children	leetcode/problems/994_rotting_oranges, leetcode/references/breadth_first_search, leetcode/problems/1926_nearest_exit_from_entrance_in_maze, leetcode/problems/1161_max_level_sum_binary_tree
parents	leetcode/problems/200_number_of_islands
location	knowledge/leetcode/leetcode.dz:183

binary_search
content	Binary Search
children	leetcode/references/binary_search_java, leetcode/references/binary_search_leetcode, leetcode/references/opionated_guide_binary_search, leetcode/problems/704_binary_search, leetcode/problems/34_first_last_sorted_array, leetcode/references/binary_search, leetcode/problems/162_find_peak_element, leetcode/problems/278_first_bad_version, python/docs/stdlib/bisect (useful builtin for binary search), leetcode/problems/875_koko_eating_bananas, leetcode/problems/374_guess_number_lower_higher, leetcode/problems/2300_successful_pairs_potions_spells
parents	leetcode/problems/33_search_in_rotated_sorted_array
location	knowledge/leetcode/leetcode.dz:203

backtracking
content	Backtracking
children	leetcode/problems/216_combination_sum_iii, leetcode/references/backtracking, leetcode/problems/39_combination_sum
location	knowledge/leetcode/leetcode.dz:225

greedy
content	Greedy
children	leetcode/references/greedy_algorithm, leetcode/explore/dynamic_programming/0_intro/3_when_to_use/1_find_optimum_value (sometimes a problem in this kind of format is meant to,be solved with a greedy algorithm), leetcode/explore/dynamic_programming/0_intro/3_when_to_use/2_future_decisions_depend_on_earlier_ones (this characteristic is what makes a greedy algorithm,invalid for a DP problem), leetcode/explore/dynamic_programming/0_intro/1_what_is/kinds_of_problems/optimal_substructure (greedy problems have optimal substructure, but,the not overlapping subproblems), leetcode/problems/121_best_time_to_sell_and_buy_stock (I'm pretty sure this is a greedy algorithm? ("locally optimal choices"))
location	knowledge/leetcode/leetcode.dz:372

two_pointer
content	Two Pointer
children	leetcode/problems/282_move_zeros, leetcode/problems/345_reverse_vowels_stringa, leetcode/problems/125_valid_palindrome, leetcode/problems/1679_max_number_of_ksum_pairs, leetcode/problems/392_is_subsequence
location	knowledge/leetcode/leetcode.dz:401

bit_manipulation
content	Bit manipulation
children	leetcode/problems/67_add_binary, leetcode/problems/338_counting_bits, leetcode/problems/260_single_number_3, leetcode/problems/187_repeated_DNA_sequences, leetcode/problems/318_max_product_word_lengths, leetcode/problems/137_single_number_2, leetcode/problems/136_single_number
location	knowledge/leetcode/leetcode.dz:517

array_string
content	array/string manipulation
children	leetcode/problems/1431_kids_with_greatest_number_of_candies, leetcode/problems/1768_merge_strings_alternately, leetcode/problems/605_can_place_flowers, leetcode/problems/151_reverse_words_in_a_string, leetcode/problems/1071_GCD_of_strings, leetcode/problems/443_string_compression
location	knowledge/leetcode/leetcode.dz:607

sliding_window
content	Sliding Window
children	leetcode/problems/643_maximum_average_subarray, leetcode/problems/1456_max_vowels_in_substring, leetcode/problems/1493_longest_subarray_ones_deleting_elem, leetcode/problems/1004_max_consecutive_ones_iii
location	knowledge/leetcode/leetcode.dz:672

prefix_sum
content	Prefix Sum
children	leetcode/problems/1732_find_highest_altitude, leetcode/problems/724_pivot_index, leetcode/problems/437_path_sum_iii (yes, the solution for 437 uses prefix sum), leetcode/problems/560_subarray_sum_equals_k
location	knowledge/leetcode/leetcode.dz:704

divide_and_conquer
content	divide and conquer
children	leetcode/explore/dynamic_programming/0_intro/1_what_is/kinds_of_problems/overlapping_subproblems (divide and conquer problems break a problem,into subproblems, but these are not overlapping.,DP and divide and conquer are often mistaken,for one another for this reason.)
location	knowledge/leetcode/leetcode.dz:1430