Index

A B C D E F G H I J K L M N P Q R S T U V W Z
All Classes and Interfaces|All Packages

A

addBinary(String, String) - Method in class g0001_0100.s0067_add_binary.Solution

addDigits(int) - Method in class g0201_0300.s0258_add_digits.Solution

addNum(int) - Method in class g0201_0300.s0295_find_median_from_data_stream.MedianFinder

addOperators(String, int) - Method in class g0201_0300.s0282_expression_add_operators.Solution

addTwoNumbers(ListNode, ListNode) - Method in class g0001_0100.s0002_add_two_numbers.Solution

addWord(Tree, String) - Static method in class g0201_0300.s0212_word_search_ii.Tree

addWord(String) - Method in class g0201_0300.s0211_design_add_and_search_words_data_structure.WordDictionary

B

balance(PriorityQueue<Integer>, PriorityQueue<Integer>) - Method in class g0201_0300.s0295_find_median_from_data_stream.MedianFinder

binaryTreePaths(TreeNode) - Method in class g0201_0300.s0257_binary_tree_paths.Solution

BSTIterator - Class in g0101_0200.s0173_binary_search_tree_iterator

BSTIterator(TreeNode) - Constructor for class g0101_0200.s0173_binary_search_tree_iterator.BSTIterator

buildTree(int[], int[]) - Method in class g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal.Solution

buildTree(int[], int[]) - Method in class g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal.Solution

C

calculate(String) - Method in class g0201_0300.s0224_basic_calculator.Solution

calculate(String) - Method in class g0201_0300.s0227_basic_calculator_ii.Solution

calculateMinimumHP(int[][]) - Method in class g0101_0200.s0174_dungeon_game.Solution

canCompleteCircuit(int[], int[]) - Method in class g0101_0200.s0134_gas_station.Solution

candy(int[]) - Method in class g0101_0200.s0135_candy.Solution

canFinish(int, int[][]) - Method in class g0201_0300.s0207_course_schedule.Solution

canJump(int[]) - Method in class g0001_0100.s0055_jump_game.Solution

canWinNim(int) - Method in class g0201_0300.s0292_nim_game.Solution

children - Variable in class g0201_0300.s0208_implement_trie_prefix_tree.TrieNode

climbStairs(int) - Method in class g0001_0100.s0070_climbing_stairs.Solution

cloneGraph(Node) - Method in class g0101_0200.s0133_clone_graph.Solution

cloneGraph(Node, Map<Node, Node>) - Method in class g0101_0200.s0133_clone_graph.Solution

Codec - Class in g0201_0300.s0297_serialize_and_deserialize_binary_tree

Codec() - Constructor for class g0201_0300.s0297_serialize_and_deserialize_binary_tree.Codec

com_github_leetcode - package com_github_leetcode

com_github_leetcode.left_right - package com_github_leetcode.left_right

com_github_leetcode.random - package com_github_leetcode.random

combinationSum(int[], int) - Method in class g0001_0100.s0039_combination_sum.Solution

combinationSum2(int[], int) - Method in class g0001_0100.s0040_combination_sum_ii.Solution

combinationSum3(int, int) - Method in class g0201_0300.s0216_combination_sum_iii.Solution

combine(int, int) - Method in class g0001_0100.s0077_combinations.Solution

compareVersion(String, String) - Method in class g0101_0200.s0165_compare_version_numbers.Solution

computeArea(int, int, int, int, int, int, int, int) - Method in class g0201_0300.s0223_rectangle_area.Solution

connect(Node) - Method in class g0101_0200.s0116_populating_next_right_pointers_in_each_node.Solution

connect(Node) - Method in class g0101_0200.s0117_populating_next_right_pointers_in_each_node_ii.Solution

containsDuplicate(int[]) - Method in class g0201_0300.s0217_contains_duplicate.Solution

containsNearbyAlmostDuplicate(int[], int, int) - Method in class g0201_0300.s0220_contains_duplicate_iii.Solution

containsNearbyDuplicate(int[], int) - Method in class g0201_0300.s0219_contains_duplicate_ii.Solution

convert(String, int) - Method in class g0001_0100.s0006_zigzag_conversion.Solution

convertToTitle(int) - Method in class g0101_0200.s0168_excel_sheet_column_title.Solution

copyRandomList(Node) - Method in class g0101_0200.s0138_copy_list_with_random_pointer.Solution

countAndSay(int) - Method in class g0001_0100.s0038_count_and_say.Solution

countDigitOne(int) - Method in class g0201_0300.s0233_number_of_digit_one.Solution

countNodes(TreeNode) - Method in class g0201_0300.s0222_count_complete_tree_nodes.Solution

countPrimes(int) - Method in class g0201_0300.s0204_count_primes.Solution

create(int[]) - Static method in class com_github_leetcode.TreeNode

D

deleteDuplicates(ListNode) - Method in class g0001_0100.s0082_remove_duplicates_from_sorted_list_ii.Solution

deleteDuplicates(ListNode) - Method in class g0001_0100.s0083_remove_duplicates_from_sorted_list.Solution

deleteWord(Tree, String) - Static method in class g0201_0300.s0212_word_search_ii.Tree

deserialize(String) - Method in class g0201_0300.s0297_serialize_and_deserialize_binary_tree.Codec

detectCycle(ListNode) - Method in class g0101_0200.s0142_linked_list_cycle_ii.Solution

diffWaysToCompute(String) - Method in class g0201_0300.s0241_different_ways_to_add_parentheses.Solution

divide(int, int) - Method in class g0001_0100.s0029_divide_two_integers.Solution

E

empty() - Method in class g0201_0300.s0225_implement_stack_using_queues.MyStack

empty() - Method in class g0201_0300.s0232_implement_queue_using_stacks.MyQueue

end - Variable in class g0201_0300.s0212_word_search_ii.Tree

evalRPN(String[]) - Method in class g0101_0200.s0150_evaluate_reverse_polish_notation.Solution

exist(char[][], String) - Method in class g0001_0100.s0079_submissions.Solution

expandAround(char[], int, int, int[]) - Method in class g0101_0200.s0132_palindrome_partitioning_ii.Solution

F

findDuplicate(int[]) - Method in class g0201_0300.s0287_find_the_duplicate_number.Solution

findItinerary(List<List<String>>) - Method in class g0301_0400.s0332_reconstruct_itinerary.Solution

findKthLargest(int[], int) - Method in class g0201_0300.s0215_kth_largest_element_in_an_array.Solution

findLadders(String, String, List<String>) - Method in class g0101_0200.s0126_word_ladder_ii.Solution

findMaxPathSum(TreeNode) - Method in class g0101_0200.s0124_binary_tree_maximum_path_sum.Solution

findMedian() - Method in class g0201_0300.s0295_find_median_from_data_stream.MedianFinder

findMedianSortedArrays(int[], int[]) - Method in class g0001_0100.s0004_median_of_two_sorted_arrays.Solution

findMin(int[]) - Method in class g0101_0200.s0153_find_minimum_in_rotated_sorted_array.Solution

findMin(int[]) - Method in class g0101_0200.s0154_find_minimum_in_rotated_sorted_array_ii.Solution

findOrder(int, int[][]) - Method in class g0201_0300.s0210_course_schedule_ii.Solution

findPeakElement(int[]) - Method in class g0101_0200.s0162_find_peak_element.Solution

findRepeatedDnaSequences(String) - Method in class g0101_0200.s0187_repeated_dna_sequences.Solution

findSubstring(String, String[]) - Method in class g0001_0100.s0030_substring_with_concatenation_of_all_words.Solution

findWords(char[][], String[]) - Method in class g0201_0300.s0212_word_search_ii.Solution

firstBadVersion(int) - Method in class g0201_0300.s0278_first_bad_version.Solution

firstMissingPositive(int[]) - Method in class g0001_0100.s0041_first_missing_positive.Solution

flatten(TreeNode) - Method in class g0101_0200.s0114_flatten_binary_tree_to_linked_list.Solution

fourSum(int[], int) - Method in class g0001_0100.s0018_four_sum.Solution

fractionToDecimal(int, int) - Method in class g0101_0200.s0166_fraction_to_recurring_decimal.Solution

fullJustify(String[], int) - Method in class g0001_0100.s0068_text_justification.Solution

G

g0001_0100.s0001_two_sum - package g0001_0100.s0001_two_sum

g0001_0100.s0002_add_two_numbers - package g0001_0100.s0002_add_two_numbers

g0001_0100.s0003_longest_substring_without_repeating_characters - package g0001_0100.s0003_longest_substring_without_repeating_characters

g0001_0100.s0004_median_of_two_sorted_arrays - package g0001_0100.s0004_median_of_two_sorted_arrays

g0001_0100.s0005_longest_palindromic_substring - package g0001_0100.s0005_longest_palindromic_substring

g0001_0100.s0006_zigzag_conversion - package g0001_0100.s0006_zigzag_conversion

g0001_0100.s0007_reverse_integer - package g0001_0100.s0007_reverse_integer

g0001_0100.s0008_string_to_integer_atoi - package g0001_0100.s0008_string_to_integer_atoi

g0001_0100.s0009_palindrome_number - package g0001_0100.s0009_palindrome_number

g0001_0100.s0010_regular_expression_matching - package g0001_0100.s0010_regular_expression_matching

g0001_0100.s0011_container_with_most_water - package g0001_0100.s0011_container_with_most_water

g0001_0100.s0012_integer_to_roman - package g0001_0100.s0012_integer_to_roman

g0001_0100.s0013_roman_to_integer - package g0001_0100.s0013_roman_to_integer

g0001_0100.s0014_longest_common_prefix - package g0001_0100.s0014_longest_common_prefix

g0001_0100.s0015_three_sum - package g0001_0100.s0015_three_sum

g0001_0100.s0016_three_sum_closest - package g0001_0100.s0016_three_sum_closest

g0001_0100.s0017_letter_combinations_of_a_phone_number - package g0001_0100.s0017_letter_combinations_of_a_phone_number

g0001_0100.s0018_four_sum - package g0001_0100.s0018_four_sum

g0001_0100.s0019_remove_nth_node_from_end_of_list - package g0001_0100.s0019_remove_nth_node_from_end_of_list

g0001_0100.s0020_valid_parentheses - package g0001_0100.s0020_valid_parentheses

g0001_0100.s0021_merge_two_sorted_lists - package g0001_0100.s0021_merge_two_sorted_lists

g0001_0100.s0022_generate_parentheses - package g0001_0100.s0022_generate_parentheses

g0001_0100.s0023_merge_k_sorted_lists - package g0001_0100.s0023_merge_k_sorted_lists

g0001_0100.s0024_swap_nodes_in_pairs - package g0001_0100.s0024_swap_nodes_in_pairs

g0001_0100.s0025_reverse_nodes_in_k_group - package g0001_0100.s0025_reverse_nodes_in_k_group

g0001_0100.s0026_remove_duplicates_from_sorted_array - package g0001_0100.s0026_remove_duplicates_from_sorted_array

g0001_0100.s0027_remove_element - package g0001_0100.s0027_remove_element

g0001_0100.s0028_implement_strstr - package g0001_0100.s0028_implement_strstr

g0001_0100.s0029_divide_two_integers - package g0001_0100.s0029_divide_two_integers

g0001_0100.s0030_substring_with_concatenation_of_all_words - package g0001_0100.s0030_substring_with_concatenation_of_all_words

g0001_0100.s0031_next_permutation - package g0001_0100.s0031_next_permutation

g0001_0100.s0032_longest_valid_parentheses - package g0001_0100.s0032_longest_valid_parentheses

g0001_0100.s0033_search_in_rotated_sorted_array - package g0001_0100.s0033_search_in_rotated_sorted_array

