data_structures

dz / leetcode / data_structures

Subgraphs

• binary_search_tree
• binary_tree
• linked_list

Node Tree

• binary_search_tree
  • predecessor
  • successor
  • leetcode/problems/235_lowest_common_ancestor_BST
  • leetcode/problems/450_delete_node_BST
  • leetcode/problems/700_binary_search_tree
  • leetcode/references/binary_search_tree
  • leetcode/references/binary_search_tree/deletion
  • leetcode/references/tree_traversal/in_order
• binary_tree
  • leetcode/problems/104_max_depth_binary_tree
  • leetcode/problems/110_balanced_binary_tree
  • leetcode/problems/1161_max_level_sum_binary_tree
  • leetcode/problems/1372_longest_zigzag_path
  • leetcode/problems/1448_count_good_nodes
  • leetcode/problems/437_path_sum_iii
  • leetcode/problems/543_diameter_of_binary_tree
  • leetcode/problems/872_leaf_similar_trees
  • leetcode/references/binary_tree
  • leetcode/references/tree_rotation
• graph
  • leetcode/problems/1466_reorder_routes_to_city_zero
  • leetcode/problems/1926_nearest_exit_from_entrance_in_maze
  • leetcode/problems/399_evaluate_division
  • leetcode/problems/547_number_of_provinces
  • leetcode/problems/841_keys_and_rooms
• hash_table
  • leetcode/problems/1207_unique_number_of_occurrences
  • leetcode/problems/1657_close_strings
  • leetcode/problems/169_majority_element
  • leetcode/problems/1_two_sum
  • leetcode/problems/217_contains_duplicate
  • leetcode/problems/2352_equal_row_column_pairs
  • leetcode/problems/242_valid_anagram
  • leetcode/problems/560_subarray_sum_equals_k
  • leetcode/references/hash_table
  • python/docs/stdlib/data_types/collections/counter
• linked_list
  • leetcode/problems/141_linked_list_cycle
  • leetcode/problems/206_reverse_linked_list
  • leetcode/problems/2095_delete_middle_node
  • leetcode/problems/2130_max_twin_sum_linked_list
  • leetcode/problems/21_merge_two_sorted_lists
  • leetcode/problems/328_odd_even_linked_list
  • leetcode/problems/876_middle_of_linked_list
  • leetcode/references/floyds_algorithm
  • leetcode/references/linked_list
• priority_queue
  • leetcode/problems/215_kth_largest_element
  • leetcode/problems/2336_smallest_number_in_infinite_set
  • leetcode/problems/2462_total_cost_hire_k_workers
  • leetcode/problems/2542_maximum_subsequence_score
• queue
  • leetcode/problems/232_implement_queue_using_stacks
  • leetcode/problems/649_dota2_senate
  • leetcode/problems/933_number_of_recent_cals
  • leetcode/references/queues
• set
  • leetcode/problems/1207_unique_number_of_occurrences
  • leetcode/problems/2215_difference_two_arrays
  • python/docs/stdtypes/set
• stack
  • leetcode/problems/20_valid_parentheses
  • leetcode/problems/232_implement_queue_using_stacks
  • leetcode/problems/2390_removing_stars_from_a_string
  • leetcode/problems/349_decode_string
  • leetcode/problems/735_asteroid_collision
  • python/pop_on_empty_stack
• trie
  • leetcode/explore/trie
  • leetcode/problems/208_implement_trie
  • leetcode/problems/211_design_add_and_search_words_data_structure
  • leetcode/problems/212_word_search_2
  • leetcode/problems/336_palindrome_pairs
  • leetcode/problems/421_max_XOR_two_numbers
  • leetcode/problems/642_design_search_autocomplete_system
  • leetcode/problems/648_replace_words
  • leetcode/problems/677_map_sum_pairs
  • leetcode/problems/79_word_search
  • leetcode/references/trie

Nodes

