Types & classes — github.com/begeekmyfriend/leetcode

CodeHub MCPcopy Create free account

hub / github.com/begeekmyfriend/leetcode / types & classes

Types & classes357 in github.com/begeekmyfriend/leetcode

⨍ Functions 962◇ Types & classes 357

↓ 1 callersClassNode

0138_copy_list_with_random_pointer/copy_list.c:4

ClassBSTIterator

0173_binary_search_tree_iterator/bst_iter.c:28

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

0297_serialize_and_deserialize_binary_tree/tree_serdes.cc:14

ClassFreqAVLNode

0460_lfu_cache/lfu_cache.c:30

ClassFreqAVLNode

0460_lfu_cache/lfu_cache.c:33

0460_lfu_cache/lfu_cache.cc:9

0460_lfu_cache/lfu_cache.cc:8

0460_lfu_cache/lfu_cache.c:43

* Your LRUCache object will be instantiated and called as such: * LRUCache* obj = new LRUCache(capacity); * int param_1 = obj->get(key); * obj->put

0146_lru_cache/lru_cache.cc:11

0143_reorder_list/reorder_list.c:4

0143_reorder_list/reorder_list.c:6

0109_convert_sorted_list_to_binary_search_tree/bst_convert.c:5

0109_convert_sorted_list_to_binary_search_tree/bst_convert.c:7

0203_remove_linked_list_element/rm_elem.c:4

0203_remove_linked_list_element/rm_elem.c:6

0086_partition_list/partition_list.c:4

0086_partition_list/partition_list.c:6

0142_linked_list_cycle_ii/list_cycle.c:5

0142_linked_list_cycle_ii/list_cycle.c:7

0021_merge_two_sorted_lists/merge_lists.c:4

0021_merge_two_sorted_lists/merge_lists.c:6

0021_merge_two_sorted_lists/merge_lists.cc:18

0002_add_two_numbers/add_two_numbers.cc:19

Definition for singly-linked list. */

0002_add_two_numbers/add_two_numbers.c:7

0002_add_two_numbers/add_two_numbers.c:9

0206_reverse_linked_list/reverse_list.c:5

0206_reverse_linked_list/reverse_list.c:7

0160_intersection_of_two_linked_list/intersection.c:5

0160_intersection_of_two_linked_list/intersection.c:7

0061_rotate_list/rotate_list.c:5

0061_rotate_list/rotate_list.c:7

0148_sort_list/sort_list.c:4

0148_sort_list/sort_list.c:6

0147_insertion_sort_list/insert_sort_list.c:4

0147_insertion_sort_list/insert_sort_list.c:6

0092_reverse_linked_list_ii/reverse_list.c:4

0092_reverse_linked_list_ii/reverse_list.c:6

0082_remove_duplicates_from_sorted_list_ii/rm_dup.c:5

0082_remove_duplicates_from_sorted_list_ii/rm_dup.c:7

0019_remove_nth_node_from_end_of_list/remove_end.cc:22

0019_remove_nth_node_from_end_of_list/remove_end.c:4

0019_remove_nth_node_from_end_of_list/remove_end.c:6

0141_linked_list_cycle/list_cycle.c:5

0141_linked_list_cycle/list_cycle.c:7

0141_linked_list_cycle/list_cycle.cc:16

0024_swap_nodes_in_pairs/swap_nodes.c:4

0024_swap_nodes_in_pairs/swap_nodes.c:6

0024_swap_nodes_in_pairs/swap_nodes.cc:18

* Definition for singly-linked list. * struct ListNode { * int val; * struct ListNode *next; * }; */

0023_merge_k_sorted_lists/merge_lists.c:12

0023_merge_k_sorted_lists/merge_lists.c:14

0023_merge_k_sorted_lists/merge_lists.cc:18

0083_remove_duplicates_from_sorted_list/rm_dup.c:6

0083_remove_duplicates_from_sorted_list/rm_dup.c:8

0025_reverse_nodes_in_k_group/reverse_nodes.c:4

0025_reverse_nodes_in_k_group/reverse_nodes.c:6

0025_reverse_nodes_in_k_group/reverse_nodes.cc:19

0117_populating_next_right_pointers_in_each_node_ii/connect.c:18

0117_populating_next_right_pointers_in_each_node_ii/connect.c:20

0117_populating_next_right_pointers_in_each_node_ii/connect.c:26

0116_populating_next_right_pointers_in_each_node/connect.c:5

0116_populating_next_right_pointers_in_each_node/connect.c:7

Definition for a Node.

0133_clone_graph/clone_graph.cc:6

0138_copy_list_with_random_pointer/copy_list.c:6

0149_max_points_on_a_line/points_on_line.c:22

0029_divide_two_integers/divide.cc:5

0204_count_primes/count_primes.cc:5

0164_maximum_gap/max_gap.cc:5

0042_trapping_rain_water/trap_water.cc:5

0009_palindrome_number/palindrome_number.cc:5

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

0129_sum_root_to_leaf_numbers/sum_tree.cc:16

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

0112_path_sum/path_sum.cc:16

0015_three_sum/three_sum.cc:5

* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode() : val(0), next(nullptr) {} * L

0109_convert_sorted_list_to_binary_search_tree/bst_convert.cc:26

0070_climbing_stairs/climb_stairs.cc:5

0117_populating_next_right_pointers_in_each_node_ii/connect.cc:23

0213_house_robber_ii/robber.cc:5

0567_permutation_in_string/permutation_in_string.cc:5

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

0337_house_robber_iii/robber.cc:14

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

0100_same_tree/same_tree.cc:16

0116_populating_next_right_pointers_in_each_node/connect.cc:23

0216_combination_sum_iii/combination_sum.cc:5

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

0102_binary_tree_level_order_traversal/bst_bfs.cc:16

0127_word_ladder/word_ladder.cc:5

0072_edit_distance/edit_distance.cc:5

0020_valid_parentheses/valid_parentheses.cc:5

0047_permutations_ii/permutations.cc:5

0198_house_robber/robber.cc:5

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode(int x) : val(

0236_lowest_common_ancestor_of_a_binary_tree/bst_lca.cc:13

1143_longest_common_subsequence/lcs.cc:5

0045_jump_game_ii/jump_game.cc:5

0003_longest_substring_without_repeat/longest_substring_without_repeat.cc:5

0354_russian_doll_envelopes/russian_doll.cc:5

0069_sqrt/sqrt.cc:5

* Definition for singly-linked list. * struct ListNode { * int val; * ListNode *next; * ListNode(int x) : val(x), next(nullptr) {} *

0142_linked_list_cycle_ii/list_cycle.cc:13

0048_rotate_image/rotate.cc:5

0017_letter_combinations_of_a_phone_number/letter_combinations.cpp:4

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

0106_construct_binary_tree_from_inorder_and_postorder_traversal/binary_tree_build.cc:16

* Definition for a binary tree node. * struct TreeNode { * int val; * TreeNode *left; * TreeNode *right; * TreeNode() : val(0), l

0563_binary_tree_tilt/tilt.cc:16

0322_coin_change/coin_change.cc:5

0040_combination_sum_ii/combination_sum.cc:5

next →1–100 of 357, ranked by callers