g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array - package g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array

g0001_0100.s0035_search_insert_position - package g0001_0100.s0035_search_insert_position

g0001_0100.s0036_valid_sudoku - package g0001_0100.s0036_valid_sudoku

g0001_0100.s0037_sudoku_solver - package g0001_0100.s0037_sudoku_solver

g0001_0100.s0038_count_and_say - package g0001_0100.s0038_count_and_say

g0001_0100.s0039_combination_sum - package g0001_0100.s0039_combination_sum

g0001_0100.s0040_combination_sum_ii - package g0001_0100.s0040_combination_sum_ii

g0001_0100.s0041_first_missing_positive - package g0001_0100.s0041_first_missing_positive

g0001_0100.s0042_trapping_rain_water - package g0001_0100.s0042_trapping_rain_water

g0001_0100.s0043_multiple_strings - package g0001_0100.s0043_multiple_strings

g0001_0100.s0044_wildcard_matching - package g0001_0100.s0044_wildcard_matching

g0001_0100.s0045_jump_game_ii - package g0001_0100.s0045_jump_game_ii

g0001_0100.s0046_permutations - package g0001_0100.s0046_permutations

g0001_0100.s0047_permutations_ii - package g0001_0100.s0047_permutations_ii

g0001_0100.s0048_rotate_image - package g0001_0100.s0048_rotate_image

g0001_0100.s0049_group_anagrams - package g0001_0100.s0049_group_anagrams

g0001_0100.s0050_powx_n - package g0001_0100.s0050_powx_n

g0001_0100.s0051_n_queens - package g0001_0100.s0051_n_queens

g0001_0100.s0052_n_queens_ii - package g0001_0100.s0052_n_queens_ii

g0001_0100.s0053_maximum_subarray - package g0001_0100.s0053_maximum_subarray

g0001_0100.s0054_spiral_matrix - package g0001_0100.s0054_spiral_matrix

g0001_0100.s0055_jump_game - package g0001_0100.s0055_jump_game

g0001_0100.s0056_merge_intervals - package g0001_0100.s0056_merge_intervals

g0001_0100.s0057_insert_interval - package g0001_0100.s0057_insert_interval

g0001_0100.s0058_length_of_last_word - package g0001_0100.s0058_length_of_last_word

g0001_0100.s0059_spiral_matrix_ii - package g0001_0100.s0059_spiral_matrix_ii

g0001_0100.s0060_permutation_sequence - package g0001_0100.s0060_permutation_sequence

g0001_0100.s0061_rotate_list - package g0001_0100.s0061_rotate_list

g0001_0100.s0062_unique_paths - package g0001_0100.s0062_unique_paths

g0001_0100.s0063_unique_paths_ii - package g0001_0100.s0063_unique_paths_ii

g0001_0100.s0064_minimum_path_sum - package g0001_0100.s0064_minimum_path_sum

g0001_0100.s0065_valid_number - package g0001_0100.s0065_valid_number

g0001_0100.s0066_plus_one - package g0001_0100.s0066_plus_one

g0001_0100.s0067_add_binary - package g0001_0100.s0067_add_binary

g0001_0100.s0068_text_justification - package g0001_0100.s0068_text_justification

g0001_0100.s0069_sqrtx - package g0001_0100.s0069_sqrtx

g0001_0100.s0070_climbing_stairs - package g0001_0100.s0070_climbing_stairs

g0001_0100.s0071_simplify_path - package g0001_0100.s0071_simplify_path

g0001_0100.s0072_edit_distance - package g0001_0100.s0072_edit_distance

g0001_0100.s0073_set_matrix_zeroes - package g0001_0100.s0073_set_matrix_zeroes

g0001_0100.s0074_search_a_2d_matrix - package g0001_0100.s0074_search_a_2d_matrix

g0001_0100.s0075_sort_colors - package g0001_0100.s0075_sort_colors

g0001_0100.s0076_minimum_window_substring - package g0001_0100.s0076_minimum_window_substring

g0001_0100.s0077_combinations - package g0001_0100.s0077_combinations

g0001_0100.s0078_subsets - package g0001_0100.s0078_subsets

g0001_0100.s0079_submissions - package g0001_0100.s0079_submissions

g0001_0100.s0080_remove_duplicates_from_sorted_array_ii - package g0001_0100.s0080_remove_duplicates_from_sorted_array_ii

g0001_0100.s0081_search_in_rotated_sorted_array_ii - package g0001_0100.s0081_search_in_rotated_sorted_array_ii

g0001_0100.s0082_remove_duplicates_from_sorted_list_ii - package g0001_0100.s0082_remove_duplicates_from_sorted_list_ii

g0001_0100.s0083_remove_duplicates_from_sorted_list - package g0001_0100.s0083_remove_duplicates_from_sorted_list

g0001_0100.s0084_largest_rectangle_in_histogram - package g0001_0100.s0084_largest_rectangle_in_histogram

g0001_0100.s0085_maximal_rectangle - package g0001_0100.s0085_maximal_rectangle

g0001_0100.s0086_partition_list - package g0001_0100.s0086_partition_list

g0001_0100.s0087_scramble_string - package g0001_0100.s0087_scramble_string

g0001_0100.s0088_merge_sorted_array - package g0001_0100.s0088_merge_sorted_array

g0001_0100.s0089_gray_code - package g0001_0100.s0089_gray_code

g0001_0100.s0090_subsets_ii - package g0001_0100.s0090_subsets_ii

g0001_0100.s0091_decode_ways - package g0001_0100.s0091_decode_ways

g0001_0100.s0092_reverse_linked_list_ii - package g0001_0100.s0092_reverse_linked_list_ii

g0001_0100.s0093_restore_ip_addresses - package g0001_0100.s0093_restore_ip_addresses

g0001_0100.s0094_binary_tree_inorder_traversal - package g0001_0100.s0094_binary_tree_inorder_traversal

g0001_0100.s0095_unique_binary_search_trees_ii - package g0001_0100.s0095_unique_binary_search_trees_ii

g0001_0100.s0096_unique_binary_search_trees - package g0001_0100.s0096_unique_binary_search_trees

g0001_0100.s0097_interleaving_string - package g0001_0100.s0097_interleaving_string

g0001_0100.s0098_validate_binary_search_tree - package g0001_0100.s0098_validate_binary_search_tree

g0001_0100.s0099_recover_binary_search_tree - package g0001_0100.s0099_recover_binary_search_tree

g0001_0100.s0100_same_tree - package g0001_0100.s0100_same_tree

g0101_0200.s0101_symmetric_tree - package g0101_0200.s0101_symmetric_tree

g0101_0200.s0102_binary_tree_level_order_traversal - package g0101_0200.s0102_binary_tree_level_order_traversal

g0101_0200.s0103_binary_tree_zigzag_level_order_traversal - package g0101_0200.s0103_binary_tree_zigzag_level_order_traversal

g0101_0200.s0104_maximum_depth_of_binary_tree - package g0101_0200.s0104_maximum_depth_of_binary_tree

g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal - package g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal

g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal - package g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal

g0101_0200.s0107_binary_tree_level_order_traversal_ii - package g0101_0200.s0107_binary_tree_level_order_traversal_ii

g0101_0200.s0108_convert_sorted_array_to_binary_search_tree - package g0101_0200.s0108_convert_sorted_array_to_binary_search_tree

g0101_0200.s0109_convert_sorted_list_to_binary_search_tree - package g0101_0200.s0109_convert_sorted_list_to_binary_search_tree

g0101_0200.s0110_balanced_binary_tree - package g0101_0200.s0110_balanced_binary_tree

g0101_0200.s0111_minimum_depth_of_binary_tree - package g0101_0200.s0111_minimum_depth_of_binary_tree

g0101_0200.s0112_path_sum - package g0101_0200.s0112_path_sum

g0101_0200.s0113_path_sum_ii - package g0101_0200.s0113_path_sum_ii

g0101_0200.s0114_flatten_binary_tree_to_linked_list - package g0101_0200.s0114_flatten_binary_tree_to_linked_list

g0101_0200.s0115_distinct_subsequences - package g0101_0200.s0115_distinct_subsequences

g0101_0200.s0116_populating_next_right_pointers_in_each_node - package g0101_0200.s0116_populating_next_right_pointers_in_each_node

g0101_0200.s0117_populating_next_right_pointers_in_each_node_ii - package g0101_0200.s0117_populating_next_right_pointers_in_each_node_ii

g0101_0200.s0118_pascals_triangle - package g0101_0200.s0118_pascals_triangle

g0101_0200.s0119_pascals_triangle_ii - package g0101_0200.s0119_pascals_triangle_ii

g0101_0200.s0120_triangle - package g0101_0200.s0120_triangle

g0101_0200.s0121_best_time_to_buy_and_sell_stock - package g0101_0200.s0121_best_time_to_buy_and_sell_stock

g0101_0200.s0122_best_time_to_buy_and_sell_stock_ii - package g0101_0200.s0122_best_time_to_buy_and_sell_stock_ii

g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii - package g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii

g0101_0200.s0124_binary_tree_maximum_path_sum - package g0101_0200.s0124_binary_tree_maximum_path_sum

g0101_0200.s0125_valid_palindrome - package g0101_0200.s0125_valid_palindrome

g0101_0200.s0126_word_ladder_ii - package g0101_0200.s0126_word_ladder_ii

g0101_0200.s0127_word_ladder - package g0101_0200.s0127_word_ladder

g0101_0200.s0128_longest_consecutive_sequence - package g0101_0200.s0128_longest_consecutive_sequence

g0101_0200.s0129_sum_root_to_leaf_numbers - package g0101_0200.s0129_sum_root_to_leaf_numbers

g0101_0200.s0130_surrounded_regions - package g0101_0200.s0130_surrounded_regions

g0101_0200.s0131_palindrome_partitioning - package g0101_0200.s0131_palindrome_partitioning

g0101_0200.s0132_palindrome_partitioning_ii - package g0101_0200.s0132_palindrome_partitioning_ii

g0101_0200.s0133_clone_graph - package g0101_0200.s0133_clone_graph

g0101_0200.s0134_gas_station - package g0101_0200.s0134_gas_station

g0101_0200.s0135_candy - package g0101_0200.s0135_candy

g0101_0200.s0136_single_number - package g0101_0200.s0136_single_number

g0101_0200.s0137_single_number_ii - package g0101_0200.s0137_single_number_ii

g0101_0200.s0138_copy_list_with_random_pointer - package g0101_0200.s0138_copy_list_with_random_pointer

g0101_0200.s0139_word_break - package g0101_0200.s0139_word_break

g0101_0200.s0140_word_break_ii - package g0101_0200.s0140_word_break_ii

g0101_0200.s0141_linked_list_cycle - package g0101_0200.s0141_linked_list_cycle

g0101_0200.s0142_linked_list_cycle_ii - package g0101_0200.s0142_linked_list_cycle_ii

g0101_0200.s0143_reorder_list - package g0101_0200.s0143_reorder_list

g0101_0200.s0144_binary_tree_preorder_traversal - package g0101_0200.s0144_binary_tree_preorder_traversal

g0101_0200.s0145_binary_tree_postorder_traversal - package g0101_0200.s0145_binary_tree_postorder_traversal

g0101_0200.s0146_lru_cache - package g0101_0200.s0146_lru_cache

g0101_0200.s0147_insertion_sort_list - package g0101_0200.s0147_insertion_sort_list

g0101_0200.s0148_sort_list - package g0101_0200.s0148_sort_list

g0101_0200.s0149_max_points_on_a_line - package g0101_0200.s0149_max_points_on_a_line

g0101_0200.s0150_evaluate_reverse_polish_notation - package g0101_0200.s0150_evaluate_reverse_polish_notation