binary_search_tree
content	Binary Search Tree
children	binary_search_tree/predecessor, leetcode/problems/700_binary_search_tree, leetcode/problems/450_delete_node_BST, binary_search_tree/successor, leetcode/references/binary_search_tree, leetcode/references/binary_search_tree/deletion, leetcode/references/tree_traversal/in_order (in-order tree traversal on BST retrieves keys in ascending,order. I'd be most likely to try to implement a solution,this way in an interview setting because this property,is pretty well established for BSTs), leetcode/problems/235_lowest_common_ancestor_BST
parents	leetcode/problems/89_validate_binary_search_tree
location	knowledge/leetcode/leetcode.dz:138

hash_table
content	Hash Table
children	leetcode/problems/1_two_sum, leetcode/problems/1657_close_strings, leetcode/references/hash_table, leetcode/problems/169_majority_element (hash table was most straight forward), leetcode/problems/2352_equal_row_column_pairs, leetcode/problems/242_valid_anagram, leetcode/problems/1207_unique_number_of_occurrences, python/docs/stdlib/data_types/collections/counter (Convenient to use with many hash table problems in Python,,to the point where Counter() is imported by default in the leetcode,environment.), leetcode/problems/217_contains_duplicate (python set structure), leetcode/problems/560_subarray_sum_equals_k
parents	python/docs/stdtypes/mapping_types/get, data_structures/hashtable, python/docs/stdtypes/mapping_types/setdefault
location	knowledge/leetcode/leetcode.dz:313

stack
content	Stack
children	leetcode/problems/349_decode_string, leetcode/problems/20_valid_parentheses, leetcode/problems/232_implement_queue_using_stacks, leetcode/problems/2390_removing_stars_from_a_string, python/pop_on_empty_stack, leetcode/problems/735_asteroid_collision
location	knowledge/leetcode/leetcode.dz:344

linked_list
content	linked list
children	leetcode/problems/2130_max_twin_sum_linked_list, leetcode/references/floyds_algorithm, leetcode/references/linked_list, leetcode/problems/328_odd_even_linked_list, leetcode/problems/206_reverse_linked_list, leetcode/problems/876_middle_of_linked_list, leetcode/problems/141_linked_list_cycle, leetcode/problems/21_merge_two_sorted_lists, leetcode/problems/2095_delete_middle_node
location	knowledge/leetcode/leetcode.dz:358

binary_tree
content	binary tree
children	leetcode/problems/437_path_sum_iii, leetcode/problems/110_balanced_binary_tree, leetcode/problems/1372_longest_zigzag_path, leetcode/problems/1448_count_good_nodes, leetcode/problems/872_leaf_similar_trees, leetcode/problems/104_max_depth_binary_tree, leetcode/problems/1161_max_level_sum_binary_tree, leetcode/references/binary_tree, leetcode/references/tree_rotation, leetcode/problems/543_diameter_of_binary_tree
location	knowledge/leetcode/leetcode.dz:449

queue
content	Queues
children	leetcode/problems/933_number_of_recent_cals, leetcode/problems/649_dota2_senate, leetcode/problems/232_implement_queue_using_stacks, leetcode/references/queues
location	knowledge/leetcode/leetcode.dz:489

set
content	Set
children	python/docs/stdtypes/set, leetcode/problems/1207_unique_number_of_occurrences, leetcode/problems/2215_difference_two_arrays
parents	leetcode/problems/421_max_XOR_two_numbers/solutions/hashset
location	knowledge/leetcode/leetcode.dz:713

graph
content	Graph
children	leetcode/problems/1466_reorder_routes_to_city_zero, leetcode/problems/547_number_of_provinces, leetcode/problems/1926_nearest_exit_from_entrance_in_maze, leetcode/problems/399_evaluate_division, leetcode/problems/841_keys_and_rooms
location	knowledge/leetcode/leetcode.dz:905

priority_queue
content	Priority Queue
children	leetcode/problems/2542_maximum_subsequence_score, leetcode/problems/2336_smallest_number_in_infinite_set, leetcode/problems/215_kth_largest_element, leetcode/problems/2462_total_cost_hire_k_workers
parents	python/docs/stdlib/data_types/heapq
location	knowledge/leetcode/leetcode.dz:942

trie
content	Trie
children	leetcode/problems/642_design_search_autocomplete_system, leetcode/explore/trie (Explore Card for Trie data structure), leetcode/problems/421_max_XOR_two_numbers, leetcode/problems/208_implement_trie, leetcode/problems/677_map_sum_pairs, leetcode/problems/212_word_search_2, leetcode/problems/79_word_search, leetcode/problems/336_palindrome_pairs, leetcode/references/trie, leetcode/problems/211_design_add_and_search_words_data_structure, leetcode/problems/648_replace_words
parents	leetcode/problems/421_max_XOR_two_numbers/solutions/trie
location	knowledge/leetcode/leetcode.dz:1528