A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  R  S  T  U  W  Z 

S

search(IntArray,Integer) - function in g0001_0100.s0033_search_in_rotated_sorted_array.Solution

 

search(IntArray,Integer) - function in g0001_0100.s0081_search_in_rotated_sorted_array_ii.Solution

 

search(String,Trie.TrieNode,Integer) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie

 

search(String,Trie.TrieNode) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie

 

search(String) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie

 

searchInsert(IntArray,Integer) - function in g0001_0100.s0035_search_insert_position.Solution

 

searchMatrix(Array,Integer) - function in g0001_0100.s0074_search_a_2d_matrix.Solution

 

searchMatrix(Array,Integer) - function in g0201_0300.s0240_search_a_2d_matrix_ii.Solution

 

searchRange(IntArray,Integer) - function in g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array.Solution

 

setAllComb(List) - function in g0001_0100.s0090_subsets_ii.Solution

 

setCacheCapacity(Integer) - function in g0101_0200.s0146_lru_cache.LRUCache

 

setChildren(Array) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie.TrieNode

 

setComb(List) - function in g0001_0100.s0090_subsets_ii.Solution

 

setIsWord(Boolean) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie.TrieNode

 

setKey(Integer) - function in g0101_0200.s0146_lru_cache.LRUCache.Node

 

setLeft(TreeNode) - function in com_github_leetcode.TreeNode

 

setNext(ListNode) - function in com_github_leetcode.ListNode

 

setNext(Node) - function in com_github_leetcode.Node

 

setNext(LRUCache.Node) - function in g0101_0200.s0146_lru_cache.LRUCache.Node

 

setNums(IntArray) - function in g0001_0100.s0090_subsets_ii.Solution

 

setPrev(LRUCache.Node) - function in g0101_0200.s0146_lru_cache.LRUCache.Node

 

setRandom(Node) - function in com_github_leetcode.Node

 

setRight(TreeNode) - function in com_github_leetcode.TreeNode

 

setVal(Integer) - function in com_github_leetcode.ListNode

 

setVal(Integer) - function in com_github_leetcode.Node

 

setVal(Integer) - function in com_github_leetcode.TreeNode

 

setValue(Integer) - function in g0101_0200.s0146_lru_cache.LRUCache.Node

 

setZeroes(Array) - function in g0001_0100.s0073_set_matrix_zeroes.Solution

 

shortestPathAllKeys(Array) - function in g0801_0900.s0864_shortest_path_to_get_all_keys.Solution

 

simplifyPath(String) - function in g0001_0100.s0071_simplify_path.Solution

 

singleNumber(IntArray) - function in g0101_0200.s0136_single_number.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_3sum

 

Solution - class in g0001_0100.s0016_3sum_closest

 

Solution - class in g0001_0100.s0017_letter_combinations_of_a_phone_number

 

Solution - class in g0001_0100.s0018_4sum

 

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_multiply_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_word_search

 

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

Example: var ti = TreeNode(5) var v = ti.

Solution - class in g0101_0200.s0107_binary_tree_level_order_traversal_ii

Example: var ti = TreeNode(5) var v = ti.

Solution - class in g0101_0200.s0108_convert_sorted_array_to_binary_search_tree

Example: var ti = TreeNode(5) var v = ti.

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.s0121_best_time_to_buy_and_sell_stock

 

Solution - class in g0101_0200.s0124_binary_tree_maximum_path_sum

 

Solution - class in g0101_0200.s0128_longest_consecutive_sequence

 

Solution - class in g0101_0200.s0131_palindrome_partitioning

 

Solution - class in g0101_0200.s0136_single_number

 

Solution - class in g0101_0200.s0138_copy_list_with_random_pointer

 

Solution - class in g0101_0200.s0139_word_break

 

Solution - class in g0101_0200.s0141_linked_list_cycle

 

Solution - class in g0101_0200.s0142_linked_list_cycle_ii

 