g0101_0200.s0151_reverse_words_in_a_string - package g0101_0200.s0151_reverse_words_in_a_string

g0101_0200.s0152_maximum_product_subarray - package g0101_0200.s0152_maximum_product_subarray

g0101_0200.s0153_find_minimum_in_rotated_sorted_array - package g0101_0200.s0153_find_minimum_in_rotated_sorted_array

g0101_0200.s0154_find_minimum_in_rotated_sorted_array_ii - package g0101_0200.s0154_find_minimum_in_rotated_sorted_array_ii

g0101_0200.s0155_min_stack - package g0101_0200.s0155_min_stack

g0101_0200.s0160_intersection_of_two_linked_lists - package g0101_0200.s0160_intersection_of_two_linked_lists

g0101_0200.s0162_find_peak_element - package g0101_0200.s0162_find_peak_element

g0101_0200.s0164_maximum_gap - package g0101_0200.s0164_maximum_gap

g0101_0200.s0165_compare_version_numbers - package g0101_0200.s0165_compare_version_numbers

g0101_0200.s0166_fraction_to_recurring_decimal - package g0101_0200.s0166_fraction_to_recurring_decimal

g0101_0200.s0167_two_sum_ii_input_array_is_sorted - package g0101_0200.s0167_two_sum_ii_input_array_is_sorted

g0101_0200.s0168_excel_sheet_column_title - package g0101_0200.s0168_excel_sheet_column_title

g0101_0200.s0169_majority_element - package g0101_0200.s0169_majority_element

g0101_0200.s0171_excel_sheet_column_number - package g0101_0200.s0171_excel_sheet_column_number

g0101_0200.s0172_factorial_trailing_zeroes - package g0101_0200.s0172_factorial_trailing_zeroes

g0101_0200.s0173_binary_search_tree_iterator - package g0101_0200.s0173_binary_search_tree_iterator

g0101_0200.s0174_dungeon_game - package g0101_0200.s0174_dungeon_game

g0101_0200.s0179_largest_number - package g0101_0200.s0179_largest_number

g0101_0200.s0187_repeated_dna_sequences - package g0101_0200.s0187_repeated_dna_sequences

g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv - package g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv

g0101_0200.s0189_rotate_array - package g0101_0200.s0189_rotate_array

g0101_0200.s0190_reverse_bits - package g0101_0200.s0190_reverse_bits

g0101_0200.s0191_number_of_1_bits - package g0101_0200.s0191_number_of_1_bits

g0101_0200.s0198_house_robber - package g0101_0200.s0198_house_robber

g0101_0200.s0199_binary_tree_right_side_view - package g0101_0200.s0199_binary_tree_right_side_view

g0101_0200.s0200_number_of_islands - package g0101_0200.s0200_number_of_islands

g0201_0300.s0201_bitwise_and_of_numbers_range - package g0201_0300.s0201_bitwise_and_of_numbers_range

g0201_0300.s0202_happy_number - package g0201_0300.s0202_happy_number

g0201_0300.s0203_remove_linked_list_elements - package g0201_0300.s0203_remove_linked_list_elements

g0201_0300.s0204_count_primes - package g0201_0300.s0204_count_primes

g0201_0300.s0205_isomorphic_strings - package g0201_0300.s0205_isomorphic_strings

g0201_0300.s0206_reverse_linked_list - package g0201_0300.s0206_reverse_linked_list

g0201_0300.s0207_course_schedule - package g0201_0300.s0207_course_schedule

g0201_0300.s0208_implement_trie_prefix_tree - package g0201_0300.s0208_implement_trie_prefix_tree

g0201_0300.s0209_minimum_size_subarray_sum - package g0201_0300.s0209_minimum_size_subarray_sum

g0201_0300.s0210_course_schedule_ii - package g0201_0300.s0210_course_schedule_ii

g0201_0300.s0211_design_add_and_search_words_data_structure - package g0201_0300.s0211_design_add_and_search_words_data_structure

g0201_0300.s0212_word_search_ii - package g0201_0300.s0212_word_search_ii

g0201_0300.s0213_house_robber_ii - package g0201_0300.s0213_house_robber_ii

g0201_0300.s0214_shortest_palindrome - package g0201_0300.s0214_shortest_palindrome

g0201_0300.s0215_kth_largest_element_in_an_array - package g0201_0300.s0215_kth_largest_element_in_an_array

g0201_0300.s0216_combination_sum_iii - package g0201_0300.s0216_combination_sum_iii

g0201_0300.s0217_contains_duplicate - package g0201_0300.s0217_contains_duplicate

g0201_0300.s0218_the_skyline_problem - package g0201_0300.s0218_the_skyline_problem

g0201_0300.s0219_contains_duplicate_ii - package g0201_0300.s0219_contains_duplicate_ii

g0201_0300.s0220_contains_duplicate_iii - package g0201_0300.s0220_contains_duplicate_iii

g0201_0300.s0221_maximal_square - package g0201_0300.s0221_maximal_square

g0201_0300.s0222_count_complete_tree_nodes - package g0201_0300.s0222_count_complete_tree_nodes

g0201_0300.s0223_rectangle_area - package g0201_0300.s0223_rectangle_area

g0201_0300.s0224_basic_calculator - package g0201_0300.s0224_basic_calculator

g0201_0300.s0225_implement_stack_using_queues - package g0201_0300.s0225_implement_stack_using_queues

g0201_0300.s0226_invert_binary_tree - package g0201_0300.s0226_invert_binary_tree

g0201_0300.s0227_basic_calculator_ii - package g0201_0300.s0227_basic_calculator_ii

g0201_0300.s0228_summary_ranges - package g0201_0300.s0228_summary_ranges

g0201_0300.s0229_majority_element_ii - package g0201_0300.s0229_majority_element_ii

g0201_0300.s0230_kth_smallest_element_in_a_bst - package g0201_0300.s0230_kth_smallest_element_in_a_bst

g0201_0300.s0231_power_of_two - package g0201_0300.s0231_power_of_two

g0201_0300.s0232_implement_queue_using_stacks - package g0201_0300.s0232_implement_queue_using_stacks

g0201_0300.s0233_number_of_digit_one - package g0201_0300.s0233_number_of_digit_one

g0201_0300.s0234_palindrome_linked_list - package g0201_0300.s0234_palindrome_linked_list

g0201_0300.s0240_search_a_2d_matrix_ii - package g0201_0300.s0240_search_a_2d_matrix_ii

g0201_0300.s0241_different_ways_to_add_parentheses - package g0201_0300.s0241_different_ways_to_add_parentheses

g0201_0300.s0242_valid_anagram - package g0201_0300.s0242_valid_anagram

g0201_0300.s0257_binary_tree_paths - package g0201_0300.s0257_binary_tree_paths

g0201_0300.s0258_add_digits - package g0201_0300.s0258_add_digits

g0201_0300.s0260_single_number_iii - package g0201_0300.s0260_single_number_iii

g0201_0300.s0263_ugly_number - package g0201_0300.s0263_ugly_number

g0201_0300.s0264_ugly_number_ii - package g0201_0300.s0264_ugly_number_ii

g0201_0300.s0268_missing_number - package g0201_0300.s0268_missing_number

g0201_0300.s0273_integer_to_english_words - package g0201_0300.s0273_integer_to_english_words

g0201_0300.s0274_h_index - package g0201_0300.s0274_h_index

g0201_0300.s0275_h_index_ii - package g0201_0300.s0275_h_index_ii

g0201_0300.s0278_first_bad_version - package g0201_0300.s0278_first_bad_version

g0201_0300.s0279_perfect_squares - package g0201_0300.s0279_perfect_squares

g0201_0300.s0282_expression_add_operators - package g0201_0300.s0282_expression_add_operators

g0201_0300.s0283_move_zeroes - package g0201_0300.s0283_move_zeroes

g0201_0300.s0284_peeking_iterator - package g0201_0300.s0284_peeking_iterator

g0201_0300.s0287_find_the_duplicate_number - package g0201_0300.s0287_find_the_duplicate_number

g0201_0300.s0289_game_of_life - package g0201_0300.s0289_game_of_life

g0201_0300.s0290_word_pattern - package g0201_0300.s0290_word_pattern

g0201_0300.s0292_nim_game - package g0201_0300.s0292_nim_game

g0201_0300.s0295_find_median_from_data_stream - package g0201_0300.s0295_find_median_from_data_stream

g0201_0300.s0297_serialize_and_deserialize_binary_tree - package g0201_0300.s0297_serialize_and_deserialize_binary_tree

g0201_0300.s0299_bulls_and_cows - package g0201_0300.s0299_bulls_and_cows

g0201_0300.s0300_longest_increasing_subsequence - package g0201_0300.s0300_longest_increasing_subsequence

g0301_0400.s0307_range_sum_query_mutable - package g0301_0400.s0307_range_sum_query_mutable

g0301_0400.s0330_patching_array - package g0301_0400.s0330_patching_array

g0301_0400.s0331_verify_preorder_serialization_of_a_binary_tree - package g0301_0400.s0331_verify_preorder_serialization_of_a_binary_tree

g0301_0400.s0332_reconstruct_itinerary - package g0301_0400.s0332_reconstruct_itinerary

g0301_0400.s0334_increasing_triplet_subsequence - package g0301_0400.s0334_increasing_triplet_subsequence

g0801_0900.s0864_shortest_path_to_get_all_keys - package g0801_0900.s0864_shortest_path_to_get_all_keys

g2001_2100.s2080_range_frequency_queries - package g2001_2100.s2080_range_frequency_queries

gameOfLife(int[][]) - Method in class g0201_0300.s0289_game_of_life.Solution

generate(int) - Method in class g0101_0200.s0118_pascals_triangle.Solution

generateMatrix(int) - Method in class g0001_0100.s0059_spiral_matrix_ii.Solution

generateParenthesis(int) - Method in class g0001_0100.s0022_generate_parentheses.Solution

generateTrees(int) - Method in class g0001_0100.s0095_unique_binary_search_trees_ii.Solution

get(int) - Method in class g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal.Solution

get(int) - Method in class g0101_0200.s0146_lru_cache.LruCache

getChild(char) - Method in class g0201_0300.s0212_word_search_ii.Tree

getHint(String, String) - Method in class g0201_0300.s0299_bulls_and_cows.Solution

getIntersectionNode(ListNode, ListNode) - Method in class g0101_0200.s0160_intersection_of_two_linked_lists.Solution

getMaxHeight(TreeNode) - Method in class g0101_0200.s0110_balanced_binary_tree.Solution

getMin() - Method in class g0101_0200.s0155_min_stack.MinStack

getOrder(TreeNode, int) - Method in class g0101_0200.s0107_binary_tree_level_order_traversal_ii.Solution

getPermutation(int, int) - Method in class g0001_0100.s0060_permutation_sequence.Solution

getRow(int) - Method in class g0101_0200.s0119_pascals_triangle_ii.Solution

getSkyline(int[][]) - Method in class g0201_0300.s0218_the_skyline_problem.Solution

grayCode(int) - Method in class g0001_0100.s0089_gray_code.Solution

groupAnagrams(String[]) - Method in class g0001_0100.s0049_group_anagrams.Solution

H

hammingWeight(int) - Method in class g0101_0200.s0191_number_of_1_bits.Solution

hasCycle(ListNode) - Method in class g0101_0200.s0141_linked_list_cycle.Solution

hasNext() - Method in class g0101_0200.s0173_binary_search_tree_iterator.BSTIterator

hasNext() - Method in class g0201_0300.s0284_peeking_iterator.PeekingIterator

hasPathSum(TreeNode, int) - Method in class g0101_0200.s0112_path_sum.Solution

