data_structures

dz / leetcode / data_structures

Subgraphs

• binary_tree

Node Tree

• binary_search_tree
  • leetcode/problems/235_lowest_common_ancestor_BST
  • leetcode/references/binary_search_tree
  • leetcode/references/tree_traversal/in_order
• binary_tree
  • leetcode/problems/104_max_depth_binary_tree
  • leetcode/problems/110_balanced_binary_tree
  • leetcode/problems/543_diameter_of_binary_tree
  • leetcode/references/binary_tree
• 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/references/hash_table
  • python/docs/stdlib/data_types/collections/counter
• linked_list
  • leetcode/problems/141_linked_list_cycle
  • leetcode/problems/21_merge_two_sorted_lists
  • leetcode/problems/876_middle_of_linked_list
  • leetcode/references/floyds_algorithm
  • leetcode/references/linked_list
• queue
  • leetcode/problems/232_implement_queue_using_stacks
  • 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

Nodes

binary_search_tree
content	Binary Search Tree
children	leetcode/references/binary_search_tree, leetcode/problems/235_lowest_common_ancestor_BST, 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)
parents	leetcode/problems/89_validate_binary_search_tree

hash_table
content	Hash Table
children	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/2352_equal_row_column_pairs, leetcode/problems/1_two_sum, leetcode/problems/169_majority_element (hash table was most straight forward), leetcode/problems/242_valid_anagram, leetcode/problems/1657_close_strings, leetcode/references/hash_table, leetcode/problems/217_contains_duplicate (python set structure)

stack
content	Stack
children	leetcode/problems/20_valid_parentheses, leetcode/problems/232_implement_queue_using_stacks

linked_list
content	linked list
children	leetcode/problems/141_linked_list_cycle, leetcode/references/floyds_algorithm, leetcode/problems/21_merge_two_sorted_lists, leetcode/references/linked_list, leetcode/problems/876_middle_of_linked_list

binary_tree
content	binary tree
children	leetcode/problems/543_diameter_of_binary_tree, leetcode/problems/110_balanced_binary_tree, leetcode/problems/104_max_depth_binary_tree, leetcode/references/binary_tree

queue
content	Queues
children	leetcode/problems/232_implement_queue_using_stacks, leetcode/references/queues

set
content	Set
children	leetcode/problems/1207_unique_number_of_occurrences, python/docs/stdtypes/set, leetcode/problems/2215_difference_two_arrays