Solution - class in g0101_0200.s0148_sort_list

 

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.s0160_intersection_of_two_linked_lists

 

Solution - class in g0101_0200.s0169_majority_element

 

Solution - class in g0101_0200.s0189_rotate_array

 

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.s0206_reverse_linked_list

 

Solution - class in g0201_0300.s0207_course_schedule

 

Solution - class in g0201_0300.s0215_kth_largest_element_in_an_array

 

Solution - class in g0201_0300.s0221_maximal_square

 

Solution - class in g0201_0300.s0226_invert_binary_tree

 

Solution - class in g0201_0300.s0230_kth_smallest_element_in_a_bst

 

Solution - class in g0201_0300.s0234_palindrome_linked_list

 

Solution - class in g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree

 

Solution - class in g0201_0300.s0238_product_of_array_except_self

 

Solution - class in g0201_0300.s0239_sliding_window_maximum

 

Solution - class in g0201_0300.s0240_search_a_2d_matrix_ii

 

Solution - class in g0201_0300.s0283_move_zeroes

 

Solution - class in g0201_0300.s0287_find_the_duplicate_number

 

Solution - class in g0201_0300.s0300_longest_increasing_subsequence

 

Solution - class in g0301_0400.s0322_coin_change

 

Solution - class in g0301_0400.s0338_counting_bits

 

Solution - class in g0301_0400.s0347_top_k_frequent_elements

 

Solution - class in g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix

 

Solution - class in g0301_0400.s0394_decode_string

 

Solution - class in g0401_0500.s0416_partition_equal_subset_sum

 

Solution - class in g0401_0500.s0437_path_sum_iii

 

Solution - class in g0401_0500.s0438_find_all_anagrams_in_a_string

 

Solution - class in g0401_0500.s0494_target_sum

 

Solution - class in g0501_0600.s0543_diameter_of_binary_tree

 

Solution - class in g0501_0600.s0560_subarray_sum_equals_k

 

Solution - class in g0601_0700.s0647_palindromic_substrings

 

Solution - class in g0701_0800.s0739_daily_temperatures

 

Solution - class in g0701_0800.s0763_partition_labels

 

Solution - class in g0801_0900.s0864_shortest_path_to_get_all_keys

 

Solution - class in g0901_1000.s0994_rotting_oranges

 

Solution - class in g1101_1200.s1143_longest_common_subsequence

 

Solution.Companion - class in g0201_0300.s0207_course_schedule.Solution

 

solveNQueens(Integer) - function in g0001_0100.s0051_n_queens.Solution

 

solveSudoku(Array) - function in g0001_0100.s0037_sudoku_solver.Solution

 

sortColors(IntArray) - function in g0001_0100.s0075_sort_colors.Solution

 

sortedArrayToBST(IntArray) - function in g0101_0200.s0108_convert_sorted_array_to_binary_search_tree.Solution

 

sortedListToBST(ListNode) - function in g0101_0200.s0109_convert_sorted_list_to_binary_search_tree.Solution

 

sortList(ListNode) - function in g0101_0200.s0148_sort_list.Solution

 

spiralOrder(Array) - function in g0001_0100.s0054_spiral_matrix.Solution

 

startsWith(String) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie

 

step(String,Integer,IntArray,Integer,List) - function in g0001_0100.s0093_restore_ip_addresses.Solution

 

strStr(String,String) - function in g0001_0100.s0028_implement_strstr.Solution

 

subarraySum(IntArray,Integer) - function in g0501_0600.s0560_subarray_sum_equals_k.Solution

 

subsets(IntArray) - function in g0001_0100.s0078_subsets.Solution

 

subsetsWithDup(IntArray) - function in g0001_0100.s0090_subsets_ii.Solution

 

swapPairs(ListNode) - function in g0001_0100.s0024_swap_nodes_in_pairs.Solution

 

A  B  C  D  E  F  G  H  I  J  K  L  M  N  O  P  R  S  T  U  W  Z