hindex(int[]) - Method in class g0201_0300.s0274_h_index.Solution

hindex(int[]) - Method in class g0201_0300.s0275_h_index_ii.Solution

I

increasingTriplet(int[]) - Method in class g0301_0400.s0334_increasing_triplet_subsequence.Solution

inorderTraversal(TreeNode) - Method in class g0001_0100.s0094_binary_tree_inorder_traversal.Solution

inorderTraversal(TreeNode, List<Integer>) - Method in class g0001_0100.s0094_binary_tree_inorder_traversal.Solution

insert(int[][], int[]) - Method in class g0001_0100.s0057_insert_interval.Solution

insert(String) - Method in class g0201_0300.s0208_implement_trie_prefix_tree.Trie

insertionSortList(ListNode) - Method in class g0101_0200.s0147_insertion_sort_list.Solution

intToRoman(int) - Method in class g0001_0100.s0012_integer_to_roman.Solution

invertTree(TreeNode) - Method in class g0201_0300.s0226_invert_binary_tree.Solution

isAnagram(String, String) - Method in class g0201_0300.s0242_valid_anagram.Solution

isBadVersion(int) - Method in class g0201_0300.s0278_first_bad_version.VersionControl

isBalanced(TreeNode) - Method in class g0101_0200.s0110_balanced_binary_tree.Solution

isHappy(int) - Method in class g0201_0300.s0202_happy_number.Solution

isInterleave(String, String, String) - Method in class g0001_0100.s0097_interleaving_string.Solution

isInterleave(String, String, String, int, int, int, Boolean[][]) - Method in class g0001_0100.s0097_interleaving_string.Solution

isIsomorphic(String, String) - Method in class g0201_0300.s0205_isomorphic_strings.Solution

isMatch(String, String) - Method in class g0001_0100.s0010_regular_expression_matching.Solution

isMatch(String, String) - Method in class g0001_0100.s0044_wildcard_matching.Solution

isNumber(String) - Method in class g0001_0100.s0065_valid_number.Solution

isPalindrome(int) - Method in class g0001_0100.s0009_palindrome_number.Solution

isPalindrome(ListNode) - Method in class g0201_0300.s0234_palindrome_linked_list.Solution

isPalindrome(String) - Method in class g0101_0200.s0125_valid_palindrome.Solution

isPowerOfTwo(int) - Method in class g0201_0300.s0231_power_of_two.Solution

isSameTree(TreeNode, TreeNode) - Method in class g0001_0100.s0100_same_tree.Solution

isScramble(String, String) - Method in class g0001_0100.s0087_scramble_string.Solution

isSymmetric(TreeNode) - Method in class g0101_0200.s0101_symmetric_tree.Solution

isUgly(int) - Method in class g0201_0300.s0263_ugly_number.Solution

isValid(String) - Method in class g0001_0100.s0020_valid_parentheses.Solution

isValidBST(TreeNode) - Method in class g0001_0100.s0098_validate_binary_search_tree.Solution

isValidSerialization(String) - Method in class g0301_0400.s0331_verify_preorder_serialization_of_a_binary_tree.Solution

isValidSudoku(char[][]) - Method in class g0001_0100.s0036_valid_sudoku.Solution

isWord - Variable in class g0201_0300.s0208_implement_trie_prefix_tree.TrieNode

J

jump(int[]) - Method in class g0001_0100.s0045_jump_game_ii.Solution

K

kthSmallest(TreeNode, int) - Method in class g0201_0300.s0230_kth_smallest_element_in_a_bst.Solution

L

ladderLength(String, String, List<String>) - Method in class g0101_0200.s0127_word_ladder.Solution

largestNumber(int[]) - Method in class g0101_0200.s0179_largest_number.Solution

largestRectangleArea(int[]) - Method in class g0001_0100.s0084_largest_rectangle_in_histogram.Solution

left - Variable in class com_github_leetcode.left_right.Node

left - Variable in class com_github_leetcode.TreeNode

len() - Method in class g0201_0300.s0212_word_search_ii.Tree

lengthOfLastWord(String) - Method in class g0001_0100.s0058_length_of_last_word.Solution

lengthOfLIS(int[]) - Method in class g0201_0300.s0300_longest_increasing_subsequence.Solution

lengthOfLongestSubstring(String) - Method in class g0001_0100.s0003_longest_substring_without_repeating_characters.Solution

letterCombinations(String) - Method in class g0001_0100.s0017_letter_combinations_of_a_phone_number.Solution

levelOrder(TreeNode) - Method in class g0101_0200.s0102_binary_tree_level_order_traversal.Solution

levelOrderBottom(TreeNode) - Method in class g0101_0200.s0107_binary_tree_level_order_traversal_ii.Solution

ListNode - Class in com_github_leetcode

ListNode() - Constructor for class com_github_leetcode.ListNode

ListNode(int) - Constructor for class com_github_leetcode.ListNode

ListNode(int, ListNode) - Constructor for class com_github_leetcode.ListNode

longestCommonPrefix(String[]) - Method in class g0001_0100.s0014_longest_common_prefix.Solution

longestConsecutive(int[]) - Method in class g0101_0200.s0128_longest_consecutive_sequence.Solution

longestPalindrome(String) - Method in class g0001_0100.s0005_longest_palindromic_substring.Solution

longestValidParentheses(String) - Method in class g0001_0100.s0032_longest_valid_parentheses.Solution

LruCache - Class in g0101_0200.s0146_lru_cache

LruCache(int) - Constructor for class g0101_0200.s0146_lru_cache.LruCache

M

majorityElement(int[]) - Method in class g0101_0200.s0169_majority_element.Solution

majorityElement(int[]) - Method in class g0201_0300.s0229_majority_element_ii.Solution

makeTree(int[], int, int) - Method in class g0101_0200.s0108_convert_sorted_array_to_binary_search_tree.Solution

maxArea(int[]) - Method in class g0001_0100.s0011_container_with_most_water.Solution

maxDepth(TreeNode) - Method in class g0101_0200.s0104_maximum_depth_of_binary_tree.Solution

maximalRectangle(char[][]) - Method in class g0001_0100.s0085_maximal_rectangle.Solution

maximalSquare(char[][]) - Method in class g0201_0300.s0221_maximal_square.Solution

maximumGap(int[]) - Method in class g0101_0200.s0164_maximum_gap.Solution

maxPathSum(TreeNode) - Method in class g0101_0200.s0124_binary_tree_maximum_path_sum.Solution

maxPoints(int[][]) - Method in class g0101_0200.s0149_max_points_on_a_line.Solution

maxProduct(int[]) - Method in class g0101_0200.s0152_maximum_product_subarray.Solution

maxProfit(int[]) - Method in class g0101_0200.s0121_best_time_to_buy_and_sell_stock.Solution

maxProfit(int[]) - Method in class g0101_0200.s0122_best_time_to_buy_and_sell_stock_ii.Solution

maxProfit(int[]) - Method in class g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii.Solution

maxProfit(int, int[]) - Method in class g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv.Solution

maxSubArray(int[]) - Method in class g0001_0100.s0053_maximum_subarray.Solution

MedianFinder - Class in g0201_0300.s0295_find_median_from_data_stream

MedianFinder() - Constructor for class g0201_0300.s0295_find_median_from_data_stream.MedianFinder

merge(int[][]) - Method in class g0001_0100.s0056_merge_intervals.Solution

merge(int[], int, int[], int) - Method in class g0001_0100.s0088_merge_sorted_array.Solution

mergeKLists(ListNode[]) - Method in class g0001_0100.s0023_merge_k_sorted_lists.Solution

mergeTwoLists(ListNode, ListNode) - Method in class g0001_0100.s0021_merge_two_sorted_lists.Solution

minCut(String) - Method in class g0101_0200.s0132_palindrome_partitioning_ii.Solution

minDepth(TreeNode) - Method in class g0101_0200.s0111_minimum_depth_of_binary_tree.Solution

minDistance(String, String) - Method in class g0001_0100.s0072_edit_distance.Solution

minimumTotal(List<List<Integer>>) - Method in class g0101_0200.s0120_triangle.Solution

minPatches(int[], int) - Method in class g0301_0400.s0330_patching_array.Solution

minPathSum(int[][]) - Method in class g0001_0100.s0064_minimum_path_sum.Solution

MinStack - Class in g0101_0200.s0155_min_stack

MinStack() - Constructor for class g0101_0200.s0155_min_stack.MinStack

minSubArrayLen(int, int[]) - Method in class g0201_0300.s0209_minimum_size_subarray_sum.Solution

minWindow(String, String) - Method in class g0001_0100.s0076_minimum_window_substring.Solution

missingNumber(int[]) - Method in class g0201_0300.s0268_missing_number.Solution

moveZeroes(int[]) - Method in class g0201_0300.s0283_move_zeroes.Solution

multiply(String, String) - Method in class g0001_0100.s0043_multiple_strings.Solution

myAtoi(String) - Method in class g0001_0100.s0008_string_to_integer_atoi.Solution

myPow(double, int) - Method in class g0001_0100.s0050_powx_n.Solution

MyQueue - Class in g0201_0300.s0232_implement_queue_using_stacks

MyQueue() - Constructor for class g0201_0300.s0232_implement_queue_using_stacks.MyQueue

mySqrt(int) - Method in class g0001_0100.s0069_sqrtx.Solution

MyStack - Class in g0201_0300.s0225_implement_stack_using_queues

MyStack() - Constructor for class g0201_0300.s0225_implement_stack_using_queues.MyStack

N

neighbors - Variable in class com_github_leetcode.Node

next - Variable in class com_github_leetcode.left_right.Node

next - Variable in class com_github_leetcode.ListNode

next - Variable in class com_github_leetcode.random.Node

next() - Method in class g0101_0200.s0173_binary_search_tree_iterator.BSTIterator

next() - Method in class g0201_0300.s0284_peeking_iterator.PeekingIterator

nextPermutation(int[]) - Method in class g0001_0100.s0031_next_permutation.Solution

Node - Class in com_github_leetcode.left_right

Node - Class in com_github_leetcode

Node - Class in com_github_leetcode.random

Node - Class in g0101_0200.s0155_min_stack

Node() - Constructor for class com_github_leetcode.left_right.Node

Node() - Constructor for class com_github_leetcode.Node

Node() - Constructor for class com_github_leetcode.random.Node

Node(int) - Constructor for class com_github_leetcode.left_right.Node

Node(int) - Constructor for class com_github_leetcode.Node

Node(int) - Constructor for class com_github_leetcode.random.Node

Node(int, int, Node, Node) - Constructor for class g0101_0200.s0155_min_stack.Node

Node(int, Node, Node, Node) - Constructor for class com_github_leetcode.left_right.Node

Node(int, Node, Node) - Constructor for class com_github_leetcode.random.Node

Node(int, List<Node>) - Constructor for class com_github_leetcode.Node

nthUglyNumber(int) - Method in class g0201_0300.s0264_ugly_number_ii.Solution

NumArray - Class in g0301_0400.s0307_range_sum_query_mutable

NumArray(int[]) - Constructor for class g0301_0400.s0307_range_sum_query_mutable.NumArray

numberToWords(int) - Method in class g0201_0300.s0273_integer_to_english_words.Solution

numDecodings(String) - Method in class g0001_0100.s0091_decode_ways.Solution

numDistinct(String, String) - Method in class g0101_0200.s0115_distinct_subsequences.Solution

numIslands(char[][]) - Method in class g0101_0200.s0200_number_of_islands.Solution

numSquares(int) - Method in class g0201_0300.s0279_perfect_squares.Solution

numTrees(int) - Method in class g0001_0100.s0096_unique_binary_search_trees.Solution

