A
B
C
D
E
F
G
H
I
J
K
L
M
N
O
P
Q
R
S
T
U
V
W
X
Z
I
- idealArrays(java.lang.Integer,java.lang.Integer) - function in g2301_2400.s2338_count_the_number_of_ideal_arrays.Solution
- imageSmoother(kotlin.Array) - function in g0601_0700.s0661_image_smoother.Solution
- inc(java.lang.String) - function in g0401_0500.s0432_all_oone_data_structure.AllOne
- increasingBST(com_github_leetcode.TreeNode) - function in g0801_0900.s0897_increasing_order_search_tree.Solution
- increasingTriplet(kotlin.IntArray) - function in g0301_0400.s0334_increasing_triplet_subsequence.Solution
- increment(java.lang.Integer,java.lang.Integer) - function in g1301_1400.s1381_design_a_stack_with_increment_operation.CustomStack
- incremovableSubarrayCount(kotlin.IntArray) - function in g2901_3000.s2970_count_the_number_of_incremovable_subarrays_i.Solution
- incremovableSubarrayCount(kotlin.IntArray) - function in g2901_3000.s2972_count_the_number_of_incremovable_subarrays_ii.Solution
- inorderTraversal(com_github_leetcode.TreeNode) - function in g0001_0100.s0094_binary_tree_inorder_traversal.Solution
- insert(kotlin.Array,kotlin.IntArray) - function in g0001_0100.s0057_insert_interval.Solution
- insert(java.lang.String) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie
- insert(java.lang.Integer) - function in g0301_0400.s0380_insert_delete_getrandom_o1.RandomizedSet
- insert(java.lang.Integer) - function in g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed.RandomizedCollection
- Inserts a value to the collection.
- insert(java.lang.String,java.lang.Integer) - function in g0601_0700.s0677_map_sum_pairs.MapSum
- insert(java.lang.Integer) - function in g0901_1000.s0919_complete_binary_tree_inserter.CBTInserter
- insert(java.lang.String) - function in g1001_1100.s1032_stream_of_characters.StreamChecker
- insert(java.lang.Integer,java.lang.String) - function in g1601_1700.s1656_design_an_ordered_stream.OrderedStream
- insertFront(java.lang.Integer) - function in g0601_0700.s0641_design_circular_deque.MyCircularDeque
- insertGreatestCommonDivisors(com_github_leetcode.ListNode) - function in g2801_2900.s2807_insert_greatest_common_divisors_in_linked_list.Solution
- insertIntoBST(com_github_leetcode.TreeNode,java.lang.Integer) - function in g0701_0800.s0701_insert_into_a_binary_search_tree.Solution
- insertIntoMaxTree(com_github_leetcode.TreeNode,java.lang.Integer) - function in g0901_1000.s0998_maximum_binary_tree_ii.Solution
- insertionSortList(com_github_leetcode.ListNode) - function in g0101_0200.s0147_insertion_sort_list.Solution
- insertLast(java.lang.Integer) - function in g0601_0700.s0641_design_circular_deque.MyCircularDeque
- integerBreak(java.lang.Integer) - function in g0301_0400.s0343_integer_break.Solution
- integerReplacement(java.lang.Integer) - function in g0301_0400.s0397_integer_replacement.Solution
- interchangeableRectangles(kotlin.Array) - function in g2001_2100.s2001_number_of_pairs_of_interchangeable_rectangles.Solution
- interpret(java.lang.String) - function in g1601_1700.s1678_goal_parser_interpretation.Solution
- intersect(kotlin.IntArray,kotlin.IntArray) - function in g0301_0400.s0350_intersection_of_two_arrays_ii.Solution
- intersect(g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node,g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node) - function in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Solution
- intersection(kotlin.IntArray,kotlin.IntArray) - function in g0301_0400.s0349_intersection_of_two_arrays.Solution
- intersection(kotlin.Array) - function in g2201_2300.s2248_intersection_of_multiple_arrays.Solution
- intersectionSizeTwo(kotlin.Array) - function in g0701_0800.s0757_set_intersection_size_at_least_two.Solution
- intervalIntersection(kotlin.Array,kotlin.Array) - function in g0901_1000.s0986_interval_list_intersections.Solution
- intToRoman(java.lang.Integer) - function in g0001_0100.s0012_integer_to_roman.Solution
- invalidTransactions(kotlin.Array) - function in g1101_1200.s1169_invalid_transactions.Solution
- invertTree(com_github_leetcode.TreeNode) - function in g0201_0300.s0226_invert_binary_tree.Solution
- isAcronym(java.util.List,java.lang.String) - function in g2801_2900.s2828_check_if_a_string_is_an_acronym_of_words.Solution
- isAdditiveNumber(java.lang.String) - function in g0301_0400.s0306_additive_number.Solution
- isAlienSorted(kotlin.Array,java.lang.String) - function in g0901_1000.s0953_verifying_an_alien_dictionary.Solution
- isAnagram(java.lang.String,java.lang.String) - function in g0201_0300.s0242_valid_anagram.Solution
- isArraySpecial(kotlin.IntArray) - function in g3101_3200.s3151_special_array_i.Solution
- isArraySpecial(kotlin.IntArray,kotlin.Array) - function in g3101_3200.s3152_special_array_ii.Solution
- isBadVersion(java.lang.Integer) - function in g0201_0300.s0278_first_bad_version.VersionControl
- isBadVersion(java.lang.Integer) - function in g0201_0300.s0278_first_bad_version.VersionControl
- isBalanced(com_github_leetcode.TreeNode) - function in g0101_0200.s0110_balanced_binary_tree.Solution
- isBalanced(java.lang.String) - function in g3301_3400.s3340_check_balanced_string.Solution
- isBipartite(kotlin.Array) - function in g0701_0800.s0785_is_graph_bipartite.Solution
- isBoomerang(kotlin.Array) - function in g1001_1100.s1037_valid_boomerang.Solution
- isCircularSentence(java.lang.String) - function in g2401_2500.s2490_circular_sentence.Solution
- isCompleteTree(com_github_leetcode.TreeNode) - function in g0901_1000.s0958_check_completeness_of_a_binary_tree.Solution
- isCousins(com_github_leetcode.TreeNode,java.lang.Integer,java.lang.Integer) - function in g0901_1000.s0993_cousins_in_binary_tree.Solution
- isCovered(kotlin.Array,java.lang.Integer,java.lang.Integer) - function in g1801_1900.s1893_check_if_all_the_integers_in_a_range_are_covered.Solution
- isEmpty() - function in g0601_0700.s0622_design_circular_queue.MyCircularQueue
- isEmpty() - function in g0601_0700.s0641_design_circular_deque.MyCircularDeque
- isEscapePossible(kotlin.Array,kotlin.IntArray,kotlin.IntArray) - function in g1001_1100.s1036_escape_a_large_maze.Solution
- isEvenOddTree(com_github_leetcode.TreeNode) - function in g1601_1700.s1609_even_odd_tree.Solution
- isFascinating(java.lang.Integer) - function in g2701_2800.s2729_check_if_the_number_is_fascinating.Solution
- isFull() - function in g0601_0700.s0622_design_circular_queue.MyCircularQueue
- isFull() - function in g0601_0700.s0641_design_circular_deque.MyCircularDeque
- isGood(kotlin.IntArray) - function in g2701_2800.s2784_check_if_array_is_good.Solution
- isGoodArray(kotlin.IntArray) - function in g1201_1300.s1250_check_if_it_is_a_good_array.Solution
- isHappy(java.lang.Integer) - function in g0201_0300.s0202_happy_number.Solution
- isIdealPermutation(kotlin.IntArray) - function in g0701_0800.s0775_global_and_local_inversions.Solution
- isInteger() - function in com_github_leetcode.NestedInteger
- isInterleave(java.lang.String,java.lang.String,java.lang.String) - function in g0001_0100.s0097_interleaving_string.Solution
- isInterleave(java.lang.String,java.lang.String,java.lang.String,java.lang.Integer,java.lang.Integer,java.lang.Integer,kotlin.Array) - function in g0001_0100.s0097_interleaving_string.Solution
- isIsomorphic(java.lang.String,java.lang.String) - function in g0201_0300.s0205_isomorphic_strings.Solution
- isItPossible(java.lang.String,java.lang.String) - function in g2501_2600.s2531_make_number_of_distinct_characters_equal.Solution
- islandPerimeter(kotlin.Array) - function in g0401_0500.s0463_island_perimeter.Solution
- isLeaf() - function in g0401_0500.s0427_construct_quad_tree.Node
- isLeaf() - function in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node
- isLongPressedName(java.lang.String,java.lang.String) - function in g0901_1000.s0925_long_pressed_name.Solution
- isMatch(java.lang.String,java.lang.String) - function in g0001_0100.s0010_regular_expression_matching.Solution
- isMatch(java.lang.String,java.lang.String) - function in g0001_0100.s0044_wildcard_matching.Solution
- isMonotonic(kotlin.IntArray) - function in g0801_0900.s0896_monotonic_array.Solution
- isNStraightHand(kotlin.IntArray,java.lang.Integer) - function in g0801_0900.s0846_hand_of_straights.Solution
- isNumber(java.lang.String) - function in g0001_0100.s0065_valid_number.Solution
- isOneBitCharacter(kotlin.IntArray) - function in g0701_0800.s0717_1_bit_and_2_bit_characters.Solution
- isPalindrome(java.lang.Integer) - function in g0001_0100.s0009_palindrome_number.Solution
- isPalindrome(java.lang.String) - function in g0101_0200.s0125_valid_palindrome.Solution
- isPalindrome(com_github_leetcode.ListNode) - function in g0201_0300.s0234_palindrome_linked_list.Solution
- isPalindrome(java.lang.String) - function in g2101_2200.s2108_find_first_palindromic_string_in_the_array.Solution.Companion
- isPathCrossing(java.lang.String) - function in g1401_1500.s1496_path_crossing.Solution
- isPerfectSquare(java.lang.Integer) - function in g0301_0400.s0367_valid_perfect_square.Solution
- isPossible(kotlin.IntArray) - function in g0601_0700.s0659_split_array_into_consecutive_subsequences.Solution
- isPossible(kotlin.IntArray) - function in g1301_1400.s1354_construct_target_array_with_multiple_sums.Solution
- isPossible(java.lang.Integer,java.util.List) - function in g2501_2600.s2508_add_edges_to_make_degrees_of_all_nodes_even.Solution
- isPossibleDivide(kotlin.IntArray,java.lang.Integer) - function in g1201_1300.s1296_divide_array_in_sets_of_k_consecutive_numbers.Solution
- isPossibleToCutPath(kotlin.Array) - function in g2501_2600.s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip.Solution
- isPossibleToRearrange(java.lang.String,java.lang.String,java.lang.Integer) - function in g3301_3400.s3365_rearrange_k_substrings_to_form_target_string.Solution
- isPossibleToSplit(kotlin.IntArray) - function in g3001_3100.s3046_split_the_array.Solution
- isPowerOfFour(java.lang.Integer) - function in g0301_0400.s0342_power_of_four.Solution
- isPowerOfThree(java.lang.Integer) - function in g0301_0400.s0326_power_of_three.Solution
- isPowerOfTwo(java.lang.Integer) - function in g0201_0300.s0231_power_of_two.Solution
- isPrefixOfWord(java.lang.String,java.lang.String) - function in g1401_1500.s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence.Solution
- isPrefixString(java.lang.String,kotlin.Array) - function in g1901_2000.s1961_check_if_string_is_a_prefix_of_array.Solution
- isPrintable(kotlin.Array) - function in g1501_1600.s1591_strange_printer_ii.Solution
- isRationalEqual(java.lang.String,java.lang.String) - function in g0901_1000.s0972_equal_rational_numbers.Solution
- isReachable(java.lang.Integer,java.lang.Integer) - function in g2501_2600.s2543_check_if_point_is_reachable.Solution
- isReachableAtTime(java.lang.Integer,java.lang.Integer,java.lang.Integer,java.lang.Integer,java.lang.Integer) - function in g2801_2900.s2849_determine_if_a_cell_is_reachable_at_a_given_time.Solution
- isRectangleCover(kotlin.Array) - function in g0301_0400.s0391_perfect_rectangle.Solution
- isRectangleOverlap(kotlin.IntArray,kotlin.IntArray) - function in g0801_0900.s0836_rectangle_overlap.Solution
- isRobotBounded(java.lang.String) - function in g1001_1100.s1041_robot_bounded_in_circle.Solution
- isSameAfterReversals(java.lang.Integer) - function in g2101_2200.s2119_a_number_after_a_double_reversal.Solution
- isSameTree(com_github_leetcode.TreeNode,com_github_leetcode.TreeNode) - function in g0001_0100.s0100_same_tree.Solution
- isScramble(java.lang.String,java.lang.String) - function in g0001_0100.s0087_scramble_string.Solution
- isSelfCrossing(kotlin.IntArray) - function in g0301_0400.s0335_self_crossing.Solution
- isSolvable(kotlin.Array,java.lang.String) - function in g1301_1400.s1307_verbal_arithmetic_puzzle.Solution
- isStrictlyPalindromic(java.lang.Integer) - function in g2301_2400.s2396_strictly_palindromic_number.Solution
- isSubPath(com_github_leetcode.ListNode,com_github_leetcode.TreeNode) - function in g1301_1400.s1367_linked_list_in_binary_tree.Solution
- isSubsequence(java.lang.String,java.lang.String) - function in g0301_0400.s0392_is_subsequence.Solution
- isSubstringPresent(java.lang.String) - function in g3001_3100.s3083_existence_of_a_substring_in_a_string_and_its_reverse.Solution
- isSubtree(com_github_leetcode.TreeNode,com_github_leetcode.TreeNode) - function in g0501_0600.s0572_subtree_of_another_tree.Solution
- isSumEqual(java.lang.String,java.lang.String,java.lang.String) - function in g1801_1900.s1880_check_if_word_equals_summation_of_two_words.Solution
- isSymmetric(com_github_leetcode.TreeNode) - function in g0101_0200.s0101_symmetric_tree.Solution
- isThree(java.lang.Integer) - function in g1901_2000.s1952_three_divisors.Solution
- isToeplitzMatrix(kotlin.Array) - function in g0701_0800.s0766_toeplitz_matrix.Solution
- isTransformable(java.lang.String,java.lang.String) - function in g1501_1600.s1585_check_if_string_is_transformable_with_substring_sort_operations.Solution
- isUgly(java.lang.Integer) - function in g0201_0300.s0263_ugly_number.Solution
- isUnivalTree(com_github_leetcode.TreeNode) - function in g0901_1000.s0965_univalued_binary_tree.Solution
- isValid(java.lang.String) - function in g0001_0100.s0020_valid_parentheses.Solution
- isValid(java.lang.String) - function in g0501_0600.s0591_tag_validator.Solution
- isValid(java.lang.String) - function in g1001_1100.s1003_check_if_word_is_valid_after_substitutions.Solution
- isValid(java.lang.String) - function in g3101_3200.s3136_valid_word.Solution
- isValidBST(com_github_leetcode.TreeNode) - function in g0001_0100.s0098_validate_binary_search_tree.Solution
- isValidBST(com_github_leetcode.TreeNode,com_github_leetcode.TreeNode,com_github_leetcode.TreeNode,java.util.Map) - function in g1901_2000.s1932_merge_bsts_to_create_single_bst.Solution
- isValidSerialization(java.lang.String) - function in g0301_0400.s0331_verify_preorder_serialization_of_a_binary_tree.Solution
- isValidSudoku(kotlin.Array) - function in g0001_0100.s0036_valid_sudoku.Solution
- isWinner(kotlin.IntArray,kotlin.IntArray) - function in g2601_2700.s2660_determine_the_winner_of_a_bowling_game.Solution
- isWord() - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie.TrieNode
- isWord() - function in g0201_0300.s0211_design_add_and_search_words_data_structure.WordDictionary.TrieNode
- isZeroArray(kotlin.IntArray,kotlin.Array) - function in g3301_3400.s3355_zero_array_transformation_i.Solution