P

partition(ListNode, int) - Method in class g0001_0100.s0086_partition_list.Solution

partition(String) - Method in class g0101_0200.s0131_palindrome_partitioning.Solution

pathSum(TreeNode, int) - Method in class g0101_0200.s0113_path_sum_ii.Solution

peek() - Method in class g0201_0300.s0232_implement_queue_using_stacks.MyQueue

peek() - Method in class g0201_0300.s0284_peeking_iterator.PeekingIterator

PeekingIterator - Class in g0201_0300.s0284_peeking_iterator

PeekingIterator(Iterator<Integer>) - Constructor for class g0201_0300.s0284_peeking_iterator.PeekingIterator

permute(int[]) - Method in class g0001_0100.s0046_permutations.Solution

permuteUnique(int[]) - Method in class g0001_0100.s0047_permutations_ii.Solution

plusOne(int[]) - Method in class g0001_0100.s0066_plus_one.Solution

pop() - Method in class g0101_0200.s0155_min_stack.MinStack

pop() - Method in class g0201_0300.s0225_implement_stack_using_queues.MyStack

pop() - Method in class g0201_0300.s0232_implement_queue_using_stacks.MyQueue

postorderTraversal(TreeNode) - Method in class g0101_0200.s0145_binary_tree_postorder_traversal.Solution

preorderTraversal(TreeNode) - Method in class g0101_0200.s0144_binary_tree_preorder_traversal.Solution

push(int) - Method in class g0101_0200.s0155_min_stack.MinStack

push(int) - Method in class g0201_0300.s0225_implement_stack_using_queues.MyStack

push(int) - Method in class g0201_0300.s0232_implement_queue_using_stacks.MyQueue

put(int, int) - Method in class g0101_0200.s0146_lru_cache.LruCache

Q

query(int, int, int) - Method in class g2001_2100.s2080_range_frequency_queries.RangeFreqQuery

R

random - Variable in class com_github_leetcode.random.Node

rangeBitwiseAnd(int, int) - Method in class g0201_0300.s0201_bitwise_and_of_numbers_range.Solution

RangeFreqQuery - Class in g2001_2100.s2080_range_frequency_queries

RangeFreqQuery(int[]) - Constructor for class g2001_2100.s2080_range_frequency_queries.RangeFreqQuery

recoverTree(TreeNode) - Method in class g0001_0100.s0099_recover_binary_search_tree.Solution

removeDuplicates(int[]) - Method in class g0001_0100.s0026_remove_duplicates_from_sorted_array.Solution

removeDuplicates(int[]) - Method in class g0001_0100.s0080_remove_duplicates_from_sorted_array_ii.Solution

removeElement(int[], int) - Method in class g0001_0100.s0027_remove_element.Solution

removeElements(ListNode, int) - Method in class g0201_0300.s0203_remove_linked_list_elements.Solution

removeNthFromEnd(ListNode, int) - Method in class g0001_0100.s0019_remove_nth_node_from_end_of_list.Solution

reorderList(ListNode) - Method in class g0101_0200.s0143_reorder_list.Solution

restoreIpAddresses(String) - Method in class g0001_0100.s0093_restore_ip_addresses.Solution

reverse(int) - Method in class g0001_0100.s0007_reverse_integer.Solution

reverse(ListNode) - Method in class g0001_0100.s0092_reverse_linked_list_ii.Solution

reverseBetween(ListNode, int, int) - Method in class g0001_0100.s0092_reverse_linked_list_ii.Solution

reverseBits(int) - Method in class g0101_0200.s0190_reverse_bits.Solution

reverseKGroup(ListNode, int) - Method in class g0001_0100.s0025_reverse_nodes_in_k_group.Solution

reverseList(ListNode) - Method in class g0201_0300.s0206_reverse_linked_list.Solution

reverseWords(String) - Method in class g0101_0200.s0151_reverse_words_in_a_string.Solution

right - Variable in class com_github_leetcode.left_right.Node

right - Variable in class com_github_leetcode.TreeNode

rightSideView(TreeNode) - Method in class g0101_0200.s0199_binary_tree_right_side_view.Solution

rob(int[]) - Method in class g0101_0200.s0198_house_robber.Solution

rob(int[]) - Method in class g0201_0300.s0213_house_robber_ii.Solution

romanToInt(String) - Method in class g0001_0100.s0013_roman_to_integer.Solution

rotate(int[][]) - Method in class g0001_0100.s0048_rotate_image.Solution

rotate(int[], int) - Method in class g0101_0200.s0189_rotate_array.Solution

rotateRight(ListNode, int) - Method in class g0001_0100.s0061_rotate_list.Solution

S

search(int[], int) - Method in class g0001_0100.s0033_search_in_rotated_sorted_array.Solution

search(int[], int) - Method in class g0001_0100.s0081_search_in_rotated_sorted_array_ii.Solution

search(String) - Method in class g0201_0300.s0208_implement_trie_prefix_tree.Trie

search(String) - Method in class g0201_0300.s0211_design_add_and_search_words_data_structure.WordDictionary

search(String, TrieNode, int) - Method in class g0201_0300.s0208_implement_trie_prefix_tree.Trie

searchInsert(int[], int) - Method in class g0001_0100.s0035_search_insert_position.Solution

searchMatrix(int[][], int) - Method in class g0001_0100.s0074_search_a_2d_matrix.Solution

searchMatrix(int[][], int) - Method in class g0201_0300.s0240_search_a_2d_matrix_ii.Solution

searchRange(int[], int) - Method in class g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array.Solution

serialize(TreeNode) - Method in class g0201_0300.s0297_serialize_and_deserialize_binary_tree.Codec

serialize(TreeNode, StringBuilder) - Method in class g0201_0300.s0297_serialize_and_deserialize_binary_tree.Codec

setZeroes(int[][]) - Method in class g0001_0100.s0073_set_matrix_zeroes.Solution

shortestPalindrome(String) - Method in class g0201_0300.s0214_shortest_palindrome.Solution

shortestPathAllKeys(String[]) - Method in class g0801_0900.s0864_shortest_path_to_get_all_keys.Solution

simplifyPath(String) - Method in class g0001_0100.s0071_simplify_path.Solution

singleNumber(int[]) - Method in class g0101_0200.s0136_single_number.Solution

singleNumber(int[]) - Method in class g0101_0200.s0137_single_number_ii.Solution

singleNumber(int[]) - Method in class g0201_0300.s0260_single_number_iii.Solution

Solution - Class in g0001_0100.s0001_two_sum

Solution - Class in g0001_0100.s0002_add_two_numbers

Solution - Class in g0001_0100.s0003_longest_substring_without_repeating_characters

Solution - Class in g0001_0100.s0004_median_of_two_sorted_arrays

Solution - Class in g0001_0100.s0005_longest_palindromic_substring

Solution - Class in g0001_0100.s0006_zigzag_conversion

Solution - Class in g0001_0100.s0007_reverse_integer

Solution - Class in g0001_0100.s0008_string_to_integer_atoi

Solution - Class in g0001_0100.s0009_palindrome_number

Solution - Class in g0001_0100.s0010_regular_expression_matching

Solution - Class in g0001_0100.s0011_container_with_most_water

Solution - Class in g0001_0100.s0012_integer_to_roman

Solution - Class in g0001_0100.s0013_roman_to_integer

Solution - Class in g0001_0100.s0014_longest_common_prefix

Solution - Class in g0001_0100.s0015_three_sum

Solution - Class in g0001_0100.s0016_three_sum_closest

Solution - Class in g0001_0100.s0017_letter_combinations_of_a_phone_number

Solution - Class in g0001_0100.s0018_four_sum

Solution - Class in g0001_0100.s0019_remove_nth_node_from_end_of_list

Solution - Class in g0001_0100.s0020_valid_parentheses

Solution - Class in g0001_0100.s0021_merge_two_sorted_lists

Solution - Class in g0001_0100.s0022_generate_parentheses

Solution - Class in g0001_0100.s0023_merge_k_sorted_lists

Solution - Class in g0001_0100.s0024_swap_nodes_in_pairs

Solution - Class in g0001_0100.s0025_reverse_nodes_in_k_group

Solution - Class in g0001_0100.s0026_remove_duplicates_from_sorted_array

Solution - Class in g0001_0100.s0027_remove_element

Solution - Class in g0001_0100.s0028_implement_strstr

Solution - Class in g0001_0100.s0029_divide_two_integers

Solution - Class in g0001_0100.s0030_substring_with_concatenation_of_all_words

Solution - Class in g0001_0100.s0031_next_permutation

Solution - Class in g0001_0100.s0032_longest_valid_parentheses

Solution - Class in g0001_0100.s0033_search_in_rotated_sorted_array

Solution - Class in g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array

Solution - Class in g0001_0100.s0035_search_insert_position

Solution - Class in g0001_0100.s0036_valid_sudoku

Solution - Class in g0001_0100.s0037_sudoku_solver

Solution - Class in g0001_0100.s0038_count_and_say

Solution - Class in g0001_0100.s0039_combination_sum

Solution - Class in g0001_0100.s0040_combination_sum_ii

Solution - Class in g0001_0100.s0041_first_missing_positive

Solution - Class in g0001_0100.s0042_trapping_rain_water

Solution - Class in g0001_0100.s0043_multiple_strings

Solution - Class in g0001_0100.s0044_wildcard_matching

Solution - Class in g0001_0100.s0045_jump_game_ii

Solution - Class in g0001_0100.s0046_permutations

Solution - Class in g0001_0100.s0047_permutations_ii

Solution - Class in g0001_0100.s0048_rotate_image

Solution - Class in g0001_0100.s0049_group_anagrams

Solution - Class in g0001_0100.s0050_powx_n

Solution - Class in g0001_0100.s0051_n_queens

Solution - Class in g0001_0100.s0052_n_queens_ii

Solution - Class in g0001_0100.s0053_maximum_subarray

Solution - Class in g0001_0100.s0054_spiral_matrix

Solution - Class in g0001_0100.s0055_jump_game

Solution - Class in g0001_0100.s0056_merge_intervals

Solution - Class in g0001_0100.s0057_insert_interval

Solution - Class in g0001_0100.s0058_length_of_last_word

Solution - Class in g0001_0100.s0059_spiral_matrix_ii

Solution - Class in g0001_0100.s0060_permutation_sequence

Solution - Class in g0001_0100.s0061_rotate_list

Solution - Class in g0001_0100.s0062_unique_paths

Solution - Class in g0001_0100.s0063_unique_paths_ii

Solution - Class in g0001_0100.s0064_minimum_path_sum

Solution - Class in g0001_0100.s0065_valid_number

Solution - Class in g0001_0100.s0066_plus_one

Solution - Class in g0001_0100.s0067_add_binary

Solution - Class in g0001_0100.s0068_text_justification

Solution - Class in g0001_0100.s0069_sqrtx

Solution - Class in g0001_0100.s0070_climbing_stairs

Solution - Class in g0001_0100.s0071_simplify_path

Solution - Class in g0001_0100.s0072_edit_distance

Solution - Class in g0001_0100.s0073_set_matrix_zeroes

Solution - Class in g0001_0100.s0074_search_a_2d_matrix

Solution - Class in g0001_0100.s0075_sort_colors

Solution - Class in g0001_0100.s0076_minimum_window_substring

Solution - Class in g0001_0100.s0077_combinations

Solution - Class in g0001_0100.s0078_subsets

Solution - Class in g0001_0100.s0079_submissions

Solution - Class in g0001_0100.s0080_remove_duplicates_from_sorted_array_ii

Solution - Class in g0001_0100.s0081_search_in_rotated_sorted_array_ii

Solution - Class in g0001_0100.s0082_remove_duplicates_from_sorted_list_ii

Solution - Class in g0001_0100.s0083_remove_duplicates_from_sorted_list

Solution - Class in g0001_0100.s0084_largest_rectangle_in_histogram

Solution - Class in g0001_0100.s0085_maximal_rectangle

Solution - Class in g0001_0100.s0086_partition_list

Solution - Class in g0001_0100.s0087_scramble_string

Solution - Class in g0001_0100.s0088_merge_sorted_array

Solution - Class in g0001_0100.s0089_gray_code

Solution - Class in g0001_0100.s0090_subsets_ii

Solution - Class in g0001_0100.s0091_decode_ways

Solution - Class in g0001_0100.s0092_reverse_linked_list_ii

Solution - Class in g0001_0100.s0093_restore_ip_addresses

Solution - Class in g0001_0100.s0094_binary_tree_inorder_traversal

Solution - Class in g0001_0100.s0095_unique_binary_search_trees_ii

Solution - Class in g0001_0100.s0096_unique_binary_search_trees

Solution - Class in g0001_0100.s0097_interleaving_string

Solution - Class in g0001_0100.s0098_validate_binary_search_tree

Solution - Class in g0001_0100.s0099_recover_binary_search_tree

Solution - Class in g0001_0100.s0100_same_tree

Solution - Class in g0101_0200.s0101_symmetric_tree

Solution - Class in g0101_0200.s0102_binary_tree_level_order_traversal

Solution - Class in g0101_0200.s0103_binary_tree_zigzag_level_order_traversal

Solution - Class in g0101_0200.s0104_maximum_depth_of_binary_tree

Solution - Class in g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal

Solution - Class in g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal

Solution - Class in g0101_0200.s0107_binary_tree_level_order_traversal_ii

Solution - Class in g0101_0200.s0108_convert_sorted_array_to_binary_search_tree

Solution - Class in g0101_0200.s0109_convert_sorted_list_to_binary_search_tree

Solution - Class in g0101_0200.s0110_balanced_binary_tree

Solution - Class in g0101_0200.s0111_minimum_depth_of_binary_tree

Solution - Class in g0101_0200.s0112_path_sum

Solution - Class in g0101_0200.s0113_path_sum_ii

Solution - Class in g0101_0200.s0114_flatten_binary_tree_to_linked_list

Solution - Class in g0101_0200.s0115_distinct_subsequences

Solution - Class in g0101_0200.s0116_populating_next_right_pointers_in_each_node

Solution - Class in g0101_0200.s0117_populating_next_right_pointers_in_each_node_ii

Solution - Class in g0101_0200.s0118_pascals_triangle

Solution - Class in g0101_0200.s0119_pascals_triangle_ii

Solution - Class in g0101_0200.s0120_triangle

Solution - Class in g0101_0200.s0121_best_time_to_buy_and_sell_stock

Solution - Class in g0101_0200.s0122_best_time_to_buy_and_sell_stock_ii

Solution - Class in g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii

Solution - Class in g0101_0200.s0124_binary_tree_maximum_path_sum

Solution - Class in g0101_0200.s0125_valid_palindrome

Solution - Class in g0101_0200.s0126_word_ladder_ii

Solution - Class in g0101_0200.s0127_word_ladder

Solution - Class in g0101_0200.s0128_longest_consecutive_sequence

Solution - Class in g0101_0200.s0129_sum_root_to_leaf_numbers

Solution - Class in g0101_0200.s0130_surrounded_regions

Solution - Class in g0101_0200.s0131_palindrome_partitioning

Solution - Class in g0101_0200.s0132_palindrome_partitioning_ii

Solution - Class in g0101_0200.s0133_clone_graph

Solution - Class in g0101_0200.s0134_gas_station

Solution - Class in g0101_0200.s0135_candy

Solution - Class in g0101_0200.s0136_single_number

Solution - Class in g0101_0200.s0137_single_number_ii

Solution - Class in g0101_0200.s0138_copy_list_with_random_pointer

Solution - Class in g0101_0200.s0139_word_break

Solution - Class in g0101_0200.s0140_word_break_ii

Solution - Class in g0101_0200.s0141_linked_list_cycle

Solution - Class in g0101_0200.s0142_linked_list_cycle_ii

Solution - Class in g0101_0200.s0143_reorder_list

Solution - Class in g0101_0200.s0144_binary_tree_preorder_traversal

Solution - Class in g0101_0200.s0145_binary_tree_postorder_traversal

Solution - Class in g0101_0200.s0147_insertion_sort_list

Solution - Class in g0101_0200.s0148_sort_list

Solution - Class in g0101_0200.s0149_max_points_on_a_line

Solution - Class in g0101_0200.s0150_evaluate_reverse_polish_notation

Solution - Class in g0101_0200.s0151_reverse_words_in_a_string

Solution - Class in g0101_0200.s0152_maximum_product_subarray

Solution - Class in g0101_0200.s0153_find_minimum_in_rotated_sorted_array

Solution - Class in g0101_0200.s0154_find_minimum_in_rotated_sorted_array_ii

Solution - Class in g0101_0200.s0160_intersection_of_two_linked_lists

Solution - Class in g0101_0200.s0162_find_peak_element

Solution - Class in g0101_0200.s0164_maximum_gap

Solution - Class in g0101_0200.s0165_compare_version_numbers

Solution - Class in g0101_0200.s0166_fraction_to_recurring_decimal

Solution - Class in g0101_0200.s0167_two_sum_ii_input_array_is_sorted

Solution - Class in g0101_0200.s0168_excel_sheet_column_title

Solution - Class in g0101_0200.s0169_majority_element

Solution - Class in g0101_0200.s0171_excel_sheet_column_number

Solution - Class in g0101_0200.s0172_factorial_trailing_zeroes

Solution - Class in g0101_0200.s0174_dungeon_game

Solution - Class in g0101_0200.s0179_largest_number

Solution - Class in g0101_0200.s0187_repeated_dna_sequences

Solution - Class in g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv

Solution - Class in g0101_0200.s0189_rotate_array

Solution - Class in g0101_0200.s0190_reverse_bits

Solution - Class in g0101_0200.s0191_number_of_1_bits

Solution - Class in g0101_0200.s0198_house_robber

Solution - Class in g0101_0200.s0199_binary_tree_right_side_view

Solution - Class in g0101_0200.s0200_number_of_islands

Solution - Class in g0201_0300.s0201_bitwise_and_of_numbers_range

Solution - Class in g0201_0300.s0202_happy_number

Solution - Class in g0201_0300.s0203_remove_linked_list_elements

Solution - Class in g0201_0300.s0204_count_primes

Solution - Class in g0201_0300.s0205_isomorphic_strings

Solution - Class in g0201_0300.s0206_reverse_linked_list

Solution - Class in g0201_0300.s0207_course_schedule

Solution - Class in g0201_0300.s0209_minimum_size_subarray_sum

Solution - Class in g0201_0300.s0210_course_schedule_ii

Solution - Class in g0201_0300.s0212_word_search_ii

Solution - Class in g0201_0300.s0213_house_robber_ii

Solution - Class in g0201_0300.s0214_shortest_palindrome

Solution - Class in g0201_0300.s0215_kth_largest_element_in_an_array

Solution - Class in g0201_0300.s0216_combination_sum_iii

Solution - Class in g0201_0300.s0217_contains_duplicate

Solution - Class in g0201_0300.s0218_the_skyline_problem

Solution - Class in g0201_0300.s0219_contains_duplicate_ii

Solution - Class in g0201_0300.s0220_contains_duplicate_iii

Solution - Class in g0201_0300.s0221_maximal_square

Solution - Class in g0201_0300.s0222_count_complete_tree_nodes

Solution - Class in g0201_0300.s0223_rectangle_area

Solution - Class in g0201_0300.s0224_basic_calculator

Solution - Class in g0201_0300.s0226_invert_binary_tree

Solution - Class in g0201_0300.s0227_basic_calculator_ii

Solution - Class in g0201_0300.s0228_summary_ranges

Solution - Class in g0201_0300.s0229_majority_element_ii

Solution - Class in g0201_0300.s0230_kth_smallest_element_in_a_bst

Solution - Class in g0201_0300.s0231_power_of_two

Solution - Class in g0201_0300.s0233_number_of_digit_one

Solution - Class in g0201_0300.s0234_palindrome_linked_list

Solution - Class in g0201_0300.s0240_search_a_2d_matrix_ii

Solution - Class in g0201_0300.s0241_different_ways_to_add_parentheses

Solution - Class in g0201_0300.s0242_valid_anagram

Solution - Class in g0201_0300.s0257_binary_tree_paths

Solution - Class in g0201_0300.s0258_add_digits

Solution - Class in g0201_0300.s0260_single_number_iii

Solution - Class in g0201_0300.s0263_ugly_number

Solution - Class in g0201_0300.s0264_ugly_number_ii

Solution - Class in g0201_0300.s0268_missing_number

Solution - Class in g0201_0300.s0273_integer_to_english_words

Solution - Class in g0201_0300.s0274_h_index

Solution - Class in g0201_0300.s0275_h_index_ii

Solution - Class in g0201_0300.s0278_first_bad_version

Solution - Class in g0201_0300.s0279_perfect_squares

Solution - Class in g0201_0300.s0282_expression_add_operators

Solution - Class in g0201_0300.s0283_move_zeroes

Solution - Class in g0201_0300.s0287_find_the_duplicate_number

Solution - Class in g0201_0300.s0289_game_of_life

Solution - Class in g0201_0300.s0290_word_pattern

Solution - Class in g0201_0300.s0292_nim_game

Solution - Class in g0201_0300.s0299_bulls_and_cows

Solution - Class in g0201_0300.s0300_longest_increasing_subsequence

Solution - Class in g0301_0400.s0330_patching_array

Solution - Class in g0301_0400.s0331_verify_preorder_serialization_of_a_binary_tree

Solution - Class in g0301_0400.s0332_reconstruct_itinerary

Solution - Class in g0301_0400.s0334_increasing_triplet_subsequence

Solution - Class in g0801_0900.s0864_shortest_path_to_get_all_keys

Solution() - Constructor for class g0001_0100.s0001_two_sum.Solution

Solution() - Constructor for class g0001_0100.s0002_add_two_numbers.Solution

Solution() - Constructor for class g0001_0100.s0003_longest_substring_without_repeating_characters.Solution

Solution() - Constructor for class g0001_0100.s0004_median_of_two_sorted_arrays.Solution

Solution() - Constructor for class g0001_0100.s0005_longest_palindromic_substring.Solution

Solution() - Constructor for class g0001_0100.s0006_zigzag_conversion.Solution

Solution() - Constructor for class g0001_0100.s0007_reverse_integer.Solution

Solution() - Constructor for class g0001_0100.s0008_string_to_integer_atoi.Solution

Solution() - Constructor for class g0001_0100.s0009_palindrome_number.Solution

Solution() - Constructor for class g0001_0100.s0010_regular_expression_matching.Solution

Solution() - Constructor for class g0001_0100.s0011_container_with_most_water.Solution

Solution() - Constructor for class g0001_0100.s0012_integer_to_roman.Solution

Solution() - Constructor for class g0001_0100.s0013_roman_to_integer.Solution

Solution() - Constructor for class g0001_0100.s0014_longest_common_prefix.Solution

Solution() - Constructor for class g0001_0100.s0015_three_sum.Solution

Solution() - Constructor for class g0001_0100.s0016_three_sum_closest.Solution

Solution() - Constructor for class g0001_0100.s0017_letter_combinations_of_a_phone_number.Solution

Solution() - Constructor for class g0001_0100.s0018_four_sum.Solution

Solution() - Constructor for class g0001_0100.s0019_remove_nth_node_from_end_of_list.Solution

Solution() - Constructor for class g0001_0100.s0020_valid_parentheses.Solution

Solution() - Constructor for class g0001_0100.s0021_merge_two_sorted_lists.Solution

Solution() - Constructor for class g0001_0100.s0022_generate_parentheses.Solution

Solution() - Constructor for class g0001_0100.s0023_merge_k_sorted_lists.Solution

Solution() - Constructor for class g0001_0100.s0024_swap_nodes_in_pairs.Solution

Solution() - Constructor for class g0001_0100.s0025_reverse_nodes_in_k_group.Solution

Solution() - Constructor for class g0001_0100.s0026_remove_duplicates_from_sorted_array.Solution

Solution() - Constructor for class g0001_0100.s0027_remove_element.Solution

Solution() - Constructor for class g0001_0100.s0028_implement_strstr.Solution

Solution() - Constructor for class g0001_0100.s0029_divide_two_integers.Solution

Solution() - Constructor for class g0001_0100.s0030_substring_with_concatenation_of_all_words.Solution

Solution() - Constructor for class g0001_0100.s0031_next_permutation.Solution

Solution() - Constructor for class g0001_0100.s0032_longest_valid_parentheses.Solution

Solution() - Constructor for class g0001_0100.s0033_search_in_rotated_sorted_array.Solution

Solution() - Constructor for class g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array.Solution

Solution() - Constructor for class g0001_0100.s0035_search_insert_position.Solution

Solution() - Constructor for class g0001_0100.s0036_valid_sudoku.Solution

Solution() - Constructor for class g0001_0100.s0037_sudoku_solver.Solution

Solution() - Constructor for class g0001_0100.s0038_count_and_say.Solution

Solution() - Constructor for class g0001_0100.s0039_combination_sum.Solution

Solution() - Constructor for class g0001_0100.s0040_combination_sum_ii.Solution

Solution() - Constructor for class g0001_0100.s0041_first_missing_positive.Solution

Solution() - Constructor for class g0001_0100.s0042_trapping_rain_water.Solution

Solution() - Constructor for class g0001_0100.s0043_multiple_strings.Solution

Solution() - Constructor for class g0001_0100.s0044_wildcard_matching.Solution

Solution() - Constructor for class g0001_0100.s0045_jump_game_ii.Solution

Solution() - Constructor for class g0001_0100.s0046_permutations.Solution

Solution() - Constructor for class g0001_0100.s0047_permutations_ii.Solution

Solution() - Constructor for class g0001_0100.s0048_rotate_image.Solution

Solution() - Constructor for class g0001_0100.s0049_group_anagrams.Solution

Solution() - Constructor for class g0001_0100.s0050_powx_n.Solution

Solution() - Constructor for class g0001_0100.s0051_n_queens.Solution

Solution() - Constructor for class g0001_0100.s0052_n_queens_ii.Solution

Solution() - Constructor for class g0001_0100.s0053_maximum_subarray.Solution

Solution() - Constructor for class g0001_0100.s0054_spiral_matrix.Solution

Solution() - Constructor for class g0001_0100.s0055_jump_game.Solution

Solution() - Constructor for class g0001_0100.s0056_merge_intervals.Solution

Solution() - Constructor for class g0001_0100.s0057_insert_interval.Solution

Solution() - Constructor for class g0001_0100.s0058_length_of_last_word.Solution

Solution() - Constructor for class g0001_0100.s0059_spiral_matrix_ii.Solution

Solution() - Constructor for class g0001_0100.s0060_permutation_sequence.Solution

Solution() - Constructor for class g0001_0100.s0061_rotate_list.Solution

Solution() - Constructor for class g0001_0100.s0062_unique_paths.Solution

Solution() - Constructor for class g0001_0100.s0063_unique_paths_ii.Solution

Solution() - Constructor for class g0001_0100.s0064_minimum_path_sum.Solution

Solution() - Constructor for class g0001_0100.s0065_valid_number.Solution

Solution() - Constructor for class g0001_0100.s0066_plus_one.Solution

Solution() - Constructor for class g0001_0100.s0067_add_binary.Solution

Solution() - Constructor for class g0001_0100.s0068_text_justification.Solution

Solution() - Constructor for class g0001_0100.s0069_sqrtx.Solution

Solution() - Constructor for class g0001_0100.s0070_climbing_stairs.Solution

Solution() - Constructor for class g0001_0100.s0071_simplify_path.Solution

Solution() - Constructor for class g0001_0100.s0072_edit_distance.Solution

Solution() - Constructor for class g0001_0100.s0073_set_matrix_zeroes.Solution

Solution() - Constructor for class g0001_0100.s0074_search_a_2d_matrix.Solution

Solution() - Constructor for class g0001_0100.s0075_sort_colors.Solution

Solution() - Constructor for class g0001_0100.s0076_minimum_window_substring.Solution

Solution() - Constructor for class g0001_0100.s0077_combinations.Solution

Solution() - Constructor for class g0001_0100.s0078_subsets.Solution

Solution() - Constructor for class g0001_0100.s0079_submissions.Solution

Solution() - Constructor for class g0001_0100.s0080_remove_duplicates_from_sorted_array_ii.Solution

Solution() - Constructor for class g0001_0100.s0081_search_in_rotated_sorted_array_ii.Solution

Solution() - Constructor for class g0001_0100.s0082_remove_duplicates_from_sorted_list_ii.Solution

Solution() - Constructor for class g0001_0100.s0083_remove_duplicates_from_sorted_list.Solution

Solution() - Constructor for class g0001_0100.s0084_largest_rectangle_in_histogram.Solution

Solution() - Constructor for class g0001_0100.s0085_maximal_rectangle.Solution

Solution() - Constructor for class g0001_0100.s0086_partition_list.Solution

Solution() - Constructor for class g0001_0100.s0087_scramble_string.Solution

Solution() - Constructor for class g0001_0100.s0088_merge_sorted_array.Solution

Solution() - Constructor for class g0001_0100.s0089_gray_code.Solution

Solution() - Constructor for class g0001_0100.s0090_subsets_ii.Solution

Solution() - Constructor for class g0001_0100.s0091_decode_ways.Solution

Solution() - Constructor for class g0001_0100.s0092_reverse_linked_list_ii.Solution

Solution() - Constructor for class g0001_0100.s0093_restore_ip_addresses.Solution

Solution() - Constructor for class g0001_0100.s0094_binary_tree_inorder_traversal.Solution

Solution() - Constructor for class g0001_0100.s0095_unique_binary_search_trees_ii.Solution

Solution() - Constructor for class g0001_0100.s0096_unique_binary_search_trees.Solution

Solution() - Constructor for class g0001_0100.s0097_interleaving_string.Solution

Solution() - Constructor for class g0001_0100.s0098_validate_binary_search_tree.Solution

Solution() - Constructor for class g0001_0100.s0099_recover_binary_search_tree.Solution

Solution() - Constructor for class g0001_0100.s0100_same_tree.Solution

Solution() - Constructor for class g0101_0200.s0101_symmetric_tree.Solution

Solution() - Constructor for class g0101_0200.s0102_binary_tree_level_order_traversal.Solution

Solution() - Constructor for class g0101_0200.s0103_binary_tree_zigzag_level_order_traversal.Solution

Solution() - Constructor for class g0101_0200.s0104_maximum_depth_of_binary_tree.Solution

Solution() - Constructor for class g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal.Solution

Solution() - Constructor for class g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal.Solution

Solution() - Constructor for class g0101_0200.s0107_binary_tree_level_order_traversal_ii.Solution

Solution() - Constructor for class g0101_0200.s0108_convert_sorted_array_to_binary_search_tree.Solution

Solution() - Constructor for class g0101_0200.s0109_convert_sorted_list_to_binary_search_tree.Solution

Solution() - Constructor for class g0101_0200.s0110_balanced_binary_tree.Solution

Solution() - Constructor for class g0101_0200.s0111_minimum_depth_of_binary_tree.Solution

Solution() - Constructor for class g0101_0200.s0112_path_sum.Solution

Solution() - Constructor for class g0101_0200.s0113_path_sum_ii.Solution

Solution() - Constructor for class g0101_0200.s0114_flatten_binary_tree_to_linked_list.Solution

Solution() - Constructor for class g0101_0200.s0115_distinct_subsequences.Solution

Solution() - Constructor for class g0101_0200.s0116_populating_next_right_pointers_in_each_node.Solution

Solution() - Constructor for class g0101_0200.s0117_populating_next_right_pointers_in_each_node_ii.Solution

Solution() - Constructor for class g0101_0200.s0118_pascals_triangle.Solution

Solution() - Constructor for class g0101_0200.s0119_pascals_triangle_ii.Solution

Solution() - Constructor for class g0101_0200.s0120_triangle.Solution

Solution() - Constructor for class g0101_0200.s0121_best_time_to_buy_and_sell_stock.Solution

Solution() - Constructor for class g0101_0200.s0122_best_time_to_buy_and_sell_stock_ii.Solution

Solution() - Constructor for class g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii.Solution

Solution() - Constructor for class g0101_0200.s0124_binary_tree_maximum_path_sum.Solution

Solution() - Constructor for class g0101_0200.s0125_valid_palindrome.Solution

Solution() - Constructor for class g0101_0200.s0126_word_ladder_ii.Solution

Solution() - Constructor for class g0101_0200.s0127_word_ladder.Solution

Solution() - Constructor for class g0101_0200.s0128_longest_consecutive_sequence.Solution

Solution() - Constructor for class g0101_0200.s0129_sum_root_to_leaf_numbers.Solution

Solution() - Constructor for class g0101_0200.s0130_surrounded_regions.Solution

Solution() - Constructor for class g0101_0200.s0131_palindrome_partitioning.Solution

Solution() - Constructor for class g0101_0200.s0132_palindrome_partitioning_ii.Solution

Solution() - Constructor for class g0101_0200.s0133_clone_graph.Solution

Solution() - Constructor for class g0101_0200.s0134_gas_station.Solution

Solution() - Constructor for class g0101_0200.s0135_candy.Solution

Solution() - Constructor for class g0101_0200.s0136_single_number.Solution

Solution() - Constructor for class g0101_0200.s0137_single_number_ii.Solution

Solution() - Constructor for class g0101_0200.s0138_copy_list_with_random_pointer.Solution

Solution() - Constructor for class g0101_0200.s0139_word_break.Solution

Solution() - Constructor for class g0101_0200.s0140_word_break_ii.Solution

Solution() - Constructor for class g0101_0200.s0141_linked_list_cycle.Solution

Solution() - Constructor for class g0101_0200.s0142_linked_list_cycle_ii.Solution

Solution() - Constructor for class g0101_0200.s0143_reorder_list.Solution

Solution() - Constructor for class g0101_0200.s0144_binary_tree_preorder_traversal.Solution

Solution() - Constructor for class g0101_0200.s0145_binary_tree_postorder_traversal.Solution

Solution() - Constructor for class g0101_0200.s0147_insertion_sort_list.Solution

Solution() - Constructor for class g0101_0200.s0148_sort_list.Solution

Solution() - Constructor for class g0101_0200.s0149_max_points_on_a_line.Solution

Solution() - Constructor for class g0101_0200.s0150_evaluate_reverse_polish_notation.Solution

Solution() - Constructor for class g0101_0200.s0151_reverse_words_in_a_string.Solution

Solution() - Constructor for class g0101_0200.s0152_maximum_product_subarray.Solution

Solution() - Constructor for class g0101_0200.s0153_find_minimum_in_rotated_sorted_array.Solution

Solution() - Constructor for class g0101_0200.s0154_find_minimum_in_rotated_sorted_array_ii.Solution

Solution() - Constructor for class g0101_0200.s0160_intersection_of_two_linked_lists.Solution

Solution() - Constructor for class g0101_0200.s0162_find_peak_element.Solution

Solution() - Constructor for class g0101_0200.s0164_maximum_gap.Solution

Solution() - Constructor for class g0101_0200.s0165_compare_version_numbers.Solution

Solution() - Constructor for class g0101_0200.s0166_fraction_to_recurring_decimal.Solution

Solution() - Constructor for class g0101_0200.s0167_two_sum_ii_input_array_is_sorted.Solution

Solution() - Constructor for class g0101_0200.s0168_excel_sheet_column_title.Solution

Solution() - Constructor for class g0101_0200.s0169_majority_element.Solution

Solution() - Constructor for class g0101_0200.s0171_excel_sheet_column_number.Solution

Solution() - Constructor for class g0101_0200.s0172_factorial_trailing_zeroes.Solution

Solution() - Constructor for class g0101_0200.s0174_dungeon_game.Solution

Solution() - Constructor for class g0101_0200.s0179_largest_number.Solution

Solution() - Constructor for class g0101_0200.s0187_repeated_dna_sequences.Solution

Solution() - Constructor for class g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv.Solution

Solution() - Constructor for class g0101_0200.s0189_rotate_array.Solution

Solution() - Constructor for class g0101_0200.s0190_reverse_bits.Solution

Solution() - Constructor for class g0101_0200.s0191_number_of_1_bits.Solution

Solution() - Constructor for class g0101_0200.s0198_house_robber.Solution

Solution() - Constructor for class g0101_0200.s0199_binary_tree_right_side_view.Solution

Solution() - Constructor for class g0101_0200.s0200_number_of_islands.Solution

Solution() - Constructor for class g0201_0300.s0201_bitwise_and_of_numbers_range.Solution

Solution() - Constructor for class g0201_0300.s0202_happy_number.Solution

Solution() - Constructor for class g0201_0300.s0203_remove_linked_list_elements.Solution

Solution() - Constructor for class g0201_0300.s0204_count_primes.Solution

Solution() - Constructor for class g0201_0300.s0205_isomorphic_strings.Solution

Solution() - Constructor for class g0201_0300.s0206_reverse_linked_list.Solution

Solution() - Constructor for class g0201_0300.s0207_course_schedule.Solution

Solution() - Constructor for class g0201_0300.s0209_minimum_size_subarray_sum.Solution

Solution() - Constructor for class g0201_0300.s0210_course_schedule_ii.Solution

Solution() - Constructor for class g0201_0300.s0212_word_search_ii.Solution

Solution() - Constructor for class g0201_0300.s0213_house_robber_ii.Solution

Solution() - Constructor for class g0201_0300.s0214_shortest_palindrome.Solution

Solution() - Constructor for class g0201_0300.s0215_kth_largest_element_in_an_array.Solution

Solution() - Constructor for class g0201_0300.s0216_combination_sum_iii.Solution

Solution() - Constructor for class g0201_0300.s0217_contains_duplicate.Solution

Solution() - Constructor for class g0201_0300.s0218_the_skyline_problem.Solution

Solution() - Constructor for class g0201_0300.s0219_contains_duplicate_ii.Solution

Solution() - Constructor for class g0201_0300.s0220_contains_duplicate_iii.Solution

Solution() - Constructor for class g0201_0300.s0221_maximal_square.Solution

Solution() - Constructor for class g0201_0300.s0222_count_complete_tree_nodes.Solution

Solution() - Constructor for class g0201_0300.s0223_rectangle_area.Solution

Solution() - Constructor for class g0201_0300.s0224_basic_calculator.Solution

Solution() - Constructor for class g0201_0300.s0226_invert_binary_tree.Solution

Solution() - Constructor for class g0201_0300.s0227_basic_calculator_ii.Solution

Solution() - Constructor for class g0201_0300.s0228_summary_ranges.Solution

Solution() - Constructor for class g0201_0300.s0229_majority_element_ii.Solution

Solution() - Constructor for class g0201_0300.s0230_kth_smallest_element_in_a_bst.Solution

Solution() - Constructor for class g0201_0300.s0231_power_of_two.Solution

Solution() - Constructor for class g0201_0300.s0233_number_of_digit_one.Solution

Solution() - Constructor for class g0201_0300.s0234_palindrome_linked_list.Solution

Solution() - Constructor for class g0201_0300.s0240_search_a_2d_matrix_ii.Solution

Solution() - Constructor for class g0201_0300.s0241_different_ways_to_add_parentheses.Solution

Solution() - Constructor for class g0201_0300.s0242_valid_anagram.Solution

Solution() - Constructor for class g0201_0300.s0257_binary_tree_paths.Solution

Solution() - Constructor for class g0201_0300.s0258_add_digits.Solution

Solution() - Constructor for class g0201_0300.s0260_single_number_iii.Solution

Solution() - Constructor for class g0201_0300.s0263_ugly_number.Solution

Solution() - Constructor for class g0201_0300.s0264_ugly_number_ii.Solution

Solution() - Constructor for class g0201_0300.s0268_missing_number.Solution

Solution() - Constructor for class g0201_0300.s0273_integer_to_english_words.Solution

Solution() - Constructor for class g0201_0300.s0274_h_index.Solution

Solution() - Constructor for class g0201_0300.s0275_h_index_ii.Solution

Solution() - Constructor for class g0201_0300.s0278_first_bad_version.Solution

Solution() - Constructor for class g0201_0300.s0279_perfect_squares.Solution

Solution() - Constructor for class g0201_0300.s0282_expression_add_operators.Solution

Solution() - Constructor for class g0201_0300.s0283_move_zeroes.Solution

Solution() - Constructor for class g0201_0300.s0287_find_the_duplicate_number.Solution

Solution() - Constructor for class g0201_0300.s0289_game_of_life.Solution

Solution() - Constructor for class g0201_0300.s0290_word_pattern.Solution

Solution() - Constructor for class g0201_0300.s0292_nim_game.Solution

Solution() - Constructor for class g0201_0300.s0299_bulls_and_cows.Solution

Solution() - Constructor for class g0201_0300.s0300_longest_increasing_subsequence.Solution

Solution() - Constructor for class g0301_0400.s0330_patching_array.Solution

Solution() - Constructor for class g0301_0400.s0331_verify_preorder_serialization_of_a_binary_tree.Solution

Solution() - Constructor for class g0301_0400.s0332_reconstruct_itinerary.Solution

Solution() - Constructor for class g0301_0400.s0334_increasing_triplet_subsequence.Solution

Solution() - Constructor for class g0801_0900.s0864_shortest_path_to_get_all_keys.Solution

solve(char[][]) - Method in class g0101_0200.s0130_surrounded_regions.Solution

solveNQueens(int) - Method in class g0001_0100.s0051_n_queens.Solution

solveSudoku(char[][]) - Method in class g0001_0100.s0037_sudoku_solver.Solution

sortColors(int[]) - Method in class g0001_0100.s0075_sort_colors.Solution

sortedArrayToBST(int[]) - Method in class g0101_0200.s0108_convert_sorted_array_to_binary_search_tree.Solution

sortedListToBST(ListNode) - Method in class g0101_0200.s0109_convert_sorted_list_to_binary_search_tree.Solution

sortList(ListNode) - Method in class g0101_0200.s0148_sort_list.Solution

spiralOrder(int[][]) - Method in class g0001_0100.s0054_spiral_matrix.Solution

startsWith(String) - Method in class g0201_0300.s0208_implement_trie_prefix_tree.Trie

strStr(String, String) - Method in class g0001_0100.s0028_implement_strstr.Solution

subsets(int[]) - Method in class g0001_0100.s0078_subsets.Solution

subsetsWithDup(int[]) - Method in class g0001_0100.s0090_subsets_ii.Solution

summaryRanges(int[]) - Method in class g0201_0300.s0228_summary_ranges.Solution

sumNumbers(TreeNode) - Method in class g0101_0200.s0129_sum_root_to_leaf_numbers.Solution

sumRange(int, int) - Method in class g0301_0400.s0307_range_sum_query_mutable.NumArray

swapPairs(ListNode) - Method in class g0001_0100.s0024_swap_nodes_in_pairs.Solution

T

threeSum(int[]) - Method in class g0001_0100.s0015_three_sum.Solution

threeSumClosest(int[], int) - Method in class g0001_0100.s0016_three_sum_closest.Solution

titleToNumber(String) - Method in class g0101_0200.s0171_excel_sheet_column_number.Solution

top() - Method in class g0101_0200.s0155_min_stack.MinStack

top() - Method in class g0201_0300.s0225_implement_stack_using_queues.MyStack

toString() - Method in class com_github_leetcode.left_right.Node

toString() - Method in class com_github_leetcode.ListNode

toString() - Method in class com_github_leetcode.Node

toString() - Method in class com_github_leetcode.random.Node

toString() - Method in class com_github_leetcode.TreeNode

totalNQueens(int) - Method in class g0001_0100.s0052_n_queens_ii.Solution

trailingZeroes(int) - Method in class g0101_0200.s0172_factorial_trailing_zeroes.Solution

trap(int[]) - Method in class g0001_0100.s0042_trapping_rain_water.Solution

Tree - Class in g0201_0300.s0212_word_search_ii

Tree() - Constructor for class g0201_0300.s0212_word_search_ii.Tree

TreeNode - Class in com_github_leetcode

TreeNode() - Constructor for class com_github_leetcode.TreeNode

TreeNode(int) - Constructor for class com_github_leetcode.TreeNode

TreeNode(int, TreeNode, TreeNode) - Constructor for class com_github_leetcode.TreeNode

Trie - Class in g0201_0300.s0208_implement_trie_prefix_tree

Trie() - Constructor for class g0201_0300.s0208_implement_trie_prefix_tree.Trie

TrieNode - Class in g0201_0300.s0208_implement_trie_prefix_tree

TrieNode() - Constructor for class g0201_0300.s0208_implement_trie_prefix_tree.TrieNode

twoSum(int[], int) - Method in class g0001_0100.s0001_two_sum.Solution

twoSum(int[], int) - Method in class g0101_0200.s0167_two_sum_ii_input_array_is_sorted.Solution

U

uniquePaths(int, int) - Method in class g0001_0100.s0062_unique_paths.Solution

uniquePathsWithObstacles(int[][]) - Method in class g0001_0100.s0063_unique_paths_ii.Solution

update(int, int) - Method in class g0301_0400.s0307_range_sum_query_mutable.NumArray

V

val - Variable in class com_github_leetcode.left_right.Node

val - Variable in class com_github_leetcode.ListNode

val - Variable in class com_github_leetcode.Node

val - Variable in class com_github_leetcode.random.Node

val - Variable in class com_github_leetcode.TreeNode

VersionControl - Class in g0201_0300.s0278_first_bad_version

VersionControl() - Constructor for class g0201_0300.s0278_first_bad_version.VersionControl

W

wordBreak(String, List<String>) - Method in class g0101_0200.s0139_word_break.Solution

wordBreak(String, List<String>) - Method in class g0101_0200.s0140_word_break_ii.Solution

WordDictionary - Class in g0201_0300.s0211_design_add_and_search_words_data_structure

WordDictionary() - Constructor for class g0201_0300.s0211_design_add_and_search_words_data_structure.WordDictionary

wordPattern(String, String) - Method in class g0201_0300.s0290_word_pattern.Solution

Z

zigzagLevelOrder(TreeNode) - Method in class g0101_0200.s0103_binary_tree_zigzag_level_order_traversal.Solution

A B C D E F G H I J K L M N P Q R S T U V W Z
All Classes and Interfaces|All Packages