Index

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
All Classes and Interfaces|All Packages|Constant Field Values

A

abbreviateProduct(int, int) - Method in class g2101_2200.s2117_abbreviating_the_product_of_a_range.Solution

accountBalanceAfterPurchase(int) - Method in class g2801_2900.s2806_account_balance_after_rounded_purchase.Solution

accountsMerge(List<List<String>>) - Method in class g0701_0800.s0721_accounts_merge.Solution

add(int) - Method in class g0701_0800.s0703_kth_largest_element_in_a_stream.KthLargest

add(int) - Method in class g0701_0800.s0705_design_hashset.MyHashSet

add(int) - Method in class g1201_1300.s1206_design_skiplist.Skiplist

add(int) - Method in class g1301_1400.s1352_product_of_the_last_k_numbers.ProductOfNumbers

add(int) - Method in class g2601_2700.s2671_frequency_tracker.FrequencyTracker

add(int[]) - Method in class g2001_2100.s2013_detect_squares.DetectSquares

add(int, int) - Method in class g1801_1900.s1865_finding_pairs_with_a_certain_sum.FindSumPairs

add(int, int) - Method in class g2201_2300.s2276_count_integers_in_intervals.CountIntervals

add(NestedInteger) - Method in class com_github_leetcode.NestedInteger

add(String, int) - Method in class g2101_2200.s2102_sequentially_ordinal_rank_tracker.SORTracker

addAll(int) - Method in class g1601_1700.s1622_fancy_sequence.Fancy

addAtHead(int) - Method in class g0701_0800.s0707_design_linked_list.MyLinkedList

addAtIndex(int, int) - Method in class g0701_0800.s0707_design_linked_list.MyLinkedList

addAtTail(int) - Method in class g0701_0800.s0707_design_linked_list.MyLinkedList

addBack(int) - Method in class g2301_2400.s2336_smallest_number_in_infinite_set.SmallestInfiniteSet

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

addCar(int) - Method in class g1601_1700.s1603_design_parking_system.ParkingSystem

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

addEdge(int[]) - Method in class g2601_2700.s2642_design_graph_with_shortest_path_calculator.Graph

addElement(int) - Method in class g1801_1900.s1825_finding_mk_average.MKAverage

addMinimum(String) - Method in class g2601_2700.s2645_minimum_additions_to_make_valid_string.Solution

addNegabinary(int[], int[]) - Method in class g1001_1100.s1073_adding_two_negabinary_numbers.Solution

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

addNum(int) - Method in class g0301_0400.s0352_data_stream_as_disjoint_intervals.SummaryRanges

addOneRow(TreeNode, int, int) - Method in class g0601_0700.s0623_add_one_row_to_tree.Solution

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

addRange(int, int) - Method in class g0701_0800.s0715_range_module.RangeModule

addRungs(int[], int) - Method in class g1901_2000.s1936_add_minimum_number_of_rungs.Solution

addSpaces(String, int[]) - Method in class g2101_2200.s2109_adding_spaces_to_a_string.Solution

addStrings(String, String) - Method in class g0401_0500.s0415_add_strings.Solution

addText(String) - Method in class g2201_2300.s2296_design_a_text_editor.TextEditor

addToArrayForm(int[], int) - Method in class g0901_1000.s0989_add_to_array_form_of_integer.Solution

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

addTwoNumbers(ListNode, ListNode) - Method in class g0401_0500.s0445_add_two_numbers_ii.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

advantageCount(int[], int[]) - Method in class g0801_0900.s0870_advantage_shuffle.Solution

alertNames(String[], String[]) - Method in class g1601_1700.s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period.Solution

all() - Method in class g2101_2200.s2166_design_bitset.Bitset

allCellsDistOrder(int, int, int, int) - Method in class g1001_1100.s1030_matrix_cells_in_distance_order.Solution

allocate(int, int) - Method in class g2501_2600.s2502_design_memory_allocator.Allocator

Allocator - Class in g2501_2600.s2502_design_memory_allocator

2502 - Design Memory Allocator.

Allocator(int) - Constructor for class g2501_2600.s2502_design_memory_allocator.Allocator

AllOne - Class in g0401_0500.s0432_all_oone_data_structure

432 - All O`one Data Structure.

AllOne() - Constructor for class g0401_0500.s0432_all_oone_data_structure.AllOne

allPathsSourceTarget(int[][]) - Method in class g0701_0800.s0797_all_paths_from_source_to_target.Solution

alphabetBoardPath(String) - Method in class g1101_1200.s1138_alphabet_board_path.Solution

alternateDigitSum(int) - Method in class g2501_2600.s2544_alternating_digit_sum.Solution

alternatingSubarray(int[]) - Method in class g2701_2800.s2765_longest_alternating_subarray.Solution

ambiguousCoordinates(String) - Method in class g0801_0900.s0816_ambiguous_coordinates.Solution

amountOfTime(TreeNode, int) - Method in class g2301_2400.s2385_amount_of_time_for_binary_tree_to_be_infected.Solution

angleClock(int, int) - Method in class g1301_1400.s1344_angle_between_hands_of_a_clock.Solution

answerQueries(int[], int[]) - Method in class g2301_2400.s2389_longest_subsequence_with_limited_sum.Solution

appealSum(String) - Method in class g2201_2300.s2262_total_appeal_of_a_string.Solution

append(int) - Method in class g1601_1700.s1622_fancy_sequence.Fancy

appendCharacters(String, String) - Method in class g2401_2500.s2486_append_characters_to_string_to_make_subsequence.Solution

applyOperations(int[]) - Method in class g2401_2500.s2460_apply_operations_to_an_array.Solution

areAlmostEqual(String, String) - Method in class g1701_1800.s1790_check_if_one_string_swap_can_make_strings_equal.Solution

areaOfMaxDiagonal(int[][]) - Method in class g2901_3000.s3000_maximum_area_of_longest_diagonal_rectangle.Solution

areConnected(int, int, int[][]) - Method in class g1601_1700.s1627_graph_connectivity_with_threshold.Solution

areNumbersAscending(String) - Method in class g2001_2100.s2042_check_if_numbers_are_ascending_in_a_sentence.Solution

areOccurrencesEqual(String) - Method in class g1901_2000.s1941_check_if_all_characters_have_equal_number_of_occurrences.Solution

areSentencesSimilar(String, String) - Method in class g1801_1900.s1813_sentence_similarity_iii.Solution

areSimilar(int[][], int) - Method in class g2901_3000.s2946_matrix_similarity_after_cyclic_shifts.Solution

arithmeticTriplets(int[], int) - Method in class g2301_2400.s2367_number_of_arithmetic_triplets.Solution

arrangeCoins(int) - Method in class g0401_0500.s0441_arranging_coins.Solution

arrangeWords(String) - Method in class g1401_1500.s1451_rearrange_words_in_a_sentence.Solution

arrayChange(int[], int[][]) - Method in class g2201_2300.s2295_replace_elements_in_an_array.Solution

arrayNesting(int[]) - Method in class g0501_0600.s0565_array_nesting.Solution

arrayPairSum(int[]) - Method in class g0501_0600.s0561_array_partition_i.Solution

arrayRankTransform(int[]) - Method in class g1301_1400.s1331_rank_transform_of_an_array.Solution

arraySign(int[]) - Method in class g1801_1900.s1822_sign_of_the_product_of_an_array.Solution

arrayStringsAreEqual(String[], String[]) - Method in class g1601_1700.s1662_check_if_two_string_arrays_are_equivalent.Solution

assignTasks(int[], int[]) - Method in class g1801_1900.s1882_process_tasks_using_servers.Solution

asteroidCollision(int[]) - Method in class g0701_0800.s0735_asteroid_collision.Solution

asteroidsDestroyed(int, int[]) - Method in class g2101_2200.s2126_destroying_asteroids.Solution

ATM - Class in g2201_2300.s2241_design_an_atm_machine

2241 - Design an ATM Machine.

ATM() - Constructor for class g2201_2300.s2241_design_an_atm_machine.ATM

atMostNGivenDigitSet(String[], int) - Method in class g0901_1000.s0902_numbers_at_most_n_given_digit_set.Solution

AuthenticationManager - Class in g1701_1800.s1797_design_authentication_manager

1797 - Design Authentication Manager.

AuthenticationManager(int) - Constructor for class g1701_1800.s1797_design_authentication_manager.AuthenticationManager

average(int[]) - Method in class g1401_1500.s1491_average_salary_excluding_the_minimum_and_maximum_salary.Solution

averageOfLevels(TreeNode) - Method in class g0601_0700.s0637_average_of_levels_in_binary_tree.Solution

averageOfSubtree(TreeNode) - Method in class g2201_2300.s2265_count_nodes_equal_to_average_of_subtree.Solution

averageValue(int[]) - Method in class g2401_2500.s2455_average_value_of_even_numbers_that_are_divisible_by_three.Solution

averageWaitingTime(int[][]) - Method in class g1701_1800.s1701_average_waiting_time.Solution

avoidFlood(int[]) - Method in class g1401_1500.s1488_avoid_flood_in_the_city.Solution

B

back(int) - Method in class g1401_1500.s1472_design_browser_history.BrowserHistory

backspaceCompare(String, String) - Method in class g0801_0900.s0844_backspace_string_compare.Solution

bagOfTokensScore(int[], int) - Method in class g0901_1000.s0948_bag_of_tokens.Solution

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

balanceBST(TreeNode) - Method in class g1301_1400.s1382_balance_a_binary_search_tree.Solution

balancedString(String) - Method in class g1201_1300.s1234_replace_the_substring_for_balanced_string.Solution

balancedStringSplit(String) - Method in class g1201_1300.s1221_split_a_string_in_balanced_strings.Solution

Bank - Class in g2001_2100.s2043_simple_bank_system

2043 - Simple Bank System.

Bank(long[]) - Constructor for class g2001_2100.s2043_simple_bank_system.Bank

bar(Runnable) - Method in class g1101_1200.s1115_print_foobar_alternately.FooBar

baseNeg2(int) - Method in class g1001_1100.s1017_convert_to_base_2.Solution

basicCalculatorIV(String, String[], int[]) - Method in class g0701_0800.s0770_basic_calculator_iv.Solution

beautifulArray(int) - Method in class g0901_1000.s0932_beautiful_array.Solution

beautifulIndices(String, String, String, int) - Method in class g3001_3100.s3006_find_beautiful_indices_in_the_given_array_i.Solution

beautifulIndices(String, String, String, int) - Method in class g3001_3100.s3008_find_beautiful_indices_in_the_given_array_ii.Solution

beautifulPartitions(String, int, int) - Method in class g2401_2500.s2478_number_of_beautiful_partitions.Solution

beautifulSubarrays(int[]) - Method in class g2501_2600.s2588_count_the_number_of_beautiful_subarrays.Solution

beautifulSubsets(int[], int) - Method in class g2501_2600.s2597_the_number_of_beautiful_subsets.Solution

beautifulSubstrings(String, int) - Method in class g2901_3000.s2947_count_beautiful_substrings_i.Solution

beautifulSubstrings(String, int) - Method in class g2901_3000.s2949_count_beautiful_substrings_ii.Solution

beautySum(String) - Method in class g1701_1800.s1781_sum_of_beauty_of_all_substrings.Solution

bestClosingTime(String) - Method in class g2401_2500.s2483_minimum_penalty_for_a_shop.Solution

bestCoordinate(int[][], int) - Method in class g1601_1700.s1620_coordinate_with_maximum_network_quality.Solution

bestHand(int[], char[]) - Method in class g2301_2400.s2347_best_poker_hand.Solution

bestRotation(int[]) - Method in class g0701_0800.s0798_smallest_rotation_with_highest_score.Solution

bestTeamScore(int[], int[]) - Method in class g1601_1700.s1626_best_team_with_no_conflicts.Solution

bfs(int[][], int) - Method in class g0701_0800.s0778_swim_in_rising_water.Solution

binaryGap(int) - Method in class g0801_0900.s0868_binary_gap.Solution

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

birth(String, String) - Method in class g1501_1600.s1600_throne_inheritance.ThroneInheritance

Bitset - Class in g2101_2200.s2166_design_bitset

2166 - Design Bitset.

Bitset(int) - Constructor for class g2101_2200.s2166_design_bitset.Bitset

bitwiseComplement(int) - Method in class g1001_1100.s1009_complement_of_base_10_integer.Solution

book(int, int) - Method in class g0701_0800.s0729_my_calendar_i.MyCalendar

book(int, int) - Method in class g0701_0800.s0731_my_calendar_ii.MyCalendarTwo

book(int, int) - Method in class g0701_0800.s0732_my_calendar_iii.MyCalendarThree

BookMyShow - Class in g2201_2300.s2286_booking_concert_tickets_in_groups

2286 - Booking Concert Tickets in Groups.

BookMyShow(int, int) - Constructor for class g2201_2300.s2286_booking_concert_tickets_in_groups.BookMyShow

bottomLeft - Variable in class g0401_0500.s0427_construct_quad_tree.Node

bottomLeft - Variable in class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

bottomRight - Variable in class g0401_0500.s0427_construct_quad_tree.Node

bottomRight - Variable in class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

boxDelivering(int[][], int, int, int) - Method in class g1601_1700.s1687_delivering_boxes_from_storage_to_ports.Solution

braceExpansionII(String) - Method in class g1001_1100.s1096_brace_expansion_ii.Solution

breakPalindrome(String) - Method in class g1301_1400.s1328_break_a_palindrome.Solution

brokenCalc(int, int) - Method in class g0901_1000.s0991_broken_calculator.Solution

BrowserHistory - Class in g1401_1500.s1472_design_browser_history

1472 - Design Browser History.

BrowserHistory(String) - Constructor for class g1401_1500.s1472_design_browser_history.BrowserHistory

bstFromPreorder(int[]) - Method in class g1001_1100.s1008_construct_binary_search_tree_from_preorder_traversal.Solution

BSTIterator - Class in g0101_0200.s0173_binary_search_tree_iterator

173 - Binary Search Tree Iterator.

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

bstToGst(TreeNode) - Method in class g1001_1100.s1038_binary_search_tree_to_greater_sum_tree.Solution

btreeGameWinningMove(TreeNode, int, int) - Method in class g1101_1200.s1145_binary_tree_coloring_game.Solution

buddyStrings(String, String) - Method in class g0801_0900.s0859_buddy_strings.Solution

buildArray(int[]) - Method in class g1901_2000.s1920_build_array_from_permutation.Solution

buildArray(int[], int) - Method in class g1401_1500.s1441_build_an_array_with_stack_operations.Solution

buildDict(String[]) - Method in class g0601_0700.s0676_implement_magic_dictionary.MagicDictionary

buildMatrix(int, int[][], int[][]) - Method in class g2301_2400.s2392_build_a_matrix_with_conditions.Solution

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

bulbSwitch(int) - Method in class g0301_0400.s0319_bulb_switcher.Solution

busiestServers(int, int[], int[]) - Method in class g1601_1700.s1606_find_servers_that_handled_most_number_of_requests.Solution

busyStudent(int[], int[], int) - Method in class g1401_1500.s1450_number_of_students_doing_homework_at_a_given_time.Solution

buyChoco(int[], int) - Method in class g2701_2800.s2706_buy_two_chocolates.Solution

buzz(Runnable) - Method in class g1101_1200.s1195_fizz_buzz_multithreaded.FizzBuzz

C

calcEquation(List<List<String>>, double[], List<List<String>>) - Method in class g0301_0400.s0399_evaluate_division.Solution

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

calculateMKAverage() - Method in class g1801_1900.s1825_finding_mk_average.MKAverage

calculateTax(int[][], int) - Method in class g2301_2400.s2303_calculate_amount_paid_in_taxes.Solution

calPoints(String[]) - Method in class g0601_0700.s0682_baseball_game.Solution

camelMatch(String[], String) - Method in class g1001_1100.s1023_camelcase_matching.Solution

canArrange(int[], int) - Method in class g1401_1500.s1497_check_if_array_pairs_are_divisible_by_k.Solution

canBeEqual(int[], int[]) - Method in class g1401_1500.s1460_make_two_arrays_equal_by_reversing_sub_arrays.Solution

canBeEqual(String, String) - Method in class g2801_2900.s2839_check_if_strings_can_be_made_equal_with_operations_i.Solution

canBeIncreasing(int[]) - Method in class g1901_2000.s1909_remove_one_element_to_make_the_array_strictly_increasing.Solution

canBeTypedWords(String, String) - Method in class g1901_2000.s1935_maximum_number_of_words_you_can_type.Solution

canBeValid(String, String) - Method in class g2101_2200.s2116_check_if_a_parentheses_string_can_be_valid.Solution

canChange(String, String) - Method in class g2301_2400.s2337_move_pieces_to_obtain_a_string.Solution

canChoose(int[][], int[]) - Method in class g1701_1800.s1764_form_array_by_concatenating_subarrays_of_another_array.Solution

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

canConstruct(String, int) - Method in class g1301_1400.s1400_construct_k_palindrome_strings.Solution

canConstruct(String, String) - Method in class g0301_0400.s0383_ransom_note.Solution

canConvertString(String, String, int) - Method in class g1501_1600.s1540_can_convert_string_in_k_moves.Solution

canCross(int[]) - Method in class g0401_0500.s0403_frog_jump.Solution

canDistribute(int[], int[]) - Method in class g1601_1700.s1655_distribute_repeating_integers.Solution

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

canEat(int[], int[][]) - Method in class g1701_1800.s1744_can_you_eat_your_favorite_candy_on_your_favorite_day.Solution

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

canFormArray(int[], int[][]) - Method in class g1601_1700.s1640_check_array_formation_through_concatenation.Solution

canIWin(int, int) - Method in class g0401_0500.s0464_can_i_win.Solution

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

canMakeArithmeticProgression(int[]) - Method in class g1501_1600.s1502_can_make_arithmetic_progression_from_sequence.Solution

canMakePalindromeQueries(String, int[][]) - Method in class g2901_3000.s2983_palindrome_rearrangement_queries.Solution

canMakePaliQueries(String, int[][]) - Method in class g1101_1200.s1177_can_make_palindrome_from_substring.Solution

canMakeSubsequence(String, String) - Method in class g2801_2900.s2825_make_string_a_subsequence_using_cyclic_increments.Solution

canMeasureWater(int, int, int) - Method in class g0301_0400.s0365_water_and_jug_problem.Solution

canMerge(List<TreeNode>) - Method in class g1901_2000.s1932_merge_bsts_to_create_single_bst.Solution

canMouseWin(String[], int, int) - Method in class g1701_1800.s1728_cat_and_mouse_ii.Solution

canPartition(int[]) - Method in class g0401_0500.s0416_partition_equal_subset_sum.Solution

canPartitionKSubsets(int[], int) - Method in class g0601_0700.s0698_partition_to_k_equal_sum_subsets.Solution

canPlaceFlowers(int[], int) - Method in class g0601_0700.s0605_can_place_flowers.Solution

canReach(int[], int) - Method in class g1301_1400.s1306_jump_game_iii.Solution

canReach(String, int, int) - Method in class g1801_1900.s1871_jump_game_vii.Solution

canReorderDoubled(int[]) - Method in class g0901_1000.s0954_array_of_doubled_pairs.Solution

canSeePersonsCount(int[]) - Method in class g1901_2000.s1944_number_of_visible_people_in_a_queue.Solution

canSortArray(int[]) - Method in class g3001_3100.s3011_find_if_array_can_be_sorted.Solution

canSplitArray(List<Integer>, int) - Method in class g2801_2900.s2811_check_if_it_is_possible_to_split_array.Solution

canThreePartsEqualSum(int[]) - Method in class g1001_1100.s1013_partition_array_into_three_parts_with_equal_sum.Solution

canTransform(String, String) - Method in class g0701_0800.s0777_swap_adjacent_in_lr_string.Solution

canTraverseAllPairs(int[]) - Method in class g2701_2800.s2709_greatest_common_divisor_traversal.Solution

canVisitAllRooms(List<List<Integer>>) - Method in class g0801_0900.s0841_keys_and_rooms.Solution

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

capitalizeTitle(String) - Method in class g2101_2200.s2129_capitalize_the_title.Solution

captureForts(int[]) - Method in class g2501_2600.s2511_maximum_enemy_forts_that_can_be_captured.Solution

carFleet(int, int[], int[]) - Method in class g0801_0900.s0853_car_fleet.Solution

carPooling(int[][], int) - Method in class g1001_1100.s1094_car_pooling.Solution

Cashier - Class in g1301_1400.s1357_apply_discount_every_n_orders

1357 - Apply Discount Every n Orders.

Cashier(int, int, int[], int[]) - Constructor for class g1301_1400.s1357_apply_discount_every_n_orders.Cashier

categorizeBox(int, int, int, int) - Method in class g2501_2600.s2525_categorize_box_according_to_criteria.Solution

catMouseGame(int[][]) - Method in class g0901_1000.s0913_cat_and_mouse.Solution

CBTInserter - Class in g0901_1000.s0919_complete_binary_tree_inserter

919 - Complete Binary Tree Inserter.

CBTInserter(TreeNode) - Constructor for class g0901_1000.s0919_complete_binary_tree_inserter.CBTInserter

cellsInRange(String) - Method in class g2101_2200.s2194_cells_in_a_range_on_an_excel_sheet.Solution

chalkReplacer(int[], int) - Method in class g1801_1900.s1894_find_the_student_that_will_replace_the_chalk.Solution

champagneTower(int, int, int) - Method in class g0701_0800.s0799_champagne_tower.Solution

change(int, int) - Method in class g2301_2400.s2349_design_a_number_container_system.NumberContainers

change(int, int[]) - Method in class g0501_0600.s0518_coin_change_2.Solution

changeRating(String, int) - Method in class g2301_2400.s2353_design_a_food_rating_system.FoodRatings

characterReplacement(String, int) - Method in class g0401_0500.s0424_longest_repeating_character_replacement.Solution

check(int[]) - Method in class g1701_1800.s1752_check_if_array_is_sorted_and_rotated.Solution

check(int, int[], int) - Method in class g1201_1300.s1300_sum_of_mutated_array_closest_to_target.Solution

checkAlmostEquivalent(String, String) - Method in class g2001_2100.s2068_check_whether_two_strings_are_almost_equivalent.Solution

checkArithmeticSubarrays(int[], int[], int[]) - Method in class g1601_1700.s1630_arithmetic_subarrays.Solution

checkArray(int[], int) - Method in class g2701_2800.s2772_apply_operations_to_make_all_array_elements_equal_to_zero.Solution

checkDistances(String, int[]) - Method in class g2301_2400.s2399_check_distances_between_same_letters.Solution

checkIfCanBreak(String, String) - Method in class g1401_1500.s1433_check_if_a_string_can_break_another_string.Solution

checkIfExist(int[]) - Method in class g1301_1400.s1346_check_if_n_and_its_double_exist.Solution

checkIfPangram(String) - Method in class g1801_1900.s1832_check_if_the_sentence_is_pangram.Solution

checkIfPrerequisite(int, int[][], int[][]) - Method in class g1401_1500.s1462_course_schedule_iv.Solution

checkIn(int, String, int) - Method in class g1301_1400.s1396_design_underground_system.UndergroundSystem

checkInclusion(String, String) - Method in class g0501_0600.s0567_permutation_in_string.Solution

checkMove(char[][], int, int, char) - Method in class g1901_2000.s1958_check_if_move_is_legal.Solution

checkNewUser(int) - Method in class g0301_0400.s0355_design_twitter.Twitter

checkOnesSegment(String) - Method in class g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones.Solution

checkOut(int, String, int) - Method in class g1301_1400.s1396_design_underground_system.UndergroundSystem

checkOverlap(int, int, int, int, int, int, int) - Method in class g1401_1500.s1401_circle_and_rectangle_overlapping.Solution

checkPalindromeFormation(String, String) - Method in class g1601_1700.s1616_split_two_strings_to_make_palindrome.Solution

checkPartitioning(String) - Method in class g1701_1800.s1745_palindrome_partitioning_iv.Solution

checkPerfectNumber(int) - Method in class g0501_0600.s0507_perfect_number.Solution

checkPossibility(int[]) - Method in class g0601_0700.s0665_non_decreasing_array.Solution

checkPowersOfThree(int) - Method in class g1701_1800.s1780_check_if_number_is_a_sum_of_powers_of_three.Solution

checkRecord(int) - Method in class g0501_0600.s0552_student_attendance_record_ii.Solution

checkRecord(String) - Method in class g0501_0600.s0551_student_attendance_record_i.Solution

checkStraightLine(int[][]) - Method in class g1201_1300.s1232_check_if_it_is_a_straight_line.Solution

checkString(String) - Method in class g2101_2200.s2124_check_if_all_as_appears_before_all_bs.Solution

checkStrings(String, String) - Method in class g2801_2900.s2840_check_if_strings_can_be_made_equal_with_operations_ii.Solution

checkSubarraySum(int[], int) - Method in class g0501_0600.s0523_continuous_subarray_sum.Solution

checkTree(TreeNode) - Method in class g2201_2300.s2236_root_equals_sum_of_children.Solution

checkValid(int[][]) - Method in class g2101_2200.s2133_check_if_every_row_and_column_contains_all_numbers.Solution

checkValidGrid(int[][]) - Method in class g2501_2600.s2596_check_knight_tour_configuration.Solution

checkValidString(String) - Method in class g0601_0700.s0678_valid_parenthesis_string.Solution

checkWays(int[][]) - Method in class g1701_1800.s1719_number_of_ways_to_reconstruct_a_tree.Solution

checkXMatrix(int[][]) - Method in class g2301_2400.s2319_check_if_matrix_is_x_matrix.Solution

checkZeroOnes(String) - Method in class g1801_1900.s1869_longer_contiguous_segments_of_ones_than_zeros.Solution

cherryPickup(int[][]) - Method in class g0701_0800.s0741_cherry_pickup.Solution

cherryPickup(int[][]) - Method in class g1401_1500.s1463_cherry_pickup_ii.Solution

child - Variable in class g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node

circularArrayLoop(int[]) - Method in class g0401_0500.s0457_circular_array_loop.Solution

circularGameLosers(int, int) - Method in class g2601_2700.s2682_find_the_losers_of_the_circular_game.Solution

circularPermutation(int, int) - Method in class g1201_1300.s1238_circular_permutation_in_binary_representation.Solution

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

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

closedIsland(int[][]) - Method in class g1201_1300.s1254_number_of_closed_islands.Solution

closestCost(int[], int[], int) - Method in class g1701_1800.s1774_closest_dessert_cost.Solution

closestDivisors(int) - Method in class g1301_1400.s1362_closest_divisors.Solution

closestMeetingNode(int[], int, int) - Method in class g2301_2400.s2359_find_closest_node_to_given_two_nodes.Solution

closestNodes(TreeNode, List<Integer>) - Method in class g2401_2500.s2476_closest_nodes_queries_in_a_binary_search_tree.Solution

closestPrimes(int, int) - Method in class g2501_2600.s2523_closest_prime_numbers_in_range.Solution

closeStrings(String, String) - Method in class g1601_1700.s1657_determine_if_two_strings_are_close.Solution

closestRoom(int[][], int[][]) - Method in class g1801_1900.s1847_closest_room.Solution

closestToTarget(int[], int) - Method in class g1501_1600.s1521_find_a_value_of_a_mysterious_function_closest_to_target.Solution

closetTarget(String[], String, int) - Method in class g2501_2600.s2515_shortest_distance_to_target_string_in_a_circular_array.Solution

clumsy(int) - Method in class g1001_1100.s1006_clumsy_factorial.Solution

Codec - Class in g0201_0300.s0297_serialize_and_deserialize_binary_tree

297 - Serialize and Deserialize Binary Tree.

Codec - Class in g0401_0500.s0449_serialize_and_deserialize_bst

449 - Serialize and Deserialize BST.

Codec - Class in g0501_0600.s0535_encode_and_decode_tinyurl

535 - Encode and Decode TinyURL.

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

Codec() - Constructor for class g0401_0500.s0449_serialize_and_deserialize_bst.Codec

Codec() - Constructor for class g0501_0600.s0535_encode_and_decode_tinyurl.Codec

coinChange(int[], int) - Method in class g0301_0400.s0322_coin_change.Solution

collapse(Allocator.Node, int) - Method in class g2501_2600.s2502_design_memory_allocator.Allocator

collectTheCoins(int[], int[][]) - Method in class g2601_2700.s2603_collect_coins_in_a_tree.Solution

colorBorder(int[][], int, int, int) - Method in class g1001_1100.s1034_coloring_a_border.Solution

coloredCells(int) - Method in class g2501_2600.s2579_count_total_number_of_colored_cells.Solution

colorTheArray(int, int[][]) - Method in class g2601_2700.s2672_number_of_adjacent_elements_with_the_same_color.Solution

colorTheGrid(int, int) - Method in class g1901_2000.s1931_painting_a_grid_with_three_different_colors.Solution

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

CombinationIterator - Class in g1201_1300.s1286_iterator_for_combination

1286 - Iterator for Combination.

CombinationIterator(String, int) - Constructor for class g1201_1300.s1286_iterator_for_combination.CombinationIterator

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

combinationSum4(int[], int) - Method in class g0301_0400.s0377_combination_sum_iv.Solution

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

commonChars(String[]) - Method in class g1001_1100.s1002_find_common_characters.Solution

commonFactors(int, int) - Method in class g2401_2500.s2427_number_of_common_factors.Solution

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

complexNumberMultiply(String, String) - Method in class g0501_0600.s0537_complex_number_multiplication.Solution

componentValue(int[], int[][]) - Method in class g2401_2500.s2440_create_components_with_same_value.Solution

compress(char[]) - Method in class g0401_0500.s0443_string_compression.Solution

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

concatenatedBinary(int) - Method in class g1601_1700.s1680_concatenation_of_consecutive_binary_numbers.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

connectTwoGroups(List<List<Integer>>) - Method in class g1501_1600.s1595_minimum_cost_to_connect_two_groups_of_points.Solution

consec(int) - Method in class g2501_2600.s2526_find_consecutive_integers_from_a_data_stream.DataStream

consecutiveNumbersSum(int) - Method in class g0801_0900.s0829_consecutive_numbers_sum.Solution

constrainedSubsetSum(int[], int) - Method in class g1401_1500.s1425_constrained_subsequence_sum.Solution

construct(int[][]) - Method in class g0401_0500.s0427_construct_quad_tree.Solution

construct2DArray(int[], int, int) - Method in class g2001_2100.s2022_convert_1d_array_into_2d_array.Solution

constructArray(int, int) - Method in class g0601_0700.s0667_beautiful_arrangement_ii.Solution

constructDistancedSequence(int) - Method in class g1701_1800.s1718_construct_the_lexicographically_largest_valid_sequence.Solution

constructFromPrePost(int[], int[]) - Method in class g0801_0900.s0889_construct_binary_tree_from_preorder_and_postorder_traversal.Solution

constructMaximumBinaryTree(int[]) - Method in class g0601_0700.s0654_maximum_binary_tree.Solution

constructMST(int[], int[][], boolean[], PriorityQueue<Solution.Pair>, int[]) - Method in class g1501_1600.s1584_min_cost_to_connect_all_points.Solution

constructProductMatrix(int[][]) - Method in class g2901_3000.s2906_construct_product_matrix.Solution

constructRectangle(int) - Method in class g0401_0500.s0492_construct_the_rectangle.Solution

contains(int) - Method in class g0701_0800.s0705_design_hashset.MyHashSet

containsCycle(char[][]) - Method in class g1501_1600.s1559_detect_cycles_in_2d_grid.Solution

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

containsFalse(boolean[]) - Method in class g1501_1600.s1584_min_cost_to_connect_all_points.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

containsPattern(int[], int, int) - Method in class g1501_1600.s1566_detect_pattern_of_length_m_repeated_k_or_more_times.Solution

containVirus(int[][]) - Method in class g0701_0800.s0749_contain_virus.Solution

continuousSubarrays(int[]) - Method in class g2701_2800.s2762_continuous_subarrays.Solution

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

convertBST(TreeNode) - Method in class g0501_0600.s0538_convert_bst_to_greater_tree.Solution

convertTemperature(double) - Method in class g2401_2500.s2469_convert_the_temperature.Solution

convertTime(String, String) - Method in class g2201_2300.s2224_minimum_number_of_operations_to_convert_time.Solution

convertToBase7(int) - Method in class g0501_0600.s0504_base_7.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

corpFlightBookings(int[][], int) - Method in class g1101_1200.s1109_corporate_flight_bookings.Solution

count() - Method in class g2101_2200.s2166_design_bitset.Bitset

count() - Method in class g2201_2300.s2276_count_integers_in_intervals.CountIntervals

count(int) - Method in class g1801_1900.s1865_finding_pairs_with_a_certain_sum.FindSumPairs

count(int[]) - Method in class g2001_2100.s2013_detect_squares.DetectSquares

count(int[], int[]) - Method in class g1501_1600.s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers.Solution

count(String, String, int, int) - Method in class g2701_2800.s2719_count_of_integers.Solution

countAnagrams(String) - Method in class g2501_2600.s2514_count_anagrams.Solution

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

countArrangement(int) - Method in class g0501_0600.s0526_beautiful_arrangement.Solution

countAsterisks(String) - Method in class g2301_2400.s2315_count_asterisks.Solution

countBadPairs(int[]) - Method in class g2301_2400.s2364_count_number_of_bad_pairs.Solution

countBalls(int, int) - Method in class g1701_1800.s1742_maximum_number_of_balls_in_a_box.Solution

countBattleships(char[][]) - Method in class g0401_0500.s0419_battleships_in_a_board.Solution

countBeautifulPairs(int[]) - Method in class g2701_2800.s2748_number_of_beautiful_pairs.Solution

countBinarySubstrings(String) - Method in class g0601_0700.s0696_count_binary_substrings.Solution

countBits(int) - Method in class g0301_0400.s0338_counting_bits.Solution

countBlackBlocks(int, int, int[][]) - Method in class g2701_2800.s2768_number_of_black_blocks.Solution

countCharacters(String[], String) - Method in class g1101_1200.s1160_find_words_that_can_be_formed_by_characters.Solution

countCollisions(String) - Method in class g2201_2300.s2211_count_collisions_on_a_road.Solution

countCombinations(String[], int[][]) - Method in class g2001_2100.s2056_number_of_valid_move_combinations_on_chessboard.Solution

countCompleteComponents(int, int[][]) - Method in class g2601_2700.s2685_count_the_number_of_complete_components.Solution

countCompleteSubarrays(int[]) - Method in class g2701_2800.s2799_count_complete_subarrays_in_an_array.Solution

countCompleteSubstrings(String, int) - Method in class g2901_3000.s2953_count_complete_substrings.Solution

countConsistentStrings(String, String[]) - Method in class g1601_1700.s1684_count_the_number_of_consistent_strings.Solution

countDaysTogether(String, String, String, String) - Method in class g2401_2500.s2409_count_days_spent_together.Solution

countDifferentSubsequenceGCDs(int[]) - Method in class g1801_1900.s1819_number_of_different_subsequences_gcds.Solution

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

countDigits(int) - Method in class g2501_2600.s2520_count_the_digits_that_divide_a_number.Solution

countDistinct(int[], int, int) - Method in class g2201_2300.s2261_k_divisible_elements_subarrays.Solution

countDistinctIntegers(int[]) - Method in class g2401_2500.s2442_count_number_of_distinct_integers_after_reverse_operations.Solution

countElements(int[]) - Method in class g2101_2200.s2148_count_elements_with_strictly_smaller_and_greater_elements.Solution

countEven(int) - Method in class g2101_2200.s2180_count_integers_with_even_digit_sum.Solution

countExcellentPairs(int[], int) - Method in class g2301_2400.s2354_number_of_excellent_pairs.Solution

countFairPairs(int[], int, int) - Method in class g2501_2600.s2563_count_the_number_of_fair_pairs.Solution

countGood(int[], int) - Method in class g2501_2600.s2537_count_the_number_of_good_subarrays.Solution

countGoodNumbers(long) - Method in class g1901_2000.s1922_count_good_numbers.Solution

countGoodRectangles(int[][]) - Method in class g1701_1800.s1725_number_of_rectangles_that_can_form_the_largest_square.Solution

countGoodStrings(int, int, int, int) - Method in class g2401_2500.s2466_count_ways_to_build_good_strings.Solution

countGoodSubstrings(String) - Method in class g1801_1900.s1876_substrings_of_size_three_with_distinct_characters.Solution

countGoodTriplets(int[], int, int, int) - Method in class g1501_1600.s1534_count_good_triplets.Solution

countHighestScoreNodes(int[]) - Method in class g2001_2100.s2049_count_nodes_with_the_highest_score.Solution

countHillValley(int[]) - Method in class g2201_2300.s2210_count_hills_and_valleys_in_an_array.Solution

countHomogenous(String) - Method in class g1701_1800.s1759_count_number_of_homogenous_substrings.Solution

countHousePlacements(int) - Method in class g2301_2400.s2320_count_number_of_ways_to_place_houses.Solution

countInterestingSubarrays(List<Integer>, int, int) - Method in class g2801_2900.s2845_count_of_interesting_subarrays.Solution

CountIntervals - Class in g2201_2300.s2276_count_integers_in_intervals

2276 - Count Integers in Intervals.

CountIntervals() - Constructor for class g2201_2300.s2276_count_integers_in_intervals.CountIntervals

countKDifference(int[], int) - Method in class g2001_2100.s2006_count_number_of_pairs_with_absolute_difference_k.Solution

countKeyChanges(String) - Method in class g3001_3100.s3019_number_of_changing_keys.Solution

countKSubsequencesWithMaxBeauty(String, int) - Method in class g2801_2900.s2842_count_k_subsequences_of_a_string_with_maximum_beauty.Solution

countLargestGroup(int) - Method in class g1301_1400.s1399_count_largest_group.Solution

countLatticePoints(int[][]) - Method in class g2201_2300.s2249_count_lattice_points_inside_a_circle.Solution

countMatches(List<List<String>>, String, String) - Method in class g1701_1800.s1773_count_items_matching_a_rule.Solution

countMatchingSubarrays(int[], int[]) - Method in class g3001_3100.s3034_number_of_subarrays_that_match_a_pattern_i.Solution

countMatchingSubarrays(int[], int[]) - Method in class g3001_3100.s3036_number_of_subarrays_that_match_a_pattern_ii.Solution

countMaxOrSubsets(int[]) - Method in class g2001_2100.s2044_count_number_of_maximum_bitwise_or_subsets.Solution

countNegatives(int[][]) - Method in class g1301_1400.s1351_count_negative_numbers_in_a_sorted_matrix.Solution

countNicePairs(int[]) - Method in class g1801_1900.s1814_count_nice_pairs_in_an_array.Solution

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

countNumbersWithUniqueDigits(int) - Method in class g0301_0400.s0357_count_numbers_with_unique_digits.Solution

countOdds(int, int) - Method in class g1501_1600.s1523_count_odd_numbers_in_an_interval_range.Solution

countOfAtoms(String) - Method in class g0701_0800.s0726_number_of_atoms.Solution

countOfPairs(int, int, int) - Method in class g3001_3100.s3015_count_the_number_of_houses_at_a_certain_distance_i.Solution

countOfPairs(int, int, int) - Method in class g3001_3100.s3017_count_the_number_of_houses_at_a_certain_distance_ii.Solution

countOperations(int, int) - Method in class g2101_2200.s2169_count_operations_to_obtain_zero.Solution

countOperationsToEmptyArray(int[]) - Method in class g2601_2700.s2659_make_array_empty.Solution

countOrders(int) - Method in class g1301_1400.s1359_count_all_valid_pickup_and_delivery_options.Solution

countPairs(int[]) - Method in class g1701_1800.s1711_count_good_meals.Solution

countPairs(int[], int) - Method in class g2101_2200.s2176_count_equal_and_divisible_pairs_in_an_array.Solution

countPairs(int[], int) - Method in class g2101_2200.s2183_count_array_pairs_divisible_by_k.Solution

countPairs(int[], int, int) - Method in class g1801_1900.s1803_count_pairs_with_xor_in_a_range.Solution

countPairs(int, int[][]) - Method in class g2301_2400.s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph.Solution

countPairs(int, int[][], int[]) - Method in class g1701_1800.s1782_count_pairs_of_nodes.Solution

countPairs(TreeNode, int) - Method in class g1501_1600.s1530_number_of_good_leaf_nodes_pairs.Solution

countPairs(List<Integer>, int) - Method in class g2801_2900.s2824_count_pairs_whose_sum_is_less_than_target.Solution

countPairs(List<List<Integer>>, int) - Method in class g2801_2900.s2857_count_pairs_of_points_with_distance_k.Solution

countPairsOfConnectableServers(int[][], int) - Method in class g3001_3100.s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network.Solution

countPalindromePaths(List<Integer>, String) - Method in class g2701_2800.s2791_count_paths_that_can_form_a_palindrome_in_a_tree.Solution

countPalindromes(String) - Method in class g2401_2500.s2484_count_palindromic_subsequences.Solution

countPalindromicSubsequence(String) - Method in class g1901_2000.s1930_unique_length_3_palindromic_subsequences.Solution

countPalindromicSubsequences(String) - Method in class g0701_0800.s0730_count_different_palindromic_subsequences.Solution

countPartitions(int[], int) - Method in class g2501_2600.s2518_number_of_great_partitions.Solution

countPaths(int[][]) - Method in class g2301_2400.s2328_number_of_increasing_paths_in_a_grid.Solution

countPaths(int, int[][]) - Method in class g1901_2000.s1976_number_of_ways_to_arrive_at_destination.Solution

countPaths(int, int[][]) - Method in class g2801_2900.s2867_count_valid_paths_in_a_tree.Solution

countPoints(int[][], int[][]) - Method in class g1801_1900.s1828_queries_on_number_of_points_inside_a_circle.Solution

countPoints(String) - Method in class g2101_2200.s2103_rings_and_rods.Solution

countPrefixes(String[], String) - Method in class g2201_2300.s2255_count_prefixes_of_a_given_string.Solution

countPrefixSuffixPairs(String[]) - Method in class g3001_3100.s3042_count_prefix_and_suffix_pairs_i.Solution

countPrefixSuffixPairs(String[]) - Method in class g3001_3100.s3045_count_prefix_and_suffix_pairs_ii.Solution

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

countPrimeSetBits(int, int) - Method in class g0701_0800.s0762_prime_number_of_set_bits_in_binary_representation.Solution

countPyramids(int[][]) - Method in class g2001_2100.s2088_count_fertile_pyramids_in_a_land.Solution

countQuadruplets(int[]) - Method in class g1901_2000.s1995_count_special_quadruplets.Solution

countQuadruplets(int[]) - Method in class g2501_2600.s2552_count_increasing_quadruplets.Solution

countRangeSum(int[], int, int) - Method in class g0301_0400.s0327_count_of_range_sum.Solution

countRectangles(int[][], int[][]) - Method in class g2201_2300.s2250_count_number_of_rectangles_containing_each_point.Solution

countRestrictedPaths(int, int[][]) - Method in class g1701_1800.s1786_number_of_restricted_paths_from_first_to_last_node.Solution

countRoutes(int[], int, int, int) - Method in class g1501_1600.s1575_count_all_possible_routes.Solution

countSegments(String) - Method in class g0401_0500.s0434_number_of_segments_in_a_string.Solution

countSeniors(String[]) - Method in class g2601_2700.s2678_number_of_senior_citizens.Solution

countServers(int[][]) - Method in class g1201_1300.s1267_count_servers_that_communicate.Solution

countServers(int, int[][], int, int[]) - Method in class g2701_2800.s2747_count_zero_request_servers.Solution

countSetBits(int) - Static method in class g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits.Solution

countSmaller(int[]) - Method in class g0301_0400.s0315_count_of_smaller_numbers_after_self.Solution

countSpecialNumbers(int) - Method in class g2301_2400.s2376_count_special_integers.Solution

countSpecialSubsequences(int[]) - Method in class g1901_2000.s1955_count_number_of_special_subsequences.Solution

countSquares(int[][]) - Method in class g1201_1300.s1277_count_square_submatrices_with_all_ones.Solution

countSteppingNumbers(String, String) - Method in class g2801_2900.s2801_count_stepping_numbers_in_range.Solution

countStudents(int[], int[]) - Method in class g1601_1700.s1700_number_of_students_unable_to_eat_lunch.Solution

countSubarrays(int[], int) - Method in class g2401_2500.s2488_count_subarrays_with_median_k.Solution

countSubarrays(int[], int) - Method in class g2901_3000.s2962_count_subarrays_where_max_element_appears_at_least_k_times.Solution

countSubarrays(int[], int, int) - Method in class g2401_2500.s2444_count_subarrays_with_fixed_bounds.Solution

countSubarrays(int[], long) - Method in class g2301_2400.s2302_count_subarrays_with_score_less_than_k.Solution

countSubgraphsForEachDiameter(int, int[][]) - Method in class g1601_1700.s1617_count_subtrees_with_max_distance_between_cities.Solution

countSubIslands(int[][], int[][]) - Method in class g1901_2000.s1905_count_sub_islands.Solution

countSubMultisets(List<Integer>, int, int) - Method in class g2901_3000.s2902_count_of_sub_multisets_with_bounded_sum.Solution

countSubstrings(String) - Method in class g0601_0700.s0647_palindromic_substrings.Solution

countSubstrings(String, String) - Method in class g1601_1700.s1638_count_substrings_that_differ_by_one_character.Solution

countSubTrees(int, int[][], String) - Method in class g1501_1600.s1519_number_of_nodes_in_the_sub_tree_with_the_same_label.Solution

countSymmetricIntegers(int, int) - Method in class g2801_2900.s2843_count_symmetric_integers.Solution

countTestedDevices(int[]) - Method in class g2901_3000.s2960_count_tested_devices_after_test_operations.Solution

countTexts(String) - Method in class g2201_2300.s2266_count_number_of_texts.Solution

countTime(String) - Method in class g2401_2500.s2437_number_of_valid_clock_times.Solution

countTriples(int) - Method in class g1901_2000.s1925_count_square_sum_triples.Solution

countTriplets(int[]) - Method in class g0901_1000.s0982_triples_with_bitwise_and_equal_to_zero.Solution

countTriplets(int[]) - Method in class g1401_1500.s1442_count_triplets_that_can_form_two_arrays_of_equal_xor.Solution

countUnexpiredTokens(int) - Method in class g1701_1800.s1797_design_authentication_manager.AuthenticationManager

countUnguarded(int, int, int[][], int[][]) - Method in class g2201_2300.s2257_count_unguarded_cells_in_the_grid.Solution

countValidWords(String) - Method in class g2001_2100.s2047_number_of_valid_words_in_a_sentence.Solution

countVisitedNodes(List<Integer>) - Method in class g2801_2900.s2876_count_visited_nodes_in_a_directed_graph.Solution

countVowelPermutation(int) - Method in class g1201_1300.s1220_count_vowels_permutation.Solution

countVowels(String) - Method in class g2001_2100.s2063_vowels_of_all_substrings.Solution

countVowelStrings(int) - Method in class g1601_1700.s1641_count_sorted_vowel_strings.Solution

countVowelSubstrings(String) - Method in class g2001_2100.s2062_count_vowel_substrings_of_a_string.Solution

countWays(int[][]) - Method in class g2501_2600.s2580_count_ways_to_group_overlapping_ranges.Solution

countWays(List<Integer>) - Method in class g2801_2900.s2860_happy_students.Solution

countWords(String[], String[]) - Method in class g2001_2100.s2085_count_common_words_with_one_occurrence.Solution

crackSafe(int, int) - Method in class g0701_0800.s0753_cracking_the_safe.Solution

create(List<Integer>) - Static method in class com_github_leetcode.TreeNode

createBinaryTree(int[][]) - Method in class g2101_2200.s2196_create_binary_tree_from_descriptions.Solution

createSortedArray(int[]) - Method in class g1601_1700.s1649_create_sorted_array_through_instructions.Solution

createTargetArray(int[], int[]) - Method in class g1301_1400.s1389_create_target_array_in_the_given_order.Solution

criticalConnections(int, List<List<Integer>>) - Method in class g1101_1200.s1192_critical_connections_in_a_network.Solution

csb(int) - Static method in class g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c.Solution

current() - Method in class g2001_2100.s2034_stock_price_fluctuation.StockPrice

cursorLeft(int) - Method in class g2201_2300.s2296_design_a_text_editor.TextEditor

cursorRight(int) - Method in class g2201_2300.s2296_design_a_text_editor.TextEditor

customSortString(String, String) - Method in class g0701_0800.s0791_custom_sort_string.Solution

CustomStack - Class in g1301_1400.s1381_design_a_stack_with_increment_operation

1381 - Design a Stack With Increment Operation.

CustomStack(int) - Constructor for class g1301_1400.s1381_design_a_stack_with_increment_operation.CustomStack

cutOffTree(List<List<Integer>>) - Method in class g0601_0700.s0675_cut_off_trees_for_golf_event.Solution

cycleLengthQueries(int, int[][]) - Method in class g2501_2600.s2509_cycle_length_queries_in_a_tree.Solution

D

dailyTemperatures(int[]) - Method in class g0701_0800.s0739_daily_temperatures.Solution

DataStream - Class in g2501_2600.s2526_find_consecutive_integers_from_a_data_stream

2526 - Find Consecutive Integers from a Data Stream.

DataStream(int, int) - Constructor for class g2501_2600.s2526_find_consecutive_integers_from_a_data_stream.DataStream

dayOfTheWeek(int, int, int) - Method in class g1101_1200.s1185_day_of_the_week.Solution

dayOfYear(String) - Method in class g1101_1200.s1154_day_of_the_year.Solution

daysBetweenDates(String, String) - Method in class g1301_1400.s1360_number_of_days_between_two_dates.Solution

death(String) - Method in class g1501_1600.s1600_throne_inheritance.ThroneInheritance

dec(String) - Method in class g0401_0500.s0432_all_oone_data_structure.AllOne

deckRevealedIncreasing(int[]) - Method in class g0901_1000.s0950_reveal_cards_in_increasing_order.Solution

decode(int[]) - Method in class g1701_1800.s1734_decode_xored_permutation.Solution

decode(int[], int) - Method in class g1701_1800.s1720_decode_xored_array.Solution

decode(String) - Method in class g0501_0600.s0535_encode_and_decode_tinyurl.Codec

decodeAtIndex(String, int) - Method in class g0801_0900.s0880_decoded_string_at_index.Solution

decodeCiphertext(String, int) - Method in class g2001_2100.s2075_decode_the_slanted_ciphertext.Solution

decodeMessage(String, String) - Method in class g2301_2400.s2325_decode_the_message.Solution

decodeString(String) - Method in class g0301_0400.s0394_decode_string.Solution

decompressRLElist(int[]) - Method in class g1301_1400.s1313_decompress_run_length_encoded_list.Solution

decrypt(int[], int) - Method in class g1601_1700.s1652_defuse_the_bomb.Solution

decrypt(String) - Method in class g2201_2300.s2227_encrypt_and_decrypt_strings.Encrypter

deepestLeavesSum(TreeNode) - Method in class g1301_1400.s1302_deepest_leaves_sum.Solution

defangIPaddr(String) - Method in class g1101_1200.s1108_defanging_an_ip_address.Solution

deleteAndEarn(int[]) - Method in class g0701_0800.s0740_delete_and_earn.Solution

deleteAtIndex(int) - Method in class g0701_0800.s0707_design_linked_list.MyLinkedList

deleteDuplicateFolder(List<List<String>>) - Method in class g1901_2000.s1948_delete_duplicate_folders_in_system.Solution

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

deleteFront() - Method in class g0601_0700.s0641_design_circular_deque.MyCircularDeque

deleteGreatestValue(int[][]) - Method in class g2401_2500.s2500_delete_greatest_value_in_each_row.Solution

deleteLast() - Method in class g0601_0700.s0641_design_circular_deque.MyCircularDeque

deleteMiddle(ListNode) - Method in class g2001_2100.s2095_delete_the_middle_node_of_a_linked_list.Solution

deleteNode(ListNode) - Method in class g0201_0300.s0237_delete_node_in_a_linked_list.Solution

deleteNode(TreeNode, int) - Method in class g0401_0500.s0450_delete_node_in_a_bst.Solution

deleteOne(int) - Method in class g2601_2700.s2671_frequency_tracker.FrequencyTracker

deleteString(String) - Method in class g2401_2500.s2430_maximum_deletions_on_a_string.Solution

deleteText(int) - Method in class g2201_2300.s2296_design_a_text_editor.TextEditor

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

delNodes(TreeNode, int[]) - Method in class g1101_1200.s1110_delete_nodes_and_return_forest.Solution

deposit(int[]) - Method in class g2201_2300.s2241_design_an_atm_machine.ATM

deposit(int, long) - Method in class g2001_2100.s2043_simple_bank_system.Bank

deQueue() - Method in class g0601_0700.s0622_design_circular_queue.MyCircularQueue

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

deserialize(String) - Method in class g0301_0400.s0385_mini_parser.Solution

deserialize(String) - Method in class g0401_0500.s0449_serialize_and_deserialize_bst.Codec

destCity(List<List<String>>) - Method in class g1401_1500.s1436_destination_city.Solution

destroyTargets(int[], int) - Method in class g2401_2500.s2453_destroy_sequential_targets.Solution

detectCapitalUse(String) - Method in class g0501_0600.s0520_detect_capital.Solution

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

DetectSquares - Class in g2001_2100.s2013_detect_squares

2013 - Detect Squares.

DetectSquares() - Constructor for class g2001_2100.s2013_detect_squares.DetectSquares

dfs(Map<Integer, Set<Integer>>, int, int, List<List<Integer>>, String) - Method in class g1201_1300.s1222_queens_that_can_attack_the_king.Solution

dfs(Map<String, LinkedHashSet<String>>, String, List<String>, Set<String>) - Method in class g1501_1600.s1600_throne_inheritance.ThroneInheritance

diagonalPrime(int[][]) - Method in class g2601_2700.s2614_prime_in_diagonal.Solution

diagonalSort(int[][]) - Method in class g1301_1400.s1329_sort_the_matrix_diagonally.Solution

diagonalSum(int[][]) - Method in class g1501_1600.s1572_matrix_diagonal_sum.Solution

diameterOfBinaryTree(TreeNode) - Method in class g0501_0600.s0543_diameter_of_binary_tree.Solution

dieSimulator(int, int[]) - Method in class g1201_1300.s1223_dice_roll_simulation.Solution

differenceOfDistinctValues(int[][]) - Method in class g2701_2800.s2711_difference_of_number_of_distinct_values_on_diagonals.Solution

differenceOfSum(int[]) - Method in class g2501_2600.s2535_difference_between_element_sum_and_digit_sum_of_an_array.Solution

differenceOfSums(int, int) - Method in class g2801_2900.s2894_divisible_and_non_divisible_sums_difference.Solution

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

digArtifacts(int, int[][], int[][]) - Method in class g2201_2300.s2201_count_artifacts_that_can_be_extracted.Solution

digitCount(String) - Method in class g2201_2300.s2283_check_if_number_has_equal_digit_count_and_digit_value.Solution

digitSum(String, int) - Method in class g2201_2300.s2243_calculate_digit_sum_of_a_string.Solution

DiningPhilosophers - Class in g1201_1300.s1226_the_dining_philosophers

1226 - The Dining Philosophers.

DiningPhilosophers() - Constructor for class g1201_1300.s1226_the_dining_philosophers.DiningPhilosophers

DinnerPlates - Class in g1101_1200.s1172_dinner_plate_stacks

1172 - Dinner Plate Stacks.

DinnerPlates(int) - Constructor for class g1101_1200.s1172_dinner_plate_stacks.DinnerPlates

discountPrices(String, int) - Method in class g2201_2300.s2288_apply_discount_to_prices.Solution

displayTable(List<List<String>>) - Method in class g1401_1500.s1418_display_table_of_food_orders_in_a_restaurant.Solution

distance(int[]) - Method in class g2601_2700.s2615_sum_of_distances.Solution

distanceBetweenBusStops(int[], int, int) - Method in class g1101_1200.s1184_distance_between_bus_stops.Solution

distanceK(TreeNode, TreeNode, int) - Method in class g0801_0900.s0863_all_nodes_distance_k_in_binary_tree.Solution

distanceLimitedPathsExist(int, int[][], int[][]) - Method in class g1601_1700.s1697_checking_existence_of_edge_length_limited_paths.Solution

distanceTraveled(int, int) - Method in class g2701_2800.s2739_total_distance_traveled.Solution

distinctAverages(int[]) - Method in class g2401_2500.s2465_number_of_distinct_averages.Solution

distinctDifferenceArray(int[]) - Method in class g2601_2700.s2670_find_the_distinct_difference_array.Solution

distinctEchoSubstrings(String) - Method in class g1301_1400.s1316_distinct_echo_substrings.Solution

distinctIntegers(int) - Method in class g2501_2600.s2549_count_distinct_numbers_on_board.Solution

distinctNames(String[]) - Method in class g2301_2400.s2306_naming_a_company.Solution

distinctPrimeFactors(int[]) - Method in class g2501_2600.s2521_distinct_prime_factors_of_product_of_array.Solution

distinctSequences(int) - Method in class g2301_2400.s2318_number_of_distinct_roll_sequences.Solution

distinctSubseqII(String) - Method in class g0901_1000.s0940_distinct_subsequences_ii.Solution

distMoney(int, int) - Method in class g2501_2600.s2591_distribute_money_to_maximum_children.Solution

distributeCandies(int[]) - Method in class g0501_0600.s0575_distribute_candies.Solution

distributeCandies(int, int) - Method in class g1101_1200.s1103_distribute_candies_to_people.Solution

distributeCandies(int, int) - Method in class g2901_3000.s2928_distribute_candies_among_children_i.Solution

distributeCandies(long, long) - Method in class g2901_3000.s2929_distribute_candies_among_children_ii.Solution

distributeCoins(TreeNode) - Method in class g0901_1000.s0979_distribute_coins_in_binary_tree.Solution

distributeCookies(int[], int) - Method in class g2301_2400.s2305_fair_distribution_of_cookies.Solution

diStringMatch(String) - Method in class g0901_1000.s0942_di_string_match.Solution

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

divideArray(int[]) - Method in class g2201_2300.s2206_divide_array_into_equal_pairs.Solution

divideArray(int[], int) - Method in class g2901_3000.s2966_divide_array_into_arrays_with_max_difference.Solution

dividePlayers(int[]) - Method in class g2401_2500.s2491_divide_players_into_teams_of_equal_skill.Solution

divideString(String, int, char) - Method in class g2101_2200.s2138_divide_a_string_into_groups_of_size_k.Solution

divisibilityArray(String, int) - Method in class g2501_2600.s2575_find_the_divisibility_array_of_a_string.Solution

divisorGame(int) - Method in class g1001_1100.s1025_divisor_game.Solution

divisorSubstrings(int, int) - Method in class g2201_2300.s2269_find_the_k_beauty_of_a_number.Solution

doesValidArrayExist(int[]) - Method in class g2601_2700.s2683_neighboring_bitwise_xor.Solution

dominantIndex(int[]) - Method in class g0701_0800.s0747_largest_number_at_least_twice_of_others.Solution

doubleIt(ListNode) - Method in class g2801_2900.s2816_double_a_number_represented_as_a_linked_list.Solution

drop(int, int) - Method in class g1901_2000.s1912_design_movie_rental_system.MovieRentingSystem

duplicateZeros(int[]) - Method in class g1001_1100.s1089_duplicate_zeros.Solution

E

earliestAndLatest(int, int, int) - Method in class g1801_1900.s1900_the_earliest_and_latest_rounds_where_players_compete.Solution

earliestFullBloom(int[], int[]) - Method in class g2101_2200.s2136_earliest_possible_day_of_full_bloom.Solution

earliestSecondToMarkIndices(int[], int[]) - Method in class g3001_3100.s3048_earliest_second_to_mark_indices_i.Solution

earliestSecondToMarkIndices(int[], int[]) - Method in class g3001_3100.s3049_earliest_second_to_mark_indices_ii.Solution

eatenApples(int[], int[]) - Method in class g1701_1800.s1705_maximum_number_of_eaten_apples.Solution

edgeScore(int[]) - Method in class g2301_2400.s2374_node_with_highest_edge_score.Solution

eliminateMaximum(int[], int[]) - Method in class g1901_2000.s1921_eliminate_maximum_number_of_monsters.Solution

Employee - Class in com_github_leetcode

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

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

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

encode(String) - Method in class g0501_0600.s0535_encode_and_decode_tinyurl.Codec

encrypt(String) - Method in class g2201_2300.s2227_encrypt_and_decrypt_strings.Encrypter

Encrypter - Class in g2201_2300.s2227_encrypt_and_decrypt_strings

2227 - Encrypt and Decrypt Strings.

Encrypter(char[], String[], String[]) - Constructor for class g2201_2300.s2227_encrypt_and_decrypt_strings.Encrypter

end - Variable in class g0201_0300.s0212_word_search_ii.Tree

enQueue(int) - Method in class g0601_0700.s0622_design_circular_queue.MyCircularQueue

entityParser(String) - Method in class g1401_1500.s1410_html_entity_parser.Solution

equalFrequency(String) - Method in class g2401_2500.s2423_remove_letter_to_equalize_frequency.Solution

equalPairs(int[][]) - Method in class g2301_2400.s2352_equal_row_and_column_pairs.Solution

equalSubstring(String, String, int) - Method in class g1201_1300.s1208_get_equal_substrings_within_budget.Solution

equationsPossible(String[]) - Method in class g0901_1000.s0990_satisfiability_of_equality_equations.Solution

erase(int) - Method in class g1201_1300.s1206_design_skiplist.Skiplist

eraseOverlapIntervals(int[][]) - Method in class g0401_0500.s0435_non_overlapping_intervals.Solution

escapeGhosts(int[][], int[]) - Method in class g0701_0800.s0789_escape_the_ghosts.Solution

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

evaluate(String) - Method in class g0701_0800.s0736_parse_lisp_expression.Solution

evaluate(String, List<List<String>>) - Method in class g1801_1900.s1807_evaluate_the_bracket_pairs_of_a_string.Solution

evaluateTree(TreeNode) - Method in class g2301_2400.s2331_evaluate_boolean_binary_tree.Solution

even(IntConsumer) - Method in class g1101_1200.s1116_print_zero_even_odd.ZeroEvenOdd

evenOddBit(int) - Method in class g2501_2600.s2595_number_of_even_and_odd_bits.Solution

eventualSafeNodes(int[][]) - Method in class g0801_0900.s0802_find_eventual_safe_states.Solution

ExamRoom - Class in g0801_0900.s0855_exam_room

855 - Exam Room.

ExamRoom() - Constructor for class g0801_0900.s0855_exam_room.ExamRoom

ExamRoom(int) - Constructor for class g0801_0900.s0855_exam_room.ExamRoom

exclusiveTime(int, List<String>) - Method in class g0601_0700.s0636_exclusive_time_of_functions.Solution

executeInstructions(int, int[], String) - Method in class g2101_2200.s2120_execution_of_all_suffix_instructions_staying_in_a_grid.Solution

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

expressiveWords(String, String[]) - Method in class g0801_0900.s0809_expressive_words.Solution

F

f(int, int) - Method in interface g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation.Solution.CustomFunction

f(String, String) - Method in class g0701_0800.s0745_prefix_and_suffix_search.WordFilter

fairCandySwap(int[], int[]) - Method in class g0801_0900.s0888_fair_candy_swap.Solution

fallingSquares(int[][]) - Method in class g0601_0700.s0699_falling_squares.Solution

Fancy - Class in g1601_1700.s1622_fancy_sequence

1622 - Fancy Sequence.

Fancy() - Constructor for class g1601_1700.s1622_fancy_sequence.Fancy

fib(int) - Method in class g0501_0600.s0509_fibonacci_number.Solution

fillCups(int[]) - Method in class g2301_2400.s2335_minimum_amount_of_time_to_fill_cups.Solution

fillMap(String[], Map<String, Integer>) - Method in class g0501_0600.s0599_minimum_index_sum_of_two_lists.Solution

filterRestaurants(int[][], int, int, int) - Method in class g1301_1400.s1333_filter_restaurants_by_vegan_friendly_price_and_distance.Solution

finalPrices(int[]) - Method in class g1401_1500.s1475_final_prices_with_a_special_discount_in_a_shop.Solution

finalString(String) - Method in class g2801_2900.s2810_faulty_keyboard.Solution

finalValueAfterOperations(String[]) - Method in class g2001_2100.s2011_final_value_of_variable_after_performing_operations.Solution

find(int) - Method in class g1201_1300.s1261_find_elements_in_a_contaminated_binary_tree.FindElements

find(int) - Method in class g2301_2400.s2349_design_a_number_container_system.NumberContainers

find(int, int[]) - Method in class g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable.Solution

find132pattern(int[]) - Method in class g0401_0500.s0456_132_pattern.Solution

findAllConcatenatedWordsInADict(String[]) - Method in class g0401_0500.s0472_concatenated_words.Solution

findAllPeople(int, int[][], int) - Method in class g2001_2100.s2092_find_all_people_with_secret.Solution

findAllRecipes(String[], List<List<String>>, String[]) - Method in class g2101_2200.s2115_find_all_possible_recipes_from_given_supplies.Solution

findAnagrams(String, String) - Method in class g0401_0500.s0438_find_all_anagrams_in_a_string.Solution

findAndReplacePattern(String[], String) - Method in class g0801_0900.s0890_find_and_replace_pattern.Solution

findArray(int[]) - Method in class g2401_2500.s2433_find_the_original_array_of_prefix_xor.Solution

findBall(int[][]) - Method in class g1701_1800.s1706_where_will_the_ball_fall.Solution

findBestValue(int[], int) - Method in class g1201_1300.s1300_sum_of_mutated_array_closest_to_target.Solution

findBottomLeftValue(TreeNode) - Method in class g0501_0600.s0513_find_bottom_left_tree_value.Solution

findCenter(int[][]) - Method in class g1701_1800.s1791_find_center_of_star_graph.Solution

findChampion(int[][]) - Method in class g2901_3000.s2923_find_champion_i.Solution

findChampion(int, int[][]) - Method in class g2901_3000.s2924_find_champion_ii.Solution

findCheapestPrice(int, int[][], int, int, int) - Method in class g0701_0800.s0787_cheapest_flights_within_k_stops.Solution

findCircleNum(int[][]) - Method in class g0501_0600.s0547_number_of_provinces.Solution

findClosestElements(int[], int, int) - Method in class g0601_0700.s0658_find_k_closest_elements.Solution

findClosestNumber(int[]) - Method in class g2201_2300.s2239_find_closest_number_to_zero.Solution

findColumnWidth(int[][]) - Method in class g2601_2700.s2639_find_the_width_of_columns_of_a_grid.Solution

findComplement(int) - Method in class g0401_0500.s0476_number_complement.Solution

findContentChildren(int[], int[]) - Method in class g0401_0500.s0455_assign_cookies.Solution

findCriticalAndPseudoCriticalEdges(int, int[][]) - Method in class g1401_1500.s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree.Solution

findCrossingTime(int, int, int[][]) - Method in class g2501_2600.s2532_time_to_cross_a_bridge.Solution

findDelayedArrivalTime(int, int) - Method in class g2601_2700.s2651_calculate_delayed_arrival_time.Solution

findDiagonalOrder(int[][]) - Method in class g0401_0500.s0498_diagonal_traverse.Solution

findDiagonalOrder(List<List<Integer>>) - Method in class g1401_1500.s1424_diagonal_traverse_ii.Solution

findDifference(int[], int[]) - Method in class g2201_2300.s2215_find_the_difference_of_two_arrays.Solution

findDifferentBinaryString(String[]) - Method in class g1901_2000.s1980_find_unique_binary_string.Solution

findDisappearedNumbers(int[]) - Method in class g0401_0500.s0448_find_all_numbers_disappeared_in_an_array.Solution

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

findDuplicate(String[]) - Method in class g0601_0700.s0609_find_duplicate_file_in_system.Solution

findDuplicates(int[]) - Method in class g0401_0500.s0442_find_all_duplicates_in_an_array.Solution

findDuplicateSubtrees(TreeNode) - Method in class g0601_0700.s0652_find_duplicate_subtrees.Solution

FindElements - Class in g1201_1300.s1261_find_elements_in_a_contaminated_binary_tree

1261 - Find Elements in a Contaminated Binary Tree.

FindElements(TreeNode) - Constructor for class g1201_1300.s1261_find_elements_in_a_contaminated_binary_tree.FindElements

findErrorNums(int[]) - Method in class g0601_0700.s0645_set_mismatch.Solution

findEvenNumbers(int[]) - Method in class g2001_2100.s2094_finding_3_digit_even_numbers.Solution

findFarmland(int[][]) - Method in class g1901_2000.s1992_find_all_groups_of_farmland.Solution

findFinalValue(int[], int) - Method in class g2101_2200.s2154_keep_multiplying_found_values_by_two.Solution

findFrequentTreeSum(TreeNode) - Method in class g0501_0600.s0508_most_frequent_subtree_sum.Solution

findGCD(int[]) - Method in class g1901_2000.s1979_find_greatest_common_divisor_of_array.Solution

findGoodStrings(int, String, String, String) - Method in class g1301_1400.s1397_find_all_good_strings.Solution

findHighAccessEmployees(List<List<String>>) - Method in class g2901_3000.s2933_high_access_employees.Solution

findIndices(int[], int, int) - Method in class g2901_3000.s2903_find_indices_with_index_and_value_difference_i.Solution

findIndices(int[], int, int) - Method in class g2901_3000.s2905_find_indices_with_index_and_value_difference_ii.Solution

findingUsersActiveMinutes(int[][], int) - Method in class g1801_1900.s1817_finding_the_users_active_minutes.Solution

findInMountainArray(int, MountainArray) - Method in class g1001_1100.s1095_find_in_mountain_array.Solution

findIntegers(int) - Method in class g0501_0600.s0600_non_negative_integers_without_consecutive_ones.Solution

findIntersectionValues(int[], int[]) - Method in class g2901_3000.s2956_find_common_elements_between_two_arrays.Solution

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

findJudge(int, int[][]) - Method in class g0901_1000.s0997_find_the_town_judge.Solution

findKDistantIndices(int[], int, int) - Method in class g2101_2200.s2200_find_all_k_distant_indices_in_an_array.Solution

findKOr(int[], int) - Method in class g2901_3000.s2917_find_the_k_or_of_an_array.Solution

findKthBit(int, int) - Method in class g1501_1600.s1545_find_kth_bit_in_nth_binary_string.Solution

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

findKthNumber(int, int) - Method in class g0401_0500.s0440_k_th_smallest_in_lexicographical_order.Solution

findKthNumber(int, int, int) - Method in class g0601_0700.s0668_kth_smallest_number_in_multiplication_table.Solution

findKthPositive(int[], int) - Method in class g1501_1600.s1539_kth_missing_positive_number.Solution

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

findLatestStep(int[], int) - Method in class g1501_1600.s1562_find_latest_group_of_size_m.Solution

findLeastNumOfUniqueInts(int[], int) - Method in class g1401_1500.s1481_least_number_of_unique_integers_after_k_removals.Solution

findLength(int[], int[]) - Method in class g0701_0800.s0718_maximum_length_of_repeated_subarray.Solution

findLengthOfLCIS(int[]) - Method in class g0601_0700.s0674_longest_continuous_increasing_subsequence.Solution

findLengthOfShortestSubarray(int[]) - Method in class g1501_1600.s1574_shortest_subarray_to_be_removed_to_make_array_sorted.Solution

findLexSmallestString(String, int, int) - Method in class g1601_1700.s1625_lexicographically_smallest_string_after_applying_operations.Solution

findLHS(int[]) - Method in class g0501_0600.s0594_longest_harmonious_subsequence.Solution

findLonely(int[]) - Method in class g2101_2200.s2150_find_all_lonely_numbers_in_the_array.Solution

findLongest(String, List<String>[], Map<String, Integer>) - Method in class g1001_1100.s1048_longest_string_chain.Solution

findLongestChain(int[][]) - Method in class g0601_0700.s0646_maximum_length_of_pair_chain.Solution

findLongestWord(String, List<String>) - Method in class g0501_0600.s0524_longest_word_in_dictionary_through_deleting.Solution

findLucky(int[]) - Method in class g1301_1400.s1394_find_lucky_integer_in_an_array.Solution

findLUSlength(String[]) - Method in class g0501_0600.s0522_longest_uncommon_subsequence_ii.Solution

findLUSlength(String, String) - Method in class g0501_0600.s0521_longest_uncommon_subsequence_i.Solution

findMatrix(int[]) - Method in class g2601_2700.s2610_convert_an_array_into_a_2d_array_with_conditions.Solution

findMaxAverage(int[], int) - Method in class g0601_0700.s0643_maximum_average_subarray_i.Solution

findMaxConsecutiveOnes(int[]) - Method in class g0401_0500.s0485_max_consecutive_ones.Solution

findMaxFish(int[][]) - Method in class g2601_2700.s2658_maximum_number_of_fish_in_a_grid.Solution

findMaxForm(String[], int, int) - Method in class g0401_0500.s0474_ones_and_zeroes.Solution

findMaximizedCapital(int, int, int[], int[]) - Method in class g0501_0600.s0502_ipo.Solution

findMaximumElegance(int[][], int) - Method in class g2801_2900.s2813_maximum_elegance_of_a_k_length_subsequence.Solution

findMaximumLength(int[]) - Method in class g2901_3000.s2945_find_maximum_non_decreasing_array_length.Solution

findMaximumNumber(long, int) - Method in class g3001_3100.s3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k.Solution

findMaximumXOR(int[]) - Method in class g0401_0500.s0421_maximum_xor_of_two_numbers_in_an_array.Solution

findMaxK(int[]) - Method in class g2401_2500.s2441_largest_positive_integer_that_exists_with_its_negative.Solution

findMaxLength(int[]) - Method in class g0501_0600.s0525_contiguous_array.Solution

findMaxValueOfEquation(int[][], int) - Method in class g1401_1500.s1499_max_value_of_equation.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

findMiddleIndex(int[]) - Method in class g1901_2000.s1991_find_the_middle_index_in_array.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

findMinArrowShots(int[][]) - Method in class g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons.Solution

findMinDifference(List<String>) - Method in class g0501_0600.s0539_minimum_time_difference.Solution

findMinFibonacciNumbers(int) - Method in class g1401_1500.s1414_find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k.Solution

findMinHeightTrees(int, int[][]) - Method in class g0301_0400.s0310_minimum_height_trees.Solution

findMinimumOperations(String, String, String) - Method in class g2901_3000.s2937_make_three_strings_equal.Solution

findMinimumTime(int[][]) - Method in class g2501_2600.s2589_minimum_time_to_complete_all_tasks.Solution

findMinMoves(int[]) - Method in class g0501_0600.s0517_super_washing_machines.Solution

findMinStep(String, String) - Method in class g0401_0500.s0488_zuma_game.Solution

findMissingAndRepeatedValues(int[][]) - Method in class g2901_3000.s2965_find_missing_and_repeated_values.Solution

findMode(TreeNode) - Method in class g0501_0600.s0501_find_mode_in_binary_search_tree.Solution

findNonMinOrMax(int[]) - Method in class g2701_2800.s2733_neither_minimum_nor_maximum.Solution

findNthDigit(int) - Method in class g0301_0400.s0400_nth_digit.Solution

findNum(int, int[]) - Method in class g0701_0800.s0747_largest_number_at_least_twice_of_others.Solution

findNumberOfLIS(int[]) - Method in class g0601_0700.s0673_number_of_longest_increasing_subsequence.Solution

findNumbers(int[]) - Method in class g1201_1300.s1295_find_numbers_with_even_number_of_digits.Solution

findNumOfValidWords(String[], String[]) - Method in class g1101_1200.s1178_number_of_valid_words_for_each_puzzle.Solution

findOcurrences(String, String, String) - Method in class g1001_1100.s1078_occurrences_after_bigram.Solution

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

findOriginalArray(int[]) - Method in class g2001_2100.s2007_find_original_array_from_doubled_array.Solution

findPairs(int[], int) - Method in class g0501_0600.s0532_k_diff_pairs_in_an_array.Solution

findPaths(int, int, int, int, int) - Method in class g0501_0600.s0576_out_of_boundary_paths.Solution

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

findPeakGrid(int[][]) - Method in class g1901_2000.s1901_find_a_peak_element_ii.Solution

findPeaks(int[]) - Method in class g2901_3000.s2951_find_the_peaks.Solution

findPoisonedDuration(int[], int) - Method in class g0401_0500.s0495_teemo_attacking.Solution

findPrefixScore(int[]) - Method in class g2601_2700.s2640_find_the_score_of_all_prefixes_of_an_array.Solution

findPrimePairs(int) - Method in class g2701_2800.s2761_prime_pairs_with_target_sum.Solution

findRadius(int[], int[]) - Method in class g0401_0500.s0475_heaters.Solution

findRedundantConnection(int[][]) - Method in class g0601_0700.s0684_redundant_connection.Solution

findRedundantDirectedConnection(int[][]) - Method in class g0601_0700.s0685_redundant_connection_ii.Solution

findRelativeRanks(int[]) - Method in class g0501_0600.s0506_relative_ranks.Solution

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

findReplaceString(String, int[], String[], String[]) - Method in class g0801_0900.s0833_find_and_replace_in_string.Solution

findRestaurant(String[], String[]) - Method in class g0501_0600.s0599_minimum_index_sum_of_two_lists.Solution

findRightInterval(int[][]) - Method in class g0401_0500.s0436_find_right_interval.Solution

findRotateSteps(String, String) - Method in class g0501_0600.s0514_freedom_trail.Solution

findRotation(int[][], int[][]) - Method in class g1801_1900.s1886_determine_whether_matrix_can_be_obtained_by_rotation.Solution

findScore(int[]) - Method in class g2501_2600.s2593_find_score_of_an_array_after_marking_all_elements.Solution

findSecondMinimumValue(TreeNode) - Method in class g0601_0700.s0671_second_minimum_node_in_a_binary_tree.Solution

findSecretWord(String[], Solution.Master) - Method in class g0801_0900.s0843_guess_the_word.Solution

findShortestCycle(int, int[][]) - Method in class g2601_2700.s2608_shortest_cycle_in_a_graph.Solution

findShortestSubArray(int[]) - Method in class g0601_0700.s0697_degree_of_an_array.Solution

findSmallestInteger(int[], int) - Method in class g2501_2600.s2598_smallest_missing_non_negative_integer_after_operations.Solution

findSmallestSetOfVertices(int, List<List<Integer>>) - Method in class g1501_1600.s1557_minimum_number_of_vertices_to_reach_all_nodes.Solution

findSolution(Solution.CustomFunction, int) - Method in class g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation.Solution

findSpecialInteger(int[]) - Method in class g1201_1300.s1287_element_appearing_more_than_25_in_sorted_array.Solution

findSubarrays(int[]) - Method in class g2301_2400.s2395_find_subarrays_with_equal_sum.Solution

findSubsequences(int[]) - Method in class g0401_0500.s0491_increasing_subsequences.Solution

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

findSubstringInWraproundString(String) - Method in class g0401_0500.s0467_unique_substrings_in_wraparound_string.Solution

FindSumPairs - Class in g1801_1900.s1865_finding_pairs_with_a_certain_sum

1865 - Finding Pairs With a Certain Sum.

FindSumPairs(int[], int[]) - Constructor for class g1801_1900.s1865_finding_pairs_with_a_certain_sum.FindSumPairs

findTarget(TreeNode, int) - Method in class g0601_0700.s0653_two_sum_iv_input_is_a_bst.Solution

findTargetSumWays(int[], int) - Method in class g0401_0500.s0494_target_sum.Solution

findTheArrayConcVal(int[]) - Method in class g2501_2600.s2562_find_the_array_concatenation_value.Solution

findTheCity(int, int[][], int) - Method in class g1301_1400.s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance.Solution

findTheDifference(String, String) - Method in class g0301_0400.s0389_find_the_difference.Solution

findTheDistanceValue(int[], int[], int) - Method in class g1301_1400.s1385_find_the_distance_value_between_two_arrays.Solution

findTheLongestBalancedSubstring(String) - Method in class g2601_2700.s2609_find_the_longest_balanced_substring_of_a_binary_string.Solution

findTheLongestSubstring(String) - Method in class g1301_1400.s1371_find_the_longest_substring_containing_vowels_in_even_counts.Solution

findThePrefixCommonArray(int[], int[]) - Method in class g2601_2700.s2657_find_the_prefix_common_array_of_two_arrays.Solution

findTheString(int[][]) - Method in class g2501_2600.s2573_find_the_string_with_lcp.Solution

findTheWinner(int, int) - Method in class g1801_1900.s1823_find_the_winner_of_the_circular_game.Solution

findTilt(TreeNode) - Method in class g0501_0600.s0563_binary_tree_tilt.Solution

findUnsortedSubarray(int[]) - Method in class g0501_0600.s0581_shortest_unsorted_continuous_subarray.Solution

findValidSplit(int[]) - Method in class g2501_2600.s2584_split_the_array_to_make_coprime_products.Solution

findValueOfPartition(int[]) - Method in class g2701_2800.s2740_find_the_value_of_the_partition.Solution

findWinners(int[][]) - Method in class g2201_2300.s2225_find_players_with_zero_or_one_losses.Solution

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

findWords(String[]) - Method in class g0401_0500.s0500_keyboard_row.Solution

findWordsContaining(String[], char) - Method in class g2901_3000.s2942_find_words_containing_character.Solution

first(Runnable) - Method in class g1101_1200.s1114_print_in_order.Foo

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

firstCompleteIndex(int[], int[][]) - Method in class g2601_2700.s2661_first_completely_painted_row_or_column.Solution

firstDayBeenInAllRooms(int[]) - Method in class g1901_2000.s1997_first_day_where_you_have_been_in_all_the_rooms.Solution

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

firstPalindrome(String[]) - Method in class g2101_2200.s2108_find_first_palindromic_string_in_the_array.Solution

firstUniqChar(String) - Method in class g0301_0400.s0387_first_unique_character_in_a_string.Solution

fix(int) - Method in class g2101_2200.s2166_design_bitset.Bitset

fizz(Runnable) - Method in class g1101_1200.s1195_fizz_buzz_multithreaded.FizzBuzz

fizzbuzz(Runnable) - Method in class g1101_1200.s1195_fizz_buzz_multithreaded.FizzBuzz

fizzBuzz(int) - Method in class g0401_0500.s0412_fizz_buzz.Solution

FizzBuzz - Class in g1101_1200.s1195_fizz_buzz_multithreaded

1195 - Fizz Buzz Multithreaded.

FizzBuzz(int) - Constructor for class g1101_1200.s1195_fizz_buzz_multithreaded.FizzBuzz

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

flatten(Node) - Method in class g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Solution

flip() - Method in class g0501_0600.s0519_random_flip_matrix.Solution

flip() - Method in class g2101_2200.s2166_design_bitset.Bitset

flipAndInvertImage(int[][]) - Method in class g0801_0900.s0832_flipping_an_image.Solution

flipEquiv(TreeNode, TreeNode) - Method in class g0901_1000.s0951_flip_equivalent_binary_trees.Solution

flipgame(int[], int[]) - Method in class g0801_0900.s0822_card_flipping_game.Solution

flipLights(int, int) - Method in class g0601_0700.s0672_bulb_switcher_ii.Solution

flipMatchVoyage(TreeNode, int[]) - Method in class g0901_1000.s0971_flip_binary_tree_to_match_preorder_traversal.Solution

floodFill(int[][], int, int, int) - Method in class g0701_0800.s0733_flood_fill.Solution

flowerGame(long, long) - Method in class g3001_3100.s3021_alice_and_bob_playing_flower_game.Solution

follow(int, int) - Method in class g0301_0400.s0355_design_twitter.Twitter

foo(Runnable) - Method in class g1101_1200.s1115_print_foobar_alternately.FooBar

Foo - Class in g1101_1200.s1114_print_in_order

1114 - Print in Order.

Foo() - Constructor for class g1101_1200.s1114_print_in_order.Foo

FooBar - Class in g1101_1200.s1115_print_foobar_alternately

1115 - Print FooBar Alternately.

FooBar(int) - Constructor for class g1101_1200.s1115_print_foobar_alternately.FooBar

FoodRatings - Class in g2301_2400.s2353_design_a_food_rating_system

2353 - Design a Food Rating System.

FoodRatings(String[], String[], int[]) - Constructor for class g2301_2400.s2353_design_a_food_rating_system.FoodRatings

forward(int) - Method in class g1401_1500.s1472_design_browser_history.BrowserHistory

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

fourSumCount(int[], int[], int[], int[]) - Method in class g0401_0500.s0454_4sum_ii.Solution

fractionAddition(String) - Method in class g0501_0600.s0592_fraction_addition_and_subtraction.Solution

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

free(int) - Method in class g2501_2600.s2502_design_memory_allocator.Allocator

freqAlphabets(String) - Method in class g1301_1400.s1309_decrypt_string_from_alphabet_to_integer_mapping.Solution

FreqStack - Class in g0801_0900.s0895_maximum_frequency_stack

895 - Maximum Frequency Stack.

FreqStack() - Constructor for class g0801_0900.s0895_maximum_frequency_stack.FreqStack

frequencySort(int[]) - Method in class g1601_1700.s1636_sort_array_by_increasing_frequency.Solution

frequencySort(String) - Method in class g0401_0500.s0451_sort_characters_by_frequency.Solution

FrequencyTracker - Class in g2601_2700.s2671_frequency_tracker

2671 - Frequency Tracker.

FrequencyTracker() - Constructor for class g2601_2700.s2671_frequency_tracker.FrequencyTracker

friendRequests(int, int[][], int[][]) - Method in class g2001_2100.s2076_process_restricted_friend_requests.Solution

frogPosition(int, int[][], int, int) - Method in class g1301_1400.s1377_frog_position_after_t_seconds.Solution

front() - Method in class g0601_0700.s0622_design_circular_queue.MyCircularQueue

FrontMiddleBackQueue - Class in g1601_1700.s1670_design_front_middle_back_queue

1670 - Design Front Middle Back Queue.

FrontMiddleBackQueue() - Constructor for class g1601_1700.s1670_design_front_middle_back_queue.FrontMiddleBackQueue

fullBloomFlowers(int[][], int[]) - Method in class g2201_2300.s2251_number_of_flowers_in_full_bloom.Solution

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

furthestBuilding(int[], int, int) - Method in class g1601_1700.s1642_furthest_building_you_can_reach.Solution

furthestDistanceFromOrigin(String) - Method in class g2801_2900.s2833_furthest_point_from_origin.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_3sum - package g0001_0100.s0015_3sum

g0001_0100.s0016_3sum_closest - package g0001_0100.s0016_3sum_closest

g0001_0100.s0017_letter_combinations_of_a_phone_number - package g0001_0100.s0017_letter_combinations_of_a_phone_number

g0001_0100.s0018_4sum - package g0001_0100.s0018_4sum

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_find_the_index_of_the_first_occurrence_in_a_string - package g0001_0100.s0028_find_the_index_of_the_first_occurrence_in_a_string

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_multiply_strings - package g0001_0100.s0043_multiply_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_word_search - package g0001_0100.s0079_word_search

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.s0235_lowest_common_ancestor_of_a_binary_search_tree - package g0201_0300.s0235_lowest_common_ancestor_of_a_binary_search_tree

g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree - package g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree

g0201_0300.s0237_delete_node_in_a_linked_list - package g0201_0300.s0237_delete_node_in_a_linked_list

g0201_0300.s0238_product_of_array_except_self - package g0201_0300.s0238_product_of_array_except_self

g0201_0300.s0239_sliding_window_maximum - package g0201_0300.s0239_sliding_window_maximum

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.s0301_remove_invalid_parentheses - package g0301_0400.s0301_remove_invalid_parentheses

g0301_0400.s0303_range_sum_query_immutable - package g0301_0400.s0303_range_sum_query_immutable

g0301_0400.s0304_range_sum_query_2d_immutable - package g0301_0400.s0304_range_sum_query_2d_immutable

g0301_0400.s0306_additive_number - package g0301_0400.s0306_additive_number

g0301_0400.s0307_range_sum_query_mutable - package g0301_0400.s0307_range_sum_query_mutable

g0301_0400.s0309_best_time_to_buy_and_sell_stock_with_cooldown - package g0301_0400.s0309_best_time_to_buy_and_sell_stock_with_cooldown

g0301_0400.s0310_minimum_height_trees - package g0301_0400.s0310_minimum_height_trees

g0301_0400.s0312_burst_balloons - package g0301_0400.s0312_burst_balloons

g0301_0400.s0313_super_ugly_number - package g0301_0400.s0313_super_ugly_number

g0301_0400.s0315_count_of_smaller_numbers_after_self - package g0301_0400.s0315_count_of_smaller_numbers_after_self

g0301_0400.s0316_remove_duplicate_letters - package g0301_0400.s0316_remove_duplicate_letters

g0301_0400.s0318_maximum_product_of_word_lengths - package g0301_0400.s0318_maximum_product_of_word_lengths

g0301_0400.s0319_bulb_switcher - package g0301_0400.s0319_bulb_switcher

g0301_0400.s0321_create_maximum_number - package g0301_0400.s0321_create_maximum_number

g0301_0400.s0322_coin_change - package g0301_0400.s0322_coin_change

g0301_0400.s0324_wiggle_sort_ii - package g0301_0400.s0324_wiggle_sort_ii

g0301_0400.s0326_power_of_three - package g0301_0400.s0326_power_of_three

g0301_0400.s0327_count_of_range_sum - package g0301_0400.s0327_count_of_range_sum

g0301_0400.s0328_odd_even_linked_list - package g0301_0400.s0328_odd_even_linked_list

g0301_0400.s0329_longest_increasing_path_in_a_matrix - package g0301_0400.s0329_longest_increasing_path_in_a_matrix

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

g0301_0400.s0335_self_crossing - package g0301_0400.s0335_self_crossing

g0301_0400.s0336_palindrome_pairs - package g0301_0400.s0336_palindrome_pairs

g0301_0400.s0337_house_robber_iii - package g0301_0400.s0337_house_robber_iii

g0301_0400.s0338_counting_bits - package g0301_0400.s0338_counting_bits

g0301_0400.s0341_flatten_nested_list_iterator - package g0301_0400.s0341_flatten_nested_list_iterator

g0301_0400.s0342_power_of_four - package g0301_0400.s0342_power_of_four

g0301_0400.s0343_integer_break - package g0301_0400.s0343_integer_break

g0301_0400.s0344_reverse_string - package g0301_0400.s0344_reverse_string

g0301_0400.s0345_reverse_vowels_of_a_string - package g0301_0400.s0345_reverse_vowels_of_a_string

g0301_0400.s0347_top_k_frequent_elements - package g0301_0400.s0347_top_k_frequent_elements

g0301_0400.s0349_intersection_of_two_arrays - package g0301_0400.s0349_intersection_of_two_arrays

g0301_0400.s0350_intersection_of_two_arrays_ii - package g0301_0400.s0350_intersection_of_two_arrays_ii

g0301_0400.s0352_data_stream_as_disjoint_intervals - package g0301_0400.s0352_data_stream_as_disjoint_intervals

g0301_0400.s0354_russian_doll_envelopes - package g0301_0400.s0354_russian_doll_envelopes

g0301_0400.s0355_design_twitter - package g0301_0400.s0355_design_twitter

g0301_0400.s0357_count_numbers_with_unique_digits - package g0301_0400.s0357_count_numbers_with_unique_digits

g0301_0400.s0363_max_sum_of_rectangle_no_larger_than_k - package g0301_0400.s0363_max_sum_of_rectangle_no_larger_than_k

g0301_0400.s0365_water_and_jug_problem - package g0301_0400.s0365_water_and_jug_problem

g0301_0400.s0367_valid_perfect_square - package g0301_0400.s0367_valid_perfect_square

g0301_0400.s0368_largest_divisible_subset - package g0301_0400.s0368_largest_divisible_subset

g0301_0400.s0371_sum_of_two_integers - package g0301_0400.s0371_sum_of_two_integers

g0301_0400.s0372_super_pow - package g0301_0400.s0372_super_pow

g0301_0400.s0373_find_k_pairs_with_smallest_sums - package g0301_0400.s0373_find_k_pairs_with_smallest_sums

g0301_0400.s0374_guess_number_higher_or_lower - package g0301_0400.s0374_guess_number_higher_or_lower

g0301_0400.s0375_guess_number_higher_or_lower_ii - package g0301_0400.s0375_guess_number_higher_or_lower_ii

g0301_0400.s0376_wiggle_subsequence - package g0301_0400.s0376_wiggle_subsequence

g0301_0400.s0377_combination_sum_iv - package g0301_0400.s0377_combination_sum_iv

g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix - package g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix

g0301_0400.s0380_insert_delete_getrandom_o1 - package g0301_0400.s0380_insert_delete_getrandom_o1

g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed - package g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed

g0301_0400.s0382_linked_list_random_node - package g0301_0400.s0382_linked_list_random_node

g0301_0400.s0383_ransom_note - package g0301_0400.s0383_ransom_note

g0301_0400.s0384_shuffle_an_array - package g0301_0400.s0384_shuffle_an_array

g0301_0400.s0385_mini_parser - package g0301_0400.s0385_mini_parser

g0301_0400.s0386_lexicographical_numbers - package g0301_0400.s0386_lexicographical_numbers

g0301_0400.s0387_first_unique_character_in_a_string - package g0301_0400.s0387_first_unique_character_in_a_string

g0301_0400.s0388_longest_absolute_file_path - package g0301_0400.s0388_longest_absolute_file_path

g0301_0400.s0389_find_the_difference - package g0301_0400.s0389_find_the_difference

g0301_0400.s0390_elimination_game - package g0301_0400.s0390_elimination_game

g0301_0400.s0391_perfect_rectangle - package g0301_0400.s0391_perfect_rectangle

g0301_0400.s0392_is_subsequence - package g0301_0400.s0392_is_subsequence

g0301_0400.s0393_utf_8_validation - package g0301_0400.s0393_utf_8_validation

g0301_0400.s0394_decode_string - package g0301_0400.s0394_decode_string

g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters - package g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters

g0301_0400.s0396_rotate_function - package g0301_0400.s0396_rotate_function

g0301_0400.s0397_integer_replacement - package g0301_0400.s0397_integer_replacement

g0301_0400.s0398_random_pick_index - package g0301_0400.s0398_random_pick_index

g0301_0400.s0399_evaluate_division - package g0301_0400.s0399_evaluate_division

g0301_0400.s0400_nth_digit - package g0301_0400.s0400_nth_digit

g0401_0500.s0401_binary_watch - package g0401_0500.s0401_binary_watch

g0401_0500.s0402_remove_k_digits - package g0401_0500.s0402_remove_k_digits

g0401_0500.s0403_frog_jump - package g0401_0500.s0403_frog_jump

g0401_0500.s0404_sum_of_left_leaves - package g0401_0500.s0404_sum_of_left_leaves

g0401_0500.s0405_convert_a_number_to_hexadecimal - package g0401_0500.s0405_convert_a_number_to_hexadecimal

g0401_0500.s0406_queue_reconstruction_by_height - package g0401_0500.s0406_queue_reconstruction_by_height

g0401_0500.s0407_trapping_rain_water_ii - package g0401_0500.s0407_trapping_rain_water_ii

g0401_0500.s0409_longest_palindrome - package g0401_0500.s0409_longest_palindrome

g0401_0500.s0410_split_array_largest_sum - package g0401_0500.s0410_split_array_largest_sum

g0401_0500.s0412_fizz_buzz - package g0401_0500.s0412_fizz_buzz

g0401_0500.s0413_arithmetic_slices - package g0401_0500.s0413_arithmetic_slices

g0401_0500.s0414_third_maximum_number - package g0401_0500.s0414_third_maximum_number

g0401_0500.s0415_add_strings - package g0401_0500.s0415_add_strings

g0401_0500.s0416_partition_equal_subset_sum - package g0401_0500.s0416_partition_equal_subset_sum

g0401_0500.s0417_pacific_atlantic_water_flow - package g0401_0500.s0417_pacific_atlantic_water_flow

g0401_0500.s0419_battleships_in_a_board - package g0401_0500.s0419_battleships_in_a_board

g0401_0500.s0420_strong_password_checker - package g0401_0500.s0420_strong_password_checker

g0401_0500.s0421_maximum_xor_of_two_numbers_in_an_array - package g0401_0500.s0421_maximum_xor_of_two_numbers_in_an_array

g0401_0500.s0423_reconstruct_original_digits_from_english - package g0401_0500.s0423_reconstruct_original_digits_from_english

g0401_0500.s0424_longest_repeating_character_replacement - package g0401_0500.s0424_longest_repeating_character_replacement

g0401_0500.s0427_construct_quad_tree - package g0401_0500.s0427_construct_quad_tree

g0401_0500.s0429_n_ary_tree_level_order_traversal - package g0401_0500.s0429_n_ary_tree_level_order_traversal

g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list - package g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list

g0401_0500.s0432_all_oone_data_structure - package g0401_0500.s0432_all_oone_data_structure

g0401_0500.s0433_minimum_genetic_mutation - package g0401_0500.s0433_minimum_genetic_mutation

g0401_0500.s0434_number_of_segments_in_a_string - package g0401_0500.s0434_number_of_segments_in_a_string

g0401_0500.s0435_non_overlapping_intervals - package g0401_0500.s0435_non_overlapping_intervals

g0401_0500.s0436_find_right_interval - package g0401_0500.s0436_find_right_interval

g0401_0500.s0437_path_sum_iii - package g0401_0500.s0437_path_sum_iii

g0401_0500.s0438_find_all_anagrams_in_a_string - package g0401_0500.s0438_find_all_anagrams_in_a_string

g0401_0500.s0440_k_th_smallest_in_lexicographical_order - package g0401_0500.s0440_k_th_smallest_in_lexicographical_order

g0401_0500.s0441_arranging_coins - package g0401_0500.s0441_arranging_coins

g0401_0500.s0442_find_all_duplicates_in_an_array - package g0401_0500.s0442_find_all_duplicates_in_an_array

g0401_0500.s0443_string_compression - package g0401_0500.s0443_string_compression

g0401_0500.s0445_add_two_numbers_ii - package g0401_0500.s0445_add_two_numbers_ii

g0401_0500.s0446_arithmetic_slices_ii_subsequence - package g0401_0500.s0446_arithmetic_slices_ii_subsequence

g0401_0500.s0447_number_of_boomerangs - package g0401_0500.s0447_number_of_boomerangs

g0401_0500.s0448_find_all_numbers_disappeared_in_an_array - package g0401_0500.s0448_find_all_numbers_disappeared_in_an_array

g0401_0500.s0449_serialize_and_deserialize_bst - package g0401_0500.s0449_serialize_and_deserialize_bst

g0401_0500.s0450_delete_node_in_a_bst - package g0401_0500.s0450_delete_node_in_a_bst

g0401_0500.s0451_sort_characters_by_frequency - package g0401_0500.s0451_sort_characters_by_frequency

g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons - package g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons

g0401_0500.s0453_minimum_moves_to_equal_array_elements - package g0401_0500.s0453_minimum_moves_to_equal_array_elements

g0401_0500.s0454_4sum_ii - package g0401_0500.s0454_4sum_ii

g0401_0500.s0455_assign_cookies - package g0401_0500.s0455_assign_cookies

g0401_0500.s0456_132_pattern - package g0401_0500.s0456_132_pattern

g0401_0500.s0457_circular_array_loop - package g0401_0500.s0457_circular_array_loop

g0401_0500.s0458_poor_pigs - package g0401_0500.s0458_poor_pigs

g0401_0500.s0459_repeated_substring_pattern - package g0401_0500.s0459_repeated_substring_pattern

g0401_0500.s0460_lfu_cache - package g0401_0500.s0460_lfu_cache

g0401_0500.s0461_hamming_distance - package g0401_0500.s0461_hamming_distance

g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii - package g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii

g0401_0500.s0463_island_perimeter - package g0401_0500.s0463_island_perimeter

g0401_0500.s0464_can_i_win - package g0401_0500.s0464_can_i_win

g0401_0500.s0466_count_the_repetitions - package g0401_0500.s0466_count_the_repetitions

g0401_0500.s0467_unique_substrings_in_wraparound_string - package g0401_0500.s0467_unique_substrings_in_wraparound_string

g0401_0500.s0468_validate_ip_address - package g0401_0500.s0468_validate_ip_address

g0401_0500.s0470_implement_rand10_using_rand7 - package g0401_0500.s0470_implement_rand10_using_rand7

g0401_0500.s0472_concatenated_words - package g0401_0500.s0472_concatenated_words

g0401_0500.s0473_matchsticks_to_square - package g0401_0500.s0473_matchsticks_to_square

g0401_0500.s0474_ones_and_zeroes - package g0401_0500.s0474_ones_and_zeroes

g0401_0500.s0475_heaters - package g0401_0500.s0475_heaters

g0401_0500.s0476_number_complement - package g0401_0500.s0476_number_complement

g0401_0500.s0477_total_hamming_distance - package g0401_0500.s0477_total_hamming_distance

g0401_0500.s0478_generate_random_point_in_a_circle - package g0401_0500.s0478_generate_random_point_in_a_circle

g0401_0500.s0479_largest_palindrome_product - package g0401_0500.s0479_largest_palindrome_product

g0401_0500.s0480_sliding_window_median - package g0401_0500.s0480_sliding_window_median

g0401_0500.s0481_magical_string - package g0401_0500.s0481_magical_string

g0401_0500.s0482_license_key_formatting - package g0401_0500.s0482_license_key_formatting

g0401_0500.s0483_smallest_good_base - package g0401_0500.s0483_smallest_good_base

g0401_0500.s0485_max_consecutive_ones - package g0401_0500.s0485_max_consecutive_ones

g0401_0500.s0486_predict_the_winner - package g0401_0500.s0486_predict_the_winner

g0401_0500.s0488_zuma_game - package g0401_0500.s0488_zuma_game

g0401_0500.s0491_increasing_subsequences - package g0401_0500.s0491_increasing_subsequences

g0401_0500.s0492_construct_the_rectangle - package g0401_0500.s0492_construct_the_rectangle

g0401_0500.s0493_reverse_pairs - package g0401_0500.s0493_reverse_pairs

g0401_0500.s0494_target_sum - package g0401_0500.s0494_target_sum

g0401_0500.s0495_teemo_attacking - package g0401_0500.s0495_teemo_attacking

g0401_0500.s0496_next_greater_element_i - package g0401_0500.s0496_next_greater_element_i

g0401_0500.s0497_random_point_in_non_overlapping_rectangles - package g0401_0500.s0497_random_point_in_non_overlapping_rectangles

g0401_0500.s0498_diagonal_traverse - package g0401_0500.s0498_diagonal_traverse

g0401_0500.s0500_keyboard_row - package g0401_0500.s0500_keyboard_row

g0501_0600.s0501_find_mode_in_binary_search_tree - package g0501_0600.s0501_find_mode_in_binary_search_tree

g0501_0600.s0502_ipo - package g0501_0600.s0502_ipo

g0501_0600.s0503_next_greater_element_ii - package g0501_0600.s0503_next_greater_element_ii

g0501_0600.s0504_base_7 - package g0501_0600.s0504_base_7

g0501_0600.s0506_relative_ranks - package g0501_0600.s0506_relative_ranks

g0501_0600.s0507_perfect_number - package g0501_0600.s0507_perfect_number

g0501_0600.s0508_most_frequent_subtree_sum - package g0501_0600.s0508_most_frequent_subtree_sum

g0501_0600.s0509_fibonacci_number - package g0501_0600.s0509_fibonacci_number

g0501_0600.s0513_find_bottom_left_tree_value - package g0501_0600.s0513_find_bottom_left_tree_value

g0501_0600.s0514_freedom_trail - package g0501_0600.s0514_freedom_trail

g0501_0600.s0515_find_largest_value_in_each_tree_row - package g0501_0600.s0515_find_largest_value_in_each_tree_row

g0501_0600.s0516_longest_palindromic_subsequence - package g0501_0600.s0516_longest_palindromic_subsequence

g0501_0600.s0517_super_washing_machines - package g0501_0600.s0517_super_washing_machines

g0501_0600.s0518_coin_change_2 - package g0501_0600.s0518_coin_change_2

g0501_0600.s0519_random_flip_matrix - package g0501_0600.s0519_random_flip_matrix

g0501_0600.s0520_detect_capital - package g0501_0600.s0520_detect_capital

g0501_0600.s0521_longest_uncommon_subsequence_i - package g0501_0600.s0521_longest_uncommon_subsequence_i

g0501_0600.s0522_longest_uncommon_subsequence_ii - package g0501_0600.s0522_longest_uncommon_subsequence_ii

g0501_0600.s0523_continuous_subarray_sum - package g0501_0600.s0523_continuous_subarray_sum

g0501_0600.s0524_longest_word_in_dictionary_through_deleting - package g0501_0600.s0524_longest_word_in_dictionary_through_deleting

g0501_0600.s0525_contiguous_array - package g0501_0600.s0525_contiguous_array

g0501_0600.s0526_beautiful_arrangement - package g0501_0600.s0526_beautiful_arrangement

g0501_0600.s0528_random_pick_with_weight - package g0501_0600.s0528_random_pick_with_weight

g0501_0600.s0529_minesweeper - package g0501_0600.s0529_minesweeper

g0501_0600.s0530_minimum_absolute_difference_in_bst - package g0501_0600.s0530_minimum_absolute_difference_in_bst

g0501_0600.s0532_k_diff_pairs_in_an_array - package g0501_0600.s0532_k_diff_pairs_in_an_array

g0501_0600.s0535_encode_and_decode_tinyurl - package g0501_0600.s0535_encode_and_decode_tinyurl

g0501_0600.s0537_complex_number_multiplication - package g0501_0600.s0537_complex_number_multiplication

g0501_0600.s0538_convert_bst_to_greater_tree - package g0501_0600.s0538_convert_bst_to_greater_tree

g0501_0600.s0539_minimum_time_difference - package g0501_0600.s0539_minimum_time_difference

g0501_0600.s0540_single_element_in_a_sorted_array - package g0501_0600.s0540_single_element_in_a_sorted_array

g0501_0600.s0541_reverse_string_ii - package g0501_0600.s0541_reverse_string_ii

g0501_0600.s0542_01_matrix - package g0501_0600.s0542_01_matrix

g0501_0600.s0543_diameter_of_binary_tree - package g0501_0600.s0543_diameter_of_binary_tree

g0501_0600.s0546_remove_boxes - package g0501_0600.s0546_remove_boxes

g0501_0600.s0547_number_of_provinces - package g0501_0600.s0547_number_of_provinces

g0501_0600.s0551_student_attendance_record_i - package g0501_0600.s0551_student_attendance_record_i

g0501_0600.s0552_student_attendance_record_ii - package g0501_0600.s0552_student_attendance_record_ii

g0501_0600.s0553_optimal_division - package g0501_0600.s0553_optimal_division

g0501_0600.s0554_brick_wall - package g0501_0600.s0554_brick_wall

g0501_0600.s0556_next_greater_element_iii - package g0501_0600.s0556_next_greater_element_iii

g0501_0600.s0557_reverse_words_in_a_string_iii - package g0501_0600.s0557_reverse_words_in_a_string_iii

g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees - package g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees

g0501_0600.s0559_maximum_depth_of_n_ary_tree - package g0501_0600.s0559_maximum_depth_of_n_ary_tree

g0501_0600.s0560_subarray_sum_equals_k - package g0501_0600.s0560_subarray_sum_equals_k

g0501_0600.s0561_array_partition_i - package g0501_0600.s0561_array_partition_i

g0501_0600.s0563_binary_tree_tilt - package g0501_0600.s0563_binary_tree_tilt

g0501_0600.s0564_find_the_closest_palindrome - package g0501_0600.s0564_find_the_closest_palindrome

g0501_0600.s0565_array_nesting - package g0501_0600.s0565_array_nesting

g0501_0600.s0566_reshape_the_matrix - package g0501_0600.s0566_reshape_the_matrix

g0501_0600.s0567_permutation_in_string - package g0501_0600.s0567_permutation_in_string

g0501_0600.s0572_subtree_of_another_tree - package g0501_0600.s0572_subtree_of_another_tree

g0501_0600.s0575_distribute_candies - package g0501_0600.s0575_distribute_candies

g0501_0600.s0576_out_of_boundary_paths - package g0501_0600.s0576_out_of_boundary_paths

g0501_0600.s0581_shortest_unsorted_continuous_subarray - package g0501_0600.s0581_shortest_unsorted_continuous_subarray

g0501_0600.s0583_delete_operation_for_two_strings - package g0501_0600.s0583_delete_operation_for_two_strings

g0501_0600.s0587_erect_the_fence - package g0501_0600.s0587_erect_the_fence

g0501_0600.s0589_n_ary_tree_preorder_traversal - package g0501_0600.s0589_n_ary_tree_preorder_traversal

g0501_0600.s0590_n_ary_tree_postorder_traversal - package g0501_0600.s0590_n_ary_tree_postorder_traversal

g0501_0600.s0591_tag_validator - package g0501_0600.s0591_tag_validator

g0501_0600.s0592_fraction_addition_and_subtraction - package g0501_0600.s0592_fraction_addition_and_subtraction

g0501_0600.s0593_valid_square - package g0501_0600.s0593_valid_square

g0501_0600.s0594_longest_harmonious_subsequence - package g0501_0600.s0594_longest_harmonious_subsequence

g0501_0600.s0598_range_addition_ii - package g0501_0600.s0598_range_addition_ii

g0501_0600.s0599_minimum_index_sum_of_two_lists - package g0501_0600.s0599_minimum_index_sum_of_two_lists

g0501_0600.s0600_non_negative_integers_without_consecutive_ones - package g0501_0600.s0600_non_negative_integers_without_consecutive_ones

g0601_0700.s0605_can_place_flowers - package g0601_0700.s0605_can_place_flowers

g0601_0700.s0606_construct_string_from_binary_tree - package g0601_0700.s0606_construct_string_from_binary_tree

g0601_0700.s0609_find_duplicate_file_in_system - package g0601_0700.s0609_find_duplicate_file_in_system

g0601_0700.s0611_valid_triangle_number - package g0601_0700.s0611_valid_triangle_number

g0601_0700.s0617_merge_two_binary_trees - package g0601_0700.s0617_merge_two_binary_trees

g0601_0700.s0621_task_scheduler - package g0601_0700.s0621_task_scheduler

g0601_0700.s0622_design_circular_queue - package g0601_0700.s0622_design_circular_queue

g0601_0700.s0623_add_one_row_to_tree - package g0601_0700.s0623_add_one_row_to_tree

g0601_0700.s0628_maximum_product_of_three_numbers - package g0601_0700.s0628_maximum_product_of_three_numbers

g0601_0700.s0629_k_inverse_pairs_array - package g0601_0700.s0629_k_inverse_pairs_array

g0601_0700.s0630_course_schedule_iii - package g0601_0700.s0630_course_schedule_iii

g0601_0700.s0632_smallest_range_covering_elements_from_k_lists - package g0601_0700.s0632_smallest_range_covering_elements_from_k_lists

g0601_0700.s0633_sum_of_square_numbers - package g0601_0700.s0633_sum_of_square_numbers

g0601_0700.s0636_exclusive_time_of_functions - package g0601_0700.s0636_exclusive_time_of_functions

g0601_0700.s0637_average_of_levels_in_binary_tree - package g0601_0700.s0637_average_of_levels_in_binary_tree

g0601_0700.s0638_shopping_offers - package g0601_0700.s0638_shopping_offers

g0601_0700.s0639_decode_ways_ii - package g0601_0700.s0639_decode_ways_ii

g0601_0700.s0640_solve_the_equation - package g0601_0700.s0640_solve_the_equation

g0601_0700.s0641_design_circular_deque - package g0601_0700.s0641_design_circular_deque

g0601_0700.s0643_maximum_average_subarray_i - package g0601_0700.s0643_maximum_average_subarray_i

g0601_0700.s0645_set_mismatch - package g0601_0700.s0645_set_mismatch

g0601_0700.s0646_maximum_length_of_pair_chain - package g0601_0700.s0646_maximum_length_of_pair_chain

g0601_0700.s0647_palindromic_substrings - package g0601_0700.s0647_palindromic_substrings

g0601_0700.s0648_replace_words - package g0601_0700.s0648_replace_words

g0601_0700.s0649_dota2_senate - package g0601_0700.s0649_dota2_senate

g0601_0700.s0650_2_keys_keyboard - package g0601_0700.s0650_2_keys_keyboard

g0601_0700.s0652_find_duplicate_subtrees - package g0601_0700.s0652_find_duplicate_subtrees

g0601_0700.s0653_two_sum_iv_input_is_a_bst - package g0601_0700.s0653_two_sum_iv_input_is_a_bst

g0601_0700.s0654_maximum_binary_tree - package g0601_0700.s0654_maximum_binary_tree

g0601_0700.s0655_print_binary_tree - package g0601_0700.s0655_print_binary_tree

g0601_0700.s0657_robot_return_to_origin - package g0601_0700.s0657_robot_return_to_origin

g0601_0700.s0658_find_k_closest_elements - package g0601_0700.s0658_find_k_closest_elements

g0601_0700.s0659_split_array_into_consecutive_subsequences - package g0601_0700.s0659_split_array_into_consecutive_subsequences

g0601_0700.s0661_image_smoother - package g0601_0700.s0661_image_smoother

g0601_0700.s0662_maximum_width_of_binary_tree - package g0601_0700.s0662_maximum_width_of_binary_tree

g0601_0700.s0664_strange_printer - package g0601_0700.s0664_strange_printer

g0601_0700.s0665_non_decreasing_array - package g0601_0700.s0665_non_decreasing_array

g0601_0700.s0667_beautiful_arrangement_ii - package g0601_0700.s0667_beautiful_arrangement_ii

g0601_0700.s0668_kth_smallest_number_in_multiplication_table - package g0601_0700.s0668_kth_smallest_number_in_multiplication_table

g0601_0700.s0669_trim_a_binary_search_tree - package g0601_0700.s0669_trim_a_binary_search_tree

g0601_0700.s0670_maximum_swap - package g0601_0700.s0670_maximum_swap

g0601_0700.s0671_second_minimum_node_in_a_binary_tree - package g0601_0700.s0671_second_minimum_node_in_a_binary_tree

g0601_0700.s0672_bulb_switcher_ii - package g0601_0700.s0672_bulb_switcher_ii

g0601_0700.s0673_number_of_longest_increasing_subsequence - package g0601_0700.s0673_number_of_longest_increasing_subsequence

g0601_0700.s0674_longest_continuous_increasing_subsequence - package g0601_0700.s0674_longest_continuous_increasing_subsequence

g0601_0700.s0675_cut_off_trees_for_golf_event - package g0601_0700.s0675_cut_off_trees_for_golf_event

g0601_0700.s0676_implement_magic_dictionary - package g0601_0700.s0676_implement_magic_dictionary

g0601_0700.s0677_map_sum_pairs - package g0601_0700.s0677_map_sum_pairs

g0601_0700.s0678_valid_parenthesis_string - package g0601_0700.s0678_valid_parenthesis_string

g0601_0700.s0679_24_game - package g0601_0700.s0679_24_game

g0601_0700.s0680_valid_palindrome_ii - package g0601_0700.s0680_valid_palindrome_ii

g0601_0700.s0682_baseball_game - package g0601_0700.s0682_baseball_game

g0601_0700.s0684_redundant_connection - package g0601_0700.s0684_redundant_connection

g0601_0700.s0685_redundant_connection_ii - package g0601_0700.s0685_redundant_connection_ii

g0601_0700.s0686_repeated_string_match - package g0601_0700.s0686_repeated_string_match

g0601_0700.s0687_longest_univalue_path - package g0601_0700.s0687_longest_univalue_path

g0601_0700.s0688_knight_probability_in_chessboard - package g0601_0700.s0688_knight_probability_in_chessboard

g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays - package g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays

g0601_0700.s0690_employee_importance - package g0601_0700.s0690_employee_importance

g0601_0700.s0691_stickers_to_spell_word - package g0601_0700.s0691_stickers_to_spell_word

g0601_0700.s0692_top_k_frequent_words - package g0601_0700.s0692_top_k_frequent_words

g0601_0700.s0693_binary_number_with_alternating_bits - package g0601_0700.s0693_binary_number_with_alternating_bits

g0601_0700.s0695_max_area_of_island - package g0601_0700.s0695_max_area_of_island

g0601_0700.s0696_count_binary_substrings - package g0601_0700.s0696_count_binary_substrings

g0601_0700.s0697_degree_of_an_array - package g0601_0700.s0697_degree_of_an_array

g0601_0700.s0698_partition_to_k_equal_sum_subsets - package g0601_0700.s0698_partition_to_k_equal_sum_subsets

g0601_0700.s0699_falling_squares - package g0601_0700.s0699_falling_squares

g0601_0700.s0700_search_in_a_binary_search_tree - package g0601_0700.s0700_search_in_a_binary_search_tree

g0701_0800.s0701_insert_into_a_binary_search_tree - package g0701_0800.s0701_insert_into_a_binary_search_tree

g0701_0800.s0703_kth_largest_element_in_a_stream - package g0701_0800.s0703_kth_largest_element_in_a_stream

g0701_0800.s0704_binary_search - package g0701_0800.s0704_binary_search

g0701_0800.s0705_design_hashset - package g0701_0800.s0705_design_hashset

g0701_0800.s0706_design_hashmap - package g0701_0800.s0706_design_hashmap

g0701_0800.s0707_design_linked_list - package g0701_0800.s0707_design_linked_list

g0701_0800.s0709_to_lower_case - package g0701_0800.s0709_to_lower_case

g0701_0800.s0710_random_pick_with_blacklist - package g0701_0800.s0710_random_pick_with_blacklist

g0701_0800.s0712_minimum_ascii_delete_sum_for_two_strings - package g0701_0800.s0712_minimum_ascii_delete_sum_for_two_strings

g0701_0800.s0713_subarray_product_less_than_k - package g0701_0800.s0713_subarray_product_less_than_k

g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee - package g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee

g0701_0800.s0715_range_module - package g0701_0800.s0715_range_module

g0701_0800.s0717_1_bit_and_2_bit_characters - package g0701_0800.s0717_1_bit_and_2_bit_characters

g0701_0800.s0718_maximum_length_of_repeated_subarray - package g0701_0800.s0718_maximum_length_of_repeated_subarray

g0701_0800.s0719_find_k_th_smallest_pair_distance - package g0701_0800.s0719_find_k_th_smallest_pair_distance

g0701_0800.s0720_longest_word_in_dictionary - package g0701_0800.s0720_longest_word_in_dictionary

g0701_0800.s0721_accounts_merge - package g0701_0800.s0721_accounts_merge

g0701_0800.s0722_remove_comments - package g0701_0800.s0722_remove_comments

g0701_0800.s0724_find_pivot_index - package g0701_0800.s0724_find_pivot_index

g0701_0800.s0725_split_linked_list_in_parts - package g0701_0800.s0725_split_linked_list_in_parts

g0701_0800.s0726_number_of_atoms - package g0701_0800.s0726_number_of_atoms

g0701_0800.s0728_self_dividing_numbers - package g0701_0800.s0728_self_dividing_numbers

g0701_0800.s0729_my_calendar_i - package g0701_0800.s0729_my_calendar_i

g0701_0800.s0730_count_different_palindromic_subsequences - package g0701_0800.s0730_count_different_palindromic_subsequences

g0701_0800.s0731_my_calendar_ii - package g0701_0800.s0731_my_calendar_ii

g0701_0800.s0732_my_calendar_iii - package g0701_0800.s0732_my_calendar_iii

g0701_0800.s0733_flood_fill - package g0701_0800.s0733_flood_fill

g0701_0800.s0735_asteroid_collision - package g0701_0800.s0735_asteroid_collision

g0701_0800.s0736_parse_lisp_expression - package g0701_0800.s0736_parse_lisp_expression

g0701_0800.s0738_monotone_increasing_digits - package g0701_0800.s0738_monotone_increasing_digits

g0701_0800.s0739_daily_temperatures - package g0701_0800.s0739_daily_temperatures

g0701_0800.s0740_delete_and_earn - package g0701_0800.s0740_delete_and_earn

g0701_0800.s0741_cherry_pickup - package g0701_0800.s0741_cherry_pickup

g0701_0800.s0743_network_delay_time - package g0701_0800.s0743_network_delay_time

g0701_0800.s0744_find_smallest_letter_greater_than_target - package g0701_0800.s0744_find_smallest_letter_greater_than_target

g0701_0800.s0745_prefix_and_suffix_search - package g0701_0800.s0745_prefix_and_suffix_search

g0701_0800.s0746_min_cost_climbing_stairs - package g0701_0800.s0746_min_cost_climbing_stairs

g0701_0800.s0747_largest_number_at_least_twice_of_others - package g0701_0800.s0747_largest_number_at_least_twice_of_others

g0701_0800.s0748_shortest_completing_word - package g0701_0800.s0748_shortest_completing_word

g0701_0800.s0749_contain_virus - package g0701_0800.s0749_contain_virus

g0701_0800.s0752_open_the_lock - package g0701_0800.s0752_open_the_lock

g0701_0800.s0753_cracking_the_safe - package g0701_0800.s0753_cracking_the_safe

g0701_0800.s0754_reach_a_number - package g0701_0800.s0754_reach_a_number

g0701_0800.s0756_pyramid_transition_matrix - package g0701_0800.s0756_pyramid_transition_matrix

g0701_0800.s0757_set_intersection_size_at_least_two - package g0701_0800.s0757_set_intersection_size_at_least_two

g0701_0800.s0761_special_binary_string - package g0701_0800.s0761_special_binary_string

g0701_0800.s0762_prime_number_of_set_bits_in_binary_representation - package g0701_0800.s0762_prime_number_of_set_bits_in_binary_representation

g0701_0800.s0763_partition_labels - package g0701_0800.s0763_partition_labels

g0701_0800.s0764_largest_plus_sign - package g0701_0800.s0764_largest_plus_sign

g0701_0800.s0765_couples_holding_hands - package g0701_0800.s0765_couples_holding_hands

g0701_0800.s0766_toeplitz_matrix - package g0701_0800.s0766_toeplitz_matrix

g0701_0800.s0767_reorganize_string - package g0701_0800.s0767_reorganize_string

g0701_0800.s0768_max_chunks_to_make_sorted_ii - package g0701_0800.s0768_max_chunks_to_make_sorted_ii

g0701_0800.s0769_max_chunks_to_make_sorted - package g0701_0800.s0769_max_chunks_to_make_sorted

g0701_0800.s0770_basic_calculator_iv - package g0701_0800.s0770_basic_calculator_iv

g0701_0800.s0771_jewels_and_stones - package g0701_0800.s0771_jewels_and_stones

g0701_0800.s0773_sliding_puzzle - package g0701_0800.s0773_sliding_puzzle

g0701_0800.s0775_global_and_local_inversions - package g0701_0800.s0775_global_and_local_inversions

g0701_0800.s0777_swap_adjacent_in_lr_string - package g0701_0800.s0777_swap_adjacent_in_lr_string

g0701_0800.s0778_swim_in_rising_water - package g0701_0800.s0778_swim_in_rising_water

g0701_0800.s0779_k_th_symbol_in_grammar - package g0701_0800.s0779_k_th_symbol_in_grammar

g0701_0800.s0780_reaching_points - package g0701_0800.s0780_reaching_points

g0701_0800.s0781_rabbits_in_forest - package g0701_0800.s0781_rabbits_in_forest

g0701_0800.s0782_transform_to_chessboard - package g0701_0800.s0782_transform_to_chessboard

g0701_0800.s0783_minimum_distance_between_bst_nodes - package g0701_0800.s0783_minimum_distance_between_bst_nodes

g0701_0800.s0784_letter_case_permutation - package g0701_0800.s0784_letter_case_permutation

g0701_0800.s0785_is_graph_bipartite - package g0701_0800.s0785_is_graph_bipartite

g0701_0800.s0786_k_th_smallest_prime_fraction - package g0701_0800.s0786_k_th_smallest_prime_fraction

g0701_0800.s0787_cheapest_flights_within_k_stops - package g0701_0800.s0787_cheapest_flights_within_k_stops

g0701_0800.s0788_rotated_digits - package g0701_0800.s0788_rotated_digits

g0701_0800.s0789_escape_the_ghosts - package g0701_0800.s0789_escape_the_ghosts

g0701_0800.s0790_domino_and_tromino_tiling - package g0701_0800.s0790_domino_and_tromino_tiling

g0701_0800.s0791_custom_sort_string - package g0701_0800.s0791_custom_sort_string

g0701_0800.s0792_number_of_matching_subsequences - package g0701_0800.s0792_number_of_matching_subsequences

g0701_0800.s0793_preimage_size_of_factorial_zeroes_function - package g0701_0800.s0793_preimage_size_of_factorial_zeroes_function

g0701_0800.s0794_valid_tic_tac_toe_state - package g0701_0800.s0794_valid_tic_tac_toe_state

g0701_0800.s0795_number_of_subarrays_with_bounded_maximum - package g0701_0800.s0795_number_of_subarrays_with_bounded_maximum

g0701_0800.s0796_rotate_string - package g0701_0800.s0796_rotate_string

g0701_0800.s0797_all_paths_from_source_to_target - package g0701_0800.s0797_all_paths_from_source_to_target

g0701_0800.s0798_smallest_rotation_with_highest_score - package g0701_0800.s0798_smallest_rotation_with_highest_score

g0701_0800.s0799_champagne_tower - package g0701_0800.s0799_champagne_tower

g0801_0900.s0801_minimum_swaps_to_make_sequences_increasing - package g0801_0900.s0801_minimum_swaps_to_make_sequences_increasing

g0801_0900.s0802_find_eventual_safe_states - package g0801_0900.s0802_find_eventual_safe_states

g0801_0900.s0803_bricks_falling_when_hit - package g0801_0900.s0803_bricks_falling_when_hit

g0801_0900.s0804_unique_morse_code_words - package g0801_0900.s0804_unique_morse_code_words

g0801_0900.s0805_split_array_with_same_average - package g0801_0900.s0805_split_array_with_same_average

g0801_0900.s0806_number_of_lines_to_write_string - package g0801_0900.s0806_number_of_lines_to_write_string

g0801_0900.s0807_max_increase_to_keep_city_skyline - package g0801_0900.s0807_max_increase_to_keep_city_skyline

g0801_0900.s0808_soup_servings - package g0801_0900.s0808_soup_servings

g0801_0900.s0809_expressive_words - package g0801_0900.s0809_expressive_words

g0801_0900.s0810_chalkboard_xor_game - package g0801_0900.s0810_chalkboard_xor_game

g0801_0900.s0811_subdomain_visit_count - package g0801_0900.s0811_subdomain_visit_count

g0801_0900.s0812_largest_triangle_area - package g0801_0900.s0812_largest_triangle_area

g0801_0900.s0813_largest_sum_of_averages - package g0801_0900.s0813_largest_sum_of_averages

g0801_0900.s0814_binary_tree_pruning - package g0801_0900.s0814_binary_tree_pruning

g0801_0900.s0815_bus_routes - package g0801_0900.s0815_bus_routes

g0801_0900.s0816_ambiguous_coordinates - package g0801_0900.s0816_ambiguous_coordinates

g0801_0900.s0817_linked_list_components - package g0801_0900.s0817_linked_list_components

g0801_0900.s0818_race_car - package g0801_0900.s0818_race_car

g0801_0900.s0819_most_common_word - package g0801_0900.s0819_most_common_word

g0801_0900.s0820_short_encoding_of_words - package g0801_0900.s0820_short_encoding_of_words

g0801_0900.s0821_shortest_distance_to_a_character - package g0801_0900.s0821_shortest_distance_to_a_character

g0801_0900.s0822_card_flipping_game - package g0801_0900.s0822_card_flipping_game

g0801_0900.s0823_binary_trees_with_factors - package g0801_0900.s0823_binary_trees_with_factors

g0801_0900.s0824_goat_latin - package g0801_0900.s0824_goat_latin

g0801_0900.s0825_friends_of_appropriate_ages - package g0801_0900.s0825_friends_of_appropriate_ages

g0801_0900.s0826_most_profit_assigning_work - package g0801_0900.s0826_most_profit_assigning_work

g0801_0900.s0827_making_a_large_island - package g0801_0900.s0827_making_a_large_island

g0801_0900.s0828_count_unique_characters_of_all_substrings_of_a_given_string - package g0801_0900.s0828_count_unique_characters_of_all_substrings_of_a_given_string

g0801_0900.s0829_consecutive_numbers_sum - package g0801_0900.s0829_consecutive_numbers_sum

g0801_0900.s0830_positions_of_large_groups - package g0801_0900.s0830_positions_of_large_groups

g0801_0900.s0831_masking_personal_information - package g0801_0900.s0831_masking_personal_information

g0801_0900.s0832_flipping_an_image - package g0801_0900.s0832_flipping_an_image

g0801_0900.s0833_find_and_replace_in_string - package g0801_0900.s0833_find_and_replace_in_string

g0801_0900.s0834_sum_of_distances_in_tree - package g0801_0900.s0834_sum_of_distances_in_tree

g0801_0900.s0835_image_overlap - package g0801_0900.s0835_image_overlap

g0801_0900.s0836_rectangle_overlap - package g0801_0900.s0836_rectangle_overlap

g0801_0900.s0837_new_21_game - package g0801_0900.s0837_new_21_game

g0801_0900.s0838_push_dominoes - package g0801_0900.s0838_push_dominoes

g0801_0900.s0839_similar_string_groups - package g0801_0900.s0839_similar_string_groups

g0801_0900.s0840_magic_squares_in_grid - package g0801_0900.s0840_magic_squares_in_grid

g0801_0900.s0841_keys_and_rooms - package g0801_0900.s0841_keys_and_rooms

g0801_0900.s0842_split_array_into_fibonacci_sequence - package g0801_0900.s0842_split_array_into_fibonacci_sequence

g0801_0900.s0843_guess_the_word - package g0801_0900.s0843_guess_the_word

g0801_0900.s0844_backspace_string_compare - package g0801_0900.s0844_backspace_string_compare

g0801_0900.s0845_longest_mountain_in_array - package g0801_0900.s0845_longest_mountain_in_array

g0801_0900.s0846_hand_of_straights - package g0801_0900.s0846_hand_of_straights

g0801_0900.s0847_shortest_path_visiting_all_nodes - package g0801_0900.s0847_shortest_path_visiting_all_nodes

g0801_0900.s0848_shifting_letters - package g0801_0900.s0848_shifting_letters

g0801_0900.s0849_maximize_distance_to_closest_person - package g0801_0900.s0849_maximize_distance_to_closest_person

g0801_0900.s0850_rectangle_area_ii - package g0801_0900.s0850_rectangle_area_ii

g0801_0900.s0851_loud_and_rich - package g0801_0900.s0851_loud_and_rich

g0801_0900.s0852_peak_index_in_a_mountain_array - package g0801_0900.s0852_peak_index_in_a_mountain_array

g0801_0900.s0853_car_fleet - package g0801_0900.s0853_car_fleet

g0801_0900.s0854_k_similar_strings - package g0801_0900.s0854_k_similar_strings

g0801_0900.s0855_exam_room - package g0801_0900.s0855_exam_room

g0801_0900.s0856_score_of_parentheses - package g0801_0900.s0856_score_of_parentheses

g0801_0900.s0857_minimum_cost_to_hire_k_workers - package g0801_0900.s0857_minimum_cost_to_hire_k_workers

g0801_0900.s0858_mirror_reflection - package g0801_0900.s0858_mirror_reflection

g0801_0900.s0859_buddy_strings - package g0801_0900.s0859_buddy_strings

g0801_0900.s0860_lemonade_change - package g0801_0900.s0860_lemonade_change

g0801_0900.s0861_score_after_flipping_matrix - package g0801_0900.s0861_score_after_flipping_matrix

g0801_0900.s0862_shortest_subarray_with_sum_at_least_k - package g0801_0900.s0862_shortest_subarray_with_sum_at_least_k

g0801_0900.s0863_all_nodes_distance_k_in_binary_tree - package g0801_0900.s0863_all_nodes_distance_k_in_binary_tree

g0801_0900.s0864_shortest_path_to_get_all_keys - package g0801_0900.s0864_shortest_path_to_get_all_keys

g0801_0900.s0865_smallest_subtree_with_all_the_deepest_nodes - package g0801_0900.s0865_smallest_subtree_with_all_the_deepest_nodes

g0801_0900.s0866_prime_palindrome - package g0801_0900.s0866_prime_palindrome

g0801_0900.s0867_transpose_matrix - package g0801_0900.s0867_transpose_matrix

g0801_0900.s0868_binary_gap - package g0801_0900.s0868_binary_gap

g0801_0900.s0869_reordered_power_of_2 - package g0801_0900.s0869_reordered_power_of_2

g0801_0900.s0870_advantage_shuffle - package g0801_0900.s0870_advantage_shuffle

g0801_0900.s0871_minimum_number_of_refueling_stops - package g0801_0900.s0871_minimum_number_of_refueling_stops

g0801_0900.s0872_leaf_similar_trees - package g0801_0900.s0872_leaf_similar_trees

g0801_0900.s0873_length_of_longest_fibonacci_subsequence - package g0801_0900.s0873_length_of_longest_fibonacci_subsequence

g0801_0900.s0874_walking_robot_simulation - package g0801_0900.s0874_walking_robot_simulation

g0801_0900.s0875_koko_eating_bananas - package g0801_0900.s0875_koko_eating_bananas

g0801_0900.s0876_middle_of_the_linked_list - package g0801_0900.s0876_middle_of_the_linked_list

g0801_0900.s0877_stone_game - package g0801_0900.s0877_stone_game

g0801_0900.s0878_nth_magical_number - package g0801_0900.s0878_nth_magical_number

g0801_0900.s0879_profitable_schemes - package g0801_0900.s0879_profitable_schemes

g0801_0900.s0880_decoded_string_at_index - package g0801_0900.s0880_decoded_string_at_index

g0801_0900.s0881_boats_to_save_people - package g0801_0900.s0881_boats_to_save_people

g0801_0900.s0882_reachable_nodes_in_subdivided_graph - package g0801_0900.s0882_reachable_nodes_in_subdivided_graph

g0801_0900.s0883_projection_area_of_3d_shapes - package g0801_0900.s0883_projection_area_of_3d_shapes

g0801_0900.s0884_uncommon_words_from_two_sentences - package g0801_0900.s0884_uncommon_words_from_two_sentences

g0801_0900.s0885_spiral_matrix_iii - package g0801_0900.s0885_spiral_matrix_iii

g0801_0900.s0886_possible_bipartition - package g0801_0900.s0886_possible_bipartition

g0801_0900.s0887_super_egg_drop - package g0801_0900.s0887_super_egg_drop

g0801_0900.s0888_fair_candy_swap - package g0801_0900.s0888_fair_candy_swap

g0801_0900.s0889_construct_binary_tree_from_preorder_and_postorder_traversal - package g0801_0900.s0889_construct_binary_tree_from_preorder_and_postorder_traversal

g0801_0900.s0890_find_and_replace_pattern - package g0801_0900.s0890_find_and_replace_pattern

g0801_0900.s0891_sum_of_subsequence_widths - package g0801_0900.s0891_sum_of_subsequence_widths

g0801_0900.s0892_surface_area_of_3d_shapes - package g0801_0900.s0892_surface_area_of_3d_shapes

g0801_0900.s0893_groups_of_special_equivalent_strings - package g0801_0900.s0893_groups_of_special_equivalent_strings

g0801_0900.s0894_all_possible_full_binary_trees - package g0801_0900.s0894_all_possible_full_binary_trees

g0801_0900.s0895_maximum_frequency_stack - package g0801_0900.s0895_maximum_frequency_stack

g0801_0900.s0896_monotonic_array - package g0801_0900.s0896_monotonic_array

g0801_0900.s0897_increasing_order_search_tree - package g0801_0900.s0897_increasing_order_search_tree

g0801_0900.s0898_bitwise_ors_of_subarrays - package g0801_0900.s0898_bitwise_ors_of_subarrays

g0801_0900.s0899_orderly_queue - package g0801_0900.s0899_orderly_queue

g0801_0900.s0900_rle_iterator - package g0801_0900.s0900_rle_iterator

g0901_1000.s0901_online_stock_span - package g0901_1000.s0901_online_stock_span

g0901_1000.s0902_numbers_at_most_n_given_digit_set - package g0901_1000.s0902_numbers_at_most_n_given_digit_set

g0901_1000.s0903_valid_permutations_for_di_sequence - package g0901_1000.s0903_valid_permutations_for_di_sequence

g0901_1000.s0904_fruit_into_baskets - package g0901_1000.s0904_fruit_into_baskets

g0901_1000.s0905_sort_array_by_parity - package g0901_1000.s0905_sort_array_by_parity

g0901_1000.s0906_super_palindromes - package g0901_1000.s0906_super_palindromes

g0901_1000.s0907_sum_of_subarray_minimums - package g0901_1000.s0907_sum_of_subarray_minimums

g0901_1000.s0908_smallest_range_i - package g0901_1000.s0908_smallest_range_i

g0901_1000.s0909_snakes_and_ladders - package g0901_1000.s0909_snakes_and_ladders

g0901_1000.s0910_smallest_range_ii - package g0901_1000.s0910_smallest_range_ii

g0901_1000.s0911_online_election - package g0901_1000.s0911_online_election

g0901_1000.s0912_sort_an_array - package g0901_1000.s0912_sort_an_array

g0901_1000.s0913_cat_and_mouse - package g0901_1000.s0913_cat_and_mouse

g0901_1000.s0914_x_of_a_kind_in_a_deck_of_cards - package g0901_1000.s0914_x_of_a_kind_in_a_deck_of_cards

g0901_1000.s0915_partition_array_into_disjoint_intervals - package g0901_1000.s0915_partition_array_into_disjoint_intervals

g0901_1000.s0916_word_subsets - package g0901_1000.s0916_word_subsets

g0901_1000.s0917_reverse_only_letters - package g0901_1000.s0917_reverse_only_letters

g0901_1000.s0918_maximum_sum_circular_subarray - package g0901_1000.s0918_maximum_sum_circular_subarray

g0901_1000.s0919_complete_binary_tree_inserter - package g0901_1000.s0919_complete_binary_tree_inserter

g0901_1000.s0920_number_of_music_playlists - package g0901_1000.s0920_number_of_music_playlists

g0901_1000.s0921_minimum_add_to_make_parentheses_valid - package g0901_1000.s0921_minimum_add_to_make_parentheses_valid

g0901_1000.s0922_sort_array_by_parity_ii - package g0901_1000.s0922_sort_array_by_parity_ii

g0901_1000.s0923_3sum_with_multiplicity - package g0901_1000.s0923_3sum_with_multiplicity

g0901_1000.s0924_minimize_malware_spread - package g0901_1000.s0924_minimize_malware_spread

g0901_1000.s0925_long_pressed_name - package g0901_1000.s0925_long_pressed_name

g0901_1000.s0926_flip_string_to_monotone_increasing - package g0901_1000.s0926_flip_string_to_monotone_increasing

g0901_1000.s0927_three_equal_parts - package g0901_1000.s0927_three_equal_parts

g0901_1000.s0928_minimize_malware_spread_ii - package g0901_1000.s0928_minimize_malware_spread_ii

g0901_1000.s0929_unique_email_addresses - package g0901_1000.s0929_unique_email_addresses

g0901_1000.s0930_binary_subarrays_with_sum - package g0901_1000.s0930_binary_subarrays_with_sum

g0901_1000.s0931_minimum_falling_path_sum - package g0901_1000.s0931_minimum_falling_path_sum

g0901_1000.s0932_beautiful_array - package g0901_1000.s0932_beautiful_array

g0901_1000.s0933_number_of_recent_calls - package g0901_1000.s0933_number_of_recent_calls

g0901_1000.s0934_shortest_bridge - package g0901_1000.s0934_shortest_bridge

g0901_1000.s0935_knight_dialer - package g0901_1000.s0935_knight_dialer

g0901_1000.s0936_stamping_the_sequence - package g0901_1000.s0936_stamping_the_sequence

g0901_1000.s0937_reorder_data_in_log_files - package g0901_1000.s0937_reorder_data_in_log_files

g0901_1000.s0938_range_sum_of_bst - package g0901_1000.s0938_range_sum_of_bst

g0901_1000.s0939_minimum_area_rectangle - package g0901_1000.s0939_minimum_area_rectangle

g0901_1000.s0940_distinct_subsequences_ii - package g0901_1000.s0940_distinct_subsequences_ii

g0901_1000.s0941_valid_mountain_array - package g0901_1000.s0941_valid_mountain_array

g0901_1000.s0942_di_string_match - package g0901_1000.s0942_di_string_match

g0901_1000.s0943_find_the_shortest_superstring - package g0901_1000.s0943_find_the_shortest_superstring

g0901_1000.s0944_delete_columns_to_make_sorted - package g0901_1000.s0944_delete_columns_to_make_sorted

g0901_1000.s0945_minimum_increment_to_make_array_unique - package g0901_1000.s0945_minimum_increment_to_make_array_unique

g0901_1000.s0946_validate_stack_sequences - package g0901_1000.s0946_validate_stack_sequences

g0901_1000.s0947_most_stones_removed_with_same_row_or_column - package g0901_1000.s0947_most_stones_removed_with_same_row_or_column

g0901_1000.s0948_bag_of_tokens - package g0901_1000.s0948_bag_of_tokens

g0901_1000.s0949_largest_time_for_given_digits - package g0901_1000.s0949_largest_time_for_given_digits

g0901_1000.s0950_reveal_cards_in_increasing_order - package g0901_1000.s0950_reveal_cards_in_increasing_order

g0901_1000.s0951_flip_equivalent_binary_trees - package g0901_1000.s0951_flip_equivalent_binary_trees

g0901_1000.s0952_largest_component_size_by_common_factor - package g0901_1000.s0952_largest_component_size_by_common_factor

g0901_1000.s0953_verifying_an_alien_dictionary - package g0901_1000.s0953_verifying_an_alien_dictionary

g0901_1000.s0954_array_of_doubled_pairs - package g0901_1000.s0954_array_of_doubled_pairs

g0901_1000.s0955_delete_columns_to_make_sorted_ii - package g0901_1000.s0955_delete_columns_to_make_sorted_ii

g0901_1000.s0956_tallest_billboard - package g0901_1000.s0956_tallest_billboard

g0901_1000.s0957_prison_cells_after_n_days - package g0901_1000.s0957_prison_cells_after_n_days

g0901_1000.s0958_check_completeness_of_a_binary_tree - package g0901_1000.s0958_check_completeness_of_a_binary_tree

g0901_1000.s0959_regions_cut_by_slashes - package g0901_1000.s0959_regions_cut_by_slashes

g0901_1000.s0960_delete_columns_to_make_sorted_iii - package g0901_1000.s0960_delete_columns_to_make_sorted_iii

g0901_1000.s0961_n_repeated_element_in_size_2n_array - package g0901_1000.s0961_n_repeated_element_in_size_2n_array

g0901_1000.s0962_maximum_width_ramp - package g0901_1000.s0962_maximum_width_ramp

g0901_1000.s0963_minimum_area_rectangle_ii - package g0901_1000.s0963_minimum_area_rectangle_ii

g0901_1000.s0964_least_operators_to_express_number - package g0901_1000.s0964_least_operators_to_express_number

g0901_1000.s0965_univalued_binary_tree - package g0901_1000.s0965_univalued_binary_tree

g0901_1000.s0966_vowel_spellchecker - package g0901_1000.s0966_vowel_spellchecker

g0901_1000.s0967_numbers_with_same_consecutive_differences - package g0901_1000.s0967_numbers_with_same_consecutive_differences

g0901_1000.s0968_binary_tree_cameras - package g0901_1000.s0968_binary_tree_cameras

g0901_1000.s0969_pancake_sorting - package g0901_1000.s0969_pancake_sorting

g0901_1000.s0970_powerful_integers - package g0901_1000.s0970_powerful_integers

g0901_1000.s0971_flip_binary_tree_to_match_preorder_traversal - package g0901_1000.s0971_flip_binary_tree_to_match_preorder_traversal

g0901_1000.s0972_equal_rational_numbers - package g0901_1000.s0972_equal_rational_numbers

g0901_1000.s0973_k_closest_points_to_origin - package g0901_1000.s0973_k_closest_points_to_origin

g0901_1000.s0974_subarray_sums_divisible_by_k - package g0901_1000.s0974_subarray_sums_divisible_by_k

g0901_1000.s0975_odd_even_jump - package g0901_1000.s0975_odd_even_jump

g0901_1000.s0976_largest_perimeter_triangle - package g0901_1000.s0976_largest_perimeter_triangle

g0901_1000.s0977_squares_of_a_sorted_array - package g0901_1000.s0977_squares_of_a_sorted_array

g0901_1000.s0978_longest_turbulent_subarray - package g0901_1000.s0978_longest_turbulent_subarray

g0901_1000.s0979_distribute_coins_in_binary_tree - package g0901_1000.s0979_distribute_coins_in_binary_tree

g0901_1000.s0980_unique_paths_iii - package g0901_1000.s0980_unique_paths_iii

g0901_1000.s0981_time_based_key_value_store - package g0901_1000.s0981_time_based_key_value_store

g0901_1000.s0982_triples_with_bitwise_and_equal_to_zero - package g0901_1000.s0982_triples_with_bitwise_and_equal_to_zero

g0901_1000.s0983_minimum_cost_for_tickets - package g0901_1000.s0983_minimum_cost_for_tickets

g0901_1000.s0984_string_without_aaa_or_bbb - package g0901_1000.s0984_string_without_aaa_or_bbb

g0901_1000.s0985_sum_of_even_numbers_after_queries - package g0901_1000.s0985_sum_of_even_numbers_after_queries

g0901_1000.s0986_interval_list_intersections - package g0901_1000.s0986_interval_list_intersections

g0901_1000.s0987_vertical_order_traversal_of_a_binary_tree - package g0901_1000.s0987_vertical_order_traversal_of_a_binary_tree

g0901_1000.s0988_smallest_string_starting_from_leaf - package g0901_1000.s0988_smallest_string_starting_from_leaf

g0901_1000.s0989_add_to_array_form_of_integer - package g0901_1000.s0989_add_to_array_form_of_integer

g0901_1000.s0990_satisfiability_of_equality_equations - package g0901_1000.s0990_satisfiability_of_equality_equations

g0901_1000.s0991_broken_calculator - package g0901_1000.s0991_broken_calculator

g0901_1000.s0992_subarrays_with_k_different_integers - package g0901_1000.s0992_subarrays_with_k_different_integers

g0901_1000.s0993_cousins_in_binary_tree - package g0901_1000.s0993_cousins_in_binary_tree

g0901_1000.s0994_rotting_oranges - package g0901_1000.s0994_rotting_oranges

g0901_1000.s0995_minimum_number_of_k_consecutive_bit_flips - package g0901_1000.s0995_minimum_number_of_k_consecutive_bit_flips

g0901_1000.s0996_number_of_squareful_arrays - package g0901_1000.s0996_number_of_squareful_arrays

g0901_1000.s0997_find_the_town_judge - package g0901_1000.s0997_find_the_town_judge

g0901_1000.s0998_maximum_binary_tree_ii - package g0901_1000.s0998_maximum_binary_tree_ii

g0901_1000.s0999_available_captures_for_rook - package g0901_1000.s0999_available_captures_for_rook

g0901_1000.s1000_minimum_cost_to_merge_stones - package g0901_1000.s1000_minimum_cost_to_merge_stones

g1001_1100.s1001_grid_illumination - package g1001_1100.s1001_grid_illumination

g1001_1100.s1002_find_common_characters - package g1001_1100.s1002_find_common_characters

g1001_1100.s1003_check_if_word_is_valid_after_substitutions - package g1001_1100.s1003_check_if_word_is_valid_after_substitutions

g1001_1100.s1004_max_consecutive_ones_iii - package g1001_1100.s1004_max_consecutive_ones_iii

g1001_1100.s1005_maximize_sum_of_array_after_k_negations - package g1001_1100.s1005_maximize_sum_of_array_after_k_negations

g1001_1100.s1006_clumsy_factorial - package g1001_1100.s1006_clumsy_factorial

g1001_1100.s1007_minimum_domino_rotations_for_equal_row - package g1001_1100.s1007_minimum_domino_rotations_for_equal_row

g1001_1100.s1008_construct_binary_search_tree_from_preorder_traversal - package g1001_1100.s1008_construct_binary_search_tree_from_preorder_traversal

g1001_1100.s1009_complement_of_base_10_integer - package g1001_1100.s1009_complement_of_base_10_integer

g1001_1100.s1010_pairs_of_songs_with_total_durations_divisible_by_60 - package g1001_1100.s1010_pairs_of_songs_with_total_durations_divisible_by_60

g1001_1100.s1011_capacity_to_ship_packages_within_d_days - package g1001_1100.s1011_capacity_to_ship_packages_within_d_days

g1001_1100.s1012_numbers_with_repeated_digits - package g1001_1100.s1012_numbers_with_repeated_digits

g1001_1100.s1013_partition_array_into_three_parts_with_equal_sum - package g1001_1100.s1013_partition_array_into_three_parts_with_equal_sum

g1001_1100.s1014_best_sightseeing_pair - package g1001_1100.s1014_best_sightseeing_pair

g1001_1100.s1015_smallest_integer_divisible_by_k - package g1001_1100.s1015_smallest_integer_divisible_by_k

g1001_1100.s1016_binary_string_with_substrings_representing_1_to_n - package g1001_1100.s1016_binary_string_with_substrings_representing_1_to_n

g1001_1100.s1017_convert_to_base_2 - package g1001_1100.s1017_convert_to_base_2

g1001_1100.s1018_binary_prefix_divisible_by_5 - package g1001_1100.s1018_binary_prefix_divisible_by_5

g1001_1100.s1019_next_greater_node_in_linked_list - package g1001_1100.s1019_next_greater_node_in_linked_list

g1001_1100.s1020_number_of_enclaves - package g1001_1100.s1020_number_of_enclaves

g1001_1100.s1021_remove_outermost_parentheses - package g1001_1100.s1021_remove_outermost_parentheses

g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers - package g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers

g1001_1100.s1023_camelcase_matching - package g1001_1100.s1023_camelcase_matching

g1001_1100.s1024_video_stitching - package g1001_1100.s1024_video_stitching

g1001_1100.s1025_divisor_game - package g1001_1100.s1025_divisor_game

g1001_1100.s1026_maximum_difference_between_node_and_ancestor - package g1001_1100.s1026_maximum_difference_between_node_and_ancestor

g1001_1100.s1027_longest_arithmetic_subsequence - package g1001_1100.s1027_longest_arithmetic_subsequence

g1001_1100.s1028_recover_a_tree_from_preorder_traversal - package g1001_1100.s1028_recover_a_tree_from_preorder_traversal

g1001_1100.s1029_two_city_scheduling - package g1001_1100.s1029_two_city_scheduling

g1001_1100.s1030_matrix_cells_in_distance_order - package g1001_1100.s1030_matrix_cells_in_distance_order

g1001_1100.s1031_maximum_sum_of_two_non_overlapping_subarrays - package g1001_1100.s1031_maximum_sum_of_two_non_overlapping_subarrays

g1001_1100.s1032_stream_of_characters - package g1001_1100.s1032_stream_of_characters

g1001_1100.s1033_moving_stones_until_consecutive - package g1001_1100.s1033_moving_stones_until_consecutive

g1001_1100.s1034_coloring_a_border - package g1001_1100.s1034_coloring_a_border

g1001_1100.s1035_uncrossed_lines - package g1001_1100.s1035_uncrossed_lines

g1001_1100.s1036_escape_a_large_maze - package g1001_1100.s1036_escape_a_large_maze

g1001_1100.s1037_valid_boomerang - package g1001_1100.s1037_valid_boomerang

g1001_1100.s1038_binary_search_tree_to_greater_sum_tree - package g1001_1100.s1038_binary_search_tree_to_greater_sum_tree

g1001_1100.s1039_minimum_score_triangulation_of_polygon - package g1001_1100.s1039_minimum_score_triangulation_of_polygon

g1001_1100.s1040_moving_stones_until_consecutive_ii - package g1001_1100.s1040_moving_stones_until_consecutive_ii

g1001_1100.s1041_robot_bounded_in_circle - package g1001_1100.s1041_robot_bounded_in_circle

g1001_1100.s1042_flower_planting_with_no_adjacent - package g1001_1100.s1042_flower_planting_with_no_adjacent

g1001_1100.s1043_partition_array_for_maximum_sum - package g1001_1100.s1043_partition_array_for_maximum_sum

g1001_1100.s1044_longest_duplicate_substring - package g1001_1100.s1044_longest_duplicate_substring

g1001_1100.s1046_last_stone_weight - package g1001_1100.s1046_last_stone_weight

g1001_1100.s1047_remove_all_adjacent_duplicates_in_string - package g1001_1100.s1047_remove_all_adjacent_duplicates_in_string

g1001_1100.s1048_longest_string_chain - package g1001_1100.s1048_longest_string_chain

g1001_1100.s1049_last_stone_weight_ii - package g1001_1100.s1049_last_stone_weight_ii

g1001_1100.s1051_height_checker - package g1001_1100.s1051_height_checker

g1001_1100.s1052_grumpy_bookstore_owner - package g1001_1100.s1052_grumpy_bookstore_owner

g1001_1100.s1053_previous_permutation_with_one_swap - package g1001_1100.s1053_previous_permutation_with_one_swap

g1001_1100.s1054_distant_barcodes - package g1001_1100.s1054_distant_barcodes

g1001_1100.s1061_lexicographically_smallest_equivalent_string - package g1001_1100.s1061_lexicographically_smallest_equivalent_string

g1001_1100.s1071_greatest_common_divisor_of_strings - package g1001_1100.s1071_greatest_common_divisor_of_strings

g1001_1100.s1072_flip_columns_for_maximum_number_of_equal_rows - package g1001_1100.s1072_flip_columns_for_maximum_number_of_equal_rows

g1001_1100.s1073_adding_two_negabinary_numbers - package g1001_1100.s1073_adding_two_negabinary_numbers

g1001_1100.s1074_number_of_submatrices_that_sum_to_target - package g1001_1100.s1074_number_of_submatrices_that_sum_to_target

g1001_1100.s1078_occurrences_after_bigram - package g1001_1100.s1078_occurrences_after_bigram

g1001_1100.s1079_letter_tile_possibilities - package g1001_1100.s1079_letter_tile_possibilities

g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths - package g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths

g1001_1100.s1081_smallest_subsequence_of_distinct_characters - package g1001_1100.s1081_smallest_subsequence_of_distinct_characters

g1001_1100.s1089_duplicate_zeros - package g1001_1100.s1089_duplicate_zeros

g1001_1100.s1090_largest_values_from_labels - package g1001_1100.s1090_largest_values_from_labels

g1001_1100.s1091_shortest_path_in_binary_matrix - package g1001_1100.s1091_shortest_path_in_binary_matrix

g1001_1100.s1092_shortest_common_supersequence - package g1001_1100.s1092_shortest_common_supersequence

g1001_1100.s1093_statistics_from_a_large_sample - package g1001_1100.s1093_statistics_from_a_large_sample

g1001_1100.s1094_car_pooling - package g1001_1100.s1094_car_pooling

g1001_1100.s1095_find_in_mountain_array - package g1001_1100.s1095_find_in_mountain_array

g1001_1100.s1096_brace_expansion_ii - package g1001_1100.s1096_brace_expansion_ii

g1101_1200.s1103_distribute_candies_to_people - package g1101_1200.s1103_distribute_candies_to_people

g1101_1200.s1104_path_in_zigzag_labelled_binary_tree - package g1101_1200.s1104_path_in_zigzag_labelled_binary_tree

g1101_1200.s1105_filling_bookcase_shelves - package g1101_1200.s1105_filling_bookcase_shelves

g1101_1200.s1106_parsing_a_boolean_expression - package g1101_1200.s1106_parsing_a_boolean_expression

g1101_1200.s1108_defanging_an_ip_address - package g1101_1200.s1108_defanging_an_ip_address

g1101_1200.s1109_corporate_flight_bookings - package g1101_1200.s1109_corporate_flight_bookings

g1101_1200.s1110_delete_nodes_and_return_forest - package g1101_1200.s1110_delete_nodes_and_return_forest

g1101_1200.s1111_maximum_nesting_depth_of_two_valid_parentheses_strings - package g1101_1200.s1111_maximum_nesting_depth_of_two_valid_parentheses_strings

g1101_1200.s1114_print_in_order - package g1101_1200.s1114_print_in_order

g1101_1200.s1115_print_foobar_alternately - package g1101_1200.s1115_print_foobar_alternately

g1101_1200.s1116_print_zero_even_odd - package g1101_1200.s1116_print_zero_even_odd

g1101_1200.s1117_building_h2o - package g1101_1200.s1117_building_h2o

g1101_1200.s1122_relative_sort_array - package g1101_1200.s1122_relative_sort_array

g1101_1200.s1123_lowest_common_ancestor_of_deepest_leaves - package g1101_1200.s1123_lowest_common_ancestor_of_deepest_leaves

g1101_1200.s1124_longest_well_performing_interval - package g1101_1200.s1124_longest_well_performing_interval

g1101_1200.s1125_smallest_sufficient_team - package g1101_1200.s1125_smallest_sufficient_team

g1101_1200.s1128_number_of_equivalent_domino_pairs - package g1101_1200.s1128_number_of_equivalent_domino_pairs

g1101_1200.s1129_shortest_path_with_alternating_colors - package g1101_1200.s1129_shortest_path_with_alternating_colors

g1101_1200.s1130_minimum_cost_tree_from_leaf_values - package g1101_1200.s1130_minimum_cost_tree_from_leaf_values

g1101_1200.s1131_maximum_of_absolute_value_expression - package g1101_1200.s1131_maximum_of_absolute_value_expression

g1101_1200.s1137_n_th_tribonacci_number - package g1101_1200.s1137_n_th_tribonacci_number

g1101_1200.s1138_alphabet_board_path - package g1101_1200.s1138_alphabet_board_path

g1101_1200.s1139_largest_1_bordered_square - package g1101_1200.s1139_largest_1_bordered_square

g1101_1200.s1140_stone_game_ii - package g1101_1200.s1140_stone_game_ii

g1101_1200.s1143_longest_common_subsequence - package g1101_1200.s1143_longest_common_subsequence

g1101_1200.s1144_decrease_elements_to_make_array_zigzag - package g1101_1200.s1144_decrease_elements_to_make_array_zigzag

g1101_1200.s1145_binary_tree_coloring_game - package g1101_1200.s1145_binary_tree_coloring_game

g1101_1200.s1146_snapshot_array - package g1101_1200.s1146_snapshot_array

g1101_1200.s1147_longest_chunked_palindrome_decomposition - package g1101_1200.s1147_longest_chunked_palindrome_decomposition

g1101_1200.s1154_day_of_the_year - package g1101_1200.s1154_day_of_the_year

g1101_1200.s1155_number_of_dice_rolls_with_target_sum - package g1101_1200.s1155_number_of_dice_rolls_with_target_sum

g1101_1200.s1156_swap_for_longest_repeated_character_substring - package g1101_1200.s1156_swap_for_longest_repeated_character_substring

g1101_1200.s1157_online_majority_element_in_subarray - package g1101_1200.s1157_online_majority_element_in_subarray

g1101_1200.s1160_find_words_that_can_be_formed_by_characters - package g1101_1200.s1160_find_words_that_can_be_formed_by_characters

g1101_1200.s1161_maximum_level_sum_of_a_binary_tree - package g1101_1200.s1161_maximum_level_sum_of_a_binary_tree

g1101_1200.s1162_as_far_from_land_as_possible - package g1101_1200.s1162_as_far_from_land_as_possible

g1101_1200.s1163_last_substring_in_lexicographical_order - package g1101_1200.s1163_last_substring_in_lexicographical_order

g1101_1200.s1169_invalid_transactions - package g1101_1200.s1169_invalid_transactions

g1101_1200.s1170_compare_strings_by_frequency_of_the_smallest_character - package g1101_1200.s1170_compare_strings_by_frequency_of_the_smallest_character

g1101_1200.s1171_remove_zero_sum_consecutive_nodes_from_linked_list - package g1101_1200.s1171_remove_zero_sum_consecutive_nodes_from_linked_list

g1101_1200.s1172_dinner_plate_stacks - package g1101_1200.s1172_dinner_plate_stacks

g1101_1200.s1175_prime_arrangements - package g1101_1200.s1175_prime_arrangements

g1101_1200.s1177_can_make_palindrome_from_substring - package g1101_1200.s1177_can_make_palindrome_from_substring

g1101_1200.s1178_number_of_valid_words_for_each_puzzle - package g1101_1200.s1178_number_of_valid_words_for_each_puzzle

g1101_1200.s1184_distance_between_bus_stops - package g1101_1200.s1184_distance_between_bus_stops

g1101_1200.s1185_day_of_the_week - package g1101_1200.s1185_day_of_the_week

g1101_1200.s1186_maximum_subarray_sum_with_one_deletion - package g1101_1200.s1186_maximum_subarray_sum_with_one_deletion

g1101_1200.s1187_make_array_strictly_increasing - package g1101_1200.s1187_make_array_strictly_increasing

g1101_1200.s1189_maximum_number_of_balloons - package g1101_1200.s1189_maximum_number_of_balloons

g1101_1200.s1190_reverse_substrings_between_each_pair_of_parentheses - package g1101_1200.s1190_reverse_substrings_between_each_pair_of_parentheses

g1101_1200.s1191_k_concatenation_maximum_sum - package g1101_1200.s1191_k_concatenation_maximum_sum

g1101_1200.s1192_critical_connections_in_a_network - package g1101_1200.s1192_critical_connections_in_a_network

g1101_1200.s1195_fizz_buzz_multithreaded - package g1101_1200.s1195_fizz_buzz_multithreaded

g1101_1200.s1200_minimum_absolute_difference - package g1101_1200.s1200_minimum_absolute_difference

g1201_1300.s1201_ugly_number_iii - package g1201_1300.s1201_ugly_number_iii

g1201_1300.s1202_smallest_string_with_swaps - package g1201_1300.s1202_smallest_string_with_swaps

g1201_1300.s1203_sort_items_by_groups_respecting_dependencies - package g1201_1300.s1203_sort_items_by_groups_respecting_dependencies

g1201_1300.s1206_design_skiplist - package g1201_1300.s1206_design_skiplist

g1201_1300.s1207_unique_number_of_occurrences - package g1201_1300.s1207_unique_number_of_occurrences

g1201_1300.s1208_get_equal_substrings_within_budget - package g1201_1300.s1208_get_equal_substrings_within_budget

g1201_1300.s1209_remove_all_adjacent_duplicates_in_string_ii - package g1201_1300.s1209_remove_all_adjacent_duplicates_in_string_ii

g1201_1300.s1210_minimum_moves_to_reach_target_with_rotations - package g1201_1300.s1210_minimum_moves_to_reach_target_with_rotations

g1201_1300.s1217_minimum_cost_to_move_chips_to_the_same_position - package g1201_1300.s1217_minimum_cost_to_move_chips_to_the_same_position

g1201_1300.s1218_longest_arithmetic_subsequence_of_given_difference - package g1201_1300.s1218_longest_arithmetic_subsequence_of_given_difference

g1201_1300.s1219_path_with_maximum_gold - package g1201_1300.s1219_path_with_maximum_gold

g1201_1300.s1220_count_vowels_permutation - package g1201_1300.s1220_count_vowels_permutation

g1201_1300.s1221_split_a_string_in_balanced_strings - package g1201_1300.s1221_split_a_string_in_balanced_strings

g1201_1300.s1222_queens_that_can_attack_the_king - package g1201_1300.s1222_queens_that_can_attack_the_king

g1201_1300.s1223_dice_roll_simulation - package g1201_1300.s1223_dice_roll_simulation

g1201_1300.s1224_maximum_equal_frequency - package g1201_1300.s1224_maximum_equal_frequency

g1201_1300.s1226_the_dining_philosophers - package g1201_1300.s1226_the_dining_philosophers

g1201_1300.s1227_airplane_seat_assignment_probability - package g1201_1300.s1227_airplane_seat_assignment_probability

g1201_1300.s1232_check_if_it_is_a_straight_line - package g1201_1300.s1232_check_if_it_is_a_straight_line

g1201_1300.s1233_remove_sub_folders_from_the_filesystem - package g1201_1300.s1233_remove_sub_folders_from_the_filesystem

g1201_1300.s1234_replace_the_substring_for_balanced_string - package g1201_1300.s1234_replace_the_substring_for_balanced_string

g1201_1300.s1235_maximum_profit_in_job_scheduling - package g1201_1300.s1235_maximum_profit_in_job_scheduling

g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation - package g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation

g1201_1300.s1238_circular_permutation_in_binary_representation - package g1201_1300.s1238_circular_permutation_in_binary_representation

g1201_1300.s1239_maximum_length_of_a_concatenated_string_with_unique_characters - package g1201_1300.s1239_maximum_length_of_a_concatenated_string_with_unique_characters

g1201_1300.s1240_tiling_a_rectangle_with_the_fewest_squares - package g1201_1300.s1240_tiling_a_rectangle_with_the_fewest_squares

g1201_1300.s1247_minimum_swaps_to_make_strings_equal - package g1201_1300.s1247_minimum_swaps_to_make_strings_equal

g1201_1300.s1248_count_number_of_nice_subarrays - package g1201_1300.s1248_count_number_of_nice_subarrays

g1201_1300.s1249_minimum_remove_to_make_valid_parentheses - package g1201_1300.s1249_minimum_remove_to_make_valid_parentheses

g1201_1300.s1250_check_if_it_is_a_good_array - package g1201_1300.s1250_check_if_it_is_a_good_array

g1201_1300.s1252_cells_with_odd_values_in_a_matrix - package g1201_1300.s1252_cells_with_odd_values_in_a_matrix

g1201_1300.s1253_reconstruct_a_2_row_binary_matrix - package g1201_1300.s1253_reconstruct_a_2_row_binary_matrix

g1201_1300.s1254_number_of_closed_islands - package g1201_1300.s1254_number_of_closed_islands

g1201_1300.s1255_maximum_score_words_formed_by_letters - package g1201_1300.s1255_maximum_score_words_formed_by_letters

g1201_1300.s1260_shift_2d_grid - package g1201_1300.s1260_shift_2d_grid

g1201_1300.s1261_find_elements_in_a_contaminated_binary_tree - package g1201_1300.s1261_find_elements_in_a_contaminated_binary_tree

g1201_1300.s1262_greatest_sum_divisible_by_three - package g1201_1300.s1262_greatest_sum_divisible_by_three

g1201_1300.s1263_minimum_moves_to_move_a_box_to_their_target_location - package g1201_1300.s1263_minimum_moves_to_move_a_box_to_their_target_location

g1201_1300.s1266_minimum_time_visiting_all_points - package g1201_1300.s1266_minimum_time_visiting_all_points

g1201_1300.s1267_count_servers_that_communicate - package g1201_1300.s1267_count_servers_that_communicate

g1201_1300.s1268_search_suggestions_system - package g1201_1300.s1268_search_suggestions_system

g1201_1300.s1269_number_of_ways_to_stay_in_the_same_place_after_some_steps - package g1201_1300.s1269_number_of_ways_to_stay_in_the_same_place_after_some_steps

g1201_1300.s1275_find_winner_on_a_tic_tac_toe_game - package g1201_1300.s1275_find_winner_on_a_tic_tac_toe_game

g1201_1300.s1276_number_of_burgers_with_no_waste_of_ingredients - package g1201_1300.s1276_number_of_burgers_with_no_waste_of_ingredients

g1201_1300.s1277_count_square_submatrices_with_all_ones - package g1201_1300.s1277_count_square_submatrices_with_all_ones

g1201_1300.s1278_palindrome_partitioning_iii - package g1201_1300.s1278_palindrome_partitioning_iii

g1201_1300.s1281_subtract_the_product_and_sum_of_digits_of_an_integer - package g1201_1300.s1281_subtract_the_product_and_sum_of_digits_of_an_integer

g1201_1300.s1282_group_the_people_given_the_group_size_they_belong_to - package g1201_1300.s1282_group_the_people_given_the_group_size_they_belong_to

g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold - package g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold

g1201_1300.s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix - package g1201_1300.s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix

g1201_1300.s1286_iterator_for_combination - package g1201_1300.s1286_iterator_for_combination

g1201_1300.s1287_element_appearing_more_than_25_in_sorted_array - package g1201_1300.s1287_element_appearing_more_than_25_in_sorted_array

g1201_1300.s1288_remove_covered_intervals - package g1201_1300.s1288_remove_covered_intervals

g1201_1300.s1289_minimum_falling_path_sum_ii - package g1201_1300.s1289_minimum_falling_path_sum_ii

g1201_1300.s1290_convert_binary_number_in_a_linked_list_to_integer - package g1201_1300.s1290_convert_binary_number_in_a_linked_list_to_integer

g1201_1300.s1291_sequential_digits - package g1201_1300.s1291_sequential_digits

g1201_1300.s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold - package g1201_1300.s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold

g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination - package g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination

g1201_1300.s1295_find_numbers_with_even_number_of_digits - package g1201_1300.s1295_find_numbers_with_even_number_of_digits

g1201_1300.s1296_divide_array_in_sets_of_k_consecutive_numbers - package g1201_1300.s1296_divide_array_in_sets_of_k_consecutive_numbers

g1201_1300.s1297_maximum_number_of_occurrences_of_a_substring - package g1201_1300.s1297_maximum_number_of_occurrences_of_a_substring

g1201_1300.s1298_maximum_candies_you_can_get_from_boxes - package g1201_1300.s1298_maximum_candies_you_can_get_from_boxes

g1201_1300.s1299_replace_elements_with_greatest_element_on_right_side - package g1201_1300.s1299_replace_elements_with_greatest_element_on_right_side

g1201_1300.s1300_sum_of_mutated_array_closest_to_target - package g1201_1300.s1300_sum_of_mutated_array_closest_to_target

g1301_1400.s1301_number_of_paths_with_max_score - package g1301_1400.s1301_number_of_paths_with_max_score

g1301_1400.s1302_deepest_leaves_sum - package g1301_1400.s1302_deepest_leaves_sum

g1301_1400.s1304_find_n_unique_integers_sum_up_to_zero - package g1301_1400.s1304_find_n_unique_integers_sum_up_to_zero

g1301_1400.s1305_all_elements_in_two_binary_search_trees - package g1301_1400.s1305_all_elements_in_two_binary_search_trees

g1301_1400.s1306_jump_game_iii - package g1301_1400.s1306_jump_game_iii

g1301_1400.s1307_verbal_arithmetic_puzzle - package g1301_1400.s1307_verbal_arithmetic_puzzle

g1301_1400.s1309_decrypt_string_from_alphabet_to_integer_mapping - package g1301_1400.s1309_decrypt_string_from_alphabet_to_integer_mapping

g1301_1400.s1310_xor_queries_of_a_subarray - package g1301_1400.s1310_xor_queries_of_a_subarray

g1301_1400.s1311_get_watched_videos_by_your_friends - package g1301_1400.s1311_get_watched_videos_by_your_friends

g1301_1400.s1312_minimum_insertion_steps_to_make_a_string_palindrome - package g1301_1400.s1312_minimum_insertion_steps_to_make_a_string_palindrome

g1301_1400.s1313_decompress_run_length_encoded_list - package g1301_1400.s1313_decompress_run_length_encoded_list

g1301_1400.s1314_matrix_block_sum - package g1301_1400.s1314_matrix_block_sum

g1301_1400.s1315_sum_of_nodes_with_even_valued_grandparent - package g1301_1400.s1315_sum_of_nodes_with_even_valued_grandparent

g1301_1400.s1316_distinct_echo_substrings - package g1301_1400.s1316_distinct_echo_substrings

g1301_1400.s1317_convert_integer_to_the_sum_of_two_no_zero_integers - package g1301_1400.s1317_convert_integer_to_the_sum_of_two_no_zero_integers

g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c - package g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c

g1301_1400.s1319_number_of_operations_to_make_network_connected - package g1301_1400.s1319_number_of_operations_to_make_network_connected

g1301_1400.s1320_minimum_distance_to_type_a_word_using_two_fingers - package g1301_1400.s1320_minimum_distance_to_type_a_word_using_two_fingers

g1301_1400.s1323_maximum_69_number - package g1301_1400.s1323_maximum_69_number

g1301_1400.s1324_print_words_vertically - package g1301_1400.s1324_print_words_vertically

g1301_1400.s1325_delete_leaves_with_a_given_value - package g1301_1400.s1325_delete_leaves_with_a_given_value

g1301_1400.s1326_minimum_number_of_taps_to_open_to_water_a_garden - package g1301_1400.s1326_minimum_number_of_taps_to_open_to_water_a_garden

g1301_1400.s1328_break_a_palindrome - package g1301_1400.s1328_break_a_palindrome

g1301_1400.s1329_sort_the_matrix_diagonally - package g1301_1400.s1329_sort_the_matrix_diagonally

g1301_1400.s1330_reverse_subarray_to_maximize_array_value - package g1301_1400.s1330_reverse_subarray_to_maximize_array_value

g1301_1400.s1331_rank_transform_of_an_array - package g1301_1400.s1331_rank_transform_of_an_array

g1301_1400.s1332_remove_palindromic_subsequences - package g1301_1400.s1332_remove_palindromic_subsequences

g1301_1400.s1333_filter_restaurants_by_vegan_friendly_price_and_distance - package g1301_1400.s1333_filter_restaurants_by_vegan_friendly_price_and_distance

g1301_1400.s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance - package g1301_1400.s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance

g1301_1400.s1335_minimum_difficulty_of_a_job_schedule - package g1301_1400.s1335_minimum_difficulty_of_a_job_schedule

g1301_1400.s1337_the_k_weakest_rows_in_a_matrix - package g1301_1400.s1337_the_k_weakest_rows_in_a_matrix

g1301_1400.s1338_reduce_array_size_to_the_half - package g1301_1400.s1338_reduce_array_size_to_the_half

g1301_1400.s1339_maximum_product_of_splitted_binary_tree - package g1301_1400.s1339_maximum_product_of_splitted_binary_tree

g1301_1400.s1340_jump_game_v - package g1301_1400.s1340_jump_game_v

g1301_1400.s1342_number_of_steps_to_reduce_a_number_to_zero - package g1301_1400.s1342_number_of_steps_to_reduce_a_number_to_zero

g1301_1400.s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold - package g1301_1400.s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold

g1301_1400.s1344_angle_between_hands_of_a_clock - package g1301_1400.s1344_angle_between_hands_of_a_clock

g1301_1400.s1345_jump_game_iv - package g1301_1400.s1345_jump_game_iv

g1301_1400.s1346_check_if_n_and_its_double_exist - package g1301_1400.s1346_check_if_n_and_its_double_exist

g1301_1400.s1347_minimum_number_of_steps_to_make_two_strings_anagram - package g1301_1400.s1347_minimum_number_of_steps_to_make_two_strings_anagram

g1301_1400.s1348_tweet_counts_per_frequency - package g1301_1400.s1348_tweet_counts_per_frequency

g1301_1400.s1349_maximum_students_taking_exam - package g1301_1400.s1349_maximum_students_taking_exam

g1301_1400.s1351_count_negative_numbers_in_a_sorted_matrix - package g1301_1400.s1351_count_negative_numbers_in_a_sorted_matrix

g1301_1400.s1352_product_of_the_last_k_numbers - package g1301_1400.s1352_product_of_the_last_k_numbers

g1301_1400.s1353_maximum_number_of_events_that_can_be_attended - package g1301_1400.s1353_maximum_number_of_events_that_can_be_attended

g1301_1400.s1354_construct_target_array_with_multiple_sums - package g1301_1400.s1354_construct_target_array_with_multiple_sums

g1301_1400.s1356_sort_integers_by_the_number_of_1_bits - package g1301_1400.s1356_sort_integers_by_the_number_of_1_bits

g1301_1400.s1357_apply_discount_every_n_orders - package g1301_1400.s1357_apply_discount_every_n_orders

g1301_1400.s1358_number_of_substrings_containing_all_three_characters - package g1301_1400.s1358_number_of_substrings_containing_all_three_characters

g1301_1400.s1359_count_all_valid_pickup_and_delivery_options - package g1301_1400.s1359_count_all_valid_pickup_and_delivery_options

g1301_1400.s1360_number_of_days_between_two_dates - package g1301_1400.s1360_number_of_days_between_two_dates

g1301_1400.s1361_validate_binary_tree_nodes - package g1301_1400.s1361_validate_binary_tree_nodes

g1301_1400.s1362_closest_divisors - package g1301_1400.s1362_closest_divisors

g1301_1400.s1363_largest_multiple_of_three - package g1301_1400.s1363_largest_multiple_of_three

g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number - package g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number

g1301_1400.s1366_rank_teams_by_votes - package g1301_1400.s1366_rank_teams_by_votes

g1301_1400.s1367_linked_list_in_binary_tree - package g1301_1400.s1367_linked_list_in_binary_tree

g1301_1400.s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid - package g1301_1400.s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid

g1301_1400.s1370_increasing_decreasing_string - package g1301_1400.s1370_increasing_decreasing_string

g1301_1400.s1371_find_the_longest_substring_containing_vowels_in_even_counts - package g1301_1400.s1371_find_the_longest_substring_containing_vowels_in_even_counts

g1301_1400.s1372_longest_zigzag_path_in_a_binary_tree - package g1301_1400.s1372_longest_zigzag_path_in_a_binary_tree

g1301_1400.s1373_maximum_sum_bst_in_binary_tree - package g1301_1400.s1373_maximum_sum_bst_in_binary_tree

g1301_1400.s1374_generate_a_string_with_characters_that_have_odd_counts - package g1301_1400.s1374_generate_a_string_with_characters_that_have_odd_counts

g1301_1400.s1375_number_of_times_binary_string_is_prefix_aligned - package g1301_1400.s1375_number_of_times_binary_string_is_prefix_aligned

g1301_1400.s1376_time_needed_to_inform_all_employees - package g1301_1400.s1376_time_needed_to_inform_all_employees

g1301_1400.s1377_frog_position_after_t_seconds - package g1301_1400.s1377_frog_position_after_t_seconds

g1301_1400.s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree - package g1301_1400.s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree

g1301_1400.s1380_lucky_numbers_in_a_matrix - package g1301_1400.s1380_lucky_numbers_in_a_matrix

g1301_1400.s1381_design_a_stack_with_increment_operation - package g1301_1400.s1381_design_a_stack_with_increment_operation

g1301_1400.s1382_balance_a_binary_search_tree - package g1301_1400.s1382_balance_a_binary_search_tree

g1301_1400.s1383_maximum_performance_of_a_team - package g1301_1400.s1383_maximum_performance_of_a_team

g1301_1400.s1385_find_the_distance_value_between_two_arrays - package g1301_1400.s1385_find_the_distance_value_between_two_arrays

g1301_1400.s1386_cinema_seat_allocation - package g1301_1400.s1386_cinema_seat_allocation

g1301_1400.s1387_sort_integers_by_the_power_value - package g1301_1400.s1387_sort_integers_by_the_power_value

g1301_1400.s1388_pizza_with_3n_slices - package g1301_1400.s1388_pizza_with_3n_slices

g1301_1400.s1389_create_target_array_in_the_given_order - package g1301_1400.s1389_create_target_array_in_the_given_order

g1301_1400.s1390_four_divisors - package g1301_1400.s1390_four_divisors

g1301_1400.s1391_check_if_there_is_a_valid_path_in_a_grid - package g1301_1400.s1391_check_if_there_is_a_valid_path_in_a_grid

g1301_1400.s1392_longest_happy_prefix - package g1301_1400.s1392_longest_happy_prefix

g1301_1400.s1394_find_lucky_integer_in_an_array - package g1301_1400.s1394_find_lucky_integer_in_an_array

g1301_1400.s1395_count_number_of_teams - package g1301_1400.s1395_count_number_of_teams

g1301_1400.s1396_design_underground_system - package g1301_1400.s1396_design_underground_system

g1301_1400.s1397_find_all_good_strings - package g1301_1400.s1397_find_all_good_strings

g1301_1400.s1399_count_largest_group - package g1301_1400.s1399_count_largest_group

g1301_1400.s1400_construct_k_palindrome_strings - package g1301_1400.s1400_construct_k_palindrome_strings

g1401_1500.s1401_circle_and_rectangle_overlapping - package g1401_1500.s1401_circle_and_rectangle_overlapping

g1401_1500.s1402_reducing_dishes - package g1401_1500.s1402_reducing_dishes

g1401_1500.s1403_minimum_subsequence_in_non_increasing_order - package g1401_1500.s1403_minimum_subsequence_in_non_increasing_order

g1401_1500.s1404_number_of_steps_to_reduce_a_number_in_binary_representation_to_one - package g1401_1500.s1404_number_of_steps_to_reduce_a_number_in_binary_representation_to_one

g1401_1500.s1405_longest_happy_string - package g1401_1500.s1405_longest_happy_string

g1401_1500.s1406_stone_game_iii - package g1401_1500.s1406_stone_game_iii

g1401_1500.s1408_string_matching_in_an_array - package g1401_1500.s1408_string_matching_in_an_array

g1401_1500.s1409_queries_on_a_permutation_with_key - package g1401_1500.s1409_queries_on_a_permutation_with_key

g1401_1500.s1410_html_entity_parser - package g1401_1500.s1410_html_entity_parser

g1401_1500.s1411_number_of_ways_to_paint_n_3_grid - package g1401_1500.s1411_number_of_ways_to_paint_n_3_grid

g1401_1500.s1413_minimum_value_to_get_positive_step_by_step_sum - package g1401_1500.s1413_minimum_value_to_get_positive_step_by_step_sum

g1401_1500.s1414_find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k - package g1401_1500.s1414_find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k

g1401_1500.s1415_the_k_th_lexicographical_string_of_all_happy_strings_of_length_n - package g1401_1500.s1415_the_k_th_lexicographical_string_of_all_happy_strings_of_length_n

g1401_1500.s1416_restore_the_array - package g1401_1500.s1416_restore_the_array

g1401_1500.s1417_reformat_the_string - package g1401_1500.s1417_reformat_the_string

g1401_1500.s1418_display_table_of_food_orders_in_a_restaurant - package g1401_1500.s1418_display_table_of_food_orders_in_a_restaurant

g1401_1500.s1419_minimum_number_of_frogs_croaking - package g1401_1500.s1419_minimum_number_of_frogs_croaking

g1401_1500.s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons - package g1401_1500.s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons

g1401_1500.s1422_maximum_score_after_splitting_a_string - package g1401_1500.s1422_maximum_score_after_splitting_a_string

g1401_1500.s1423_maximum_points_you_can_obtain_from_cards - package g1401_1500.s1423_maximum_points_you_can_obtain_from_cards

g1401_1500.s1424_diagonal_traverse_ii - package g1401_1500.s1424_diagonal_traverse_ii

g1401_1500.s1425_constrained_subsequence_sum - package g1401_1500.s1425_constrained_subsequence_sum

g1401_1500.s1431_kids_with_the_greatest_number_of_candies - package g1401_1500.s1431_kids_with_the_greatest_number_of_candies

g1401_1500.s1432_max_difference_you_can_get_from_changing_an_integer - package g1401_1500.s1432_max_difference_you_can_get_from_changing_an_integer

g1401_1500.s1433_check_if_a_string_can_break_another_string - package g1401_1500.s1433_check_if_a_string_can_break_another_string

g1401_1500.s1434_number_of_ways_to_wear_different_hats_to_each_other - package g1401_1500.s1434_number_of_ways_to_wear_different_hats_to_each_other

g1401_1500.s1436_destination_city - package g1401_1500.s1436_destination_city

g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away - package g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away

g1401_1500.s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit - package g1401_1500.s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit

g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows - package g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows

g1401_1500.s1441_build_an_array_with_stack_operations - package g1401_1500.s1441_build_an_array_with_stack_operations

g1401_1500.s1442_count_triplets_that_can_form_two_arrays_of_equal_xor - package g1401_1500.s1442_count_triplets_that_can_form_two_arrays_of_equal_xor

g1401_1500.s1443_minimum_time_to_collect_all_apples_in_a_tree - package g1401_1500.s1443_minimum_time_to_collect_all_apples_in_a_tree

g1401_1500.s1444_number_of_ways_of_cutting_a_pizza - package g1401_1500.s1444_number_of_ways_of_cutting_a_pizza

g1401_1500.s1446_consecutive_characters - package g1401_1500.s1446_consecutive_characters

g1401_1500.s1447_simplified_fractions - package g1401_1500.s1447_simplified_fractions

g1401_1500.s1448_count_good_nodes_in_binary_tree - package g1401_1500.s1448_count_good_nodes_in_binary_tree

g1401_1500.s1449_form_largest_integer_with_digits_that_add_up_to_target - package g1401_1500.s1449_form_largest_integer_with_digits_that_add_up_to_target

g1401_1500.s1450_number_of_students_doing_homework_at_a_given_time - package g1401_1500.s1450_number_of_students_doing_homework_at_a_given_time

g1401_1500.s1451_rearrange_words_in_a_sentence - package g1401_1500.s1451_rearrange_words_in_a_sentence

g1401_1500.s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list - package g1401_1500.s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list

g1401_1500.s1453_maximum_number_of_darts_inside_of_a_circular_dartboard - package g1401_1500.s1453_maximum_number_of_darts_inside_of_a_circular_dartboard

g1401_1500.s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence - package g1401_1500.s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence

g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length - package g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length

g1401_1500.s1457_pseudo_palindromic_paths_in_a_binary_tree - package g1401_1500.s1457_pseudo_palindromic_paths_in_a_binary_tree

g1401_1500.s1458_max_dot_product_of_two_subsequences - package g1401_1500.s1458_max_dot_product_of_two_subsequences

g1401_1500.s1460_make_two_arrays_equal_by_reversing_sub_arrays - package g1401_1500.s1460_make_two_arrays_equal_by_reversing_sub_arrays

g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k - package g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k

g1401_1500.s1462_course_schedule_iv - package g1401_1500.s1462_course_schedule_iv

g1401_1500.s1463_cherry_pickup_ii - package g1401_1500.s1463_cherry_pickup_ii

g1401_1500.s1464_maximum_product_of_two_elements_in_an_array - package g1401_1500.s1464_maximum_product_of_two_elements_in_an_array

g1401_1500.s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts - package g1401_1500.s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts

g1401_1500.s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero - package g1401_1500.s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero

g1401_1500.s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls - package g1401_1500.s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls

g1401_1500.s1470_shuffle_the_array - package g1401_1500.s1470_shuffle_the_array

g1401_1500.s1471_the_k_strongest_values_in_an_array - package g1401_1500.s1471_the_k_strongest_values_in_an_array

g1401_1500.s1472_design_browser_history - package g1401_1500.s1472_design_browser_history

g1401_1500.s1473_paint_house_iii - package g1401_1500.s1473_paint_house_iii

g1401_1500.s1475_final_prices_with_a_special_discount_in_a_shop - package g1401_1500.s1475_final_prices_with_a_special_discount_in_a_shop

g1401_1500.s1476_subrectangle_queries - package g1401_1500.s1476_subrectangle_queries

g1401_1500.s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum - package g1401_1500.s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum

g1401_1500.s1478_allocate_mailboxes - package g1401_1500.s1478_allocate_mailboxes

g1401_1500.s1480_running_sum_of_1d_array - package g1401_1500.s1480_running_sum_of_1d_array

g1401_1500.s1481_least_number_of_unique_integers_after_k_removals - package g1401_1500.s1481_least_number_of_unique_integers_after_k_removals

g1401_1500.s1482_minimum_number_of_days_to_make_m_bouquets - package g1401_1500.s1482_minimum_number_of_days_to_make_m_bouquets

g1401_1500.s1483_kth_ancestor_of_a_tree_node - package g1401_1500.s1483_kth_ancestor_of_a_tree_node

g1401_1500.s1486_xor_operation_in_an_array - package g1401_1500.s1486_xor_operation_in_an_array

g1401_1500.s1487_making_file_names_unique - package g1401_1500.s1487_making_file_names_unique

g1401_1500.s1488_avoid_flood_in_the_city - package g1401_1500.s1488_avoid_flood_in_the_city

g1401_1500.s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree - package g1401_1500.s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree

g1401_1500.s1491_average_salary_excluding_the_minimum_and_maximum_salary - package g1401_1500.s1491_average_salary_excluding_the_minimum_and_maximum_salary

g1401_1500.s1492_the_kth_factor_of_n - package g1401_1500.s1492_the_kth_factor_of_n

g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element - package g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element

g1401_1500.s1494_parallel_courses_ii - package g1401_1500.s1494_parallel_courses_ii

g1401_1500.s1496_path_crossing - package g1401_1500.s1496_path_crossing

g1401_1500.s1497_check_if_array_pairs_are_divisible_by_k - package g1401_1500.s1497_check_if_array_pairs_are_divisible_by_k

g1401_1500.s1498_number_of_subsequences_that_satisfy_the_given_sum_condition - package g1401_1500.s1498_number_of_subsequences_that_satisfy_the_given_sum_condition

g1401_1500.s1499_max_value_of_equation - package g1401_1500.s1499_max_value_of_equation

g1501_1600.s1502_can_make_arithmetic_progression_from_sequence - package g1501_1600.s1502_can_make_arithmetic_progression_from_sequence

g1501_1600.s1503_last_moment_before_all_ants_fall_out_of_a_plank - package g1501_1600.s1503_last_moment_before_all_ants_fall_out_of_a_plank

g1501_1600.s1504_count_submatrices_with_all_ones - package g1501_1600.s1504_count_submatrices_with_all_ones

g1501_1600.s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits - package g1501_1600.s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits

g1501_1600.s1507_reformat_date - package g1501_1600.s1507_reformat_date

g1501_1600.s1508_range_sum_of_sorted_subarray_sums - package g1501_1600.s1508_range_sum_of_sorted_subarray_sums

g1501_1600.s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves - package g1501_1600.s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves

g1501_1600.s1510_stone_game_iv - package g1501_1600.s1510_stone_game_iv

g1501_1600.s1512_number_of_good_pairs - package g1501_1600.s1512_number_of_good_pairs

g1501_1600.s1513_number_of_substrings_with_only_1s - package g1501_1600.s1513_number_of_substrings_with_only_1s

g1501_1600.s1514_path_with_maximum_probability - package g1501_1600.s1514_path_with_maximum_probability

g1501_1600.s1515_best_position_for_a_service_centre - package g1501_1600.s1515_best_position_for_a_service_centre

g1501_1600.s1518_water_bottles - package g1501_1600.s1518_water_bottles

g1501_1600.s1519_number_of_nodes_in_the_sub_tree_with_the_same_label - package g1501_1600.s1519_number_of_nodes_in_the_sub_tree_with_the_same_label

g1501_1600.s1520_maximum_number_of_non_overlapping_substrings - package g1501_1600.s1520_maximum_number_of_non_overlapping_substrings

g1501_1600.s1521_find_a_value_of_a_mysterious_function_closest_to_target - package g1501_1600.s1521_find_a_value_of_a_mysterious_function_closest_to_target

g1501_1600.s1523_count_odd_numbers_in_an_interval_range - package g1501_1600.s1523_count_odd_numbers_in_an_interval_range

g1501_1600.s1524_number_of_sub_arrays_with_odd_sum - package g1501_1600.s1524_number_of_sub_arrays_with_odd_sum

g1501_1600.s1525_number_of_good_ways_to_split_a_string - package g1501_1600.s1525_number_of_good_ways_to_split_a_string

g1501_1600.s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array - package g1501_1600.s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array

g1501_1600.s1528_shuffle_string - package g1501_1600.s1528_shuffle_string

g1501_1600.s1529_bulb_switcher_iv - package g1501_1600.s1529_bulb_switcher_iv

g1501_1600.s1530_number_of_good_leaf_nodes_pairs - package g1501_1600.s1530_number_of_good_leaf_nodes_pairs

g1501_1600.s1531_string_compression_ii - package g1501_1600.s1531_string_compression_ii

g1501_1600.s1534_count_good_triplets - package g1501_1600.s1534_count_good_triplets

g1501_1600.s1535_find_the_winner_of_an_array_game - package g1501_1600.s1535_find_the_winner_of_an_array_game

g1501_1600.s1536_minimum_swaps_to_arrange_a_binary_grid - package g1501_1600.s1536_minimum_swaps_to_arrange_a_binary_grid

g1501_1600.s1537_get_the_maximum_score - package g1501_1600.s1537_get_the_maximum_score

g1501_1600.s1539_kth_missing_positive_number - package g1501_1600.s1539_kth_missing_positive_number

g1501_1600.s1540_can_convert_string_in_k_moves - package g1501_1600.s1540_can_convert_string_in_k_moves

g1501_1600.s1541_minimum_insertions_to_balance_a_parentheses_string - package g1501_1600.s1541_minimum_insertions_to_balance_a_parentheses_string

g1501_1600.s1542_find_longest_awesome_substring - package g1501_1600.s1542_find_longest_awesome_substring

g1501_1600.s1544_make_the_string_great - package g1501_1600.s1544_make_the_string_great

g1501_1600.s1545_find_kth_bit_in_nth_binary_string - package g1501_1600.s1545_find_kth_bit_in_nth_binary_string

g1501_1600.s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target - package g1501_1600.s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target

g1501_1600.s1547_minimum_cost_to_cut_a_stick - package g1501_1600.s1547_minimum_cost_to_cut_a_stick

g1501_1600.s1550_three_consecutive_odds - package g1501_1600.s1550_three_consecutive_odds

g1501_1600.s1551_minimum_operations_to_make_array_equal - package g1501_1600.s1551_minimum_operations_to_make_array_equal

g1501_1600.s1552_magnetic_force_between_two_balls - package g1501_1600.s1552_magnetic_force_between_two_balls

g1501_1600.s1553_minimum_number_of_days_to_eat_n_oranges - package g1501_1600.s1553_minimum_number_of_days_to_eat_n_oranges

g1501_1600.s1556_thousand_separator - package g1501_1600.s1556_thousand_separator

g1501_1600.s1557_minimum_number_of_vertices_to_reach_all_nodes - package g1501_1600.s1557_minimum_number_of_vertices_to_reach_all_nodes

g1501_1600.s1558_minimum_numbers_of_function_calls_to_make_target_array - package g1501_1600.s1558_minimum_numbers_of_function_calls_to_make_target_array

g1501_1600.s1559_detect_cycles_in_2d_grid - package g1501_1600.s1559_detect_cycles_in_2d_grid

g1501_1600.s1560_most_visited_sector_in_a_circular_track - package g1501_1600.s1560_most_visited_sector_in_a_circular_track

g1501_1600.s1561_maximum_number_of_coins_you_can_get - package g1501_1600.s1561_maximum_number_of_coins_you_can_get

g1501_1600.s1562_find_latest_group_of_size_m - package g1501_1600.s1562_find_latest_group_of_size_m

g1501_1600.s1563_stone_game_v - package g1501_1600.s1563_stone_game_v

g1501_1600.s1566_detect_pattern_of_length_m_repeated_k_or_more_times - package g1501_1600.s1566_detect_pattern_of_length_m_repeated_k_or_more_times

g1501_1600.s1567_maximum_length_of_subarray_with_positive_product - package g1501_1600.s1567_maximum_length_of_subarray_with_positive_product

g1501_1600.s1568_minimum_number_of_days_to_disconnect_island - package g1501_1600.s1568_minimum_number_of_days_to_disconnect_island

g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst - package g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst

g1501_1600.s1572_matrix_diagonal_sum - package g1501_1600.s1572_matrix_diagonal_sum

g1501_1600.s1573_number_of_ways_to_split_a_string - package g1501_1600.s1573_number_of_ways_to_split_a_string

g1501_1600.s1574_shortest_subarray_to_be_removed_to_make_array_sorted - package g1501_1600.s1574_shortest_subarray_to_be_removed_to_make_array_sorted

g1501_1600.s1575_count_all_possible_routes - package g1501_1600.s1575_count_all_possible_routes

g1501_1600.s1576_replace_all_s_to_avoid_consecutive_repeating_characters - package g1501_1600.s1576_replace_all_s_to_avoid_consecutive_repeating_characters

g1501_1600.s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers - package g1501_1600.s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers

g1501_1600.s1578_minimum_time_to_make_rope_colorful - package g1501_1600.s1578_minimum_time_to_make_rope_colorful

g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable - package g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable

g1501_1600.s1582_special_positions_in_a_binary_matrix - package g1501_1600.s1582_special_positions_in_a_binary_matrix

g1501_1600.s1583_count_unhappy_friends - package g1501_1600.s1583_count_unhappy_friends

g1501_1600.s1584_min_cost_to_connect_all_points - package g1501_1600.s1584_min_cost_to_connect_all_points

g1501_1600.s1585_check_if_string_is_transformable_with_substring_sort_operations - package g1501_1600.s1585_check_if_string_is_transformable_with_substring_sort_operations

g1501_1600.s1588_sum_of_all_odd_length_subarrays - package g1501_1600.s1588_sum_of_all_odd_length_subarrays

g1501_1600.s1589_maximum_sum_obtained_of_any_permutation - package g1501_1600.s1589_maximum_sum_obtained_of_any_permutation

g1501_1600.s1590_make_sum_divisible_by_p - package g1501_1600.s1590_make_sum_divisible_by_p

g1501_1600.s1591_strange_printer_ii - package g1501_1600.s1591_strange_printer_ii

g1501_1600.s1592_rearrange_spaces_between_words - package g1501_1600.s1592_rearrange_spaces_between_words

g1501_1600.s1593_split_a_string_into_the_max_number_of_unique_substrings - package g1501_1600.s1593_split_a_string_into_the_max_number_of_unique_substrings

g1501_1600.s1594_maximum_non_negative_product_in_a_matrix - package g1501_1600.s1594_maximum_non_negative_product_in_a_matrix

g1501_1600.s1595_minimum_cost_to_connect_two_groups_of_points - package g1501_1600.s1595_minimum_cost_to_connect_two_groups_of_points

g1501_1600.s1598_crawler_log_folder - package g1501_1600.s1598_crawler_log_folder

g1501_1600.s1599_maximum_profit_of_operating_a_centennial_wheel - package g1501_1600.s1599_maximum_profit_of_operating_a_centennial_wheel

g1501_1600.s1600_throne_inheritance - package g1501_1600.s1600_throne_inheritance

g1601_1700.s1601_maximum_number_of_achievable_transfer_requests - package g1601_1700.s1601_maximum_number_of_achievable_transfer_requests

g1601_1700.s1603_design_parking_system - package g1601_1700.s1603_design_parking_system

g1601_1700.s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period - package g1601_1700.s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period

g1601_1700.s1605_find_valid_matrix_given_row_and_column_sums - package g1601_1700.s1605_find_valid_matrix_given_row_and_column_sums

g1601_1700.s1606_find_servers_that_handled_most_number_of_requests - package g1601_1700.s1606_find_servers_that_handled_most_number_of_requests

g1601_1700.s1608_special_array_with_x_elements_greater_than_or_equal_x - package g1601_1700.s1608_special_array_with_x_elements_greater_than_or_equal_x

g1601_1700.s1609_even_odd_tree - package g1601_1700.s1609_even_odd_tree

g1601_1700.s1610_maximum_number_of_visible_points - package g1601_1700.s1610_maximum_number_of_visible_points

g1601_1700.s1611_minimum_one_bit_operations_to_make_integers_zero - package g1601_1700.s1611_minimum_one_bit_operations_to_make_integers_zero

g1601_1700.s1614_maximum_nesting_depth_of_the_parentheses - package g1601_1700.s1614_maximum_nesting_depth_of_the_parentheses

g1601_1700.s1615_maximal_network_rank - package g1601_1700.s1615_maximal_network_rank

g1601_1700.s1616_split_two_strings_to_make_palindrome - package g1601_1700.s1616_split_two_strings_to_make_palindrome

g1601_1700.s1617_count_subtrees_with_max_distance_between_cities - package g1601_1700.s1617_count_subtrees_with_max_distance_between_cities

g1601_1700.s1619_mean_of_array_after_removing_some_elements - package g1601_1700.s1619_mean_of_array_after_removing_some_elements

g1601_1700.s1620_coordinate_with_maximum_network_quality - package g1601_1700.s1620_coordinate_with_maximum_network_quality

g1601_1700.s1621_number_of_sets_of_k_non_overlapping_line_segments - package g1601_1700.s1621_number_of_sets_of_k_non_overlapping_line_segments

g1601_1700.s1622_fancy_sequence - package g1601_1700.s1622_fancy_sequence

g1601_1700.s1624_largest_substring_between_two_equal_characters - package g1601_1700.s1624_largest_substring_between_two_equal_characters

g1601_1700.s1625_lexicographically_smallest_string_after_applying_operations - package g1601_1700.s1625_lexicographically_smallest_string_after_applying_operations

g1601_1700.s1626_best_team_with_no_conflicts - package g1601_1700.s1626_best_team_with_no_conflicts

g1601_1700.s1627_graph_connectivity_with_threshold - package g1601_1700.s1627_graph_connectivity_with_threshold

g1601_1700.s1629_slowest_key - package g1601_1700.s1629_slowest_key

g1601_1700.s1630_arithmetic_subarrays - package g1601_1700.s1630_arithmetic_subarrays

g1601_1700.s1631_path_with_minimum_effort - package g1601_1700.s1631_path_with_minimum_effort

g1601_1700.s1632_rank_transform_of_a_matrix - package g1601_1700.s1632_rank_transform_of_a_matrix

g1601_1700.s1636_sort_array_by_increasing_frequency - package g1601_1700.s1636_sort_array_by_increasing_frequency

g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points - package g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points

g1601_1700.s1638_count_substrings_that_differ_by_one_character - package g1601_1700.s1638_count_substrings_that_differ_by_one_character

g1601_1700.s1639_number_of_ways_to_form_a_target_string_given_a_dictionary - package g1601_1700.s1639_number_of_ways_to_form_a_target_string_given_a_dictionary

g1601_1700.s1640_check_array_formation_through_concatenation - package g1601_1700.s1640_check_array_formation_through_concatenation

g1601_1700.s1641_count_sorted_vowel_strings - package g1601_1700.s1641_count_sorted_vowel_strings

g1601_1700.s1642_furthest_building_you_can_reach - package g1601_1700.s1642_furthest_building_you_can_reach

g1601_1700.s1643_kth_smallest_instructions - package g1601_1700.s1643_kth_smallest_instructions

g1601_1700.s1646_get_maximum_in_generated_array - package g1601_1700.s1646_get_maximum_in_generated_array

g1601_1700.s1647_minimum_deletions_to_make_character_frequencies_unique - package g1601_1700.s1647_minimum_deletions_to_make_character_frequencies_unique

g1601_1700.s1648_sell_diminishing_valued_colored_balls - package g1601_1700.s1648_sell_diminishing_valued_colored_balls

g1601_1700.s1649_create_sorted_array_through_instructions - package g1601_1700.s1649_create_sorted_array_through_instructions

g1601_1700.s1652_defuse_the_bomb - package g1601_1700.s1652_defuse_the_bomb

g1601_1700.s1653_minimum_deletions_to_make_string_balanced - package g1601_1700.s1653_minimum_deletions_to_make_string_balanced

g1601_1700.s1654_minimum_jumps_to_reach_home - package g1601_1700.s1654_minimum_jumps_to_reach_home

g1601_1700.s1655_distribute_repeating_integers - package g1601_1700.s1655_distribute_repeating_integers

g1601_1700.s1656_design_an_ordered_stream - package g1601_1700.s1656_design_an_ordered_stream

g1601_1700.s1657_determine_if_two_strings_are_close - package g1601_1700.s1657_determine_if_two_strings_are_close

g1601_1700.s1658_minimum_operations_to_reduce_x_to_zero - package g1601_1700.s1658_minimum_operations_to_reduce_x_to_zero

g1601_1700.s1659_maximize_grid_happiness - package g1601_1700.s1659_maximize_grid_happiness

g1601_1700.s1662_check_if_two_string_arrays_are_equivalent - package g1601_1700.s1662_check_if_two_string_arrays_are_equivalent

g1601_1700.s1663_smallest_string_with_a_given_numeric_value - package g1601_1700.s1663_smallest_string_with_a_given_numeric_value

g1601_1700.s1664_ways_to_make_a_fair_array - package g1601_1700.s1664_ways_to_make_a_fair_array

g1601_1700.s1665_minimum_initial_energy_to_finish_tasks - package g1601_1700.s1665_minimum_initial_energy_to_finish_tasks

g1601_1700.s1668_maximum_repeating_substring - package g1601_1700.s1668_maximum_repeating_substring

g1601_1700.s1669_merge_in_between_linked_lists - package g1601_1700.s1669_merge_in_between_linked_lists

g1601_1700.s1670_design_front_middle_back_queue - package g1601_1700.s1670_design_front_middle_back_queue

g1601_1700.s1671_minimum_number_of_removals_to_make_mountain_array - package g1601_1700.s1671_minimum_number_of_removals_to_make_mountain_array

g1601_1700.s1672_richest_customer_wealth - package g1601_1700.s1672_richest_customer_wealth

g1601_1700.s1673_find_the_most_competitive_subsequence - package g1601_1700.s1673_find_the_most_competitive_subsequence

g1601_1700.s1674_minimum_moves_to_make_array_complementary - package g1601_1700.s1674_minimum_moves_to_make_array_complementary

g1601_1700.s1675_minimize_deviation_in_array - package g1601_1700.s1675_minimize_deviation_in_array

g1601_1700.s1678_goal_parser_interpretation - package g1601_1700.s1678_goal_parser_interpretation

g1601_1700.s1679_max_number_of_k_sum_pairs - package g1601_1700.s1679_max_number_of_k_sum_pairs

g1601_1700.s1680_concatenation_of_consecutive_binary_numbers - package g1601_1700.s1680_concatenation_of_consecutive_binary_numbers

g1601_1700.s1681_minimum_incompatibility - package g1601_1700.s1681_minimum_incompatibility

g1601_1700.s1684_count_the_number_of_consistent_strings - package g1601_1700.s1684_count_the_number_of_consistent_strings

g1601_1700.s1685_sum_of_absolute_differences_in_a_sorted_array - package g1601_1700.s1685_sum_of_absolute_differences_in_a_sorted_array

g1601_1700.s1686_stone_game_vi - package g1601_1700.s1686_stone_game_vi

g1601_1700.s1687_delivering_boxes_from_storage_to_ports - package g1601_1700.s1687_delivering_boxes_from_storage_to_ports

g1601_1700.s1688_count_of_matches_in_tournament - package g1601_1700.s1688_count_of_matches_in_tournament

g1601_1700.s1689_partitioning_into_minimum_number_of_deci_binary_numbers - package g1601_1700.s1689_partitioning_into_minimum_number_of_deci_binary_numbers

g1601_1700.s1690_stone_game_vii - package g1601_1700.s1690_stone_game_vii

g1601_1700.s1691_maximum_height_by_stacking_cuboids - package g1601_1700.s1691_maximum_height_by_stacking_cuboids

g1601_1700.s1694_reformat_phone_number - package g1601_1700.s1694_reformat_phone_number

g1601_1700.s1695_maximum_erasure_value - package g1601_1700.s1695_maximum_erasure_value

g1601_1700.s1696_jump_game_vi - package g1601_1700.s1696_jump_game_vi

g1601_1700.s1697_checking_existence_of_edge_length_limited_paths - package g1601_1700.s1697_checking_existence_of_edge_length_limited_paths

g1601_1700.s1700_number_of_students_unable_to_eat_lunch - package g1601_1700.s1700_number_of_students_unable_to_eat_lunch

g1701_1800.s1701_average_waiting_time - package g1701_1800.s1701_average_waiting_time

g1701_1800.s1702_maximum_binary_string_after_change - package g1701_1800.s1702_maximum_binary_string_after_change

g1701_1800.s1703_minimum_adjacent_swaps_for_k_consecutive_ones - package g1701_1800.s1703_minimum_adjacent_swaps_for_k_consecutive_ones

g1701_1800.s1704_determine_if_string_halves_are_alike - package g1701_1800.s1704_determine_if_string_halves_are_alike

g1701_1800.s1705_maximum_number_of_eaten_apples - package g1701_1800.s1705_maximum_number_of_eaten_apples

g1701_1800.s1706_where_will_the_ball_fall - package g1701_1800.s1706_where_will_the_ball_fall

g1701_1800.s1707_maximum_xor_with_an_element_from_array - package g1701_1800.s1707_maximum_xor_with_an_element_from_array

g1701_1800.s1710_maximum_units_on_a_truck - package g1701_1800.s1710_maximum_units_on_a_truck

g1701_1800.s1711_count_good_meals - package g1701_1800.s1711_count_good_meals

g1701_1800.s1712_ways_to_split_array_into_three_subarrays - package g1701_1800.s1712_ways_to_split_array_into_three_subarrays

g1701_1800.s1713_minimum_operations_to_make_a_subsequence - package g1701_1800.s1713_minimum_operations_to_make_a_subsequence

g1701_1800.s1716_calculate_money_in_leetcode_bank - package g1701_1800.s1716_calculate_money_in_leetcode_bank

g1701_1800.s1717_maximum_score_from_removing_substrings - package g1701_1800.s1717_maximum_score_from_removing_substrings

g1701_1800.s1718_construct_the_lexicographically_largest_valid_sequence - package g1701_1800.s1718_construct_the_lexicographically_largest_valid_sequence

g1701_1800.s1719_number_of_ways_to_reconstruct_a_tree - package g1701_1800.s1719_number_of_ways_to_reconstruct_a_tree

g1701_1800.s1720_decode_xored_array - package g1701_1800.s1720_decode_xored_array

g1701_1800.s1721_swapping_nodes_in_a_linked_list - package g1701_1800.s1721_swapping_nodes_in_a_linked_list

g1701_1800.s1722_minimize_hamming_distance_after_swap_operations - package g1701_1800.s1722_minimize_hamming_distance_after_swap_operations

g1701_1800.s1723_find_minimum_time_to_finish_all_jobs - package g1701_1800.s1723_find_minimum_time_to_finish_all_jobs

g1701_1800.s1725_number_of_rectangles_that_can_form_the_largest_square - package g1701_1800.s1725_number_of_rectangles_that_can_form_the_largest_square

g1701_1800.s1726_tuple_with_same_product - package g1701_1800.s1726_tuple_with_same_product

g1701_1800.s1727_largest_submatrix_with_rearrangements - package g1701_1800.s1727_largest_submatrix_with_rearrangements

g1701_1800.s1728_cat_and_mouse_ii - package g1701_1800.s1728_cat_and_mouse_ii

g1701_1800.s1732_find_the_highest_altitude - package g1701_1800.s1732_find_the_highest_altitude

g1701_1800.s1733_minimum_number_of_people_to_teach - package g1701_1800.s1733_minimum_number_of_people_to_teach

g1701_1800.s1734_decode_xored_permutation - package g1701_1800.s1734_decode_xored_permutation

g1701_1800.s1735_count_ways_to_make_array_with_product - package g1701_1800.s1735_count_ways_to_make_array_with_product

g1701_1800.s1736_latest_time_by_replacing_hidden_digits - package g1701_1800.s1736_latest_time_by_replacing_hidden_digits

g1701_1800.s1737_change_minimum_characters_to_satisfy_one_of_three_conditions - package g1701_1800.s1737_change_minimum_characters_to_satisfy_one_of_three_conditions

g1701_1800.s1738_find_kth_largest_xor_coordinate_value - package g1701_1800.s1738_find_kth_largest_xor_coordinate_value

g1701_1800.s1739_building_boxes - package g1701_1800.s1739_building_boxes

g1701_1800.s1742_maximum_number_of_balls_in_a_box - package g1701_1800.s1742_maximum_number_of_balls_in_a_box

g1701_1800.s1743_restore_the_array_from_adjacent_pairs - package g1701_1800.s1743_restore_the_array_from_adjacent_pairs

g1701_1800.s1744_can_you_eat_your_favorite_candy_on_your_favorite_day - package g1701_1800.s1744_can_you_eat_your_favorite_candy_on_your_favorite_day

g1701_1800.s1745_palindrome_partitioning_iv - package g1701_1800.s1745_palindrome_partitioning_iv

g1701_1800.s1748_sum_of_unique_elements - package g1701_1800.s1748_sum_of_unique_elements

g1701_1800.s1749_maximum_absolute_sum_of_any_subarray - package g1701_1800.s1749_maximum_absolute_sum_of_any_subarray

g1701_1800.s1750_minimum_length_of_string_after_deleting_similar_ends - package g1701_1800.s1750_minimum_length_of_string_after_deleting_similar_ends

g1701_1800.s1751_maximum_number_of_events_that_can_be_attended_ii - package g1701_1800.s1751_maximum_number_of_events_that_can_be_attended_ii

g1701_1800.s1752_check_if_array_is_sorted_and_rotated - package g1701_1800.s1752_check_if_array_is_sorted_and_rotated

g1701_1800.s1753_maximum_score_from_removing_stones - package g1701_1800.s1753_maximum_score_from_removing_stones

g1701_1800.s1754_largest_merge_of_two_strings - package g1701_1800.s1754_largest_merge_of_two_strings

g1701_1800.s1755_closest_subsequence_sum - package g1701_1800.s1755_closest_subsequence_sum

g1701_1800.s1758_minimum_changes_to_make_alternating_binary_string - package g1701_1800.s1758_minimum_changes_to_make_alternating_binary_string

g1701_1800.s1759_count_number_of_homogenous_substrings - package g1701_1800.s1759_count_number_of_homogenous_substrings

g1701_1800.s1760_minimum_limit_of_balls_in_a_bag - package g1701_1800.s1760_minimum_limit_of_balls_in_a_bag

g1701_1800.s1761_minimum_degree_of_a_connected_trio_in_a_graph - package g1701_1800.s1761_minimum_degree_of_a_connected_trio_in_a_graph

g1701_1800.s1763_longest_nice_substring - package g1701_1800.s1763_longest_nice_substring

g1701_1800.s1764_form_array_by_concatenating_subarrays_of_another_array - package g1701_1800.s1764_form_array_by_concatenating_subarrays_of_another_array

g1701_1800.s1765_map_of_highest_peak - package g1701_1800.s1765_map_of_highest_peak

g1701_1800.s1766_tree_of_coprimes - package g1701_1800.s1766_tree_of_coprimes

g1701_1800.s1768_merge_strings_alternately - package g1701_1800.s1768_merge_strings_alternately

g1701_1800.s1769_minimum_number_of_operations_to_move_all_balls_to_each_box - package g1701_1800.s1769_minimum_number_of_operations_to_move_all_balls_to_each_box

g1701_1800.s1770_maximum_score_from_performing_multiplication_operations - package g1701_1800.s1770_maximum_score_from_performing_multiplication_operations

g1701_1800.s1771_maximize_palindrome_length_from_subsequences - package g1701_1800.s1771_maximize_palindrome_length_from_subsequences

g1701_1800.s1773_count_items_matching_a_rule - package g1701_1800.s1773_count_items_matching_a_rule

g1701_1800.s1774_closest_dessert_cost - package g1701_1800.s1774_closest_dessert_cost

g1701_1800.s1775_equal_sum_arrays_with_minimum_number_of_operations - package g1701_1800.s1775_equal_sum_arrays_with_minimum_number_of_operations

g1701_1800.s1776_car_fleet_ii - package g1701_1800.s1776_car_fleet_ii

g1701_1800.s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate - package g1701_1800.s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate

g1701_1800.s1780_check_if_number_is_a_sum_of_powers_of_three - package g1701_1800.s1780_check_if_number_is_a_sum_of_powers_of_three

g1701_1800.s1781_sum_of_beauty_of_all_substrings - package g1701_1800.s1781_sum_of_beauty_of_all_substrings

g1701_1800.s1782_count_pairs_of_nodes - package g1701_1800.s1782_count_pairs_of_nodes

g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones - package g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones

g1701_1800.s1785_minimum_elements_to_add_to_form_a_given_sum - package g1701_1800.s1785_minimum_elements_to_add_to_form_a_given_sum

g1701_1800.s1786_number_of_restricted_paths_from_first_to_last_node - package g1701_1800.s1786_number_of_restricted_paths_from_first_to_last_node

g1701_1800.s1787_make_the_xor_of_all_segments_equal_to_zero - package g1701_1800.s1787_make_the_xor_of_all_segments_equal_to_zero

g1701_1800.s1790_check_if_one_string_swap_can_make_strings_equal - package g1701_1800.s1790_check_if_one_string_swap_can_make_strings_equal

g1701_1800.s1791_find_center_of_star_graph - package g1701_1800.s1791_find_center_of_star_graph

g1701_1800.s1792_maximum_average_pass_ratio - package g1701_1800.s1792_maximum_average_pass_ratio

g1701_1800.s1793_maximum_score_of_a_good_subarray - package g1701_1800.s1793_maximum_score_of_a_good_subarray

g1701_1800.s1796_second_largest_digit_in_a_string - package g1701_1800.s1796_second_largest_digit_in_a_string

g1701_1800.s1797_design_authentication_manager - package g1701_1800.s1797_design_authentication_manager

g1701_1800.s1798_maximum_number_of_consecutive_values_you_can_make - package g1701_1800.s1798_maximum_number_of_consecutive_values_you_can_make

g1701_1800.s1799_maximize_score_after_n_operations - package g1701_1800.s1799_maximize_score_after_n_operations

g1701_1800.s1800_maximum_ascending_subarray_sum - package g1701_1800.s1800_maximum_ascending_subarray_sum

g1801_1900.s1801_number_of_orders_in_the_backlog - package g1801_1900.s1801_number_of_orders_in_the_backlog

g1801_1900.s1802_maximum_value_at_a_given_index_in_a_bounded_array - package g1801_1900.s1802_maximum_value_at_a_given_index_in_a_bounded_array

g1801_1900.s1803_count_pairs_with_xor_in_a_range - package g1801_1900.s1803_count_pairs_with_xor_in_a_range

g1801_1900.s1805_number_of_different_integers_in_a_string - package g1801_1900.s1805_number_of_different_integers_in_a_string

g1801_1900.s1806_minimum_number_of_operations_to_reinitialize_a_permutation - package g1801_1900.s1806_minimum_number_of_operations_to_reinitialize_a_permutation

g1801_1900.s1807_evaluate_the_bracket_pairs_of_a_string - package g1801_1900.s1807_evaluate_the_bracket_pairs_of_a_string

g1801_1900.s1808_maximize_number_of_nice_divisors - package g1801_1900.s1808_maximize_number_of_nice_divisors

g1801_1900.s1812_determine_color_of_a_chessboard_square - package g1801_1900.s1812_determine_color_of_a_chessboard_square

g1801_1900.s1813_sentence_similarity_iii - package g1801_1900.s1813_sentence_similarity_iii

g1801_1900.s1814_count_nice_pairs_in_an_array - package g1801_1900.s1814_count_nice_pairs_in_an_array

g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts - package g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts

g1801_1900.s1816_truncate_sentence - package g1801_1900.s1816_truncate_sentence

g1801_1900.s1817_finding_the_users_active_minutes - package g1801_1900.s1817_finding_the_users_active_minutes

g1801_1900.s1818_minimum_absolute_sum_difference - package g1801_1900.s1818_minimum_absolute_sum_difference

g1801_1900.s1819_number_of_different_subsequences_gcds - package g1801_1900.s1819_number_of_different_subsequences_gcds

g1801_1900.s1822_sign_of_the_product_of_an_array - package g1801_1900.s1822_sign_of_the_product_of_an_array

g1801_1900.s1823_find_the_winner_of_the_circular_game - package g1801_1900.s1823_find_the_winner_of_the_circular_game

g1801_1900.s1824_minimum_sideway_jumps - package g1801_1900.s1824_minimum_sideway_jumps

g1801_1900.s1825_finding_mk_average - package g1801_1900.s1825_finding_mk_average

g1801_1900.s1827_minimum_operations_to_make_the_array_increasing - package g1801_1900.s1827_minimum_operations_to_make_the_array_increasing

g1801_1900.s1828_queries_on_number_of_points_inside_a_circle - package g1801_1900.s1828_queries_on_number_of_points_inside_a_circle

g1801_1900.s1829_maximum_xor_for_each_query - package g1801_1900.s1829_maximum_xor_for_each_query

g1801_1900.s1830_minimum_number_of_operations_to_make_string_sorted - package g1801_1900.s1830_minimum_number_of_operations_to_make_string_sorted

g1801_1900.s1832_check_if_the_sentence_is_pangram - package g1801_1900.s1832_check_if_the_sentence_is_pangram

g1801_1900.s1833_maximum_ice_cream_bars - package g1801_1900.s1833_maximum_ice_cream_bars

g1801_1900.s1834_single_threaded_cpu - package g1801_1900.s1834_single_threaded_cpu

g1801_1900.s1835_find_xor_sum_of_all_pairs_bitwise_and - package g1801_1900.s1835_find_xor_sum_of_all_pairs_bitwise_and

g1801_1900.s1837_sum_of_digits_in_base_k - package g1801_1900.s1837_sum_of_digits_in_base_k

g1801_1900.s1838_frequency_of_the_most_frequent_element - package g1801_1900.s1838_frequency_of_the_most_frequent_element

g1801_1900.s1839_longest_substring_of_all_vowels_in_order - package g1801_1900.s1839_longest_substring_of_all_vowels_in_order

g1801_1900.s1840_maximum_building_height - package g1801_1900.s1840_maximum_building_height

g1801_1900.s1844_replace_all_digits_with_characters - package g1801_1900.s1844_replace_all_digits_with_characters

g1801_1900.s1845_seat_reservation_manager - package g1801_1900.s1845_seat_reservation_manager

g1801_1900.s1846_maximum_element_after_decreasing_and_rearranging - package g1801_1900.s1846_maximum_element_after_decreasing_and_rearranging

g1801_1900.s1847_closest_room - package g1801_1900.s1847_closest_room

g1801_1900.s1848_minimum_distance_to_the_target_element - package g1801_1900.s1848_minimum_distance_to_the_target_element

g1801_1900.s1849_splitting_a_string_into_descending_consecutive_values - package g1801_1900.s1849_splitting_a_string_into_descending_consecutive_values

g1801_1900.s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number - package g1801_1900.s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number

g1801_1900.s1851_minimum_interval_to_include_each_query - package g1801_1900.s1851_minimum_interval_to_include_each_query

g1801_1900.s1854_maximum_population_year - package g1801_1900.s1854_maximum_population_year

g1801_1900.s1855_maximum_distance_between_a_pair_of_values - package g1801_1900.s1855_maximum_distance_between_a_pair_of_values

g1801_1900.s1856_maximum_subarray_min_product - package g1801_1900.s1856_maximum_subarray_min_product

g1801_1900.s1857_largest_color_value_in_a_directed_graph - package g1801_1900.s1857_largest_color_value_in_a_directed_graph

g1801_1900.s1859_sorting_the_sentence - package g1801_1900.s1859_sorting_the_sentence

g1801_1900.s1860_incremental_memory_leak - package g1801_1900.s1860_incremental_memory_leak

g1801_1900.s1861_rotating_the_box - package g1801_1900.s1861_rotating_the_box

g1801_1900.s1862_sum_of_floored_pairs - package g1801_1900.s1862_sum_of_floored_pairs

g1801_1900.s1863_sum_of_all_subset_xor_totals - package g1801_1900.s1863_sum_of_all_subset_xor_totals

g1801_1900.s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating - package g1801_1900.s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating

g1801_1900.s1865_finding_pairs_with_a_certain_sum - package g1801_1900.s1865_finding_pairs_with_a_certain_sum

g1801_1900.s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible - package g1801_1900.s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible

g1801_1900.s1869_longer_contiguous_segments_of_ones_than_zeros - package g1801_1900.s1869_longer_contiguous_segments_of_ones_than_zeros

g1801_1900.s1870_minimum_speed_to_arrive_on_time - package g1801_1900.s1870_minimum_speed_to_arrive_on_time

g1801_1900.s1871_jump_game_vii - package g1801_1900.s1871_jump_game_vii

g1801_1900.s1872_stone_game_viii - package g1801_1900.s1872_stone_game_viii

g1801_1900.s1876_substrings_of_size_three_with_distinct_characters - package g1801_1900.s1876_substrings_of_size_three_with_distinct_characters

g1801_1900.s1877_minimize_maximum_pair_sum_in_array - package g1801_1900.s1877_minimize_maximum_pair_sum_in_array

g1801_1900.s1878_get_biggest_three_rhombus_sums_in_a_grid - package g1801_1900.s1878_get_biggest_three_rhombus_sums_in_a_grid

g1801_1900.s1879_minimum_xor_sum_of_two_arrays - package g1801_1900.s1879_minimum_xor_sum_of_two_arrays

g1801_1900.s1880_check_if_word_equals_summation_of_two_words - package g1801_1900.s1880_check_if_word_equals_summation_of_two_words

g1801_1900.s1881_maximum_value_after_insertion - package g1801_1900.s1881_maximum_value_after_insertion

g1801_1900.s1882_process_tasks_using_servers - package g1801_1900.s1882_process_tasks_using_servers

g1801_1900.s1883_minimum_skips_to_arrive_at_meeting_on_time - package g1801_1900.s1883_minimum_skips_to_arrive_at_meeting_on_time

g1801_1900.s1884_egg_drop_with_2_eggs_and_n_floors - package g1801_1900.s1884_egg_drop_with_2_eggs_and_n_floors

g1801_1900.s1886_determine_whether_matrix_can_be_obtained_by_rotation - package g1801_1900.s1886_determine_whether_matrix_can_be_obtained_by_rotation

g1801_1900.s1887_reduction_operations_to_make_the_array_elements_equal - package g1801_1900.s1887_reduction_operations_to_make_the_array_elements_equal

g1801_1900.s1888_minimum_number_of_flips_to_make_the_binary_string_alternating - package g1801_1900.s1888_minimum_number_of_flips_to_make_the_binary_string_alternating

g1801_1900.s1889_minimum_space_wasted_from_packaging - package g1801_1900.s1889_minimum_space_wasted_from_packaging

g1801_1900.s1893_check_if_all_the_integers_in_a_range_are_covered - package g1801_1900.s1893_check_if_all_the_integers_in_a_range_are_covered

g1801_1900.s1894_find_the_student_that_will_replace_the_chalk - package g1801_1900.s1894_find_the_student_that_will_replace_the_chalk

g1801_1900.s1895_largest_magic_square - package g1801_1900.s1895_largest_magic_square

g1801_1900.s1896_minimum_cost_to_change_the_final_value_of_expression - package g1801_1900.s1896_minimum_cost_to_change_the_final_value_of_expression

g1801_1900.s1897_redistribute_characters_to_make_all_strings_equal - package g1801_1900.s1897_redistribute_characters_to_make_all_strings_equal

g1801_1900.s1898_maximum_number_of_removable_characters - package g1801_1900.s1898_maximum_number_of_removable_characters

g1801_1900.s1899_merge_triplets_to_form_target_triplet - package g1801_1900.s1899_merge_triplets_to_form_target_triplet

g1801_1900.s1900_the_earliest_and_latest_rounds_where_players_compete - package g1801_1900.s1900_the_earliest_and_latest_rounds_where_players_compete

g1901_2000.s1901_find_a_peak_element_ii - package g1901_2000.s1901_find_a_peak_element_ii

g1901_2000.s1903_largest_odd_number_in_string - package g1901_2000.s1903_largest_odd_number_in_string

g1901_2000.s1904_the_number_of_full_rounds_you_have_played - package g1901_2000.s1904_the_number_of_full_rounds_you_have_played

g1901_2000.s1905_count_sub_islands - package g1901_2000.s1905_count_sub_islands

g1901_2000.s1906_minimum_absolute_difference_queries - package g1901_2000.s1906_minimum_absolute_difference_queries

g1901_2000.s1909_remove_one_element_to_make_the_array_strictly_increasing - package g1901_2000.s1909_remove_one_element_to_make_the_array_strictly_increasing

g1901_2000.s1910_remove_all_occurrences_of_a_substring - package g1901_2000.s1910_remove_all_occurrences_of_a_substring

g1901_2000.s1911_maximum_alternating_subsequence_sum - package g1901_2000.s1911_maximum_alternating_subsequence_sum

g1901_2000.s1912_design_movie_rental_system - package g1901_2000.s1912_design_movie_rental_system

g1901_2000.s1913_maximum_product_difference_between_two_pairs - package g1901_2000.s1913_maximum_product_difference_between_two_pairs

g1901_2000.s1914_cyclically_rotating_a_grid - package g1901_2000.s1914_cyclically_rotating_a_grid

g1901_2000.s1915_number_of_wonderful_substrings - package g1901_2000.s1915_number_of_wonderful_substrings

g1901_2000.s1916_count_ways_to_build_rooms_in_an_ant_colony - package g1901_2000.s1916_count_ways_to_build_rooms_in_an_ant_colony

g1901_2000.s1920_build_array_from_permutation - package g1901_2000.s1920_build_array_from_permutation

g1901_2000.s1921_eliminate_maximum_number_of_monsters - package g1901_2000.s1921_eliminate_maximum_number_of_monsters

g1901_2000.s1922_count_good_numbers - package g1901_2000.s1922_count_good_numbers

g1901_2000.s1923_longest_common_subpath - package g1901_2000.s1923_longest_common_subpath

g1901_2000.s1925_count_square_sum_triples - package g1901_2000.s1925_count_square_sum_triples

g1901_2000.s1926_nearest_exit_from_entrance_in_maze - package g1901_2000.s1926_nearest_exit_from_entrance_in_maze

g1901_2000.s1927_sum_game - package g1901_2000.s1927_sum_game

g1901_2000.s1928_minimum_cost_to_reach_destination_in_time - package g1901_2000.s1928_minimum_cost_to_reach_destination_in_time

g1901_2000.s1929_concatenation_of_array - package g1901_2000.s1929_concatenation_of_array

g1901_2000.s1930_unique_length_3_palindromic_subsequences - package g1901_2000.s1930_unique_length_3_palindromic_subsequences

g1901_2000.s1931_painting_a_grid_with_three_different_colors - package g1901_2000.s1931_painting_a_grid_with_three_different_colors

g1901_2000.s1932_merge_bsts_to_create_single_bst - package g1901_2000.s1932_merge_bsts_to_create_single_bst

g1901_2000.s1935_maximum_number_of_words_you_can_type - package g1901_2000.s1935_maximum_number_of_words_you_can_type

g1901_2000.s1936_add_minimum_number_of_rungs - package g1901_2000.s1936_add_minimum_number_of_rungs

g1901_2000.s1937_maximum_number_of_points_with_cost - package g1901_2000.s1937_maximum_number_of_points_with_cost

g1901_2000.s1938_maximum_genetic_difference_query - package g1901_2000.s1938_maximum_genetic_difference_query

g1901_2000.s1941_check_if_all_characters_have_equal_number_of_occurrences - package g1901_2000.s1941_check_if_all_characters_have_equal_number_of_occurrences

g1901_2000.s1942_the_number_of_the_smallest_unoccupied_chair - package g1901_2000.s1942_the_number_of_the_smallest_unoccupied_chair

g1901_2000.s1943_describe_the_painting - package g1901_2000.s1943_describe_the_painting

g1901_2000.s1944_number_of_visible_people_in_a_queue - package g1901_2000.s1944_number_of_visible_people_in_a_queue

g1901_2000.s1945_sum_of_digits_of_string_after_convert - package g1901_2000.s1945_sum_of_digits_of_string_after_convert

g1901_2000.s1946_largest_number_after_mutating_substring - package g1901_2000.s1946_largest_number_after_mutating_substring

g1901_2000.s1947_maximum_compatibility_score_sum - package g1901_2000.s1947_maximum_compatibility_score_sum

g1901_2000.s1948_delete_duplicate_folders_in_system - package g1901_2000.s1948_delete_duplicate_folders_in_system

g1901_2000.s1952_three_divisors - package g1901_2000.s1952_three_divisors

g1901_2000.s1953_maximum_number_of_weeks_for_which_you_can_work - package g1901_2000.s1953_maximum_number_of_weeks_for_which_you_can_work

g1901_2000.s1954_minimum_garden_perimeter_to_collect_enough_apples - package g1901_2000.s1954_minimum_garden_perimeter_to_collect_enough_apples

g1901_2000.s1955_count_number_of_special_subsequences - package g1901_2000.s1955_count_number_of_special_subsequences

g1901_2000.s1957_delete_characters_to_make_fancy_string - package g1901_2000.s1957_delete_characters_to_make_fancy_string

g1901_2000.s1958_check_if_move_is_legal - package g1901_2000.s1958_check_if_move_is_legal

g1901_2000.s1959_minimum_total_space_wasted_with_k_resizing_operations - package g1901_2000.s1959_minimum_total_space_wasted_with_k_resizing_operations

g1901_2000.s1960_maximum_product_of_the_length_of_two_palindromic_substrings - package g1901_2000.s1960_maximum_product_of_the_length_of_two_palindromic_substrings

g1901_2000.s1961_check_if_string_is_a_prefix_of_array - package g1901_2000.s1961_check_if_string_is_a_prefix_of_array

g1901_2000.s1962_remove_stones_to_minimize_the_total - package g1901_2000.s1962_remove_stones_to_minimize_the_total

g1901_2000.s1963_minimum_number_of_swaps_to_make_the_string_balanced - package g1901_2000.s1963_minimum_number_of_swaps_to_make_the_string_balanced

g1901_2000.s1964_find_the_longest_valid_obstacle_course_at_each_position - package g1901_2000.s1964_find_the_longest_valid_obstacle_course_at_each_position

g1901_2000.s1967_number_of_strings_that_appear_as_substrings_in_word - package g1901_2000.s1967_number_of_strings_that_appear_as_substrings_in_word

g1901_2000.s1968_array_with_elements_not_equal_to_average_of_neighbors - package g1901_2000.s1968_array_with_elements_not_equal_to_average_of_neighbors

g1901_2000.s1969_minimum_non_zero_product_of_the_array_elements - package g1901_2000.s1969_minimum_non_zero_product_of_the_array_elements

g1901_2000.s1970_last_day_where_you_can_still_cross - package g1901_2000.s1970_last_day_where_you_can_still_cross

g1901_2000.s1971_find_if_path_exists_in_graph - package g1901_2000.s1971_find_if_path_exists_in_graph

g1901_2000.s1974_minimum_time_to_type_word_using_special_typewriter - package g1901_2000.s1974_minimum_time_to_type_word_using_special_typewriter

g1901_2000.s1975_maximum_matrix_sum - package g1901_2000.s1975_maximum_matrix_sum

g1901_2000.s1976_number_of_ways_to_arrive_at_destination - package g1901_2000.s1976_number_of_ways_to_arrive_at_destination

g1901_2000.s1977_number_of_ways_to_separate_numbers - package g1901_2000.s1977_number_of_ways_to_separate_numbers

g1901_2000.s1979_find_greatest_common_divisor_of_array - package g1901_2000.s1979_find_greatest_common_divisor_of_array

g1901_2000.s1980_find_unique_binary_string - package g1901_2000.s1980_find_unique_binary_string

g1901_2000.s1981_minimize_the_difference_between_target_and_chosen_elements - package g1901_2000.s1981_minimize_the_difference_between_target_and_chosen_elements

g1901_2000.s1982_find_array_given_subset_sums - package g1901_2000.s1982_find_array_given_subset_sums

g1901_2000.s1984_minimum_difference_between_highest_and_lowest_of_k_scores - package g1901_2000.s1984_minimum_difference_between_highest_and_lowest_of_k_scores

g1901_2000.s1985_find_the_kth_largest_integer_in_the_array - package g1901_2000.s1985_find_the_kth_largest_integer_in_the_array

g1901_2000.s1986_minimum_number_of_work_sessions_to_finish_the_tasks - package g1901_2000.s1986_minimum_number_of_work_sessions_to_finish_the_tasks

g1901_2000.s1987_number_of_unique_good_subsequences - package g1901_2000.s1987_number_of_unique_good_subsequences

g1901_2000.s1991_find_the_middle_index_in_array - package g1901_2000.s1991_find_the_middle_index_in_array

g1901_2000.s1992_find_all_groups_of_farmland - package g1901_2000.s1992_find_all_groups_of_farmland

g1901_2000.s1993_operations_on_tree - package g1901_2000.s1993_operations_on_tree

g1901_2000.s1994_the_number_of_good_subsets - package g1901_2000.s1994_the_number_of_good_subsets

g1901_2000.s1995_count_special_quadruplets - package g1901_2000.s1995_count_special_quadruplets

g1901_2000.s1996_the_number_of_weak_characters_in_the_game - package g1901_2000.s1996_the_number_of_weak_characters_in_the_game

g1901_2000.s1997_first_day_where_you_have_been_in_all_the_rooms - package g1901_2000.s1997_first_day_where_you_have_been_in_all_the_rooms

g1901_2000.s1998_gcd_sort_of_an_array - package g1901_2000.s1998_gcd_sort_of_an_array

g1901_2000.s2000_reverse_prefix_of_word - package g1901_2000.s2000_reverse_prefix_of_word

g2001_2100.s2001_number_of_pairs_of_interchangeable_rectangles - package g2001_2100.s2001_number_of_pairs_of_interchangeable_rectangles

g2001_2100.s2002_maximum_product_of_the_length_of_two_palindromic_subsequences - package g2001_2100.s2002_maximum_product_of_the_length_of_two_palindromic_subsequences

g2001_2100.s2003_smallest_missing_genetic_value_in_each_subtree - package g2001_2100.s2003_smallest_missing_genetic_value_in_each_subtree

g2001_2100.s2006_count_number_of_pairs_with_absolute_difference_k - package g2001_2100.s2006_count_number_of_pairs_with_absolute_difference_k

g2001_2100.s2007_find_original_array_from_doubled_array - package g2001_2100.s2007_find_original_array_from_doubled_array

g2001_2100.s2008_maximum_earnings_from_taxi - package g2001_2100.s2008_maximum_earnings_from_taxi

g2001_2100.s2009_minimum_number_of_operations_to_make_array_continuous - package g2001_2100.s2009_minimum_number_of_operations_to_make_array_continuous

g2001_2100.s2011_final_value_of_variable_after_performing_operations - package g2001_2100.s2011_final_value_of_variable_after_performing_operations

g2001_2100.s2012_sum_of_beauty_in_the_array - package g2001_2100.s2012_sum_of_beauty_in_the_array

g2001_2100.s2013_detect_squares - package g2001_2100.s2013_detect_squares

g2001_2100.s2014_longest_subsequence_repeated_k_times - package g2001_2100.s2014_longest_subsequence_repeated_k_times

g2001_2100.s2016_maximum_difference_between_increasing_elements - package g2001_2100.s2016_maximum_difference_between_increasing_elements

g2001_2100.s2017_grid_game - package g2001_2100.s2017_grid_game

g2001_2100.s2018_check_if_word_can_be_placed_in_crossword - package g2001_2100.s2018_check_if_word_can_be_placed_in_crossword

g2001_2100.s2019_the_score_of_students_solving_math_expression - package g2001_2100.s2019_the_score_of_students_solving_math_expression

g2001_2100.s2022_convert_1d_array_into_2d_array - package g2001_2100.s2022_convert_1d_array_into_2d_array

g2001_2100.s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target - package g2001_2100.s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target

g2001_2100.s2024_maximize_the_confusion_of_an_exam - package g2001_2100.s2024_maximize_the_confusion_of_an_exam

g2001_2100.s2025_maximum_number_of_ways_to_partition_an_array - package g2001_2100.s2025_maximum_number_of_ways_to_partition_an_array

g2001_2100.s2027_minimum_moves_to_convert_string - package g2001_2100.s2027_minimum_moves_to_convert_string

g2001_2100.s2028_find_missing_observations - package g2001_2100.s2028_find_missing_observations

g2001_2100.s2029_stone_game_ix - package g2001_2100.s2029_stone_game_ix

g2001_2100.s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter - package g2001_2100.s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter

g2001_2100.s2032_two_out_of_three - package g2001_2100.s2032_two_out_of_three

g2001_2100.s2033_minimum_operations_to_make_a_uni_value_grid - package g2001_2100.s2033_minimum_operations_to_make_a_uni_value_grid

g2001_2100.s2034_stock_price_fluctuation - package g2001_2100.s2034_stock_price_fluctuation

g2001_2100.s2035_partition_array_into_two_arrays_to_minimize_sum_difference - package g2001_2100.s2035_partition_array_into_two_arrays_to_minimize_sum_difference

g2001_2100.s2037_minimum_number_of_moves_to_seat_everyone - package g2001_2100.s2037_minimum_number_of_moves_to_seat_everyone

g2001_2100.s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color - package g2001_2100.s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color

g2001_2100.s2039_the_time_when_the_network_becomes_idle - package g2001_2100.s2039_the_time_when_the_network_becomes_idle

g2001_2100.s2040_kth_smallest_product_of_two_sorted_arrays - package g2001_2100.s2040_kth_smallest_product_of_two_sorted_arrays

g2001_2100.s2042_check_if_numbers_are_ascending_in_a_sentence - package g2001_2100.s2042_check_if_numbers_are_ascending_in_a_sentence

g2001_2100.s2043_simple_bank_system - package g2001_2100.s2043_simple_bank_system

g2001_2100.s2044_count_number_of_maximum_bitwise_or_subsets - package g2001_2100.s2044_count_number_of_maximum_bitwise_or_subsets

g2001_2100.s2045_second_minimum_time_to_reach_destination - package g2001_2100.s2045_second_minimum_time_to_reach_destination

g2001_2100.s2047_number_of_valid_words_in_a_sentence - package g2001_2100.s2047_number_of_valid_words_in_a_sentence

g2001_2100.s2048_next_greater_numerically_balanced_number - package g2001_2100.s2048_next_greater_numerically_balanced_number

g2001_2100.s2049_count_nodes_with_the_highest_score - package g2001_2100.s2049_count_nodes_with_the_highest_score

g2001_2100.s2050_parallel_courses_iii - package g2001_2100.s2050_parallel_courses_iii

g2001_2100.s2053_kth_distinct_string_in_an_array - package g2001_2100.s2053_kth_distinct_string_in_an_array

g2001_2100.s2054_two_best_non_overlapping_events - package g2001_2100.s2054_two_best_non_overlapping_events

g2001_2100.s2055_plates_between_candles - package g2001_2100.s2055_plates_between_candles

g2001_2100.s2056_number_of_valid_move_combinations_on_chessboard - package g2001_2100.s2056_number_of_valid_move_combinations_on_chessboard

g2001_2100.s2057_smallest_index_with_equal_value - package g2001_2100.s2057_smallest_index_with_equal_value

g2001_2100.s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points - package g2001_2100.s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points

g2001_2100.s2059_minimum_operations_to_convert_number - package g2001_2100.s2059_minimum_operations_to_convert_number

g2001_2100.s2060_check_if_an_original_string_exists_given_two_encoded_strings - package g2001_2100.s2060_check_if_an_original_string_exists_given_two_encoded_strings

g2001_2100.s2062_count_vowel_substrings_of_a_string - package g2001_2100.s2062_count_vowel_substrings_of_a_string

g2001_2100.s2063_vowels_of_all_substrings - package g2001_2100.s2063_vowels_of_all_substrings

g2001_2100.s2064_minimized_maximum_of_products_distributed_to_any_store - package g2001_2100.s2064_minimized_maximum_of_products_distributed_to_any_store

g2001_2100.s2065_maximum_path_quality_of_a_graph - package g2001_2100.s2065_maximum_path_quality_of_a_graph

g2001_2100.s2068_check_whether_two_strings_are_almost_equivalent - package g2001_2100.s2068_check_whether_two_strings_are_almost_equivalent

g2001_2100.s2069_walking_robot_simulation_ii - package g2001_2100.s2069_walking_robot_simulation_ii

g2001_2100.s2070_most_beautiful_item_for_each_query - package g2001_2100.s2070_most_beautiful_item_for_each_query

g2001_2100.s2071_maximum_number_of_tasks_you_can_assign - package g2001_2100.s2071_maximum_number_of_tasks_you_can_assign

g2001_2100.s2073_time_needed_to_buy_tickets - package g2001_2100.s2073_time_needed_to_buy_tickets

g2001_2100.s2074_reverse_nodes_in_even_length_groups - package g2001_2100.s2074_reverse_nodes_in_even_length_groups

g2001_2100.s2075_decode_the_slanted_ciphertext - package g2001_2100.s2075_decode_the_slanted_ciphertext

g2001_2100.s2076_process_restricted_friend_requests - package g2001_2100.s2076_process_restricted_friend_requests

g2001_2100.s2078_two_furthest_houses_with_different_colors - package g2001_2100.s2078_two_furthest_houses_with_different_colors

g2001_2100.s2079_watering_plants - package g2001_2100.s2079_watering_plants

g2001_2100.s2080_range_frequency_queries - package g2001_2100.s2080_range_frequency_queries

g2001_2100.s2081_sum_of_k_mirror_numbers - package g2001_2100.s2081_sum_of_k_mirror_numbers

g2001_2100.s2085_count_common_words_with_one_occurrence - package g2001_2100.s2085_count_common_words_with_one_occurrence

g2001_2100.s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses - package g2001_2100.s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses

g2001_2100.s2087_minimum_cost_homecoming_of_a_robot_in_a_grid - package g2001_2100.s2087_minimum_cost_homecoming_of_a_robot_in_a_grid

g2001_2100.s2088_count_fertile_pyramids_in_a_land - package g2001_2100.s2088_count_fertile_pyramids_in_a_land

g2001_2100.s2089_find_target_indices_after_sorting_array - package g2001_2100.s2089_find_target_indices_after_sorting_array

g2001_2100.s2090_k_radius_subarray_averages - package g2001_2100.s2090_k_radius_subarray_averages

g2001_2100.s2091_removing_minimum_and_maximum_from_array - package g2001_2100.s2091_removing_minimum_and_maximum_from_array

g2001_2100.s2092_find_all_people_with_secret - package g2001_2100.s2092_find_all_people_with_secret

g2001_2100.s2094_finding_3_digit_even_numbers - package g2001_2100.s2094_finding_3_digit_even_numbers

g2001_2100.s2095_delete_the_middle_node_of_a_linked_list - package g2001_2100.s2095_delete_the_middle_node_of_a_linked_list

g2001_2100.s2096_step_by_step_directions_from_a_binary_tree_node_to_another - package g2001_2100.s2096_step_by_step_directions_from_a_binary_tree_node_to_another

g2001_2100.s2097_valid_arrangement_of_pairs - package g2001_2100.s2097_valid_arrangement_of_pairs

g2001_2100.s2099_find_subsequence_of_length_k_with_the_largest_sum - package g2001_2100.s2099_find_subsequence_of_length_k_with_the_largest_sum

g2001_2100.s2100_find_good_days_to_rob_the_bank - package g2001_2100.s2100_find_good_days_to_rob_the_bank

g2101_2200.s2101_detonate_the_maximum_bombs - package g2101_2200.s2101_detonate_the_maximum_bombs

g2101_2200.s2102_sequentially_ordinal_rank_tracker - package g2101_2200.s2102_sequentially_ordinal_rank_tracker

g2101_2200.s2103_rings_and_rods - package g2101_2200.s2103_rings_and_rods

g2101_2200.s2104_sum_of_subarray_ranges - package g2101_2200.s2104_sum_of_subarray_ranges

g2101_2200.s2105_watering_plants_ii - package g2101_2200.s2105_watering_plants_ii

g2101_2200.s2106_maximum_fruits_harvested_after_at_most_k_steps - package g2101_2200.s2106_maximum_fruits_harvested_after_at_most_k_steps

g2101_2200.s2108_find_first_palindromic_string_in_the_array - package g2101_2200.s2108_find_first_palindromic_string_in_the_array

g2101_2200.s2109_adding_spaces_to_a_string - package g2101_2200.s2109_adding_spaces_to_a_string

g2101_2200.s2110_number_of_smooth_descent_periods_of_a_stock - package g2101_2200.s2110_number_of_smooth_descent_periods_of_a_stock

g2101_2200.s2111_minimum_operations_to_make_the_array_k_increasing - package g2101_2200.s2111_minimum_operations_to_make_the_array_k_increasing

g2101_2200.s2114_maximum_number_of_words_found_in_sentences - package g2101_2200.s2114_maximum_number_of_words_found_in_sentences

g2101_2200.s2115_find_all_possible_recipes_from_given_supplies - package g2101_2200.s2115_find_all_possible_recipes_from_given_supplies

g2101_2200.s2116_check_if_a_parentheses_string_can_be_valid - package g2101_2200.s2116_check_if_a_parentheses_string_can_be_valid

g2101_2200.s2117_abbreviating_the_product_of_a_range - package g2101_2200.s2117_abbreviating_the_product_of_a_range

g2101_2200.s2119_a_number_after_a_double_reversal - package g2101_2200.s2119_a_number_after_a_double_reversal

g2101_2200.s2120_execution_of_all_suffix_instructions_staying_in_a_grid - package g2101_2200.s2120_execution_of_all_suffix_instructions_staying_in_a_grid

g2101_2200.s2121_intervals_between_identical_elements - package g2101_2200.s2121_intervals_between_identical_elements

g2101_2200.s2122_recover_the_original_array - package g2101_2200.s2122_recover_the_original_array

g2101_2200.s2124_check_if_all_as_appears_before_all_bs - package g2101_2200.s2124_check_if_all_as_appears_before_all_bs

g2101_2200.s2125_number_of_laser_beams_in_a_bank - package g2101_2200.s2125_number_of_laser_beams_in_a_bank

g2101_2200.s2126_destroying_asteroids - package g2101_2200.s2126_destroying_asteroids

g2101_2200.s2127_maximum_employees_to_be_invited_to_a_meeting - package g2101_2200.s2127_maximum_employees_to_be_invited_to_a_meeting

g2101_2200.s2129_capitalize_the_title - package g2101_2200.s2129_capitalize_the_title

g2101_2200.s2130_maximum_twin_sum_of_a_linked_list - package g2101_2200.s2130_maximum_twin_sum_of_a_linked_list

g2101_2200.s2131_longest_palindrome_by_concatenating_two_letter_words - package g2101_2200.s2131_longest_palindrome_by_concatenating_two_letter_words

g2101_2200.s2132_stamping_the_grid - package g2101_2200.s2132_stamping_the_grid

g2101_2200.s2133_check_if_every_row_and_column_contains_all_numbers - package g2101_2200.s2133_check_if_every_row_and_column_contains_all_numbers

g2101_2200.s2134_minimum_swaps_to_group_all_1s_together_ii - package g2101_2200.s2134_minimum_swaps_to_group_all_1s_together_ii

g2101_2200.s2135_count_words_obtained_after_adding_a_letter - package g2101_2200.s2135_count_words_obtained_after_adding_a_letter

g2101_2200.s2136_earliest_possible_day_of_full_bloom - package g2101_2200.s2136_earliest_possible_day_of_full_bloom

g2101_2200.s2138_divide_a_string_into_groups_of_size_k - package g2101_2200.s2138_divide_a_string_into_groups_of_size_k

g2101_2200.s2139_minimum_moves_to_reach_target_score - package g2101_2200.s2139_minimum_moves_to_reach_target_score

g2101_2200.s2140_solving_questions_with_brainpower - package g2101_2200.s2140_solving_questions_with_brainpower

g2101_2200.s2141_maximum_running_time_of_n_computers - package g2101_2200.s2141_maximum_running_time_of_n_computers

g2101_2200.s2144_minimum_cost_of_buying_candies_with_discount - package g2101_2200.s2144_minimum_cost_of_buying_candies_with_discount

g2101_2200.s2145_count_the_hidden_sequences - package g2101_2200.s2145_count_the_hidden_sequences

g2101_2200.s2146_k_highest_ranked_items_within_a_price_range - package g2101_2200.s2146_k_highest_ranked_items_within_a_price_range

g2101_2200.s2147_number_of_ways_to_divide_a_long_corridor - package g2101_2200.s2147_number_of_ways_to_divide_a_long_corridor

g2101_2200.s2148_count_elements_with_strictly_smaller_and_greater_elements - package g2101_2200.s2148_count_elements_with_strictly_smaller_and_greater_elements

g2101_2200.s2149_rearrange_array_elements_by_sign - package g2101_2200.s2149_rearrange_array_elements_by_sign

g2101_2200.s2150_find_all_lonely_numbers_in_the_array - package g2101_2200.s2150_find_all_lonely_numbers_in_the_array

g2101_2200.s2151_maximum_good_people_based_on_statements - package g2101_2200.s2151_maximum_good_people_based_on_statements

g2101_2200.s2154_keep_multiplying_found_values_by_two - package g2101_2200.s2154_keep_multiplying_found_values_by_two

g2101_2200.s2155_all_divisions_with_the_highest_score_of_a_binary_array - package g2101_2200.s2155_all_divisions_with_the_highest_score_of_a_binary_array

g2101_2200.s2156_find_substring_with_given_hash_value - package g2101_2200.s2156_find_substring_with_given_hash_value

g2101_2200.s2157_groups_of_strings - package g2101_2200.s2157_groups_of_strings

g2101_2200.s2160_minimum_sum_of_four_digit_number_after_splitting_digits - package g2101_2200.s2160_minimum_sum_of_four_digit_number_after_splitting_digits

g2101_2200.s2161_partition_array_according_to_given_pivot - package g2101_2200.s2161_partition_array_according_to_given_pivot

g2101_2200.s2162_minimum_cost_to_set_cooking_time - package g2101_2200.s2162_minimum_cost_to_set_cooking_time

g2101_2200.s2163_minimum_difference_in_sums_after_removal_of_elements - package g2101_2200.s2163_minimum_difference_in_sums_after_removal_of_elements

g2101_2200.s2164_sort_even_and_odd_indices_independently - package g2101_2200.s2164_sort_even_and_odd_indices_independently

g2101_2200.s2165_smallest_value_of_the_rearranged_number - package g2101_2200.s2165_smallest_value_of_the_rearranged_number

g2101_2200.s2166_design_bitset - package g2101_2200.s2166_design_bitset

g2101_2200.s2167_minimum_time_to_remove_all_cars_containing_illegal_goods - package g2101_2200.s2167_minimum_time_to_remove_all_cars_containing_illegal_goods

g2101_2200.s2169_count_operations_to_obtain_zero - package g2101_2200.s2169_count_operations_to_obtain_zero

g2101_2200.s2170_minimum_operations_to_make_the_array_alternating - package g2101_2200.s2170_minimum_operations_to_make_the_array_alternating

g2101_2200.s2171_removing_minimum_number_of_magic_beans - package g2101_2200.s2171_removing_minimum_number_of_magic_beans

g2101_2200.s2172_maximum_and_sum_of_array - package g2101_2200.s2172_maximum_and_sum_of_array

g2101_2200.s2176_count_equal_and_divisible_pairs_in_an_array - package g2101_2200.s2176_count_equal_and_divisible_pairs_in_an_array

g2101_2200.s2177_find_three_consecutive_integers_that_sum_to_a_given_number - package g2101_2200.s2177_find_three_consecutive_integers_that_sum_to_a_given_number

g2101_2200.s2178_maximum_split_of_positive_even_integers - package g2101_2200.s2178_maximum_split_of_positive_even_integers

g2101_2200.s2179_count_good_triplets_in_an_array - package g2101_2200.s2179_count_good_triplets_in_an_array

g2101_2200.s2180_count_integers_with_even_digit_sum - package g2101_2200.s2180_count_integers_with_even_digit_sum

g2101_2200.s2181_merge_nodes_in_between_zeros - package g2101_2200.s2181_merge_nodes_in_between_zeros

g2101_2200.s2182_construct_string_with_repeat_limit - package g2101_2200.s2182_construct_string_with_repeat_limit

g2101_2200.s2183_count_array_pairs_divisible_by_k - package g2101_2200.s2183_count_array_pairs_divisible_by_k

g2101_2200.s2185_counting_words_with_a_given_prefix - package g2101_2200.s2185_counting_words_with_a_given_prefix

g2101_2200.s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii - package g2101_2200.s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii

g2101_2200.s2187_minimum_time_to_complete_trips - package g2101_2200.s2187_minimum_time_to_complete_trips

g2101_2200.s2188_minimum_time_to_finish_the_race - package g2101_2200.s2188_minimum_time_to_finish_the_race

g2101_2200.s2190_most_frequent_number_following_key_in_an_array - package g2101_2200.s2190_most_frequent_number_following_key_in_an_array

g2101_2200.s2191_sort_the_jumbled_numbers - package g2101_2200.s2191_sort_the_jumbled_numbers

g2101_2200.s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph - package g2101_2200.s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph

g2101_2200.s2193_minimum_number_of_moves_to_make_palindrome - package g2101_2200.s2193_minimum_number_of_moves_to_make_palindrome

g2101_2200.s2194_cells_in_a_range_on_an_excel_sheet - package g2101_2200.s2194_cells_in_a_range_on_an_excel_sheet

g2101_2200.s2195_append_k_integers_with_minimal_sum - package g2101_2200.s2195_append_k_integers_with_minimal_sum

g2101_2200.s2196_create_binary_tree_from_descriptions - package g2101_2200.s2196_create_binary_tree_from_descriptions

g2101_2200.s2197_replace_non_coprime_numbers_in_array - package g2101_2200.s2197_replace_non_coprime_numbers_in_array

g2101_2200.s2200_find_all_k_distant_indices_in_an_array - package g2101_2200.s2200_find_all_k_distant_indices_in_an_array

g2201_2300.s2201_count_artifacts_that_can_be_extracted - package g2201_2300.s2201_count_artifacts_that_can_be_extracted

g2201_2300.s2202_maximize_the_topmost_element_after_k_moves - package g2201_2300.s2202_maximize_the_topmost_element_after_k_moves

g2201_2300.s2203_minimum_weighted_subgraph_with_the_required_paths - package g2201_2300.s2203_minimum_weighted_subgraph_with_the_required_paths

g2201_2300.s2206_divide_array_into_equal_pairs - package g2201_2300.s2206_divide_array_into_equal_pairs

g2201_2300.s2207_maximize_number_of_subsequences_in_a_string - package g2201_2300.s2207_maximize_number_of_subsequences_in_a_string

g2201_2300.s2208_minimum_operations_to_halve_array_sum - package g2201_2300.s2208_minimum_operations_to_halve_array_sum

g2201_2300.s2209_minimum_white_tiles_after_covering_with_carpets - package g2201_2300.s2209_minimum_white_tiles_after_covering_with_carpets

g2201_2300.s2210_count_hills_and_valleys_in_an_array - package g2201_2300.s2210_count_hills_and_valleys_in_an_array

g2201_2300.s2211_count_collisions_on_a_road - package g2201_2300.s2211_count_collisions_on_a_road

g2201_2300.s2212_maximum_points_in_an_archery_competition - package g2201_2300.s2212_maximum_points_in_an_archery_competition

g2201_2300.s2213_longest_substring_of_one_repeating_character - package g2201_2300.s2213_longest_substring_of_one_repeating_character

g2201_2300.s2215_find_the_difference_of_two_arrays - package g2201_2300.s2215_find_the_difference_of_two_arrays

g2201_2300.s2216_minimum_deletions_to_make_array_beautiful - package g2201_2300.s2216_minimum_deletions_to_make_array_beautiful

g2201_2300.s2217_find_palindrome_with_fixed_length - package g2201_2300.s2217_find_palindrome_with_fixed_length

g2201_2300.s2218_maximum_value_of_k_coins_from_piles - package g2201_2300.s2218_maximum_value_of_k_coins_from_piles

g2201_2300.s2220_minimum_bit_flips_to_convert_number - package g2201_2300.s2220_minimum_bit_flips_to_convert_number

g2201_2300.s2221_find_triangular_sum_of_an_array - package g2201_2300.s2221_find_triangular_sum_of_an_array

g2201_2300.s2222_number_of_ways_to_select_buildings - package g2201_2300.s2222_number_of_ways_to_select_buildings

g2201_2300.s2223_sum_of_scores_of_built_strings - package g2201_2300.s2223_sum_of_scores_of_built_strings

g2201_2300.s2224_minimum_number_of_operations_to_convert_time - package g2201_2300.s2224_minimum_number_of_operations_to_convert_time

g2201_2300.s2225_find_players_with_zero_or_one_losses - package g2201_2300.s2225_find_players_with_zero_or_one_losses

g2201_2300.s2226_maximum_candies_allocated_to_k_children - package g2201_2300.s2226_maximum_candies_allocated_to_k_children

g2201_2300.s2227_encrypt_and_decrypt_strings - package g2201_2300.s2227_encrypt_and_decrypt_strings

g2201_2300.s2231_largest_number_after_digit_swaps_by_parity - package g2201_2300.s2231_largest_number_after_digit_swaps_by_parity

g2201_2300.s2232_minimize_result_by_adding_parentheses_to_expression - package g2201_2300.s2232_minimize_result_by_adding_parentheses_to_expression

g2201_2300.s2233_maximum_product_after_k_increments - package g2201_2300.s2233_maximum_product_after_k_increments

g2201_2300.s2234_maximum_total_beauty_of_the_gardens - package g2201_2300.s2234_maximum_total_beauty_of_the_gardens

g2201_2300.s2235_add_two_integers - package g2201_2300.s2235_add_two_integers

g2201_2300.s2236_root_equals_sum_of_children - package g2201_2300.s2236_root_equals_sum_of_children

g2201_2300.s2239_find_closest_number_to_zero - package g2201_2300.s2239_find_closest_number_to_zero

g2201_2300.s2240_number_of_ways_to_buy_pens_and_pencils - package g2201_2300.s2240_number_of_ways_to_buy_pens_and_pencils

g2201_2300.s2241_design_an_atm_machine - package g2201_2300.s2241_design_an_atm_machine

g2201_2300.s2242_maximum_score_of_a_node_sequence - package g2201_2300.s2242_maximum_score_of_a_node_sequence

g2201_2300.s2243_calculate_digit_sum_of_a_string - package g2201_2300.s2243_calculate_digit_sum_of_a_string

g2201_2300.s2244_minimum_rounds_to_complete_all_tasks - package g2201_2300.s2244_minimum_rounds_to_complete_all_tasks

g2201_2300.s2245_maximum_trailing_zeros_in_a_cornered_path - package g2201_2300.s2245_maximum_trailing_zeros_in_a_cornered_path

g2201_2300.s2246_longest_path_with_different_adjacent_characters - package g2201_2300.s2246_longest_path_with_different_adjacent_characters

g2201_2300.s2248_intersection_of_multiple_arrays - package g2201_2300.s2248_intersection_of_multiple_arrays

g2201_2300.s2249_count_lattice_points_inside_a_circle - package g2201_2300.s2249_count_lattice_points_inside_a_circle

g2201_2300.s2250_count_number_of_rectangles_containing_each_point - package g2201_2300.s2250_count_number_of_rectangles_containing_each_point

g2201_2300.s2251_number_of_flowers_in_full_bloom - package g2201_2300.s2251_number_of_flowers_in_full_bloom

g2201_2300.s2255_count_prefixes_of_a_given_string - package g2201_2300.s2255_count_prefixes_of_a_given_string

g2201_2300.s2256_minimum_average_difference - package g2201_2300.s2256_minimum_average_difference

g2201_2300.s2257_count_unguarded_cells_in_the_grid - package g2201_2300.s2257_count_unguarded_cells_in_the_grid

g2201_2300.s2258_escape_the_spreading_fire - package g2201_2300.s2258_escape_the_spreading_fire

g2201_2300.s2259_remove_digit_from_number_to_maximize_result - package g2201_2300.s2259_remove_digit_from_number_to_maximize_result

g2201_2300.s2260_minimum_consecutive_cards_to_pick_up - package g2201_2300.s2260_minimum_consecutive_cards_to_pick_up

g2201_2300.s2261_k_divisible_elements_subarrays - package g2201_2300.s2261_k_divisible_elements_subarrays

g2201_2300.s2262_total_appeal_of_a_string - package g2201_2300.s2262_total_appeal_of_a_string

g2201_2300.s2264_largest_3_same_digit_number_in_string - package g2201_2300.s2264_largest_3_same_digit_number_in_string

g2201_2300.s2265_count_nodes_equal_to_average_of_subtree - package g2201_2300.s2265_count_nodes_equal_to_average_of_subtree

g2201_2300.s2266_count_number_of_texts - package g2201_2300.s2266_count_number_of_texts

g2201_2300.s2267_check_if_there_is_a_valid_parentheses_string_path - package g2201_2300.s2267_check_if_there_is_a_valid_parentheses_string_path

g2201_2300.s2269_find_the_k_beauty_of_a_number - package g2201_2300.s2269_find_the_k_beauty_of_a_number

g2201_2300.s2270_number_of_ways_to_split_array - package g2201_2300.s2270_number_of_ways_to_split_array

g2201_2300.s2271_maximum_white_tiles_covered_by_a_carpet - package g2201_2300.s2271_maximum_white_tiles_covered_by_a_carpet

g2201_2300.s2272_substring_with_largest_variance - package g2201_2300.s2272_substring_with_largest_variance

g2201_2300.s2273_find_resultant_array_after_removing_anagrams - package g2201_2300.s2273_find_resultant_array_after_removing_anagrams

g2201_2300.s2274_maximum_consecutive_floors_without_special_floors - package g2201_2300.s2274_maximum_consecutive_floors_without_special_floors

g2201_2300.s2275_largest_combination_with_bitwise_and_greater_than_zero - package g2201_2300.s2275_largest_combination_with_bitwise_and_greater_than_zero

g2201_2300.s2276_count_integers_in_intervals - package g2201_2300.s2276_count_integers_in_intervals

g2201_2300.s2278_percentage_of_letter_in_string - package g2201_2300.s2278_percentage_of_letter_in_string

g2201_2300.s2279_maximum_bags_with_full_capacity_of_rocks - package g2201_2300.s2279_maximum_bags_with_full_capacity_of_rocks

g2201_2300.s2280_minimum_lines_to_represent_a_line_chart - package g2201_2300.s2280_minimum_lines_to_represent_a_line_chart

g2201_2300.s2281_sum_of_total_strength_of_wizards - package g2201_2300.s2281_sum_of_total_strength_of_wizards

g2201_2300.s2283_check_if_number_has_equal_digit_count_and_digit_value - package g2201_2300.s2283_check_if_number_has_equal_digit_count_and_digit_value

g2201_2300.s2284_sender_with_largest_word_count - package g2201_2300.s2284_sender_with_largest_word_count

g2201_2300.s2285_maximum_total_importance_of_roads - package g2201_2300.s2285_maximum_total_importance_of_roads

g2201_2300.s2286_booking_concert_tickets_in_groups - package g2201_2300.s2286_booking_concert_tickets_in_groups

g2201_2300.s2287_rearrange_characters_to_make_target_string - package g2201_2300.s2287_rearrange_characters_to_make_target_string

g2201_2300.s2288_apply_discount_to_prices - package g2201_2300.s2288_apply_discount_to_prices

g2201_2300.s2289_steps_to_make_array_non_decreasing - package g2201_2300.s2289_steps_to_make_array_non_decreasing

g2201_2300.s2290_minimum_obstacle_removal_to_reach_corner - package g2201_2300.s2290_minimum_obstacle_removal_to_reach_corner

g2201_2300.s2293_min_max_game - package g2201_2300.s2293_min_max_game

g2201_2300.s2294_partition_array_such_that_maximum_difference_is_k - package g2201_2300.s2294_partition_array_such_that_maximum_difference_is_k

g2201_2300.s2295_replace_elements_in_an_array - package g2201_2300.s2295_replace_elements_in_an_array

g2201_2300.s2296_design_a_text_editor - package g2201_2300.s2296_design_a_text_editor

g2201_2300.s2299_strong_password_checker_ii - package g2201_2300.s2299_strong_password_checker_ii

g2201_2300.s2300_successful_pairs_of_spells_and_potions - package g2201_2300.s2300_successful_pairs_of_spells_and_potions

g2301_2400.s2301_match_substring_after_replacement - package g2301_2400.s2301_match_substring_after_replacement

g2301_2400.s2302_count_subarrays_with_score_less_than_k - package g2301_2400.s2302_count_subarrays_with_score_less_than_k

g2301_2400.s2303_calculate_amount_paid_in_taxes - package g2301_2400.s2303_calculate_amount_paid_in_taxes

g2301_2400.s2304_minimum_path_cost_in_a_grid - package g2301_2400.s2304_minimum_path_cost_in_a_grid

g2301_2400.s2305_fair_distribution_of_cookies - package g2301_2400.s2305_fair_distribution_of_cookies

g2301_2400.s2306_naming_a_company - package g2301_2400.s2306_naming_a_company

g2301_2400.s2309_greatest_english_letter_in_upper_and_lower_case - package g2301_2400.s2309_greatest_english_letter_in_upper_and_lower_case

g2301_2400.s2310_sum_of_numbers_with_units_digit_k - package g2301_2400.s2310_sum_of_numbers_with_units_digit_k

g2301_2400.s2311_longest_binary_subsequence_less_than_or_equal_to_k - package g2301_2400.s2311_longest_binary_subsequence_less_than_or_equal_to_k

g2301_2400.s2312_selling_pieces_of_wood - package g2301_2400.s2312_selling_pieces_of_wood

g2301_2400.s2315_count_asterisks - package g2301_2400.s2315_count_asterisks

g2301_2400.s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph - package g2301_2400.s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph

g2301_2400.s2317_maximum_xor_after_operations - package g2301_2400.s2317_maximum_xor_after_operations

g2301_2400.s2318_number_of_distinct_roll_sequences - package g2301_2400.s2318_number_of_distinct_roll_sequences

g2301_2400.s2319_check_if_matrix_is_x_matrix - package g2301_2400.s2319_check_if_matrix_is_x_matrix

g2301_2400.s2320_count_number_of_ways_to_place_houses - package g2301_2400.s2320_count_number_of_ways_to_place_houses

g2301_2400.s2321_maximum_score_of_spliced_array - package g2301_2400.s2321_maximum_score_of_spliced_array

g2301_2400.s2322_minimum_score_after_removals_on_a_tree - package g2301_2400.s2322_minimum_score_after_removals_on_a_tree

g2301_2400.s2325_decode_the_message - package g2301_2400.s2325_decode_the_message

g2301_2400.s2326_spiral_matrix_iv - package g2301_2400.s2326_spiral_matrix_iv

g2301_2400.s2327_number_of_people_aware_of_a_secret - package g2301_2400.s2327_number_of_people_aware_of_a_secret

g2301_2400.s2328_number_of_increasing_paths_in_a_grid - package g2301_2400.s2328_number_of_increasing_paths_in_a_grid

g2301_2400.s2331_evaluate_boolean_binary_tree - package g2301_2400.s2331_evaluate_boolean_binary_tree

g2301_2400.s2332_the_latest_time_to_catch_a_bus - package g2301_2400.s2332_the_latest_time_to_catch_a_bus

g2301_2400.s2333_minimum_sum_of_squared_difference - package g2301_2400.s2333_minimum_sum_of_squared_difference

g2301_2400.s2334_subarray_with_elements_greater_than_varying_threshold - package g2301_2400.s2334_subarray_with_elements_greater_than_varying_threshold

g2301_2400.s2335_minimum_amount_of_time_to_fill_cups - package g2301_2400.s2335_minimum_amount_of_time_to_fill_cups

g2301_2400.s2336_smallest_number_in_infinite_set - package g2301_2400.s2336_smallest_number_in_infinite_set

g2301_2400.s2337_move_pieces_to_obtain_a_string - package g2301_2400.s2337_move_pieces_to_obtain_a_string

g2301_2400.s2338_count_the_number_of_ideal_arrays - package g2301_2400.s2338_count_the_number_of_ideal_arrays

g2301_2400.s2341_maximum_number_of_pairs_in_array - package g2301_2400.s2341_maximum_number_of_pairs_in_array

g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits - package g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits

g2301_2400.s2343_query_kth_smallest_trimmed_number - package g2301_2400.s2343_query_kth_smallest_trimmed_number

g2301_2400.s2344_minimum_deletions_to_make_array_divisible - package g2301_2400.s2344_minimum_deletions_to_make_array_divisible

g2301_2400.s2347_best_poker_hand - package g2301_2400.s2347_best_poker_hand

g2301_2400.s2348_number_of_zero_filled_subarrays - package g2301_2400.s2348_number_of_zero_filled_subarrays

g2301_2400.s2349_design_a_number_container_system - package g2301_2400.s2349_design_a_number_container_system

g2301_2400.s2350_shortest_impossible_sequence_of_rolls - package g2301_2400.s2350_shortest_impossible_sequence_of_rolls

g2301_2400.s2351_first_letter_to_appear_twice - package g2301_2400.s2351_first_letter_to_appear_twice

g2301_2400.s2352_equal_row_and_column_pairs - package g2301_2400.s2352_equal_row_and_column_pairs

g2301_2400.s2353_design_a_food_rating_system - package g2301_2400.s2353_design_a_food_rating_system

g2301_2400.s2354_number_of_excellent_pairs - package g2301_2400.s2354_number_of_excellent_pairs

g2301_2400.s2357_make_array_zero_by_subtracting_equal_amounts - package g2301_2400.s2357_make_array_zero_by_subtracting_equal_amounts

g2301_2400.s2358_maximum_number_of_groups_entering_a_competition - package g2301_2400.s2358_maximum_number_of_groups_entering_a_competition

g2301_2400.s2359_find_closest_node_to_given_two_nodes - package g2301_2400.s2359_find_closest_node_to_given_two_nodes

g2301_2400.s2360_longest_cycle_in_a_graph - package g2301_2400.s2360_longest_cycle_in_a_graph

g2301_2400.s2363_merge_similar_items - package g2301_2400.s2363_merge_similar_items

g2301_2400.s2364_count_number_of_bad_pairs - package g2301_2400.s2364_count_number_of_bad_pairs

g2301_2400.s2365_task_scheduler_ii - package g2301_2400.s2365_task_scheduler_ii

g2301_2400.s2366_minimum_replacements_to_sort_the_array - package g2301_2400.s2366_minimum_replacements_to_sort_the_array

g2301_2400.s2367_number_of_arithmetic_triplets - package g2301_2400.s2367_number_of_arithmetic_triplets

g2301_2400.s2368_reachable_nodes_with_restrictions - package g2301_2400.s2368_reachable_nodes_with_restrictions

g2301_2400.s2369_check_if_there_is_a_valid_partition_for_the_array - package g2301_2400.s2369_check_if_there_is_a_valid_partition_for_the_array

g2301_2400.s2370_longest_ideal_subsequence - package g2301_2400.s2370_longest_ideal_subsequence

g2301_2400.s2373_largest_local_values_in_a_matrix - package g2301_2400.s2373_largest_local_values_in_a_matrix

g2301_2400.s2374_node_with_highest_edge_score - package g2301_2400.s2374_node_with_highest_edge_score

g2301_2400.s2375_construct_smallest_number_from_di_string - package g2301_2400.s2375_construct_smallest_number_from_di_string

g2301_2400.s2376_count_special_integers - package g2301_2400.s2376_count_special_integers

g2301_2400.s2379_minimum_recolors_to_get_k_consecutive_black_blocks - package g2301_2400.s2379_minimum_recolors_to_get_k_consecutive_black_blocks

g2301_2400.s2380_time_needed_to_rearrange_a_binary_string - package g2301_2400.s2380_time_needed_to_rearrange_a_binary_string

g2301_2400.s2381_shifting_letters_ii - package g2301_2400.s2381_shifting_letters_ii

g2301_2400.s2382_maximum_segment_sum_after_removals - package g2301_2400.s2382_maximum_segment_sum_after_removals

g2301_2400.s2383_minimum_hours_of_training_to_win_a_competition - package g2301_2400.s2383_minimum_hours_of_training_to_win_a_competition

g2301_2400.s2384_largest_palindromic_number - package g2301_2400.s2384_largest_palindromic_number

g2301_2400.s2385_amount_of_time_for_binary_tree_to_be_infected - package g2301_2400.s2385_amount_of_time_for_binary_tree_to_be_infected

g2301_2400.s2386_find_the_k_sum_of_an_array - package g2301_2400.s2386_find_the_k_sum_of_an_array

g2301_2400.s2389_longest_subsequence_with_limited_sum - package g2301_2400.s2389_longest_subsequence_with_limited_sum

g2301_2400.s2390_removing_stars_from_a_string - package g2301_2400.s2390_removing_stars_from_a_string

g2301_2400.s2391_minimum_amount_of_time_to_collect_garbage - package g2301_2400.s2391_minimum_amount_of_time_to_collect_garbage

g2301_2400.s2392_build_a_matrix_with_conditions - package g2301_2400.s2392_build_a_matrix_with_conditions

g2301_2400.s2395_find_subarrays_with_equal_sum - package g2301_2400.s2395_find_subarrays_with_equal_sum

g2301_2400.s2396_strictly_palindromic_number - package g2301_2400.s2396_strictly_palindromic_number

g2301_2400.s2397_maximum_rows_covered_by_columns - package g2301_2400.s2397_maximum_rows_covered_by_columns

g2301_2400.s2398_maximum_number_of_robots_within_budget - package g2301_2400.s2398_maximum_number_of_robots_within_budget

g2301_2400.s2399_check_distances_between_same_letters - package g2301_2400.s2399_check_distances_between_same_letters

g2301_2400.s2400_number_of_ways_to_reach_a_position_after_exactly_k_steps - package g2301_2400.s2400_number_of_ways_to_reach_a_position_after_exactly_k_steps

g2401_2500.s2401_longest_nice_subarray - package g2401_2500.s2401_longest_nice_subarray

g2401_2500.s2402_meeting_rooms_iii - package g2401_2500.s2402_meeting_rooms_iii

g2401_2500.s2404_most_frequent_even_element - package g2401_2500.s2404_most_frequent_even_element

g2401_2500.s2405_optimal_partition_of_string - package g2401_2500.s2405_optimal_partition_of_string

g2401_2500.s2406_divide_intervals_into_minimum_number_of_groups - package g2401_2500.s2406_divide_intervals_into_minimum_number_of_groups

g2401_2500.s2407_longest_increasing_subsequence_ii - package g2401_2500.s2407_longest_increasing_subsequence_ii

g2401_2500.s2409_count_days_spent_together - package g2401_2500.s2409_count_days_spent_together

g2401_2500.s2410_maximum_matching_of_players_with_trainers - package g2401_2500.s2410_maximum_matching_of_players_with_trainers

g2401_2500.s2411_smallest_subarrays_with_maximum_bitwise_or - package g2401_2500.s2411_smallest_subarrays_with_maximum_bitwise_or

g2401_2500.s2412_minimum_money_required_before_transactions - package g2401_2500.s2412_minimum_money_required_before_transactions

g2401_2500.s2413_smallest_even_multiple - package g2401_2500.s2413_smallest_even_multiple

g2401_2500.s2414_length_of_the_longest_alphabetical_continuous_substring - package g2401_2500.s2414_length_of_the_longest_alphabetical_continuous_substring

g2401_2500.s2415_reverse_odd_levels_of_binary_tree - package g2401_2500.s2415_reverse_odd_levels_of_binary_tree

g2401_2500.s2416_sum_of_prefix_scores_of_strings - package g2401_2500.s2416_sum_of_prefix_scores_of_strings

g2401_2500.s2418_sort_the_people - package g2401_2500.s2418_sort_the_people

g2401_2500.s2419_longest_subarray_with_maximum_bitwise_and - package g2401_2500.s2419_longest_subarray_with_maximum_bitwise_and

g2401_2500.s2420_find_all_good_indices - package g2401_2500.s2420_find_all_good_indices

g2401_2500.s2421_number_of_good_paths - package g2401_2500.s2421_number_of_good_paths

g2401_2500.s2423_remove_letter_to_equalize_frequency - package g2401_2500.s2423_remove_letter_to_equalize_frequency

g2401_2500.s2424_longest_uploaded_prefix - package g2401_2500.s2424_longest_uploaded_prefix

g2401_2500.s2425_bitwise_xor_of_all_pairings - package g2401_2500.s2425_bitwise_xor_of_all_pairings

g2401_2500.s2426_number_of_pairs_satisfying_inequality - package g2401_2500.s2426_number_of_pairs_satisfying_inequality

g2401_2500.s2427_number_of_common_factors - package g2401_2500.s2427_number_of_common_factors

g2401_2500.s2428_maximum_sum_of_an_hourglass - package g2401_2500.s2428_maximum_sum_of_an_hourglass

g2401_2500.s2429_minimize_xor - package g2401_2500.s2429_minimize_xor

g2401_2500.s2430_maximum_deletions_on_a_string - package g2401_2500.s2430_maximum_deletions_on_a_string

g2401_2500.s2432_the_employee_that_worked_on_the_longest_task - package g2401_2500.s2432_the_employee_that_worked_on_the_longest_task

g2401_2500.s2433_find_the_original_array_of_prefix_xor - package g2401_2500.s2433_find_the_original_array_of_prefix_xor

g2401_2500.s2434_using_a_robot_to_print_the_lexicographically_smallest_string - package g2401_2500.s2434_using_a_robot_to_print_the_lexicographically_smallest_string

g2401_2500.s2435_paths_in_matrix_whose_sum_is_divisible_by_k - package g2401_2500.s2435_paths_in_matrix_whose_sum_is_divisible_by_k

g2401_2500.s2437_number_of_valid_clock_times - package g2401_2500.s2437_number_of_valid_clock_times

g2401_2500.s2438_range_product_queries_of_powers - package g2401_2500.s2438_range_product_queries_of_powers

g2401_2500.s2439_minimize_maximum_of_array - package g2401_2500.s2439_minimize_maximum_of_array

g2401_2500.s2440_create_components_with_same_value - package g2401_2500.s2440_create_components_with_same_value

g2401_2500.s2441_largest_positive_integer_that_exists_with_its_negative - package g2401_2500.s2441_largest_positive_integer_that_exists_with_its_negative

g2401_2500.s2442_count_number_of_distinct_integers_after_reverse_operations - package g2401_2500.s2442_count_number_of_distinct_integers_after_reverse_operations

g2401_2500.s2443_sum_of_number_and_its_reverse - package g2401_2500.s2443_sum_of_number_and_its_reverse

g2401_2500.s2444_count_subarrays_with_fixed_bounds - package g2401_2500.s2444_count_subarrays_with_fixed_bounds

g2401_2500.s2446_determine_if_two_events_have_conflict - package g2401_2500.s2446_determine_if_two_events_have_conflict

g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k - package g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k

g2401_2500.s2448_minimum_cost_to_make_array_equal - package g2401_2500.s2448_minimum_cost_to_make_array_equal

g2401_2500.s2449_minimum_number_of_operations_to_make_arrays_similar - package g2401_2500.s2449_minimum_number_of_operations_to_make_arrays_similar

g2401_2500.s2451_odd_string_difference - package g2401_2500.s2451_odd_string_difference

g2401_2500.s2452_words_within_two_edits_of_dictionary - package g2401_2500.s2452_words_within_two_edits_of_dictionary

g2401_2500.s2453_destroy_sequential_targets - package g2401_2500.s2453_destroy_sequential_targets

g2401_2500.s2454_next_greater_element_iv - package g2401_2500.s2454_next_greater_element_iv

g2401_2500.s2455_average_value_of_even_numbers_that_are_divisible_by_three - package g2401_2500.s2455_average_value_of_even_numbers_that_are_divisible_by_three

g2401_2500.s2456_most_popular_video_creator - package g2401_2500.s2456_most_popular_video_creator

g2401_2500.s2457_minimum_addition_to_make_integer_beautiful - package g2401_2500.s2457_minimum_addition_to_make_integer_beautiful

g2401_2500.s2458_height_of_binary_tree_after_subtree_removal_queries - package g2401_2500.s2458_height_of_binary_tree_after_subtree_removal_queries

g2401_2500.s2460_apply_operations_to_an_array - package g2401_2500.s2460_apply_operations_to_an_array

g2401_2500.s2461_maximum_sum_of_distinct_subarrays_with_length_k - package g2401_2500.s2461_maximum_sum_of_distinct_subarrays_with_length_k

g2401_2500.s2462_total_cost_to_hire_k_workers - package g2401_2500.s2462_total_cost_to_hire_k_workers

g2401_2500.s2463_minimum_total_distance_traveled - package g2401_2500.s2463_minimum_total_distance_traveled

g2401_2500.s2465_number_of_distinct_averages - package g2401_2500.s2465_number_of_distinct_averages

g2401_2500.s2466_count_ways_to_build_good_strings - package g2401_2500.s2466_count_ways_to_build_good_strings

g2401_2500.s2467_most_profitable_path_in_a_tree - package g2401_2500.s2467_most_profitable_path_in_a_tree

g2401_2500.s2468_split_message_based_on_limit - package g2401_2500.s2468_split_message_based_on_limit

g2401_2500.s2469_convert_the_temperature - package g2401_2500.s2469_convert_the_temperature

g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k - package g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k

g2401_2500.s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level - package g2401_2500.s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level

g2401_2500.s2472_maximum_number_of_non_overlapping_palindrome_substrings - package g2401_2500.s2472_maximum_number_of_non_overlapping_palindrome_substrings

g2401_2500.s2475_number_of_unequal_triplets_in_array - package g2401_2500.s2475_number_of_unequal_triplets_in_array

g2401_2500.s2476_closest_nodes_queries_in_a_binary_search_tree - package g2401_2500.s2476_closest_nodes_queries_in_a_binary_search_tree

g2401_2500.s2477_minimum_fuel_cost_to_report_to_the_capital - package g2401_2500.s2477_minimum_fuel_cost_to_report_to_the_capital

g2401_2500.s2478_number_of_beautiful_partitions - package g2401_2500.s2478_number_of_beautiful_partitions

g2401_2500.s2481_minimum_cuts_to_divide_a_circle - package g2401_2500.s2481_minimum_cuts_to_divide_a_circle

g2401_2500.s2482_difference_between_ones_and_zeros_in_row_and_column - package g2401_2500.s2482_difference_between_ones_and_zeros_in_row_and_column

g2401_2500.s2483_minimum_penalty_for_a_shop - package g2401_2500.s2483_minimum_penalty_for_a_shop

g2401_2500.s2484_count_palindromic_subsequences - package g2401_2500.s2484_count_palindromic_subsequences

g2401_2500.s2485_find_the_pivot_integer - package g2401_2500.s2485_find_the_pivot_integer

g2401_2500.s2486_append_characters_to_string_to_make_subsequence - package g2401_2500.s2486_append_characters_to_string_to_make_subsequence

g2401_2500.s2487_remove_nodes_from_linked_list - package g2401_2500.s2487_remove_nodes_from_linked_list

g2401_2500.s2488_count_subarrays_with_median_k - package g2401_2500.s2488_count_subarrays_with_median_k

g2401_2500.s2490_circular_sentence - package g2401_2500.s2490_circular_sentence

g2401_2500.s2491_divide_players_into_teams_of_equal_skill - package g2401_2500.s2491_divide_players_into_teams_of_equal_skill

g2401_2500.s2492_minimum_score_of_a_path_between_two_cities - package g2401_2500.s2492_minimum_score_of_a_path_between_two_cities

g2401_2500.s2493_divide_nodes_into_the_maximum_number_of_groups - package g2401_2500.s2493_divide_nodes_into_the_maximum_number_of_groups

g2401_2500.s2496_maximum_value_of_a_string_in_an_array - package g2401_2500.s2496_maximum_value_of_a_string_in_an_array

g2401_2500.s2497_maximum_star_sum_of_a_graph - package g2401_2500.s2497_maximum_star_sum_of_a_graph

g2401_2500.s2498_frog_jump_ii - package g2401_2500.s2498_frog_jump_ii

g2401_2500.s2499_minimum_total_cost_to_make_arrays_unequal - package g2401_2500.s2499_minimum_total_cost_to_make_arrays_unequal

g2401_2500.s2500_delete_greatest_value_in_each_row - package g2401_2500.s2500_delete_greatest_value_in_each_row

g2501_2600.s2501_longest_square_streak_in_an_array - package g2501_2600.s2501_longest_square_streak_in_an_array

g2501_2600.s2502_design_memory_allocator - package g2501_2600.s2502_design_memory_allocator

g2501_2600.s2503_maximum_number_of_points_from_grid_queries - package g2501_2600.s2503_maximum_number_of_points_from_grid_queries

g2501_2600.s2506_count_pairs_of_similar_strings - package g2501_2600.s2506_count_pairs_of_similar_strings

g2501_2600.s2507_smallest_value_after_replacing_with_sum_of_prime_factors - package g2501_2600.s2507_smallest_value_after_replacing_with_sum_of_prime_factors

g2501_2600.s2508_add_edges_to_make_degrees_of_all_nodes_even - package g2501_2600.s2508_add_edges_to_make_degrees_of_all_nodes_even

g2501_2600.s2509_cycle_length_queries_in_a_tree - package g2501_2600.s2509_cycle_length_queries_in_a_tree

g2501_2600.s2511_maximum_enemy_forts_that_can_be_captured - package g2501_2600.s2511_maximum_enemy_forts_that_can_be_captured

g2501_2600.s2512_reward_top_k_students - package g2501_2600.s2512_reward_top_k_students

g2501_2600.s2513_minimize_the_maximum_of_two_arrays - package g2501_2600.s2513_minimize_the_maximum_of_two_arrays

g2501_2600.s2514_count_anagrams - package g2501_2600.s2514_count_anagrams

g2501_2600.s2515_shortest_distance_to_target_string_in_a_circular_array - package g2501_2600.s2515_shortest_distance_to_target_string_in_a_circular_array

g2501_2600.s2516_take_k_of_each_character_from_left_and_right - package g2501_2600.s2516_take_k_of_each_character_from_left_and_right

g2501_2600.s2517_maximum_tastiness_of_candy_basket - package g2501_2600.s2517_maximum_tastiness_of_candy_basket

g2501_2600.s2518_number_of_great_partitions - package g2501_2600.s2518_number_of_great_partitions

g2501_2600.s2520_count_the_digits_that_divide_a_number - package g2501_2600.s2520_count_the_digits_that_divide_a_number

g2501_2600.s2521_distinct_prime_factors_of_product_of_array - package g2501_2600.s2521_distinct_prime_factors_of_product_of_array

g2501_2600.s2522_partition_string_into_substrings_with_values_at_most_k - package g2501_2600.s2522_partition_string_into_substrings_with_values_at_most_k

g2501_2600.s2523_closest_prime_numbers_in_range - package g2501_2600.s2523_closest_prime_numbers_in_range

g2501_2600.s2525_categorize_box_according_to_criteria - package g2501_2600.s2525_categorize_box_according_to_criteria

g2501_2600.s2526_find_consecutive_integers_from_a_data_stream - package g2501_2600.s2526_find_consecutive_integers_from_a_data_stream

g2501_2600.s2527_find_xor_beauty_of_array - package g2501_2600.s2527_find_xor_beauty_of_array

g2501_2600.s2528_maximize_the_minimum_powered_city - package g2501_2600.s2528_maximize_the_minimum_powered_city

g2501_2600.s2529_maximum_count_of_positive_integer_and_negative_integer - package g2501_2600.s2529_maximum_count_of_positive_integer_and_negative_integer

g2501_2600.s2530_maximal_score_after_applying_k_operations - package g2501_2600.s2530_maximal_score_after_applying_k_operations

g2501_2600.s2531_make_number_of_distinct_characters_equal - package g2501_2600.s2531_make_number_of_distinct_characters_equal

g2501_2600.s2532_time_to_cross_a_bridge - package g2501_2600.s2532_time_to_cross_a_bridge

g2501_2600.s2535_difference_between_element_sum_and_digit_sum_of_an_array - package g2501_2600.s2535_difference_between_element_sum_and_digit_sum_of_an_array

g2501_2600.s2536_increment_submatrices_by_one - package g2501_2600.s2536_increment_submatrices_by_one

g2501_2600.s2537_count_the_number_of_good_subarrays - package g2501_2600.s2537_count_the_number_of_good_subarrays

g2501_2600.s2538_difference_between_maximum_and_minimum_price_sum - package g2501_2600.s2538_difference_between_maximum_and_minimum_price_sum

g2501_2600.s2540_minimum_common_value - package g2501_2600.s2540_minimum_common_value

g2501_2600.s2541_minimum_operations_to_make_array_equal_ii - package g2501_2600.s2541_minimum_operations_to_make_array_equal_ii

g2501_2600.s2542_maximum_subsequence_score - package g2501_2600.s2542_maximum_subsequence_score

g2501_2600.s2543_check_if_point_is_reachable - package g2501_2600.s2543_check_if_point_is_reachable

g2501_2600.s2544_alternating_digit_sum - package g2501_2600.s2544_alternating_digit_sum

g2501_2600.s2545_sort_the_students_by_their_kth_score - package g2501_2600.s2545_sort_the_students_by_their_kth_score

g2501_2600.s2546_apply_bitwise_operations_to_make_strings_equal - package g2501_2600.s2546_apply_bitwise_operations_to_make_strings_equal

g2501_2600.s2547_minimum_cost_to_split_an_array - package g2501_2600.s2547_minimum_cost_to_split_an_array

g2501_2600.s2549_count_distinct_numbers_on_board - package g2501_2600.s2549_count_distinct_numbers_on_board

g2501_2600.s2550_count_collisions_of_monkeys_on_a_polygon - package g2501_2600.s2550_count_collisions_of_monkeys_on_a_polygon

g2501_2600.s2551_put_marbles_in_bags - package g2501_2600.s2551_put_marbles_in_bags

g2501_2600.s2552_count_increasing_quadruplets - package g2501_2600.s2552_count_increasing_quadruplets

g2501_2600.s2553_separate_the_digits_in_an_array - package g2501_2600.s2553_separate_the_digits_in_an_array

g2501_2600.s2554_maximum_number_of_integers_to_choose_from_a_range_i - package g2501_2600.s2554_maximum_number_of_integers_to_choose_from_a_range_i

g2501_2600.s2555_maximize_win_from_two_segments - package g2501_2600.s2555_maximize_win_from_two_segments

g2501_2600.s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip - package g2501_2600.s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip

g2501_2600.s2558_take_gifts_from_the_richest_pile - package g2501_2600.s2558_take_gifts_from_the_richest_pile

g2501_2600.s2559_count_vowel_strings_in_ranges - package g2501_2600.s2559_count_vowel_strings_in_ranges

g2501_2600.s2560_house_robber_iv - package g2501_2600.s2560_house_robber_iv

g2501_2600.s2561_rearranging_fruits - package g2501_2600.s2561_rearranging_fruits

g2501_2600.s2562_find_the_array_concatenation_value - package g2501_2600.s2562_find_the_array_concatenation_value

g2501_2600.s2563_count_the_number_of_fair_pairs - package g2501_2600.s2563_count_the_number_of_fair_pairs

g2501_2600.s2564_substring_xor_queries - package g2501_2600.s2564_substring_xor_queries

g2501_2600.s2565_subsequence_with_the_minimum_score - package g2501_2600.s2565_subsequence_with_the_minimum_score

g2501_2600.s2566_maximum_difference_by_remapping_a_digit - package g2501_2600.s2566_maximum_difference_by_remapping_a_digit

g2501_2600.s2567_minimum_score_by_changing_two_elements - package g2501_2600.s2567_minimum_score_by_changing_two_elements

g2501_2600.s2568_minimum_impossible_or - package g2501_2600.s2568_minimum_impossible_or

g2501_2600.s2569_handling_sum_queries_after_update - package g2501_2600.s2569_handling_sum_queries_after_update

g2501_2600.s2570_merge_two_2d_arrays_by_summing_values - package g2501_2600.s2570_merge_two_2d_arrays_by_summing_values

g2501_2600.s2571_minimum_operations_to_reduce_an_integer_to_0 - package g2501_2600.s2571_minimum_operations_to_reduce_an_integer_to_0

g2501_2600.s2572_count_the_number_of_square_free_subsets - package g2501_2600.s2572_count_the_number_of_square_free_subsets

g2501_2600.s2573_find_the_string_with_lcp - package g2501_2600.s2573_find_the_string_with_lcp

g2501_2600.s2574_left_and_right_sum_differences - package g2501_2600.s2574_left_and_right_sum_differences

g2501_2600.s2575_find_the_divisibility_array_of_a_string - package g2501_2600.s2575_find_the_divisibility_array_of_a_string

g2501_2600.s2576_find_the_maximum_number_of_marked_indices - package g2501_2600.s2576_find_the_maximum_number_of_marked_indices

g2501_2600.s2577_minimum_time_to_visit_a_cell_in_a_grid - package g2501_2600.s2577_minimum_time_to_visit_a_cell_in_a_grid

g2501_2600.s2578_split_with_minimum_sum - package g2501_2600.s2578_split_with_minimum_sum

g2501_2600.s2579_count_total_number_of_colored_cells - package g2501_2600.s2579_count_total_number_of_colored_cells

g2501_2600.s2580_count_ways_to_group_overlapping_ranges - package g2501_2600.s2580_count_ways_to_group_overlapping_ranges

g2501_2600.s2581_count_number_of_possible_root_nodes - package g2501_2600.s2581_count_number_of_possible_root_nodes

g2501_2600.s2582_pass_the_pillow - package g2501_2600.s2582_pass_the_pillow

g2501_2600.s2583_kth_largest_sum_in_a_binary_tree - package g2501_2600.s2583_kth_largest_sum_in_a_binary_tree

g2501_2600.s2584_split_the_array_to_make_coprime_products - package g2501_2600.s2584_split_the_array_to_make_coprime_products

g2501_2600.s2585_number_of_ways_to_earn_points - package g2501_2600.s2585_number_of_ways_to_earn_points

g2501_2600.s2586_count_the_number_of_vowel_strings_in_range - package g2501_2600.s2586_count_the_number_of_vowel_strings_in_range

g2501_2600.s2587_rearrange_array_to_maximize_prefix_score - package g2501_2600.s2587_rearrange_array_to_maximize_prefix_score

g2501_2600.s2588_count_the_number_of_beautiful_subarrays - package g2501_2600.s2588_count_the_number_of_beautiful_subarrays

g2501_2600.s2589_minimum_time_to_complete_all_tasks - package g2501_2600.s2589_minimum_time_to_complete_all_tasks

g2501_2600.s2591_distribute_money_to_maximum_children - package g2501_2600.s2591_distribute_money_to_maximum_children

g2501_2600.s2592_maximize_greatness_of_an_array - package g2501_2600.s2592_maximize_greatness_of_an_array

g2501_2600.s2593_find_score_of_an_array_after_marking_all_elements - package g2501_2600.s2593_find_score_of_an_array_after_marking_all_elements

g2501_2600.s2594_minimum_time_to_repair_cars - package g2501_2600.s2594_minimum_time_to_repair_cars

g2501_2600.s2595_number_of_even_and_odd_bits - package g2501_2600.s2595_number_of_even_and_odd_bits

g2501_2600.s2596_check_knight_tour_configuration - package g2501_2600.s2596_check_knight_tour_configuration

g2501_2600.s2597_the_number_of_beautiful_subsets - package g2501_2600.s2597_the_number_of_beautiful_subsets

g2501_2600.s2598_smallest_missing_non_negative_integer_after_operations - package g2501_2600.s2598_smallest_missing_non_negative_integer_after_operations

g2501_2600.s2600_k_items_with_the_maximum_sum - package g2501_2600.s2600_k_items_with_the_maximum_sum

g2601_2700.s2601_prime_subtraction_operation - package g2601_2700.s2601_prime_subtraction_operation

g2601_2700.s2602_minimum_operations_to_make_all_array_elements_equal - package g2601_2700.s2602_minimum_operations_to_make_all_array_elements_equal

g2601_2700.s2603_collect_coins_in_a_tree - package g2601_2700.s2603_collect_coins_in_a_tree

g2601_2700.s2605_form_smallest_number_from_two_digit_arrays - package g2601_2700.s2605_form_smallest_number_from_two_digit_arrays

g2601_2700.s2606_find_the_substring_with_maximum_cost - package g2601_2700.s2606_find_the_substring_with_maximum_cost

g2601_2700.s2607_make_k_subarray_sums_equal - package g2601_2700.s2607_make_k_subarray_sums_equal

g2601_2700.s2608_shortest_cycle_in_a_graph - package g2601_2700.s2608_shortest_cycle_in_a_graph

g2601_2700.s2609_find_the_longest_balanced_substring_of_a_binary_string - package g2601_2700.s2609_find_the_longest_balanced_substring_of_a_binary_string

g2601_2700.s2610_convert_an_array_into_a_2d_array_with_conditions - package g2601_2700.s2610_convert_an_array_into_a_2d_array_with_conditions

g2601_2700.s2611_mice_and_cheese - package g2601_2700.s2611_mice_and_cheese

g2601_2700.s2612_minimum_reverse_operations - package g2601_2700.s2612_minimum_reverse_operations

g2601_2700.s2614_prime_in_diagonal - package g2601_2700.s2614_prime_in_diagonal

g2601_2700.s2615_sum_of_distances - package g2601_2700.s2615_sum_of_distances

g2601_2700.s2616_minimize_the_maximum_difference_of_pairs - package g2601_2700.s2616_minimize_the_maximum_difference_of_pairs

g2601_2700.s2617_minimum_number_of_visited_cells_in_a_grid - package g2601_2700.s2617_minimum_number_of_visited_cells_in_a_grid

g2601_2700.s2639_find_the_width_of_columns_of_a_grid - package g2601_2700.s2639_find_the_width_of_columns_of_a_grid

g2601_2700.s2640_find_the_score_of_all_prefixes_of_an_array - package g2601_2700.s2640_find_the_score_of_all_prefixes_of_an_array

g2601_2700.s2641_cousins_in_binary_tree_ii - package g2601_2700.s2641_cousins_in_binary_tree_ii

g2601_2700.s2642_design_graph_with_shortest_path_calculator - package g2601_2700.s2642_design_graph_with_shortest_path_calculator

g2601_2700.s2643_row_with_maximum_ones - package g2601_2700.s2643_row_with_maximum_ones

g2601_2700.s2644_find_the_maximum_divisibility_score - package g2601_2700.s2644_find_the_maximum_divisibility_score

g2601_2700.s2645_minimum_additions_to_make_valid_string - package g2601_2700.s2645_minimum_additions_to_make_valid_string

g2601_2700.s2646_minimize_the_total_price_of_the_trips - package g2601_2700.s2646_minimize_the_total_price_of_the_trips

g2601_2700.s2651_calculate_delayed_arrival_time - package g2601_2700.s2651_calculate_delayed_arrival_time

g2601_2700.s2652_sum_multiples - package g2601_2700.s2652_sum_multiples

g2601_2700.s2653_sliding_subarray_beauty - package g2601_2700.s2653_sliding_subarray_beauty

g2601_2700.s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1 - package g2601_2700.s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1

g2601_2700.s2656_maximum_sum_with_exactly_k_elements - package g2601_2700.s2656_maximum_sum_with_exactly_k_elements

g2601_2700.s2657_find_the_prefix_common_array_of_two_arrays - package g2601_2700.s2657_find_the_prefix_common_array_of_two_arrays

g2601_2700.s2658_maximum_number_of_fish_in_a_grid - package g2601_2700.s2658_maximum_number_of_fish_in_a_grid

g2601_2700.s2659_make_array_empty - package g2601_2700.s2659_make_array_empty

g2601_2700.s2660_determine_the_winner_of_a_bowling_game - package g2601_2700.s2660_determine_the_winner_of_a_bowling_game

g2601_2700.s2661_first_completely_painted_row_or_column - package g2601_2700.s2661_first_completely_painted_row_or_column

g2601_2700.s2662_minimum_cost_of_a_path_with_special_roads - package g2601_2700.s2662_minimum_cost_of_a_path_with_special_roads

g2601_2700.s2663_lexicographically_smallest_beautiful_string - package g2601_2700.s2663_lexicographically_smallest_beautiful_string

g2601_2700.s2670_find_the_distinct_difference_array - package g2601_2700.s2670_find_the_distinct_difference_array

g2601_2700.s2671_frequency_tracker - package g2601_2700.s2671_frequency_tracker

g2601_2700.s2672_number_of_adjacent_elements_with_the_same_color - package g2601_2700.s2672_number_of_adjacent_elements_with_the_same_color

g2601_2700.s2673_make_costs_of_paths_equal_in_a_binary_tree - package g2601_2700.s2673_make_costs_of_paths_equal_in_a_binary_tree

g2601_2700.s2678_number_of_senior_citizens - package g2601_2700.s2678_number_of_senior_citizens

g2601_2700.s2679_sum_in_a_matrix - package g2601_2700.s2679_sum_in_a_matrix

g2601_2700.s2680_maximum_or - package g2601_2700.s2680_maximum_or

g2601_2700.s2681_power_of_heroes - package g2601_2700.s2681_power_of_heroes

g2601_2700.s2682_find_the_losers_of_the_circular_game - package g2601_2700.s2682_find_the_losers_of_the_circular_game

g2601_2700.s2683_neighboring_bitwise_xor - package g2601_2700.s2683_neighboring_bitwise_xor

g2601_2700.s2684_maximum_number_of_moves_in_a_grid - package g2601_2700.s2684_maximum_number_of_moves_in_a_grid

g2601_2700.s2685_count_the_number_of_complete_components - package g2601_2700.s2685_count_the_number_of_complete_components

g2601_2700.s2696_minimum_string_length_after_removing_substrings - package g2601_2700.s2696_minimum_string_length_after_removing_substrings

g2601_2700.s2697_lexicographically_smallest_palindrome - package g2601_2700.s2697_lexicographically_smallest_palindrome

g2601_2700.s2698_find_the_punishment_number_of_an_integer - package g2601_2700.s2698_find_the_punishment_number_of_an_integer

g2601_2700.s2699_modify_graph_edge_weights - package g2601_2700.s2699_modify_graph_edge_weights

g2701_2800.s2706_buy_two_chocolates - package g2701_2800.s2706_buy_two_chocolates

g2701_2800.s2707_extra_characters_in_a_string - package g2701_2800.s2707_extra_characters_in_a_string

g2701_2800.s2708_maximum_strength_of_a_group - package g2701_2800.s2708_maximum_strength_of_a_group

g2701_2800.s2709_greatest_common_divisor_traversal - package g2701_2800.s2709_greatest_common_divisor_traversal

g2701_2800.s2710_remove_trailing_zeros_from_a_string - package g2701_2800.s2710_remove_trailing_zeros_from_a_string

g2701_2800.s2711_difference_of_number_of_distinct_values_on_diagonals - package g2701_2800.s2711_difference_of_number_of_distinct_values_on_diagonals

g2701_2800.s2712_minimum_cost_to_make_all_characters_equal - package g2701_2800.s2712_minimum_cost_to_make_all_characters_equal

g2701_2800.s2713_maximum_strictly_increasing_cells_in_a_matrix - package g2701_2800.s2713_maximum_strictly_increasing_cells_in_a_matrix

g2701_2800.s2716_minimize_string_length - package g2701_2800.s2716_minimize_string_length

g2701_2800.s2717_semi_ordered_permutation - package g2701_2800.s2717_semi_ordered_permutation

g2701_2800.s2718_sum_of_matrix_after_queries - package g2701_2800.s2718_sum_of_matrix_after_queries

g2701_2800.s2719_count_of_integers - package g2701_2800.s2719_count_of_integers

g2701_2800.s2729_check_if_the_number_is_fascinating - package g2701_2800.s2729_check_if_the_number_is_fascinating

g2701_2800.s2730_find_the_longest_semi_repetitive_substring - package g2701_2800.s2730_find_the_longest_semi_repetitive_substring

g2701_2800.s2731_movement_of_robots - package g2701_2800.s2731_movement_of_robots

g2701_2800.s2732_find_a_good_subset_of_the_matrix - package g2701_2800.s2732_find_a_good_subset_of_the_matrix

g2701_2800.s2733_neither_minimum_nor_maximum - package g2701_2800.s2733_neither_minimum_nor_maximum

g2701_2800.s2734_lexicographically_smallest_string_after_substring_operation - package g2701_2800.s2734_lexicographically_smallest_string_after_substring_operation

g2701_2800.s2735_collecting_chocolates - package g2701_2800.s2735_collecting_chocolates

g2701_2800.s2736_maximum_sum_queries - package g2701_2800.s2736_maximum_sum_queries

g2701_2800.s2739_total_distance_traveled - package g2701_2800.s2739_total_distance_traveled

g2701_2800.s2740_find_the_value_of_the_partition - package g2701_2800.s2740_find_the_value_of_the_partition

g2701_2800.s2741_special_permutations - package g2701_2800.s2741_special_permutations

g2701_2800.s2742_painting_the_walls - package g2701_2800.s2742_painting_the_walls

g2701_2800.s2744_find_maximum_number_of_string_pairs - package g2701_2800.s2744_find_maximum_number_of_string_pairs

g2701_2800.s2745_construct_the_longest_new_string - package g2701_2800.s2745_construct_the_longest_new_string

g2701_2800.s2746_decremental_string_concatenation - package g2701_2800.s2746_decremental_string_concatenation

g2701_2800.s2747_count_zero_request_servers - package g2701_2800.s2747_count_zero_request_servers

g2701_2800.s2748_number_of_beautiful_pairs - package g2701_2800.s2748_number_of_beautiful_pairs

g2701_2800.s2749_minimum_operations_to_make_the_integer_zero - package g2701_2800.s2749_minimum_operations_to_make_the_integer_zero

g2701_2800.s2750_ways_to_split_array_into_good_subarrays - package g2701_2800.s2750_ways_to_split_array_into_good_subarrays

g2701_2800.s2751_robot_collisions - package g2701_2800.s2751_robot_collisions

g2701_2800.s2760_longest_even_odd_subarray_with_threshold - package g2701_2800.s2760_longest_even_odd_subarray_with_threshold

g2701_2800.s2761_prime_pairs_with_target_sum - package g2701_2800.s2761_prime_pairs_with_target_sum

g2701_2800.s2762_continuous_subarrays - package g2701_2800.s2762_continuous_subarrays

g2701_2800.s2763_sum_of_imbalance_numbers_of_all_subarrays - package g2701_2800.s2763_sum_of_imbalance_numbers_of_all_subarrays

g2701_2800.s2765_longest_alternating_subarray - package g2701_2800.s2765_longest_alternating_subarray

g2701_2800.s2766_relocate_marbles - package g2701_2800.s2766_relocate_marbles

g2701_2800.s2767_partition_string_into_minimum_beautiful_substrings - package g2701_2800.s2767_partition_string_into_minimum_beautiful_substrings

g2701_2800.s2768_number_of_black_blocks - package g2701_2800.s2768_number_of_black_blocks

g2701_2800.s2769_find_the_maximum_achievable_number - package g2701_2800.s2769_find_the_maximum_achievable_number

g2701_2800.s2770_maximum_number_of_jumps_to_reach_the_last_index - package g2701_2800.s2770_maximum_number_of_jumps_to_reach_the_last_index

g2701_2800.s2771_longest_non_decreasing_subarray_from_two_arrays - package g2701_2800.s2771_longest_non_decreasing_subarray_from_two_arrays

g2701_2800.s2772_apply_operations_to_make_all_array_elements_equal_to_zero - package g2701_2800.s2772_apply_operations_to_make_all_array_elements_equal_to_zero

g2701_2800.s2778_sum_of_squares_of_special_elements - package g2701_2800.s2778_sum_of_squares_of_special_elements

g2701_2800.s2779_maximum_beauty_of_an_array_after_applying_operation - package g2701_2800.s2779_maximum_beauty_of_an_array_after_applying_operation

g2701_2800.s2780_minimum_index_of_a_valid_split - package g2701_2800.s2780_minimum_index_of_a_valid_split

g2701_2800.s2781_length_of_the_longest_valid_substring - package g2701_2800.s2781_length_of_the_longest_valid_substring

g2701_2800.s2784_check_if_array_is_good - package g2701_2800.s2784_check_if_array_is_good

g2701_2800.s2785_sort_vowels_in_a_string - package g2701_2800.s2785_sort_vowels_in_a_string

g2701_2800.s2786_visit_array_positions_to_maximize_score - package g2701_2800.s2786_visit_array_positions_to_maximize_score

g2701_2800.s2787_ways_to_express_an_integer_as_sum_of_powers - package g2701_2800.s2787_ways_to_express_an_integer_as_sum_of_powers

g2701_2800.s2788_split_strings_by_separator - package g2701_2800.s2788_split_strings_by_separator

g2701_2800.s2789_largest_element_in_an_array_after_merge_operations - package g2701_2800.s2789_largest_element_in_an_array_after_merge_operations

g2701_2800.s2790_maximum_number_of_groups_with_increasing_length - package g2701_2800.s2790_maximum_number_of_groups_with_increasing_length

g2701_2800.s2791_count_paths_that_can_form_a_palindrome_in_a_tree - package g2701_2800.s2791_count_paths_that_can_form_a_palindrome_in_a_tree

g2701_2800.s2798_number_of_employees_who_met_the_target - package g2701_2800.s2798_number_of_employees_who_met_the_target

g2701_2800.s2799_count_complete_subarrays_in_an_array - package g2701_2800.s2799_count_complete_subarrays_in_an_array

g2701_2800.s2800_shortest_string_that_contains_three_strings - package g2701_2800.s2800_shortest_string_that_contains_three_strings

g2801_2900.s2801_count_stepping_numbers_in_range - package g2801_2900.s2801_count_stepping_numbers_in_range

g2801_2900.s2806_account_balance_after_rounded_purchase - package g2801_2900.s2806_account_balance_after_rounded_purchase

g2801_2900.s2807_insert_greatest_common_divisors_in_linked_list - package g2801_2900.s2807_insert_greatest_common_divisors_in_linked_list

g2801_2900.s2808_minimum_seconds_to_equalize_a_circular_array - package g2801_2900.s2808_minimum_seconds_to_equalize_a_circular_array

g2801_2900.s2809_minimum_time_to_make_array_sum_at_most_x - package g2801_2900.s2809_minimum_time_to_make_array_sum_at_most_x

g2801_2900.s2810_faulty_keyboard - package g2801_2900.s2810_faulty_keyboard

g2801_2900.s2811_check_if_it_is_possible_to_split_array - package g2801_2900.s2811_check_if_it_is_possible_to_split_array

g2801_2900.s2812_find_the_safest_path_in_a_grid - package g2801_2900.s2812_find_the_safest_path_in_a_grid

g2801_2900.s2813_maximum_elegance_of_a_k_length_subsequence - package g2801_2900.s2813_maximum_elegance_of_a_k_length_subsequence

g2801_2900.s2815_max_pair_sum_in_an_array - package g2801_2900.s2815_max_pair_sum_in_an_array

g2801_2900.s2816_double_a_number_represented_as_a_linked_list - package g2801_2900.s2816_double_a_number_represented_as_a_linked_list

g2801_2900.s2817_minimum_absolute_difference_between_elements_with_constraint - package g2801_2900.s2817_minimum_absolute_difference_between_elements_with_constraint

g2801_2900.s2818_apply_operations_to_maximize_score - package g2801_2900.s2818_apply_operations_to_maximize_score

g2801_2900.s2824_count_pairs_whose_sum_is_less_than_target - package g2801_2900.s2824_count_pairs_whose_sum_is_less_than_target

g2801_2900.s2825_make_string_a_subsequence_using_cyclic_increments - package g2801_2900.s2825_make_string_a_subsequence_using_cyclic_increments

g2801_2900.s2826_sorting_three_groups - package g2801_2900.s2826_sorting_three_groups

g2801_2900.s2827_number_of_beautiful_integers_in_the_range - package g2801_2900.s2827_number_of_beautiful_integers_in_the_range

g2801_2900.s2828_check_if_a_string_is_an_acronym_of_words - package g2801_2900.s2828_check_if_a_string_is_an_acronym_of_words

g2801_2900.s2829_determine_the_minimum_sum_of_a_k_avoiding_array - package g2801_2900.s2829_determine_the_minimum_sum_of_a_k_avoiding_array

g2801_2900.s2830_maximize_the_profit_as_the_salesman - package g2801_2900.s2830_maximize_the_profit_as_the_salesman

g2801_2900.s2831_find_the_longest_equal_subarray - package g2801_2900.s2831_find_the_longest_equal_subarray

g2801_2900.s2833_furthest_point_from_origin - package g2801_2900.s2833_furthest_point_from_origin

g2801_2900.s2834_find_the_minimum_possible_sum_of_a_beautiful_array - package g2801_2900.s2834_find_the_minimum_possible_sum_of_a_beautiful_array

g2801_2900.s2835_minimum_operations_to_form_subsequence_with_target_sum - package g2801_2900.s2835_minimum_operations_to_form_subsequence_with_target_sum

g2801_2900.s2836_maximize_value_of_function_in_a_ball_passing_game - package g2801_2900.s2836_maximize_value_of_function_in_a_ball_passing_game

g2801_2900.s2839_check_if_strings_can_be_made_equal_with_operations_i - package g2801_2900.s2839_check_if_strings_can_be_made_equal_with_operations_i

g2801_2900.s2840_check_if_strings_can_be_made_equal_with_operations_ii - package g2801_2900.s2840_check_if_strings_can_be_made_equal_with_operations_ii

g2801_2900.s2841_maximum_sum_of_almost_unique_subarray - package g2801_2900.s2841_maximum_sum_of_almost_unique_subarray

g2801_2900.s2842_count_k_subsequences_of_a_string_with_maximum_beauty - package g2801_2900.s2842_count_k_subsequences_of_a_string_with_maximum_beauty

g2801_2900.s2843_count_symmetric_integers - package g2801_2900.s2843_count_symmetric_integers

g2801_2900.s2844_minimum_operations_to_make_a_special_number - package g2801_2900.s2844_minimum_operations_to_make_a_special_number

g2801_2900.s2845_count_of_interesting_subarrays - package g2801_2900.s2845_count_of_interesting_subarrays

g2801_2900.s2846_minimum_edge_weight_equilibrium_queries_in_a_tree - package g2801_2900.s2846_minimum_edge_weight_equilibrium_queries_in_a_tree

g2801_2900.s2848_points_that_intersect_with_cars - package g2801_2900.s2848_points_that_intersect_with_cars

g2801_2900.s2849_determine_if_a_cell_is_reachable_at_a_given_time - package g2801_2900.s2849_determine_if_a_cell_is_reachable_at_a_given_time

g2801_2900.s2850_minimum_moves_to_spread_stones_over_grid - package g2801_2900.s2850_minimum_moves_to_spread_stones_over_grid

g2801_2900.s2851_string_transformation - package g2801_2900.s2851_string_transformation

g2801_2900.s2855_minimum_right_shifts_to_sort_the_array - package g2801_2900.s2855_minimum_right_shifts_to_sort_the_array

g2801_2900.s2856_minimum_array_length_after_pair_removals - package g2801_2900.s2856_minimum_array_length_after_pair_removals

g2801_2900.s2857_count_pairs_of_points_with_distance_k - package g2801_2900.s2857_count_pairs_of_points_with_distance_k

g2801_2900.s2858_minimum_edge_reversals_so_every_node_is_reachable - package g2801_2900.s2858_minimum_edge_reversals_so_every_node_is_reachable

g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits - package g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits

g2801_2900.s2860_happy_students - package g2801_2900.s2860_happy_students

g2801_2900.s2861_maximum_number_of_alloys - package g2801_2900.s2861_maximum_number_of_alloys

g2801_2900.s2862_maximum_element_sum_of_a_complete_subset_of_indices - package g2801_2900.s2862_maximum_element_sum_of_a_complete_subset_of_indices

g2801_2900.s2864_maximum_odd_binary_number - package g2801_2900.s2864_maximum_odd_binary_number

g2801_2900.s2865_beautiful_towers_i - package g2801_2900.s2865_beautiful_towers_i

g2801_2900.s2866_beautiful_towers_ii - package g2801_2900.s2866_beautiful_towers_ii

g2801_2900.s2867_count_valid_paths_in_a_tree - package g2801_2900.s2867_count_valid_paths_in_a_tree

g2801_2900.s2869_minimum_operations_to_collect_elements - package g2801_2900.s2869_minimum_operations_to_collect_elements

g2801_2900.s2870_minimum_number_of_operations_to_make_array_empty - package g2801_2900.s2870_minimum_number_of_operations_to_make_array_empty

g2801_2900.s2871_split_array_into_maximum_number_of_subarrays - package g2801_2900.s2871_split_array_into_maximum_number_of_subarrays

g2801_2900.s2872_maximum_number_of_k_divisible_components - package g2801_2900.s2872_maximum_number_of_k_divisible_components

g2801_2900.s2873_maximum_value_of_an_ordered_triplet_i - package g2801_2900.s2873_maximum_value_of_an_ordered_triplet_i

g2801_2900.s2874_maximum_value_of_an_ordered_triplet_ii - package g2801_2900.s2874_maximum_value_of_an_ordered_triplet_ii

g2801_2900.s2875_minimum_size_subarray_in_infinite_array - package g2801_2900.s2875_minimum_size_subarray_in_infinite_array

g2801_2900.s2876_count_visited_nodes_in_a_directed_graph - package g2801_2900.s2876_count_visited_nodes_in_a_directed_graph

g2801_2900.s2894_divisible_and_non_divisible_sums_difference - package g2801_2900.s2894_divisible_and_non_divisible_sums_difference

g2801_2900.s2895_minimum_processing_time - package g2801_2900.s2895_minimum_processing_time

g2801_2900.s2896_apply_operations_to_make_two_strings_equal - package g2801_2900.s2896_apply_operations_to_make_two_strings_equal

g2801_2900.s2897_apply_operations_on_array_to_maximize_sum_of_squares - package g2801_2900.s2897_apply_operations_on_array_to_maximize_sum_of_squares

g2801_2900.s2899_last_visited_integers - package g2801_2900.s2899_last_visited_integers

g2801_2900.s2900_longest_unequal_adjacent_groups_subsequence_i - package g2801_2900.s2900_longest_unequal_adjacent_groups_subsequence_i

g2901_3000.s2901_longest_unequal_adjacent_groups_subsequence_ii - package g2901_3000.s2901_longest_unequal_adjacent_groups_subsequence_ii

g2901_3000.s2902_count_of_sub_multisets_with_bounded_sum - package g2901_3000.s2902_count_of_sub_multisets_with_bounded_sum

g2901_3000.s2903_find_indices_with_index_and_value_difference_i - package g2901_3000.s2903_find_indices_with_index_and_value_difference_i

g2901_3000.s2904_shortest_and_lexicographically_smallest_beautiful_string - package g2901_3000.s2904_shortest_and_lexicographically_smallest_beautiful_string

g2901_3000.s2905_find_indices_with_index_and_value_difference_ii - package g2901_3000.s2905_find_indices_with_index_and_value_difference_ii

g2901_3000.s2906_construct_product_matrix - package g2901_3000.s2906_construct_product_matrix

g2901_3000.s2908_minimum_sum_of_mountain_triplets_i - package g2901_3000.s2908_minimum_sum_of_mountain_triplets_i

g2901_3000.s2909_minimum_sum_of_mountain_triplets_ii - package g2901_3000.s2909_minimum_sum_of_mountain_triplets_ii

g2901_3000.s2910_minimum_number_of_groups_to_create_a_valid_assignment - package g2901_3000.s2910_minimum_number_of_groups_to_create_a_valid_assignment

g2901_3000.s2911_minimum_changes_to_make_k_semi_palindromes - package g2901_3000.s2911_minimum_changes_to_make_k_semi_palindromes

g2901_3000.s2913_subarrays_distinct_element_sum_of_squares_i - package g2901_3000.s2913_subarrays_distinct_element_sum_of_squares_i

g2901_3000.s2914_minimum_number_of_changes_to_make_binary_string_beautiful - package g2901_3000.s2914_minimum_number_of_changes_to_make_binary_string_beautiful

g2901_3000.s2915_length_of_the_longest_subsequence_that_sums_to_target - package g2901_3000.s2915_length_of_the_longest_subsequence_that_sums_to_target

g2901_3000.s2916_subarrays_distinct_element_sum_of_squares_ii - package g2901_3000.s2916_subarrays_distinct_element_sum_of_squares_ii

g2901_3000.s2917_find_the_k_or_of_an_array - package g2901_3000.s2917_find_the_k_or_of_an_array

g2901_3000.s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros - package g2901_3000.s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros

g2901_3000.s2919_minimum_increment_operations_to_make_array_beautiful - package g2901_3000.s2919_minimum_increment_operations_to_make_array_beautiful

g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes - package g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes

g2901_3000.s2923_find_champion_i - package g2901_3000.s2923_find_champion_i

g2901_3000.s2924_find_champion_ii - package g2901_3000.s2924_find_champion_ii

g2901_3000.s2925_maximum_score_after_applying_operations_on_a_tree - package g2901_3000.s2925_maximum_score_after_applying_operations_on_a_tree

g2901_3000.s2926_maximum_balanced_subsequence_sum - package g2901_3000.s2926_maximum_balanced_subsequence_sum

g2901_3000.s2928_distribute_candies_among_children_i - package g2901_3000.s2928_distribute_candies_among_children_i

g2901_3000.s2929_distribute_candies_among_children_ii - package g2901_3000.s2929_distribute_candies_among_children_ii

g2901_3000.s2930_number_of_strings_which_can_be_rearranged_to_contain_substring - package g2901_3000.s2930_number_of_strings_which_can_be_rearranged_to_contain_substring

g2901_3000.s2931_maximum_spending_after_buying_items - package g2901_3000.s2931_maximum_spending_after_buying_items

g2901_3000.s2932_maximum_strong_pair_xor_i - package g2901_3000.s2932_maximum_strong_pair_xor_i

g2901_3000.s2933_high_access_employees - package g2901_3000.s2933_high_access_employees

g2901_3000.s2934_minimum_operations_to_maximize_last_elements_in_arrays - package g2901_3000.s2934_minimum_operations_to_maximize_last_elements_in_arrays

g2901_3000.s2935_maximum_strong_pair_xor_ii - package g2901_3000.s2935_maximum_strong_pair_xor_ii

g2901_3000.s2937_make_three_strings_equal - package g2901_3000.s2937_make_three_strings_equal

g2901_3000.s2938_separate_black_and_white_balls - package g2901_3000.s2938_separate_black_and_white_balls

g2901_3000.s2939_maximum_xor_product - package g2901_3000.s2939_maximum_xor_product

g2901_3000.s2940_find_building_where_alice_and_bob_can_meet - package g2901_3000.s2940_find_building_where_alice_and_bob_can_meet

g2901_3000.s2942_find_words_containing_character - package g2901_3000.s2942_find_words_containing_character

g2901_3000.s2943_maximize_area_of_square_hole_in_grid - package g2901_3000.s2943_maximize_area_of_square_hole_in_grid

g2901_3000.s2944_minimum_number_of_coins_for_fruits - package g2901_3000.s2944_minimum_number_of_coins_for_fruits

g2901_3000.s2945_find_maximum_non_decreasing_array_length - package g2901_3000.s2945_find_maximum_non_decreasing_array_length

g2901_3000.s2946_matrix_similarity_after_cyclic_shifts - package g2901_3000.s2946_matrix_similarity_after_cyclic_shifts

g2901_3000.s2947_count_beautiful_substrings_i - package g2901_3000.s2947_count_beautiful_substrings_i

g2901_3000.s2948_make_lexicographically_smallest_array_by_swapping_elements - package g2901_3000.s2948_make_lexicographically_smallest_array_by_swapping_elements

g2901_3000.s2949_count_beautiful_substrings_ii - package g2901_3000.s2949_count_beautiful_substrings_ii

g2901_3000.s2951_find_the_peaks - package g2901_3000.s2951_find_the_peaks

g2901_3000.s2952_minimum_number_of_coins_to_be_added - package g2901_3000.s2952_minimum_number_of_coins_to_be_added

g2901_3000.s2953_count_complete_substrings - package g2901_3000.s2953_count_complete_substrings

g2901_3000.s2954_count_the_number_of_infection_sequences - package g2901_3000.s2954_count_the_number_of_infection_sequences

g2901_3000.s2956_find_common_elements_between_two_arrays - package g2901_3000.s2956_find_common_elements_between_two_arrays

g2901_3000.s2957_remove_adjacent_almost_equal_characters - package g2901_3000.s2957_remove_adjacent_almost_equal_characters

g2901_3000.s2958_length_of_longest_subarray_with_at_most_k_frequency - package g2901_3000.s2958_length_of_longest_subarray_with_at_most_k_frequency

g2901_3000.s2959_number_of_possible_sets_of_closing_branches - package g2901_3000.s2959_number_of_possible_sets_of_closing_branches

g2901_3000.s2960_count_tested_devices_after_test_operations - package g2901_3000.s2960_count_tested_devices_after_test_operations

g2901_3000.s2961_double_modular_exponentiation - package g2901_3000.s2961_double_modular_exponentiation

g2901_3000.s2962_count_subarrays_where_max_element_appears_at_least_k_times - package g2901_3000.s2962_count_subarrays_where_max_element_appears_at_least_k_times

g2901_3000.s2963_count_the_number_of_good_partitions - package g2901_3000.s2963_count_the_number_of_good_partitions

g2901_3000.s2965_find_missing_and_repeated_values - package g2901_3000.s2965_find_missing_and_repeated_values

g2901_3000.s2966_divide_array_into_arrays_with_max_difference - package g2901_3000.s2966_divide_array_into_arrays_with_max_difference

g2901_3000.s2967_minimum_cost_to_make_array_equalindromic - package g2901_3000.s2967_minimum_cost_to_make_array_equalindromic

g2901_3000.s2968_apply_operations_to_maximize_frequency_score - package g2901_3000.s2968_apply_operations_to_maximize_frequency_score

g2901_3000.s2970_count_the_number_of_incremovable_subarrays_i - package g2901_3000.s2970_count_the_number_of_incremovable_subarrays_i

g2901_3000.s2971_find_polygon_with_the_largest_perimeter - package g2901_3000.s2971_find_polygon_with_the_largest_perimeter

g2901_3000.s2972_count_the_number_of_incremovable_subarrays_ii - package g2901_3000.s2972_count_the_number_of_incremovable_subarrays_ii

g2901_3000.s2973_find_number_of_coins_to_place_in_tree_nodes - package g2901_3000.s2973_find_number_of_coins_to_place_in_tree_nodes

g2901_3000.s2974_minimum_number_game - package g2901_3000.s2974_minimum_number_game

g2901_3000.s2975_maximum_square_area_by_removing_fences_from_a_field - package g2901_3000.s2975_maximum_square_area_by_removing_fences_from_a_field

g2901_3000.s2976_minimum_cost_to_convert_string_i - package g2901_3000.s2976_minimum_cost_to_convert_string_i

g2901_3000.s2977_minimum_cost_to_convert_string_ii - package g2901_3000.s2977_minimum_cost_to_convert_string_ii

g2901_3000.s2980_check_if_bitwise_or_has_trailing_zeros - package g2901_3000.s2980_check_if_bitwise_or_has_trailing_zeros

g2901_3000.s2981_find_longest_special_substring_that_occurs_thrice_i - package g2901_3000.s2981_find_longest_special_substring_that_occurs_thrice_i

g2901_3000.s2982_find_longest_special_substring_that_occurs_thrice_ii - package g2901_3000.s2982_find_longest_special_substring_that_occurs_thrice_ii

g2901_3000.s2983_palindrome_rearrangement_queries - package g2901_3000.s2983_palindrome_rearrangement_queries

g2901_3000.s2996_smallest_missing_integer_greater_than_sequential_prefix_sum - package g2901_3000.s2996_smallest_missing_integer_greater_than_sequential_prefix_sum

g2901_3000.s2997_minimum_number_of_operations_to_make_array_xor_equal_to_k - package g2901_3000.s2997_minimum_number_of_operations_to_make_array_xor_equal_to_k

g2901_3000.s2998_minimum_number_of_operations_to_make_x_and_y_equal - package g2901_3000.s2998_minimum_number_of_operations_to_make_x_and_y_equal

g2901_3000.s2999_count_the_number_of_powerful_integers - package g2901_3000.s2999_count_the_number_of_powerful_integers

g2901_3000.s3000_maximum_area_of_longest_diagonal_rectangle - package g2901_3000.s3000_maximum_area_of_longest_diagonal_rectangle

g3001_3100.s3001_minimum_moves_to_capture_the_queen - package g3001_3100.s3001_minimum_moves_to_capture_the_queen

g3001_3100.s3002_maximum_size_of_a_set_after_removals - package g3001_3100.s3002_maximum_size_of_a_set_after_removals

g3001_3100.s3003_maximize_the_number_of_partitions_after_operations - package g3001_3100.s3003_maximize_the_number_of_partitions_after_operations

g3001_3100.s3005_count_elements_with_maximum_frequency - package g3001_3100.s3005_count_elements_with_maximum_frequency

g3001_3100.s3006_find_beautiful_indices_in_the_given_array_i - package g3001_3100.s3006_find_beautiful_indices_in_the_given_array_i

g3001_3100.s3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k - package g3001_3100.s3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k

g3001_3100.s3008_find_beautiful_indices_in_the_given_array_ii - package g3001_3100.s3008_find_beautiful_indices_in_the_given_array_ii

g3001_3100.s3010_divide_an_array_into_subarrays_with_minimum_cost_i - package g3001_3100.s3010_divide_an_array_into_subarrays_with_minimum_cost_i

g3001_3100.s3011_find_if_array_can_be_sorted - package g3001_3100.s3011_find_if_array_can_be_sorted

g3001_3100.s3012_minimize_length_of_array_using_operations - package g3001_3100.s3012_minimize_length_of_array_using_operations

g3001_3100.s3013_divide_an_array_into_subarrays_with_minimum_cost_ii - package g3001_3100.s3013_divide_an_array_into_subarrays_with_minimum_cost_ii

g3001_3100.s3014_minimum_number_of_pushes_to_type_word_i - package g3001_3100.s3014_minimum_number_of_pushes_to_type_word_i

g3001_3100.s3015_count_the_number_of_houses_at_a_certain_distance_i - package g3001_3100.s3015_count_the_number_of_houses_at_a_certain_distance_i

g3001_3100.s3016_minimum_number_of_pushes_to_type_word_ii - package g3001_3100.s3016_minimum_number_of_pushes_to_type_word_ii

g3001_3100.s3017_count_the_number_of_houses_at_a_certain_distance_ii - package g3001_3100.s3017_count_the_number_of_houses_at_a_certain_distance_ii

g3001_3100.s3019_number_of_changing_keys - package g3001_3100.s3019_number_of_changing_keys

g3001_3100.s3020_find_the_maximum_number_of_elements_in_subset - package g3001_3100.s3020_find_the_maximum_number_of_elements_in_subset

g3001_3100.s3021_alice_and_bob_playing_flower_game - package g3001_3100.s3021_alice_and_bob_playing_flower_game

g3001_3100.s3022_minimize_or_of_remaining_elements_using_operations - package g3001_3100.s3022_minimize_or_of_remaining_elements_using_operations

g3001_3100.s3024_type_of_triangle - package g3001_3100.s3024_type_of_triangle

g3001_3100.s3025_find_the_number_of_ways_to_place_people_i - package g3001_3100.s3025_find_the_number_of_ways_to_place_people_i

g3001_3100.s3026_maximum_good_subarray_sum - package g3001_3100.s3026_maximum_good_subarray_sum

g3001_3100.s3027_find_the_number_of_ways_to_place_people_ii - package g3001_3100.s3027_find_the_number_of_ways_to_place_people_ii

g3001_3100.s3028_ant_on_the_boundary - package g3001_3100.s3028_ant_on_the_boundary

g3001_3100.s3029_minimum_time_to_revert_word_to_initial_state_i - package g3001_3100.s3029_minimum_time_to_revert_word_to_initial_state_i

g3001_3100.s3030_find_the_grid_of_region_average - package g3001_3100.s3030_find_the_grid_of_region_average

g3001_3100.s3031_minimum_time_to_revert_word_to_initial_state_ii - package g3001_3100.s3031_minimum_time_to_revert_word_to_initial_state_ii

g3001_3100.s3033_modify_the_matrix - package g3001_3100.s3033_modify_the_matrix

g3001_3100.s3034_number_of_subarrays_that_match_a_pattern_i - package g3001_3100.s3034_number_of_subarrays_that_match_a_pattern_i

g3001_3100.s3035_maximum_palindromes_after_operations - package g3001_3100.s3035_maximum_palindromes_after_operations

g3001_3100.s3036_number_of_subarrays_that_match_a_pattern_ii - package g3001_3100.s3036_number_of_subarrays_that_match_a_pattern_ii

g3001_3100.s3038_maximum_number_of_operations_with_the_same_score_i - package g3001_3100.s3038_maximum_number_of_operations_with_the_same_score_i

g3001_3100.s3039_apply_operations_to_make_string_empty - package g3001_3100.s3039_apply_operations_to_make_string_empty

g3001_3100.s3040_maximum_number_of_operations_with_the_same_score_ii - package g3001_3100.s3040_maximum_number_of_operations_with_the_same_score_ii

g3001_3100.s3041_maximize_consecutive_elements_in_an_array_after_modification - package g3001_3100.s3041_maximize_consecutive_elements_in_an_array_after_modification

g3001_3100.s3042_count_prefix_and_suffix_pairs_i - package g3001_3100.s3042_count_prefix_and_suffix_pairs_i

g3001_3100.s3043_find_the_length_of_the_longest_common_prefix - package g3001_3100.s3043_find_the_length_of_the_longest_common_prefix

g3001_3100.s3044_most_frequent_prime - package g3001_3100.s3044_most_frequent_prime

g3001_3100.s3045_count_prefix_and_suffix_pairs_ii - package g3001_3100.s3045_count_prefix_and_suffix_pairs_ii

g3001_3100.s3046_split_the_array - package g3001_3100.s3046_split_the_array

g3001_3100.s3047_find_the_largest_area_of_square_inside_two_rectangles - package g3001_3100.s3047_find_the_largest_area_of_square_inside_two_rectangles

g3001_3100.s3048_earliest_second_to_mark_indices_i - package g3001_3100.s3048_earliest_second_to_mark_indices_i

g3001_3100.s3049_earliest_second_to_mark_indices_ii - package g3001_3100.s3049_earliest_second_to_mark_indices_ii

g3001_3100.s3065_minimum_operations_to_exceed_threshold_value_i - package g3001_3100.s3065_minimum_operations_to_exceed_threshold_value_i

g3001_3100.s3066_minimum_operations_to_exceed_threshold_value_ii - package g3001_3100.s3066_minimum_operations_to_exceed_threshold_value_ii

g3001_3100.s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network - package g3001_3100.s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network

g3001_3100.s3068_find_the_maximum_sum_of_node_values - package g3001_3100.s3068_find_the_maximum_sum_of_node_values

g3001_3100.s3069_distribute_elements_into_two_arrays_i - package g3001_3100.s3069_distribute_elements_into_two_arrays_i

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

garbageCollection(String[], int[]) - Method in class g2301_2400.s2391_minimum_amount_of_time_to_collect_garbage.Solution

gardenNoAdj(int, int[][]) - Method in class g1001_1100.s1042_flower_planting_with_no_adjacent.Solution

gather(int, int) - Method in class g2201_2300.s2286_booking_concert_tickets_in_groups.BookMyShow

gcdOfStrings(String, String) - Method in class g1001_1100.s1071_greatest_common_divisor_of_strings.Solution

gcdSort(int[]) - Method in class g1901_2000.s1998_gcd_sort_of_an_array.Solution

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

generate(String, int) - Method in class g1701_1800.s1797_design_authentication_manager.AuthenticationManager

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

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

generateTheString(int) - Method in class g1301_1400.s1374_generate_a_string_with_characters_that_have_odd_counts.Solution

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

get() - Method in class g2101_2200.s2102_sequentially_ordinal_rank_tracker.SORTracker

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

get(int) - Method in class g0401_0500.s0460_lfu_cache.LFUCache

get(int) - Method in class g0701_0800.s0706_design_hashmap.MyHashMap

get(int) - Method in class g0701_0800.s0707_design_linked_list.MyLinkedList

get(int, int) - Method in class g1101_1200.s1146_snapshot_array.SnapshotArray

get(String, int) - Method in class g0901_1000.s0981_time_based_key_value_store.TimeMap

getAllElements(TreeNode, TreeNode) - Method in class g1301_1400.s1305_all_elements_in_two_binary_search_trees.Solution

getAncestors(int, int[][]) - Method in class g2101_2200.s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph.Solution

getAverages(int[], int) - Method in class g2001_2100.s2090_k_radius_subarray_averages.Solution

getAverageTime(String, String) - Method in class g1301_1400.s1396_design_underground_system.UndergroundSystem

getBiggestThree(int[][]) - Method in class g1801_1900.s1878_get_biggest_three_rhombus_sums_in_a_grid.Solution

getBill(int[], int[]) - Method in class g1301_1400.s1357_apply_discount_every_n_orders.Cashier

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

getCollisionTimes(int[][]) - Method in class g1701_1800.s1776_car_fleet_ii.Solution

getCommon(int[], int[]) - Method in class g2501_2600.s2540_minimum_common_value.Solution

getConcatenation(int[]) - Method in class g1901_2000.s1929_concatenation_of_array.Solution

getCoprimes(int[], int[][]) - Method in class g1701_1800.s1766_tree_of_coprimes.Solution

getDecimalValue(ListNode) - Method in class g1201_1300.s1290_convert_binary_number_in_a_linked_list_to_integer.Solution

getDep(TreeNode) - Method in class g1101_1200.s1123_lowest_common_ancestor_of_deepest_leaves.Solution

getDescentPeriods(int[]) - Method in class g2101_2200.s2110_number_of_smooth_descent_periods_of_a_stock.Solution

getDir() - Method in class g2001_2100.s2069_walking_robot_simulation_ii.Robot

getDirections(TreeNode, int, int) - Method in class g2001_2100.s2096_step_by_step_directions_from_a_binary_tree_node_to_another.Solution

getDistance(int[], int[]) - Method in class g1501_1600.s1584_min_cost_to_connect_all_points.Solution

getDistances(int[]) - Method in class g2101_2200.s2121_intervals_between_identical_elements.Solution

getFolderNames(String[]) - Method in class g1401_1500.s1487_making_file_names_unique.Solution

getFront() - Method in class g0601_0700.s0641_design_circular_deque.MyCircularDeque

getGoodIndices(int[][], int) - Method in class g2901_3000.s2961_double_modular_exponentiation.Solution

getHappyString(int, int) - Method in class g1401_1500.s1415_the_k_th_lexicographical_string_of_all_happy_strings_of_length_n.Solution

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

getImportance(List<Employee>, int) - Method in class g0601_0700.s0690_employee_importance.Solution

getIndex(int) - Method in class g1601_1700.s1622_fancy_sequence.Fancy

getInheritanceOrder() - Method in class g1501_1600.s1600_throne_inheritance.ThroneInheritance

getInteger() - Method in class com_github_leetcode.NestedInteger

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

getIntervals() - Method in class g0301_0400.s0352_data_stream_as_disjoint_intervals.SummaryRanges

getKth(int, int, int) - Method in class g1301_1400.s1387_sort_integers_by_the_power_value.Solution

getKthAncestor(int, int) - Method in class g1401_1500.s1483_kth_ancestor_of_a_tree_node.TreeAncestor

getLastMoment(int, int[], int[]) - Method in class g1501_1600.s1503_last_moment_before_all_ants_fall_out_of_a_plank.Solution

getLengthOfOptimalCompression(String, int) - Method in class g1501_1600.s1531_string_compression_ii.Solution

getList() - Method in class com_github_leetcode.NestedInteger

getLucky(String, int) - Method in class g1901_2000.s1945_sum_of_digits_of_string_after_convert.Solution

getMaxFunctionValue(List<Integer>, long) - Method in class g2801_2900.s2836_maximize_value_of_function_in_a_ball_passing_game.Solution

getMaxGridHappiness(int, int, int, int) - Method in class g1601_1700.s1659_maximize_grid_happiness.Solution

getMaximumConsecutive(int[]) - Method in class g1701_1800.s1798_maximum_number_of_consecutive_values_you_can_make.Solution

getMaximumGenerated(int) - Method in class g1601_1700.s1646_get_maximum_in_generated_array.Solution

getMaximumGold(int[][]) - Method in class g1201_1300.s1219_path_with_maximum_gold.Solution

getMaximumXor(int[], int) - Method in class g1801_1900.s1829_maximum_xor_for_each_query.Solution

getMaxKey() - Method in class g0401_0500.s0432_all_oone_data_structure.AllOne

getMaxLen(int[]) - Method in class g1501_1600.s1567_maximum_length_of_subarray_with_positive_product.Solution

getMaxRepetitions(String, int, String, int) - Method in class g0401_0500.s0466_count_the_repetitions.Solution

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

getMinDistance(int[], int, int) - Method in class g1801_1900.s1848_minimum_distance_to_the_target_element.Solution

getMinDistSum(int[][]) - Method in class g1501_1600.s1515_best_position_for_a_service_centre.Solution

getMinimumDifference(TreeNode) - Method in class g0501_0600.s0530_minimum_absolute_difference_in_bst.Solution

getMinKey() - Method in class g0401_0500.s0432_all_oone_data_structure.AllOne

getMinSwaps(String, int) - Method in class g1801_1900.s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number.Solution

getMoneyAmount(int) - Method in class g0301_0400.s0375_guess_number_higher_or_lower_ii.Solution

getNewsFeed(int) - Method in class g0301_0400.s0355_design_twitter.Twitter

getNext(int[], int, int) - Static method in class g0901_1000.s0983_minimum_cost_for_tickets.Solution

getNoZeroIntegers(int) - Method in class g1301_1400.s1317_convert_integer_to_the_sum_of_two_no_zero_integers.Solution

getNumberOfBacklogOrders(int[][]) - Method in class g1801_1900.s1801_number_of_orders_in_the_backlog.Solution

getOrder(int[][]) - Method in class g1801_1900.s1834_single_threaded_cpu.Solution

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

getPos() - Method in class g2001_2100.s2069_walking_robot_simulation_ii.Robot

getProbability(int[]) - Method in class g1401_1500.s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls.Solution

getProduct(int) - Method in class g1301_1400.s1352_product_of_the_last_k_numbers.ProductOfNumbers

getRandom() - Method in class g0301_0400.s0380_insert_delete_getrandom_o1.RandomizedSet

getRandom() - Method in class g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed.RandomizedCollection

getRandom() - Method in class g0301_0400.s0382_linked_list_random_node.Solution

getRear() - Method in class g0601_0700.s0641_design_circular_deque.MyCircularDeque

getRoot() - Method in class g0901_1000.s0919_complete_binary_tree_inserter.CBTInserter

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

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

getSmallestString(int, int) - Method in class g1601_1700.s1663_smallest_string_with_a_given_numeric_value.Solution

getStrongest(int[], int) - Method in class g1401_1500.s1471_the_k_strongest_values_in_an_array.Solution

getSubarrayBeauty(int[], int, int) - Method in class g2601_2700.s2653_sliding_subarray_beauty.Solution

getSum(int, int) - Method in class g0301_0400.s0371_sum_of_two_integers.Solution

getSumAbsoluteDifferences(int[]) - Method in class g1601_1700.s1685_sum_of_absolute_differences_in_a_sorted_array.Solution

getTargetCopy(TreeNode, TreeNode, TreeNode) - Method in class g1301_1400.s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree.Solution

getTweetCountsPerFrequency(String, String, int, int) - Method in class g1301_1400.s1348_tweet_counts_per_frequency.TweetCounts

getValue(int, int) - Method in class g1401_1500.s1476_subrectangle_queries.SubrectangleQueries

getWinner(int[], int) - Method in class g1501_1600.s1535_find_the_winner_of_an_array_game.Solution

getWordsInLongestSubsequence(int, String[], int[]) - Method in class g2801_2900.s2900_longest_unequal_adjacent_groups_subsequence_i.Solution

getWordsInLongestSubsequence(int, String[], int[]) - Method in class g2901_3000.s2901_longest_unequal_adjacent_groups_subsequence_ii.Solution

getXORSum(int[], int[]) - Method in class g1801_1900.s1835_find_xor_sum_of_all_pairs_bitwise_and.Solution

goodDaysToRobBank(int[], int) - Method in class g2001_2100.s2100_find_good_days_to_rob_the_bank.Solution

goodIndices(int[], int) - Method in class g2401_2500.s2420_find_all_good_indices.Solution

goodNodes(TreeNode) - Method in class g1401_1500.s1448_count_good_nodes_in_binary_tree.Solution

goodSubsetofBinaryMatrix(int[][]) - Method in class g2701_2800.s2732_find_a_good_subset_of_the_matrix.Solution

goodTriplets(int[], int[]) - Method in class g2101_2200.s2179_count_good_triplets_in_an_array.Solution

Graph - Class in g2601_2700.s2642_design_graph_with_shortest_path_calculator

2642 - Design Graph With Shortest Path Calculator.

Graph(int, int[][]) - Constructor for class g2601_2700.s2642_design_graph_with_shortest_path_calculator.Graph

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

greatestLetter(String) - Method in class g2301_2400.s2309_greatest_english_letter_in_upper_and_lower_case.Solution

gridGame(int[][]) - Method in class g2001_2100.s2017_grid_game.Solution

gridIllumination(int, int[][], int[][]) - Method in class g1001_1100.s1001_grid_illumination.Solution

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

groupStrings(String[]) - Method in class g2101_2200.s2157_groups_of_strings.Solution

groupThePeople(int[]) - Method in class g1201_1300.s1282_group_the_people_given_the_group_size_they_belong_to.Solution

guessNumber(int) - Method in class g0301_0400.s0374_guess_number_higher_or_lower.Solution

H

H2O - Class in g1101_1200.s1117_building_h2o

1117 - Building H2O.

H2O() - Constructor for class g1101_1200.s1117_building_h2o.H2O

H2O.HydrogenRunnable - Class in g1101_1200.s1117_building_h2o

H2O.OxygenRunnable - Class in g1101_1200.s1117_building_h2o

halveArray(int[]) - Method in class g2201_2300.s2208_minimum_operations_to_halve_array_sum.Solution

halvesAreAlike(String) - Method in class g1701_1800.s1704_determine_if_string_halves_are_alike.Solution

hammingDistance(int, int) - Method in class g0401_0500.s0461_hamming_distance.Solution

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

handleQuery(int[], int[], int[][]) - Method in class g2501_2600.s2569_handling_sum_queries_after_update.Solution

hardestWorker(int[][]) - Method in class g2401_2500.s2432_the_employee_that_worked_on_the_longest_task.Solution

hasAllCodes(String, int) - Method in class g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k.Solution

hasAlternatingBits(int) - Method in class g0601_0700.s0693_binary_number_with_alternating_bits.Solution

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

hasFrequency(int) - Method in class g2601_2700.s2671_frequency_tracker.FrequencyTracker

hasGroupsSizeX(int[]) - Method in class g0901_1000.s0914_x_of_a_kind_in_a_deck_of_cards.Solution

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

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

hasNext() - Method in class g0301_0400.s0341_flatten_nested_list_iterator.NestedIterator

hasNext() - Method in class g1201_1300.s1286_iterator_for_combination.CombinationIterator

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

hasTrailingZeros(int[]) - Method in class g2901_3000.s2980_check_if_bitwise_or_has_trailing_zeros.Solution

hasValidPath(char[][]) - Method in class g2201_2300.s2267_check_if_there_is_a_valid_parentheses_string_path.Solution

hasValidPath(int[][]) - Method in class g1301_1400.s1391_check_if_there_is_a_valid_path_in_a_grid.Solution

haveConflict(String[], String[]) - Method in class g2401_2500.s2446_determine_if_two_events_have_conflict.Solution

heightChecker(int[]) - Method in class g1001_1100.s1051_height_checker.Solution

helper(TreeNode, int, long) - Method in class g0401_0500.s0437_path_sum_iii.Solution

helper(String, int) - Method in class g1101_1200.s1138_alphabet_board_path.Solution

helper(String, int, String) - Method in class g0701_0800.s0784_letter_case_permutation.Solution

highestPeak(int[][]) - Method in class g1701_1800.s1765_map_of_highest_peak.Solution

highestRankedKItems(int[][], int[], int[], int) - Method in class g2101_2200.s2146_k_highest_ranked_items_within_a_price_range.Solution

highestRated(String) - Method in class g2301_2400.s2353_design_a_food_rating_system.FoodRatings

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

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

hitBricks(int[][], int[][]) - Method in class g0801_0900.s0803_bricks_falling_when_hit.Solution

hydrogen(Runnable) - Method in class g1101_1200.s1117_building_h2o.H2O

HydrogenRunnable(H2O) - Constructor for class g1101_1200.s1117_building_h2o.H2O.HydrogenRunnable

I

id - Variable in class com_github_leetcode.Employee

It’s the unique id of each node; unique id of this employee

idealArrays(int, int) - Method in class g2301_2400.s2338_count_the_number_of_ideal_arrays.Solution

imageSmoother(int[][]) - Method in class g0601_0700.s0661_image_smoother.Solution

importance - Variable in class com_github_leetcode.Employee

the importance value of this employee

inc(String) - Method in class g0401_0500.s0432_all_oone_data_structure.AllOne

increasingBST(TreeNode) - Method in class g0801_0900.s0897_increasing_order_search_tree.Solution

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

increment(int, int) - Method in class g1301_1400.s1381_design_a_stack_with_increment_operation.CustomStack

incremovableSubarrayCount(int[]) - Method in class g2901_3000.s2970_count_the_number_of_incremovable_subarrays_i.Solution

incremovableSubarrayCount(int[]) - Method in class g2901_3000.s2972_count_the_number_of_incremovable_subarrays_ii.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) - Method in class g0301_0400.s0380_insert_delete_getrandom_o1.RandomizedSet

insert(int) - Method in class g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed.RandomizedCollection

insert(int) - Method in class g0901_1000.s0919_complete_binary_tree_inserter.CBTInserter

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

insert(int, String) - Method in class g1601_1700.s1656_design_an_ordered_stream.OrderedStream

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

insert(String) - Method in class g1001_1100.s1032_stream_of_characters.StreamChecker

insert(String, int) - Method in class g0601_0700.s0677_map_sum_pairs.MapSum

insert(String, int) - Method in class g0701_0800.s0745_prefix_and_suffix_search.WordFilter

insertFront(int) - Method in class g0601_0700.s0641_design_circular_deque.MyCircularDeque

insertGreatestCommonDivisors(ListNode) - Method in class g2801_2900.s2807_insert_greatest_common_divisors_in_linked_list.Solution

insertIntoBST(TreeNode, int) - Method in class g0701_0800.s0701_insert_into_a_binary_search_tree.Solution

insertIntoMaxTree(TreeNode, int) - Method in class g0901_1000.s0998_maximum_binary_tree_ii.Solution

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

insertLast(int) - Method in class g0601_0700.s0641_design_circular_deque.MyCircularDeque

integerBreak(int) - Method in class g0301_0400.s0343_integer_break.Solution

integerReplacement(int) - Method in class g0301_0400.s0397_integer_replacement.Solution

interchangeableRectangles(int[][]) - Method in class g2001_2100.s2001_number_of_pairs_of_interchangeable_rectangles.Solution

interpret(String) - Method in class g1601_1700.s1678_goal_parser_interpretation.Solution

intersect(int[], int[]) - Method in class g0301_0400.s0350_intersection_of_two_arrays_ii.Solution

intersect(Node, Node) - Method in class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Solution

intersection(int[][]) - Method in class g2201_2300.s2248_intersection_of_multiple_arrays.Solution

intersection(int[], int[]) - Method in class g0301_0400.s0349_intersection_of_two_arrays.Solution

intersectionSizeTwo(int[][]) - Method in class g0701_0800.s0757_set_intersection_size_at_least_two.Solution

intervalIntersection(int[][], int[][]) - Method in class g0901_1000.s0986_interval_list_intersections.Solution

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

invalidTransactions(String[]) - Method in class g1101_1200.s1169_invalid_transactions.Solution

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

isAcronym(List<String>, String) - Method in class g2801_2900.s2828_check_if_a_string_is_an_acronym_of_words.Solution

isAdditiveNumber(String) - Method in class g0301_0400.s0306_additive_number.Solution

isAlienSorted(String[], String) - Method in class g0901_1000.s0953_verifying_an_alien_dictionary.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

isBipartite(int[][]) - Method in class g0701_0800.s0785_is_graph_bipartite.Solution

isBoomerang(int[][]) - Method in class g1001_1100.s1037_valid_boomerang.Solution

isCircularSentence(String) - Method in class g2401_2500.s2490_circular_sentence.Solution

isCompleteTree(TreeNode) - Method in class g0901_1000.s0958_check_completeness_of_a_binary_tree.Solution

isCousins(TreeNode, int, int) - Method in class g0901_1000.s0993_cousins_in_binary_tree.Solution

isCovered(int[][], int, int) - Method in class g1801_1900.s1893_check_if_all_the_integers_in_a_range_are_covered.Solution

isEmpty() - Method in class g0601_0700.s0622_design_circular_queue.MyCircularQueue

isEmpty() - Method in class g0601_0700.s0641_design_circular_deque.MyCircularDeque

isEscapePossible(int[][], int[], int[]) - Method in class g1001_1100.s1036_escape_a_large_maze.Solution

isEvenOddTree(TreeNode) - Method in class g1601_1700.s1609_even_odd_tree.Solution

isFascinating(int) - Method in class g2701_2800.s2729_check_if_the_number_is_fascinating.Solution

isFull() - Method in class g0601_0700.s0622_design_circular_queue.MyCircularQueue

isFull() - Method in class g0601_0700.s0641_design_circular_deque.MyCircularDeque

isGood(int[]) - Method in class g2701_2800.s2784_check_if_array_is_good.Solution

isGoodArray(int[]) - Method in class g1201_1300.s1250_check_if_it_is_a_good_array.Solution

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

isIdealPermutation(int[]) - Method in class g0701_0800.s0775_global_and_local_inversions.Solution

isInteger() - Method in class com_github_leetcode.NestedInteger

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

isItPossible(String, String) - Method in class g2501_2600.s2531_make_number_of_distinct_characters_equal.Solution

islandPerimeter(int[][]) - Method in class g0401_0500.s0463_island_perimeter.Solution

isLeaf - Variable in class g0401_0500.s0427_construct_quad_tree.Node

isLeaf - Variable in class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

isLongPressedName(String, String) - Method in class g0901_1000.s0925_long_pressed_name.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

isMonotonic(int[]) - Method in class g0801_0900.s0896_monotonic_array.Solution

isNStraightHand(int[], int) - Method in class g0801_0900.s0846_hand_of_straights.Solution

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

isOneBitCharacter(int[]) - Method in class g0701_0800.s0717_1_bit_and_2_bit_characters.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

isPalindrome(String) - Static method in class g2101_2200.s2108_find_first_palindromic_string_in_the_array.Solution

isPathCrossing(String) - Method in class g1401_1500.s1496_path_crossing.Solution

isPerfectSquare(int) - Method in class g0301_0400.s0367_valid_perfect_square.Solution

isPossible(int[]) - Method in class g0601_0700.s0659_split_array_into_consecutive_subsequences.Solution

isPossible(int[]) - Method in class g1301_1400.s1354_construct_target_array_with_multiple_sums.Solution

isPossible(int, List<List<Integer>>) - Method in class g2501_2600.s2508_add_edges_to_make_degrees_of_all_nodes_even.Solution

isPossibleDivide(int[], int) - Method in class g1201_1300.s1296_divide_array_in_sets_of_k_consecutive_numbers.Solution

isPossibleToCutPath(int[][]) - Method in class g2501_2600.s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip.Solution

isPossibleToSplit(int[]) - Method in class g3001_3100.s3046_split_the_array.Solution

isPowerOfFour(int) - Method in class g0301_0400.s0342_power_of_four.Solution

isPowerOfThree(int) - Method in class g0301_0400.s0326_power_of_three.Solution

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

isPrefixOfWord(String, String) - Method in class g1401_1500.s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence.Solution

isPrefixString(String, String[]) - Method in class g1901_2000.s1961_check_if_string_is_a_prefix_of_array.Solution

isPrintable(int[][]) - Method in class g1501_1600.s1591_strange_printer_ii.Solution

isRationalEqual(String, String) - Method in class g0901_1000.s0972_equal_rational_numbers.Solution

isReachable(int, int) - Method in class g2501_2600.s2543_check_if_point_is_reachable.Solution

isReachableAtTime(int, int, int, int, int) - Method in class g2801_2900.s2849_determine_if_a_cell_is_reachable_at_a_given_time.Solution

isRectangleCover(int[][]) - Method in class g0301_0400.s0391_perfect_rectangle.Solution

isRectangleOverlap(int[], int[]) - Method in class g0801_0900.s0836_rectangle_overlap.Solution

isRobotBounded(String) - Method in class g1001_1100.s1041_robot_bounded_in_circle.Solution

isSameAfterReversals(int) - Method in class g2101_2200.s2119_a_number_after_a_double_reversal.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

isSelfCrossing(int[]) - Method in class g0301_0400.s0335_self_crossing.Solution

isSolvable(String[], String) - Method in class g1301_1400.s1307_verbal_arithmetic_puzzle.Solution

isStrictlyPalindromic(int) - Method in class g2301_2400.s2396_strictly_palindromic_number.Solution

isSubPath(ListNode, TreeNode) - Method in class g1301_1400.s1367_linked_list_in_binary_tree.Solution

isSubsequence(String, String) - Method in class g0301_0400.s0392_is_subsequence.Solution

isSubtree(TreeNode, TreeNode) - Method in class g0501_0600.s0572_subtree_of_another_tree.Solution

isSumEqual(String, String, String) - Method in class g1801_1900.s1880_check_if_word_equals_summation_of_two_words.Solution

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

isThree(int) - Method in class g1901_2000.s1952_three_divisors.Solution

isToeplitzMatrix(int[][]) - Method in class g0701_0800.s0766_toeplitz_matrix.Solution

isTransformable(String, String) - Method in class g1501_1600.s1585_check_if_string_is_transformable_with_substring_sort_operations.Solution

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

isUnivalTree(TreeNode) - Method in class g0901_1000.s0965_univalued_binary_tree.Solution

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

isValid(String) - Method in class g0501_0600.s0591_tag_validator.Solution

isValid(String) - Method in class g1001_1100.s1003_check_if_word_is_valid_after_substitutions.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

isWinner(int[], int[]) - Method in class g2601_2700.s2660_determine_the_winner_of_a_bowling_game.Solution

J

jobScheduling(int[], int[], int[]) - Method in class g1201_1300.s1235_maximum_profit_in_job_scheduling.Solution

judgeCircle(String) - Method in class g0601_0700.s0657_robot_return_to_origin.Solution

judgePoint24(int[]) - Method in class g0601_0700.s0679_24_game.Solution

judgeSquareSum(int) - Method in class g0601_0700.s0633_sum_of_square_numbers.Solution

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

K

kClosest(int[][], int) - Method in class g0901_1000.s0973_k_closest_points_to_origin.Solution

kConcatenationMaxSum(int[], int) - Method in class g1101_1200.s1191_k_concatenation_maximum_sum.Solution

kidsWithCandies(int[], int) - Method in class g1401_1500.s1431_kids_with_the_greatest_number_of_candies.Solution

kIncreasing(int[], int) - Method in class g2101_2200.s2111_minimum_operations_to_make_the_array_k_increasing.Solution

kInversePairs(int, int) - Method in class g0601_0700.s0629_k_inverse_pairs_array.Solution

kItemsWithMaximumSum(int, int, int, int) - Method in class g2501_2600.s2600_k_items_with_the_maximum_sum.Solution

kLengthApart(int[], int) - Method in class g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away.Solution

kMirror(int, int) - Method in class g2001_2100.s2081_sum_of_k_mirror_numbers.Solution

knightDialer(int) - Method in class g0901_1000.s0935_knight_dialer.Solution

knightProbability(int, int, int, int) - Method in class g0601_0700.s0688_knight_probability_in_chessboard.Solution

kSimilarity(String, String) - Method in class g0801_0900.s0854_k_similar_strings.Solution

kSmallestPairs(int[], int[], int) - Method in class g0301_0400.s0373_find_k_pairs_with_smallest_sums.Solution

kSum(int[], int) - Method in class g2301_2400.s2386_find_the_k_sum_of_an_array.Solution

kthDistinct(String[], int) - Method in class g2001_2100.s2053_kth_distinct_string_in_an_array.Solution

kthFactor(int, int) - Method in class g1401_1500.s1492_the_kth_factor_of_n.Solution

kthGrammar(int, int) - Method in class g0701_0800.s0779_k_th_symbol_in_grammar.Solution

KthLargest - Class in g0701_0800.s0703_kth_largest_element_in_a_stream

703 - Kth Largest Element in a Stream.

KthLargest(int, int[]) - Constructor for class g0701_0800.s0703_kth_largest_element_in_a_stream.KthLargest

kthLargestLevelSum(TreeNode, int) - Method in class g2501_2600.s2583_kth_largest_sum_in_a_binary_tree.Solution

kthLargestNumber(String[], int) - Method in class g1901_2000.s1985_find_the_kth_largest_integer_in_the_array.Solution

kthLargestValue(int[][], int) - Method in class g1701_1800.s1738_find_kth_largest_xor_coordinate_value.Solution

kthPalindrome(int[], int) - Method in class g2201_2300.s2217_find_palindrome_with_fixed_length.Solution

kthSmallest(int[][], int) - Method in class g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix.Solution

kthSmallest(int[][], int) - Method in class g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows.Solution

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

kthSmallestPath(int[], int) - Method in class g1601_1700.s1643_kth_smallest_instructions.Solution

kthSmallestPrimeFraction(int[], int) - Method in class g0701_0800.s0786_k_th_smallest_prime_fraction.Solution

kthSmallestProduct(int[], int[], long) - Method in class g2001_2100.s2040_kth_smallest_product_of_two_sorted_arrays.Solution

kWeakestRows(int[][], int) - Method in class g1301_1400.s1337_the_k_weakest_rows_in_a_matrix.Solution

L

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

largeGroupPositions(String) - Method in class g0801_0900.s0830_positions_of_large_groups.Solution

largest1BorderedSquare(int[][]) - Method in class g1101_1200.s1139_largest_1_bordered_square.Solution

largestAltitude(int[]) - Method in class g1701_1800.s1732_find_the_highest_altitude.Solution

largestCombination(int[]) - Method in class g2201_2300.s2275_largest_combination_with_bitwise_and_greater_than_zero.Solution

largestComponentSize(int[]) - Method in class g0901_1000.s0952_largest_component_size_by_common_factor.Solution

largestDivisibleSubset(int[]) - Method in class g0301_0400.s0368_largest_divisible_subset.Solution

largestGoodInteger(String) - Method in class g2201_2300.s2264_largest_3_same_digit_number_in_string.Solution

largestInteger(int) - Method in class g2201_2300.s2231_largest_number_after_digit_swaps_by_parity.Solution

largestIsland(int[][]) - Method in class g0801_0900.s0827_making_a_large_island.Solution

largestLocal(int[][]) - Method in class g2301_2400.s2373_largest_local_values_in_a_matrix.Solution

largestMagicSquare(int[][]) - Method in class g1801_1900.s1895_largest_magic_square.Solution

largestMerge(String, String) - Method in class g1701_1800.s1754_largest_merge_of_two_strings.Solution

largestMultipleOfThree(int[]) - Method in class g1301_1400.s1363_largest_multiple_of_three.Solution

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

largestNumber(int[], int) - Method in class g1401_1500.s1449_form_largest_integer_with_digits_that_add_up_to_target.Solution

largestOddNumber(String) - Method in class g1901_2000.s1903_largest_odd_number_in_string.Solution

largestOverlap(int[][], int[][]) - Method in class g0801_0900.s0835_image_overlap.Solution

largestPalindrome(int) - Method in class g0401_0500.s0479_largest_palindrome_product.Solution

largestPalindromic(String) - Method in class g2301_2400.s2384_largest_palindromic_number.Solution

largestPathValue(String, int[][]) - Method in class g1801_1900.s1857_largest_color_value_in_a_directed_graph.Solution

largestPerimeter(int[]) - Method in class g0901_1000.s0976_largest_perimeter_triangle.Solution

largestPerimeter(int[]) - Method in class g2901_3000.s2971_find_polygon_with_the_largest_perimeter.Solution

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

largestSquareArea(int[][], int[][]) - Method in class g3001_3100.s3047_find_the_largest_area_of_square_inside_two_rectangles.Solution

largestSubmatrix(int[][]) - Method in class g1701_1800.s1727_largest_submatrix_with_rearrangements.Solution

largestSumAfterKNegations(int[], int) - Method in class g1001_1100.s1005_maximize_sum_of_array_after_k_negations.Solution

largestSumOfAverages(int[], int) - Method in class g0801_0900.s0813_largest_sum_of_averages.Solution

largestTimeFromDigits(int[]) - Method in class g0901_1000.s0949_largest_time_for_given_digits.Solution

largestTriangleArea(int[][]) - Method in class g0801_0900.s0812_largest_triangle_area.Solution

largestValsFromLabels(int[], int[], int, int) - Method in class g1001_1100.s1090_largest_values_from_labels.Solution

largestValues(TreeNode) - Method in class g0501_0600.s0515_find_largest_value_in_each_tree_row.Solution

largestVariance(String) - Method in class g2201_2300.s2272_substring_with_largest_variance.Solution

largestWordCount(String[], String[]) - Method in class g2201_2300.s2284_sender_with_largest_word_count.Solution

lastNonEmptyString(String) - Method in class g3001_3100.s3039_apply_operations_to_make_string_empty.Solution

lastRemaining(int) - Method in class g0301_0400.s0390_elimination_game.Solution

lastStoneWeight(int[]) - Method in class g1001_1100.s1046_last_stone_weight.Solution

lastStoneWeightII(int[]) - Method in class g1001_1100.s1049_last_stone_weight_ii.Solution

lastSubstring(String) - Method in class g1101_1200.s1163_last_substring_in_lexicographical_order.Solution

lastVisitedIntegers(List<String>) - Method in class g2801_2900.s2899_last_visited_integers.Solution

latestDayToCross(int, int, int[][]) - Method in class g1901_2000.s1970_last_day_where_you_can_still_cross.Solution

latestTimeCatchTheBus(int[], int[], int) - Method in class g2301_2400.s2332_the_latest_time_to_catch_a_bus.Solution

lcaDeepestLeaves(TreeNode) - Method in class g1101_1200.s1123_lowest_common_ancestor_of_deepest_leaves.Solution

leafSimilar(TreeNode, TreeNode) - Method in class g0801_0900.s0872_leaf_similar_trees.Solution

leastBricks(List<List<Integer>>) - Method in class g0501_0600.s0554_brick_wall.Solution

leastInterval(char[], int) - Method in class g0601_0700.s0621_task_scheduler.Solution

leastOpsExpressTarget(int, int) - Method in class g0901_1000.s0964_least_operators_to_express_number.Solution

leave(int) - Method in class g0801_0900.s0855_exam_room.ExamRoom

left - Variable in class com_github_leetcode.left_right.Node

left - Variable in class com_github_leetcode.TreeNode

leftmostBuildingQueries(int[], int[][]) - Method in class g2901_3000.s2940_find_building_where_alice_and_bob_can_meet.Solution

leftRightDifference(int[]) - Method in class g2501_2600.s2574_left_and_right_sum_differences.Solution

lemonadeChange(int[]) - Method in class g0801_0900.s0860_lemonade_change.Solution

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

lengthLongestPath(String) - Method in class g0301_0400.s0388_longest_absolute_file_path.Solution

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

lengthOfLIS(int[], int) - Method in class g2401_2500.s2407_longest_increasing_subsequence_ii.Solution

lengthOfLongestSubsequence(List<Integer>, int) - Method in class g2901_3000.s2915_length_of_the_longest_subsequence_that_sums_to_target.Solution

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

lenLongestFibSubseq(int[]) - Method in class g0801_0900.s0873_length_of_longest_fibonacci_subsequence.Solution

letterCasePermutation(String) - Method in class g0701_0800.s0784_letter_case_permutation.Solution

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

levelOrder(Node) - Method in class g0401_0500.s0429_n_ary_tree_level_order_traversal.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

lexicalOrder(int) - Method in class g0301_0400.s0386_lexicographical_numbers.Solution

lexicographicallySmallestArray(int[], int) - Method in class g2901_3000.s2948_make_lexicographically_smallest_array_by_swapping_elements.Solution

LFUCache - Class in g0401_0500.s0460_lfu_cache

460 - LFU Cache.

LFUCache(int) - Constructor for class g0401_0500.s0460_lfu_cache.LFUCache

licenseKeyFormatting(String, int) - Method in class g0401_0500.s0482_license_key_formatting.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

lock(int, int) - Method in class g1901_2000.s1993_operations_on_tree.LockingTree

LockingTree - Class in g1901_2000.s1993_operations_on_tree

1993 - Operations on Tree.

LockingTree(int[]) - Constructor for class g1901_2000.s1993_operations_on_tree.LockingTree

longest() - Method in class g2401_2500.s2424_longest_uploaded_prefix.LUPrefix

longestAlternatingSubarray(int[], int) - Method in class g2701_2800.s2760_longest_even_odd_subarray_with_threshold.Solution

longestArithSeqLength(int[]) - Method in class g1001_1100.s1027_longest_arithmetic_subsequence.Solution

longestAwesome(String) - Method in class g1501_1600.s1542_find_longest_awesome_substring.Solution

longestBeautifulSubstring(String) - Method in class g1801_1900.s1839_longest_substring_of_all_vowels_in_order.Solution

longestCommonPrefix(int[], int[]) - Method in class g3001_3100.s3043_find_the_length_of_the_longest_common_prefix.Solution

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

longestCommonSubpath(int, int[][]) - Method in class g1901_2000.s1923_longest_common_subpath.Solution

longestCommonSubsequence(String, String) - Method in class g1101_1200.s1143_longest_common_subsequence.Solution

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

longestContinuousSubstring(String) - Method in class g2401_2500.s2414_length_of_the_longest_alphabetical_continuous_substring.Solution

longestCycle(int[]) - Method in class g2301_2400.s2360_longest_cycle_in_a_graph.Solution

longestDecomposition(String) - Method in class g1101_1200.s1147_longest_chunked_palindrome_decomposition.Solution

longestDiverseString(int, int, int) - Method in class g1401_1500.s1405_longest_happy_string.Solution

longestDupSubstring(String) - Method in class g1001_1100.s1044_longest_duplicate_substring.Solution

longestEqualSubarray(List<Integer>, int) - Method in class g2801_2900.s2831_find_the_longest_equal_subarray.Solution

longestIdealString(String, int) - Method in class g2301_2400.s2370_longest_ideal_subsequence.Solution

longestIncreasingPath(int[][]) - Method in class g0301_0400.s0329_longest_increasing_path_in_a_matrix.Solution

longestMountain(int[]) - Method in class g0801_0900.s0845_longest_mountain_in_array.Solution

longestNiceSubarray(int[]) - Method in class g2401_2500.s2401_longest_nice_subarray.Solution

longestNiceSubstring(String) - Method in class g1701_1800.s1763_longest_nice_substring.Solution

longestObstacleCourseAtEachPosition(int[]) - Method in class g1901_2000.s1964_find_the_longest_valid_obstacle_course_at_each_position.Solution

longestOnes(int[], int) - Method in class g1001_1100.s1004_max_consecutive_ones_iii.Solution

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

longestPalindrome(String) - Method in class g0401_0500.s0409_longest_palindrome.Solution

longestPalindrome(String[]) - Method in class g2101_2200.s2131_longest_palindrome_by_concatenating_two_letter_words.Solution

longestPalindrome(String, String) - Method in class g1701_1800.s1771_maximize_palindrome_length_from_subsequences.Solution

longestPalindromeSubseq(String) - Method in class g0501_0600.s0516_longest_palindromic_subsequence.Solution

longestPath(int[], String) - Method in class g2201_2300.s2246_longest_path_with_different_adjacent_characters.Solution

longestPrefix(String) - Method in class g1301_1400.s1392_longest_happy_prefix.Solution

longestRepeating(String, String, int[]) - Method in class g2201_2300.s2213_longest_substring_of_one_repeating_character.Solution

longestSemiRepetitiveSubstring(String) - Method in class g2701_2800.s2730_find_the_longest_semi_repetitive_substring.Solution

longestSquareStreak(int[]) - Method in class g2501_2600.s2501_longest_square_streak_in_an_array.Solution

longestStrChain(String[]) - Method in class g1001_1100.s1048_longest_string_chain.Solution

longestString(int, int, int) - Method in class g2701_2800.s2745_construct_the_longest_new_string.Solution

longestSubarray(int[]) - Method in class g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element.Solution

longestSubarray(int[]) - Method in class g2401_2500.s2419_longest_subarray_with_maximum_bitwise_and.Solution

longestSubarray(int[], int) - Method in class g1401_1500.s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit.Solution

longestSubsequence(int[], int) - Method in class g1201_1300.s1218_longest_arithmetic_subsequence_of_given_difference.Solution

longestSubsequence(String, int) - Method in class g2301_2400.s2311_longest_binary_subsequence_less_than_or_equal_to_k.Solution

longestSubsequenceRepeatedK(String, int) - Method in class g2001_2100.s2014_longest_subsequence_repeated_k_times.Solution

longestSubstring(String, int) - Method in class g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters.Solution

longestUnivaluePath(TreeNode) - Method in class g0601_0700.s0687_longest_univalue_path.Solution

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

longestValidSubstring(String, List<String>) - Method in class g2701_2800.s2781_length_of_the_longest_valid_substring.Solution

longestWord(String[]) - Method in class g0701_0800.s0720_longest_word_in_dictionary.Solution

longestWPI(int[]) - Method in class g1101_1200.s1124_longest_well_performing_interval.Solution

longestZigZag(TreeNode) - Method in class g1301_1400.s1372_longest_zigzag_path_in_a_binary_tree.Solution

loudAndRich(int[][], int[]) - Method in class g0801_0900.s0851_loud_and_rich.Solution

lowestCommonAncestor(TreeNode, TreeNode, TreeNode) - Method in class g0201_0300.s0235_lowest_common_ancestor_of_a_binary_search_tree.Solution

lowestCommonAncestor(TreeNode, TreeNode, TreeNode) - Method in class g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree.Solution

LRUCache - Class in g0101_0200.s0146_lru_cache

146 - LRU Cache.

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

luckyNumbers(int[][]) - Method in class g1301_1400.s1380_lucky_numbers_in_a_matrix.Solution

LUPrefix - Class in g2401_2500.s2424_longest_uploaded_prefix

2424 - Longest Uploaded Prefix.

LUPrefix(int) - Constructor for class g2401_2500.s2424_longest_uploaded_prefix.LUPrefix

M

magicalString(int) - Method in class g0401_0500.s0481_magical_string.Solution

MagicDictionary - Class in g0601_0700.s0676_implement_magic_dictionary

676 - Implement Magic Dictionary.

MagicDictionary() - Constructor for class g0601_0700.s0676_implement_magic_dictionary.MagicDictionary

magnificentSets(int, int[][]) - Method in class g2401_2500.s2493_divide_nodes_into_the_maximum_number_of_groups.Solution

MajorityChecker - Class in g1101_1200.s1157_online_majority_element_in_subarray

1157 - Online Majority Element In Subarray.

MajorityChecker(int[]) - Constructor for class g1101_1200.s1157_online_majority_element_in_subarray.MajorityChecker

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

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

makeArrayIncreasing(int[], int[]) - Method in class g1101_1200.s1187_make_array_strictly_increasing.Solution

makeConnected(int, int[][]) - Method in class g1301_1400.s1319_number_of_operations_to_make_network_connected.Solution

makeEqual(String[]) - Method in class g1801_1900.s1897_redistribute_characters_to_make_all_strings_equal.Solution

makeFancyString(String) - Method in class g1901_2000.s1957_delete_characters_to_make_fancy_string.Solution

makeGood(String) - Method in class g1501_1600.s1544_make_the_string_great.Solution

makeIntegerBeautiful(long, int) - Method in class g2401_2500.s2457_minimum_addition_to_make_integer_beautiful.Solution

makeLargestSpecial(String) - Method in class g0701_0800.s0761_special_binary_string.Solution

makeSimilar(int[], int[]) - Method in class g2401_2500.s2449_minimum_number_of_operations_to_make_arrays_similar.Solution

makeSmallestPalindrome(String) - Method in class g2601_2700.s2697_lexicographically_smallest_palindrome.Solution

makesquare(int[]) - Method in class g0401_0500.s0473_matchsticks_to_square.Solution

makeStringsEqual(String, String) - Method in class g2501_2600.s2546_apply_bitwise_operations_to_make_strings_equal.Solution

makeStringSorted(String) - Method in class g1801_1900.s1830_minimum_number_of_operations_to_make_string_sorted.Solution

makeSubKSumEqual(int[], int) - Method in class g2601_2700.s2607_make_k_subarray_sums_equal.Solution

makeTheIntegerZero(int, int) - Method in class g2701_2800.s2749_minimum_operations_to_make_the_integer_zero.Solution

MapSum - Class in g0601_0700.s0677_map_sum_pairs

677 - Map Sum Pairs.

MapSum() - Constructor for class g0601_0700.s0677_map_sum_pairs.MapSum

maskPII(String) - Method in class g0801_0900.s0831_masking_personal_information.Solution

matchPlayersAndTrainers(int[], int[]) - Method in class g2401_2500.s2410_maximum_matching_of_players_with_trainers.Solution

matchReplacement(String, String, char[][]) - Method in class g2301_2400.s2301_match_substring_after_replacement.Solution

matrixBlockSum(int[][], int) - Method in class g1301_1400.s1314_matrix_block_sum.Solution

matrixRankTransform(int[][]) - Method in class g1601_1700.s1632_rank_transform_of_a_matrix.Solution

matrixReshape(int[][], int, int) - Method in class g0501_0600.s0566_reshape_the_matrix.Solution

matrixScore(int[][]) - Method in class g0801_0900.s0861_score_after_flipping_matrix.Solution

matrixSum(int[][]) - Method in class g2601_2700.s2679_sum_in_a_matrix.Solution

matrixSumQueries(int, int[][]) - Method in class g2701_2800.s2718_sum_of_matrix_after_queries.Solution

maxAbsoluteSum(int[]) - Method in class g1701_1800.s1749_maximum_absolute_sum_of_any_subarray.Solution

maxAbsValExpr(int[], int[]) - Method in class g1101_1200.s1131_maximum_of_absolute_value_expression.Solution

maxAlternatingSum(int[]) - Method in class g1901_2000.s1911_maximum_alternating_subsequence_sum.Solution

maxAncestorDiff(TreeNode) - Method in class g1001_1100.s1026_maximum_difference_between_node_and_ancestor.Solution

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

maxArea(int, int, int[], int[]) - Method in class g1401_1500.s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts.Solution

maxAreaOfIsland(int[][]) - Method in class g0601_0700.s0695_max_area_of_island.Solution

maxArrayValue(int[]) - Method in class g2701_2800.s2789_largest_element_in_an_array_after_merge_operations.Solution

maxAscendingSum(int[]) - Method in class g1701_1800.s1800_maximum_ascending_subarray_sum.Solution

maxAverageRatio(int[][], int) - Method in class g1701_1800.s1792_maximum_average_pass_ratio.Solution

maxBalancedSubsequenceSum(int[]) - Method in class g2901_3000.s2926_maximum_balanced_subsequence_sum.Solution

maxBuilding(int, int[][]) - Method in class g1801_1900.s1840_maximum_building_height.Solution

maxCandies(int[], int[], int[][], int[][], int[]) - Method in class g1201_1300.s1298_maximum_candies_you_can_get_from_boxes.Solution

maxChunksToSorted(int[]) - Method in class g0701_0800.s0768_max_chunks_to_make_sorted_ii.Solution

maxChunksToSorted(int[]) - Method in class g0701_0800.s0769_max_chunks_to_make_sorted.Solution

maxCoins(int[]) - Method in class g0301_0400.s0312_burst_balloons.Solution

maxCoins(int[]) - Method in class g1501_1600.s1561_maximum_number_of_coins_you_can_get.Solution

maxCompatibilitySum(int[][], int[][]) - Method in class g1901_2000.s1947_maximum_compatibility_score_sum.Solution

maxConsecutive(int, int, int[]) - Method in class g2201_2300.s2274_maximum_consecutive_floors_without_special_floors.Solution

maxConsecutiveAnswers(String, int) - Method in class g2001_2100.s2024_maximize_the_confusion_of_an_exam.Solution

maxCount(int[], int, int) - Method in class g2501_2600.s2554_maximum_number_of_integers_to_choose_from_a_range_i.Solution

maxCount(int, int, int[][]) - Method in class g0501_0600.s0598_range_addition_ii.Solution

maxDepth(Node) - Method in class g0501_0600.s0559_maximum_depth_of_n_ary_tree.Solution

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

maxDepth(String) - Method in class g1601_1700.s1614_maximum_nesting_depth_of_the_parentheses.Solution

maxDepthAfterSplit(String) - Method in class g1101_1200.s1111_maximum_nesting_depth_of_two_valid_parentheses_strings.Solution

maxDiff(int) - Method in class g1401_1500.s1432_max_difference_you_can_get_from_changing_an_integer.Solution

maxDistance(int[]) - Method in class g2001_2100.s2078_two_furthest_houses_with_different_colors.Solution

maxDistance(int[][]) - Method in class g1101_1200.s1162_as_far_from_land_as_possible.Solution

maxDistance(int[], int) - Method in class g1501_1600.s1552_magnetic_force_between_two_balls.Solution

maxDistance(int[], int[]) - Method in class g1801_1900.s1855_maximum_distance_between_a_pair_of_values.Solution

maxDistToClosest(int[]) - Method in class g0801_0900.s0849_maximize_distance_to_closest_person.Solution

maxDivScore(int[], int[]) - Method in class g2601_2700.s2644_find_the_maximum_divisibility_score.Solution

maxDotProduct(int[], int[]) - Method in class g1401_1500.s1458_max_dot_product_of_two_subsequences.Solution

maxEnvelopes(int[][]) - Method in class g0301_0400.s0354_russian_doll_envelopes.Solution

maxEqualFreq(int[]) - Method in class g1201_1300.s1224_maximum_equal_frequency.Solution

maxEqualRowsAfterFlips(int[][]) - Method in class g1001_1100.s1072_flip_columns_for_maximum_number_of_equal_rows.Solution

maxEvents(int[][]) - Method in class g1301_1400.s1353_maximum_number_of_events_that_can_be_attended.Solution

maxFreq(String, int, int, int) - Method in class g1201_1300.s1297_maximum_number_of_occurrences_of_a_substring.Solution

maxFrequency(int[], int) - Method in class g1801_1900.s1838_frequency_of_the_most_frequent_element.Solution

maxFrequencyElements(int[]) - Method in class g3001_3100.s3005_count_elements_with_maximum_frequency.Solution

maxFrequencyScore(int[], long) - Method in class g2901_3000.s2968_apply_operations_to_maximize_frequency_score.Solution

maxGeneticDifference(int[], int[][]) - Method in class g1901_2000.s1938_maximum_genetic_difference_query.Solution

maxHappyGroups(int, int[]) - Method in class g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts.Solution

maxHeight(int[][]) - Method in class g1601_1700.s1691_maximum_height_by_stacking_cuboids.Solution

maxIceCream(int[], int) - Method in class g1801_1900.s1833_maximum_ice_cream_bars.Solution

maximalNetworkRank(int, int[][]) - Method in class g1601_1700.s1615_maximal_network_rank.Solution

maximalPathQuality(int[], int[][], int) - Method in class g2001_2100.s2065_maximum_path_quality_of_a_graph.Solution

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

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

maximizeGreatness(int[]) - Method in class g2501_2600.s2592_maximize_greatness_of_an_array.Solution

maximizeSquareArea(int, int, int[], int[]) - Method in class g2901_3000.s2975_maximum_square_area_by_removing_fences_from_a_field.Solution

maximizeSquareHoleArea(int, int, int[], int[]) - Method in class g2901_3000.s2943_maximize_area_of_square_hole_in_grid.Solution

maximizeSum(int[], int) - Method in class g2601_2700.s2656_maximum_sum_with_exactly_k_elements.Solution

maximizeTheProfit(int, List<List<Integer>>) - Method in class g2801_2900.s2830_maximize_the_profit_as_the_salesman.Solution

maximizeWin(int[], int) - Method in class g2501_2600.s2555_maximize_win_from_two_segments.Solution

maximizeXor(int[], int[][]) - Method in class g1701_1800.s1707_maximum_xor_with_an_element_from_array.Solution

maximum() - Method in class g2001_2100.s2034_stock_price_fluctuation.StockPrice

maximum69Number(int) - Method in class g1301_1400.s1323_maximum_69_number.Solution

maximumANDSum(int[], int) - Method in class g2101_2200.s2172_maximum_and_sum_of_array.Solution

maximumBags(int[], int[], int) - Method in class g2201_2300.s2279_maximum_bags_with_full_capacity_of_rocks.Solution

maximumBeauty(int[][], int[]) - Method in class g2001_2100.s2070_most_beautiful_item_for_each_query.Solution

maximumBeauty(int[], int) - Method in class g2701_2800.s2779_maximum_beauty_of_an_array_after_applying_operation.Solution

maximumBeauty(int[], long, int, int, int) - Method in class g2201_2300.s2234_maximum_total_beauty_of_the_gardens.Solution

maximumBinaryString(String) - Method in class g1701_1800.s1702_maximum_binary_string_after_change.Solution

maximumBobPoints(int, int[]) - Method in class g2201_2300.s2212_maximum_points_in_an_archery_competition.Solution

maximumCandies(int[], long) - Method in class g2201_2300.s2226_maximum_candies_allocated_to_k_children.Solution

maximumCostSubstring(String, String, int[]) - Method in class g2601_2700.s2606_find_the_substring_with_maximum_cost.Solution

maximumCount(int[]) - Method in class g2501_2600.s2529_maximum_count_of_positive_integer_and_negative_integer.Solution

maximumDetonation(int[][]) - Method in class g2101_2200.s2101_detonate_the_maximum_bombs.Solution

maximumDifference(int[]) - Method in class g2001_2100.s2016_maximum_difference_between_increasing_elements.Solution

maximumElementAfterDecrementingAndRearranging(int[]) - Method in class g1801_1900.s1846_maximum_element_after_decreasing_and_rearranging.Solution

maximumEvenSplit(long) - Method in class g2101_2200.s2178_maximum_split_of_positive_even_integers.Solution

maximumGain(String, int, int) - Method in class g1701_1800.s1717_maximum_score_from_removing_substrings.Solution

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

maximumGood(int[][]) - Method in class g2101_2200.s2151_maximum_good_people_based_on_statements.Solution

maximumGroups(int[]) - Method in class g2301_2400.s2358_maximum_number_of_groups_entering_a_competition.Solution

maximumImportance(int, int[][]) - Method in class g2201_2300.s2285_maximum_total_importance_of_roads.Solution

maximumInvitations(int[]) - Method in class g2101_2200.s2127_maximum_employees_to_be_invited_to_a_meeting.Solution

maximumJumps(int[], int) - Method in class g2701_2800.s2770_maximum_number_of_jumps_to_reach_the_last_index.Solution

maximumLength(int[]) - Method in class g3001_3100.s3020_find_the_maximum_number_of_elements_in_subset.Solution

maximumLength(String) - Method in class g2901_3000.s2981_find_longest_special_substring_that_occurs_thrice_i.Solution

maximumLength(String) - Method in class g2901_3000.s2982_find_longest_special_substring_that_occurs_thrice_ii.Solution

maximumMinutes(int[][]) - Method in class g2201_2300.s2258_escape_the_spreading_fire.Solution

maximumNumber(String, int[]) - Method in class g1901_2000.s1946_largest_number_after_mutating_substring.Solution

maximumNumberOfStringPairs(String[]) - Method in class g2701_2800.s2744_find_maximum_number_of_string_pairs.Solution

maximumOddBinaryNumber(String) - Method in class g2801_2900.s2864_maximum_odd_binary_number.Solution

maximumOr(int[], int) - Method in class g2601_2700.s2680_maximum_or.Solution

maximumPoints(int[][], int[], int) - Method in class g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes.Solution

maximumPopulation(int[][]) - Method in class g1801_1900.s1854_maximum_population_year.Solution

maximumProduct(int[]) - Method in class g0601_0700.s0628_maximum_product_of_three_numbers.Solution

maximumProduct(int[], int) - Method in class g2201_2300.s2233_maximum_product_after_k_increments.Solution

maximumRemovals(String, String, int[]) - Method in class g1801_1900.s1898_maximum_number_of_removable_characters.Solution

maximumRequests(int, int[][]) - Method in class g1601_1700.s1601_maximum_number_of_achievable_transfer_requests.Solution

maximumRobots(int[], int[], long) - Method in class g2301_2400.s2398_maximum_number_of_robots_within_budget.Solution

maximumRows(int[][], int) - Method in class g2301_2400.s2397_maximum_rows_covered_by_columns.Solution

maximumSafenessFactor(List<List<Integer>>) - Method in class g2801_2900.s2812_find_the_safest_path_in_a_grid.Solution

maximumScore(int[], int) - Method in class g1701_1800.s1793_maximum_score_of_a_good_subarray.Solution

maximumScore(int[], int[]) - Method in class g1701_1800.s1770_maximum_score_from_performing_multiplication_operations.Solution

maximumScore(int[], int[][]) - Method in class g2201_2300.s2242_maximum_score_of_a_node_sequence.Solution

maximumScore(int, int, int) - Method in class g1701_1800.s1753_maximum_score_from_removing_stones.Solution

maximumScore(List<Integer>, int) - Method in class g2801_2900.s2818_apply_operations_to_maximize_score.Solution

maximumScoreAfterOperations(int[][], int[]) - Method in class g2901_3000.s2925_maximum_score_after_applying_operations_on_a_tree.Solution

maximumSegmentSum(int[], int[]) - Method in class g2301_2400.s2382_maximum_segment_sum_after_removals.Solution

maximumSetSize(int[], int[]) - Method in class g3001_3100.s3002_maximum_size_of_a_set_after_removals.Solution

maximumsSplicedArray(int[], int[]) - Method in class g2301_2400.s2321_maximum_score_of_spliced_array.Solution

maximumStrongPairXor(int[]) - Method in class g2901_3000.s2932_maximum_strong_pair_xor_i.Solution

maximumStrongPairXor(int[]) - Method in class g2901_3000.s2935_maximum_strong_pair_xor_ii.Solution

maximumSubarraySum(int[], int) - Method in class g2401_2500.s2461_maximum_sum_of_distinct_subarrays_with_length_k.Solution

maximumSubarraySum(int[], int) - Method in class g3001_3100.s3026_maximum_good_subarray_sum.Solution

maximumSubsequenceCount(String, String) - Method in class g2201_2300.s2207_maximize_number_of_subsequences_in_a_string.Solution

maximumSum(int[]) - Method in class g1101_1200.s1186_maximum_subarray_sum_with_one_deletion.Solution

maximumSum(int[]) - Method in class g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits.Solution

maximumSum(List<Integer>) - Method in class g2801_2900.s2862_maximum_element_sum_of_a_complete_subset_of_indices.Solution

maximumSumOfHeights(List<Integer>) - Method in class g2801_2900.s2865_beautiful_towers_i.Solution

maximumSumOfHeights(List<Integer>) - Method in class g2801_2900.s2866_beautiful_towers_ii.Solution

maximumSumQueries(int[], int[], int[][]) - Method in class g2701_2800.s2736_maximum_sum_queries.Solution

maximumSwap(int) - Method in class g0601_0700.s0670_maximum_swap.Solution

maximumTastiness(int[], int) - Method in class g2501_2600.s2517_maximum_tastiness_of_candy_basket.Solution

maximumTime(String) - Method in class g1701_1800.s1736_latest_time_by_replacing_hidden_digits.Solution

maximumTop(int[], int) - Method in class g2201_2300.s2202_maximize_the_topmost_element_after_k_moves.Solution

maximumTripletValue(int[]) - Method in class g2801_2900.s2873_maximum_value_of_an_ordered_triplet_i.Solution

maximumTripletValue(int[]) - Method in class g2801_2900.s2874_maximum_value_of_an_ordered_triplet_ii.Solution

maximumUniqueSubarray(int[]) - Method in class g1601_1700.s1695_maximum_erasure_value.Solution

maximumUnits(int[][], int) - Method in class g1701_1800.s1710_maximum_units_on_a_truck.Solution

maximumValue(String[]) - Method in class g2401_2500.s2496_maximum_value_of_a_string_in_an_array.Solution

maximumValueSum(int[], int, int[][]) - Method in class g3001_3100.s3068_find_the_maximum_sum_of_node_values.Solution

maximumWealth(int[][]) - Method in class g1601_1700.s1672_richest_customer_wealth.Solution

maximumWhiteTiles(int[][], int) - Method in class g2201_2300.s2271_maximum_white_tiles_covered_by_a_carpet.Solution

maximumXOR(int[]) - Method in class g2301_2400.s2317_maximum_xor_after_operations.Solution

maximumXorProduct(long, long, int) - Method in class g2901_3000.s2939_maximum_xor_product.Solution

maxIncreaseKeepingSkyline(int[][]) - Method in class g0801_0900.s0807_max_increase_to_keep_city_skyline.Solution

maxIncreasingCells(int[][]) - Method in class g2701_2800.s2713_maximum_strictly_increasing_cells_in_a_matrix.Solution

maxIncreasingGroups(List<Integer>) - Method in class g2701_2800.s2790_maximum_number_of_groups_with_increasing_length.Solution

maxJump(int[]) - Method in class g2401_2500.s2498_frog_jump_ii.Solution

maxJumps(int[], int) - Method in class g1301_1400.s1340_jump_game_v.Solution

maxKDivisibleComponents(int, int[][], int[], int) - Method in class g2801_2900.s2872_maximum_number_of_k_divisible_components.Solution

maxKelements(int[], int) - Method in class g2501_2600.s2530_maximal_score_after_applying_k_operations.Solution

maxLength(List<String>) - Method in class g1201_1300.s1239_maximum_length_of_a_concatenated_string_with_unique_characters.Solution

maxLengthBetweenEqualCharacters(String) - Method in class g1601_1700.s1624_largest_substring_between_two_equal_characters.Solution

maxLevelSum(TreeNode) - Method in class g1101_1200.s1161_maximum_level_sum_of_a_binary_tree.Solution

maxMatrixSum(int[][]) - Method in class g1901_2000.s1975_maximum_matrix_sum.Solution

maxMoves(int[][]) - Method in class g2601_2700.s2684_maximum_number_of_moves_in_a_grid.Solution

maxNiceDivisors(int) - Method in class g1801_1900.s1808_maximize_number_of_nice_divisors.Solution

maxNonDecreasingLength(int[], int[]) - Method in class g2701_2800.s2771_longest_non_decreasing_subarray_from_two_arrays.Solution

maxNonOverlapping(int[], int) - Method in class g1501_1600.s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target.Solution

maxNumber(int[], int[], int) - Method in class g0301_0400.s0321_create_maximum_number.Solution

maxNumberOfAlloys(int, int, int, List<List<Integer>>, List<Integer>, List<Integer>) - Method in class g2801_2900.s2861_maximum_number_of_alloys.Solution

maxNumberOfBalloons(String) - Method in class g1101_1200.s1189_maximum_number_of_balloons.Solution

maxNumberOfFamilies(int, int[][]) - Method in class g1301_1400.s1386_cinema_seat_allocation.Solution

maxNumEdgesToRemove(int, int[][]) - Method in class g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable.Solution

maxNumOfMarkedIndices(int[]) - Method in class g2501_2600.s2576_find_the_maximum_number_of_marked_indices.Solution

maxNumOfSubstrings(String) - Method in class g1501_1600.s1520_maximum_number_of_non_overlapping_substrings.Solution

maxOperations(int[]) - Method in class g3001_3100.s3038_maximum_number_of_operations_with_the_same_score_i.Solution

maxOperations(int[]) - Method in class g3001_3100.s3040_maximum_number_of_operations_with_the_same_score_ii.Solution

maxOperations(int[], int) - Method in class g1601_1700.s1679_max_number_of_k_sum_pairs.Solution

maxOutput(int, int[][], int[]) - Method in class g2501_2600.s2538_difference_between_maximum_and_minimum_price_sum.Solution

maxPalindromes(String, int) - Method in class g2401_2500.s2472_maximum_number_of_non_overlapping_palindrome_substrings.Solution

maxPalindromesAfterOperations(String[]) - Method in class g3001_3100.s3035_maximum_palindromes_after_operations.Solution

maxPartitionsAfterOperations(String, int) - Method in class g3001_3100.s3003_maximize_the_number_of_partitions_after_operations.Solution

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

maxPerformance(int, int[], int[], int) - Method in class g1301_1400.s1383_maximum_performance_of_a_team.Solution

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

maxPoints(int[][]) - Method in class g1901_2000.s1937_maximum_number_of_points_with_cost.Solution

maxPoints(int[][], int[]) - Method in class g2501_2600.s2503_maximum_number_of_points_from_grid_queries.Solution

maxPower(int[], int, int) - Method in class g2501_2600.s2528_maximize_the_minimum_powered_city.Solution

maxPower(String) - Method in class g1401_1500.s1446_consecutive_characters.Solution

maxProbability(int, int[][], double[], int, int) - Method in class g1501_1600.s1514_path_with_maximum_probability.Solution

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

maxProduct(int[]) - Method in class g1401_1500.s1464_maximum_product_of_two_elements_in_an_array.Solution

maxProduct(TreeNode) - Method in class g1301_1400.s1339_maximum_product_of_splitted_binary_tree.Solution

maxProduct(String) - Method in class g1901_2000.s1960_maximum_product_of_the_length_of_two_palindromic_substrings.Solution

maxProduct(String) - Method in class g2001_2100.s2002_maximum_product_of_the_length_of_two_palindromic_subsequences.Solution

maxProduct(String[]) - Method in class g0301_0400.s0318_maximum_product_of_word_lengths.Solution

maxProductDifference(int[]) - Method in class g1901_2000.s1913_maximum_product_difference_between_two_pairs.Solution

maxProductPath(int[][]) - Method in class g1501_1600.s1594_maximum_non_negative_product_in_a_matrix.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[]) - Method in class g0301_0400.s0309_best_time_to_buy_and_sell_stock_with_cooldown.Solution

maxProfit(int[], int) - Method in class g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee.Solution

maxProfit(int[], int) - Method in class g1601_1700.s1648_sell_diminishing_valued_colored_balls.Solution

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

maxProfitAssignment(int[], int[], int[]) - Method in class g0801_0900.s0826_most_profit_assigning_work.Solution

maxRepeating(String, String) - Method in class g1601_1700.s1668_maximum_repeating_substring.Solution

maxRepOpt1(String) - Method in class g1101_1200.s1156_swap_for_longest_repeated_character_substring.Solution

maxResult(int[], int) - Method in class g1601_1700.s1696_jump_game_vi.Solution

maxRotateFunction(int[]) - Method in class g0301_0400.s0396_rotate_function.Solution

maxRunTime(int, int[]) - Method in class g2101_2200.s2141_maximum_running_time_of_n_computers.Solution

maxSatisfaction(int[]) - Method in class g1401_1500.s1402_reducing_dishes.Solution

maxSatisfied(int[], int[], int) - Method in class g1001_1100.s1052_grumpy_bookstore_owner.Solution

maxScore(int[]) - Method in class g1701_1800.s1799_maximize_score_after_n_operations.Solution

maxScore(int[]) - Method in class g2501_2600.s2587_rearrange_array_to_maximize_prefix_score.Solution

maxScore(int[], int) - Method in class g1401_1500.s1423_maximum_points_you_can_obtain_from_cards.Solution

maxScore(int[], int) - Method in class g2701_2800.s2786_visit_array_positions_to_maximize_score.Solution

maxScore(int[], int[], int) - Method in class g2501_2600.s2542_maximum_subsequence_score.Solution

maxScore(String) - Method in class g1401_1500.s1422_maximum_score_after_splitting_a_string.Solution

maxScoreIndices(int[]) - Method in class g2101_2200.s2155_all_divisions_with_the_highest_score_of_a_binary_array.Solution

maxScoreSightseeingPair(int[]) - Method in class g1001_1100.s1014_best_sightseeing_pair.Solution

maxScoreWords(String[], char[], int[]) - Method in class g1201_1300.s1255_maximum_score_words_formed_by_letters.Solution

maxSelectedElements(int[]) - Method in class g3001_3100.s3041_maximize_consecutive_elements_in_an_array_after_modification.Solution

maxSideLength(int[][], int) - Method in class g1201_1300.s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold.Solution

maxSizeSlices(int[]) - Method in class g1301_1400.s1388_pizza_with_3n_slices.Solution

maxSlidingWindow(int[], int) - Method in class g0201_0300.s0239_sliding_window_maximum.Solution

maxSpending(int[][]) - Method in class g2901_3000.s2931_maximum_spending_after_buying_items.Solution

maxStarSum(int[], int[][], int) - Method in class g2401_2500.s2497_maximum_star_sum_of_a_graph.Solution

maxStrength(int[]) - Method in class g2701_2800.s2708_maximum_strength_of_a_group.Solution

maxStudents(char[][]) - Method in class g1301_1400.s1349_maximum_students_taking_exam.Solution

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

maxSubarrayLength(int[], int) - Method in class g2901_3000.s2958_length_of_longest_subarray_with_at_most_k_frequency.Solution

maxSubarrays(int[]) - Method in class g2801_2900.s2871_split_array_into_maximum_number_of_subarrays.Solution

maxSubarraySumCircular(int[]) - Method in class g0901_1000.s0918_maximum_sum_circular_subarray.Solution

maxSubsequence(int[], int) - Method in class g2001_2100.s2099_find_subsequence_of_length_k_with_the_largest_sum.Solution

maxSum(int[]) - Method in class g2801_2900.s2815_max_pair_sum_in_an_array.Solution

maxSum(int[][]) - Method in class g2401_2500.s2428_maximum_sum_of_an_hourglass.Solution

maxSum(int[], int[]) - Method in class g1501_1600.s1537_get_the_maximum_score.Solution

maxSum(List<Integer>, int) - Method in class g2801_2900.s2897_apply_operations_on_array_to_maximize_sum_of_squares.Solution

maxSum(List<Integer>, int, int) - Method in class g2801_2900.s2841_maximum_sum_of_almost_unique_subarray.Solution

maxSumAfterPartitioning(int[], int) - Method in class g1001_1100.s1043_partition_array_for_maximum_sum.Solution

maxSumBST(TreeNode) - Method in class g1301_1400.s1373_maximum_sum_bst_in_binary_tree.Solution

maxSumDivThree(int[]) - Method in class g1201_1300.s1262_greatest_sum_divisible_by_three.Solution

maxSumMinProduct(int[]) - Method in class g1801_1900.s1856_maximum_subarray_min_product.Solution

maxSumOfThreeSubarrays(int[], int) - Method in class g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays.Solution

maxSumRangeQuery(int[], int[][]) - Method in class g1501_1600.s1589_maximum_sum_obtained_of_any_permutation.Solution

maxSumSubmatrix(int[][], int) - Method in class g0301_0400.s0363_max_sum_of_rectangle_no_larger_than_k.Solution

maxSumTwoNoOverlap(int[], int, int) - Method in class g1001_1100.s1031_maximum_sum_of_two_non_overlapping_subarrays.Solution

maxTaskAssign(int[], int[], int, int) - Method in class g2001_2100.s2071_maximum_number_of_tasks_you_can_assign.Solution

maxTaxiEarnings(int, int[][]) - Method in class g2001_2100.s2008_maximum_earnings_from_taxi.Solution

maxTotalFruits(int[][], int, int) - Method in class g2101_2200.s2106_maximum_fruits_harvested_after_at_most_k_steps.Solution

maxTrailingZeros(int[][]) - Method in class g2201_2300.s2245_maximum_trailing_zeros_in_a_cornered_path.Solution

maxTurbulenceSize(int[]) - Method in class g0901_1000.s0978_longest_turbulent_subarray.Solution

maxTwoEvents(int[][]) - Method in class g2001_2100.s2054_two_best_non_overlapping_events.Solution

maxUncrossedLines(int[], int[]) - Method in class g1001_1100.s1035_uncrossed_lines.Solution

maxUniqueSplit(String) - Method in class g1501_1600.s1593_split_a_string_into_the_max_number_of_unique_substrings.Solution

maxValue(int[][], int) - Method in class g1701_1800.s1751_maximum_number_of_events_that_can_be_attended_ii.Solution

maxValue(int, int, int) - Method in class g1801_1900.s1802_maximum_value_at_a_given_index_in_a_bounded_array.Solution

maxValue(String, int) - Method in class g1801_1900.s1881_maximum_value_after_insertion.Solution

maxValueAfterReverse(int[]) - Method in class g1301_1400.s1330_reverse_subarray_to_maximize_array_value.Solution

maxValueOfCoins(List<List<Integer>>, int) - Method in class g2201_2300.s2218_maximum_value_of_k_coins_from_piles.Solution

maxVowels(String, int) - Method in class g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length.Solution

maxWidthOfVerticalArea(int[][]) - Method in class g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points.Solution

maxWidthRamp(int[]) - Method in class g0901_1000.s0962_maximum_width_ramp.Solution

mctFromLeafValues(int[]) - Method in class g1101_1200.s1130_minimum_cost_tree_from_leaf_values.Solution

MedianFinder - Class in g0201_0300.s0295_find_median_from_data_stream

295 - Find Median from Data Stream.

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

medianSlidingWindow(int[], int) - Method in class g0401_0500.s0480_sliding_window_median.Solution

memLeak(int, int) - Method in class g1801_1900.s1860_incremental_memory_leak.Solution

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

mergeAlternately(String, String) - Method in class g1701_1800.s1768_merge_strings_alternately.Solution

mergeArrays(int[][], int[][]) - Method in class g2501_2600.s2570_merge_two_2d_arrays_by_summing_values.Solution

mergeInBetween(ListNode, int, int, ListNode) - Method in class g1601_1700.s1669_merge_in_between_linked_lists.Solution

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

mergeNodes(ListNode) - Method in class g2101_2200.s2181_merge_nodes_in_between_zeros.Solution

mergeSimilarItems(int[][], int[][]) - Method in class g2301_2400.s2363_merge_similar_items.Solution

mergeStones(int[], int) - Method in class g0901_1000.s1000_minimum_cost_to_merge_stones.Solution

mergeTrees(TreeNode, TreeNode) - Method in class g0601_0700.s0617_merge_two_binary_trees.Solution

mergeTriplets(int[][], int[]) - Method in class g1801_1900.s1899_merge_triplets_to_form_target_triplet.Solution

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

miceAndCheese(int[], int[], int) - Method in class g2601_2700.s2611_mice_and_cheese.Solution

middleNode(ListNode) - Method in class g0801_0900.s0876_middle_of_the_linked_list.Solution

minAbsDifference(int[], int) - Method in class g1701_1800.s1755_closest_subsequence_sum.Solution

minAbsoluteDifference(List<Integer>, int) - Method in class g2801_2900.s2817_minimum_absolute_difference_between_elements_with_constraint.Solution

minAbsoluteSumDiff(int[], int[]) - Method in class g1801_1900.s1818_minimum_absolute_sum_difference.Solution

minAddToMakeValid(String) - Method in class g0901_1000.s0921_minimum_add_to_make_parentheses_valid.Solution

minAreaFreeRect(int[][]) - Method in class g0901_1000.s0963_minimum_area_rectangle_ii.Solution

minAreaRect(int[][]) - Method in class g0901_1000.s0939_minimum_area_rectangle.Solution

minBitFlips(int, int) - Method in class g2201_2300.s2220_minimum_bit_flips_to_convert_number.Solution

minCameraCover(TreeNode) - Method in class g0901_1000.s0968_binary_tree_cameras.Solution

minCapability(int[], int) - Method in class g2501_2600.s2560_house_robber_iv.Solution

minChanges(int[], int) - Method in class g1701_1800.s1787_make_the_xor_of_all_segments_equal_to_zero.Solution

minChanges(String) - Method in class g2901_3000.s2914_minimum_number_of_changes_to_make_binary_string_beautiful.Solution

minCharacters(String, String) - Method in class g1701_1800.s1737_change_minimum_characters_to_satisfy_one_of_three_conditions.Solution

minCost(int[][]) - Method in class g1301_1400.s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid.Solution

minCost(int[], int) - Method in class g2501_2600.s2547_minimum_cost_to_split_an_array.Solution

minCost(int[], int) - Method in class g2701_2800.s2735_collecting_chocolates.Solution

minCost(int[], int[]) - Method in class g2401_2500.s2448_minimum_cost_to_make_array_equal.Solution

minCost(int[], int[]) - Method in class g2501_2600.s2561_rearranging_fruits.Solution

minCost(int[], int[][], int, int) - Method in class g1401_1500.s1473_paint_house_iii.Solution

minCost(int[], int[], int[], int[]) - Method in class g2001_2100.s2087_minimum_cost_homecoming_of_a_robot_in_a_grid.Solution

minCost(int, int[]) - Method in class g1501_1600.s1547_minimum_cost_to_cut_a_stick.Solution

minCost(int, int[][], int[]) - Method in class g1901_2000.s1928_minimum_cost_to_reach_destination_in_time.Solution

minCost(String, int[]) - Method in class g1501_1600.s1578_minimum_time_to_make_rope_colorful.Solution

minCostClimbingStairs(int[]) - Method in class g0701_0800.s0746_min_cost_climbing_stairs.Solution

minCostConnectPoints(int[][]) - Method in class g1501_1600.s1584_min_cost_to_connect_all_points.Solution

minCostSetTime(int, int, int, int) - Method in class g2101_2200.s2162_minimum_cost_to_set_cooking_time.Solution

mincostTickets(int[], int[]) - Method in class g0901_1000.s0983_minimum_cost_for_tickets.Solution

mincostToHireWorkers(int[], int[], int) - Method in class g0801_0900.s0857_minimum_cost_to_hire_k_workers.Solution

minCostToMoveChips(int[]) - Method in class g1201_1300.s1217_minimum_cost_to_move_chips_to_the_same_position.Solution

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

minDays(int) - Method in class g1501_1600.s1553_minimum_number_of_days_to_eat_n_oranges.Solution

minDays(int[][]) - Method in class g1501_1600.s1568_minimum_number_of_days_to_disconnect_island.Solution

minDays(int[], int, int) - Method in class g1401_1500.s1482_minimum_number_of_days_to_make_m_bouquets.Solution

minDeletion(int[]) - Method in class g2201_2300.s2216_minimum_deletions_to_make_array_beautiful.Solution

minDeletions(String) - Method in class g1601_1700.s1647_minimum_deletions_to_make_character_frequencies_unique.Solution

minDeletionSize(String[]) - Method in class g0901_1000.s0944_delete_columns_to_make_sorted.Solution

minDeletionSize(String[]) - Method in class g0901_1000.s0955_delete_columns_to_make_sorted_ii.Solution

minDeletionSize(String[]) - Method in class g0901_1000.s0960_delete_columns_to_make_sorted_iii.Solution

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

minDifference(int[]) - Method in class g1501_1600.s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves.Solution

minDifference(int[], int[][]) - Method in class g1901_2000.s1906_minimum_absolute_difference_queries.Solution

minDifficulty(int[], int) - Method in class g1301_1400.s1335_minimum_difficulty_of_a_job_schedule.Solution

minDiffInBST(TreeNode) - Method in class g0701_0800.s0783_minimum_distance_between_bst_nodes.Solution

minDistance(int[], int) - Method in class g1401_1500.s1478_allocate_mailboxes.Solution

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

minDistance(String, String) - Method in class g0501_0600.s0583_delete_operation_for_two_strings.Solution

minDominoRotations(int[], int[]) - Method in class g1001_1100.s1007_minimum_domino_rotations_for_equal_row.Solution

minEatingSpeed(int[], int) - Method in class g0801_0900.s0875_koko_eating_bananas.Solution

minEdgeReversals(int, int[][]) - Method in class g2801_2900.s2858_minimum_edge_reversals_so_every_node_is_reachable.Solution

minElements(int[], int, int) - Method in class g1701_1800.s1785_minimum_elements_to_add_to_form_a_given_sum.Solution

minExtraChar(String, String[]) - Method in class g2701_2800.s2707_extra_characters_in_a_string.Solution

minFallingPathSum(int[][]) - Method in class g0901_1000.s0931_minimum_falling_path_sum.Solution

minFallingPathSum(int[][]) - Method in class g1201_1300.s1289_minimum_falling_path_sum_ii.Solution

minFlips(int[][]) - Method in class g1201_1300.s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix.Solution

minFlips(int, int, int) - Method in class g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c.Solution

minFlips(String) - Method in class g1501_1600.s1529_bulb_switcher_iv.Solution

minFlips(String) - Method in class g1801_1900.s1888_minimum_number_of_flips_to_make_the_binary_string_alternating.Solution

minFlipsMonoIncr(String) - Method in class g0901_1000.s0926_flip_string_to_monotone_increasing.Solution

minGroups(int[][]) - Method in class g2401_2500.s2406_divide_intervals_into_minimum_number_of_groups.Solution

minGroupsForValidAssignment(int[]) - Method in class g2901_3000.s2910_minimum_number_of_groups_to_create_a_valid_assignment.Solution

minHeightShelves(int[][], int) - Method in class g1101_1200.s1105_filling_bookcase_shelves.Solution

minimalKSum(int[], int) - Method in class g2101_2200.s2195_append_k_integers_with_minimal_sum.Solution

minimizeArrayValue(int[]) - Method in class g2401_2500.s2439_minimize_maximum_of_array.Solution

minimizeConcatenatedLength(String[]) - Method in class g2701_2800.s2746_decremental_string_concatenation.Solution

minimizedMaximum(int, int[]) - Method in class g2001_2100.s2064_minimized_maximum_of_products_distributed_to_any_store.Solution

minimizedStringLength(String) - Method in class g2701_2800.s2716_minimize_string_length.Solution

minimizeMax(int[], int) - Method in class g2601_2700.s2616_minimize_the_maximum_difference_of_pairs.Solution

minimizeResult(String) - Method in class g2201_2300.s2232_minimize_result_by_adding_parentheses_to_expression.Solution

minimizeSet(int, int, int, int) - Method in class g2501_2600.s2513_minimize_the_maximum_of_two_arrays.Solution

minimizeSum(int[]) - Method in class g2501_2600.s2567_minimum_score_by_changing_two_elements.Solution

minimizeTheDifference(int[][], int) - Method in class g1901_2000.s1981_minimize_the_difference_between_target_and_chosen_elements.Solution

minimizeXor(int, int) - Method in class g2401_2500.s2429_minimize_xor.Solution

minImpossibleOR(int[]) - Method in class g2501_2600.s2568_minimum_impossible_or.Solution

minimum() - Method in class g2001_2100.s2034_stock_price_fluctuation.StockPrice

minimumAbsDifference(int[]) - Method in class g1101_1200.s1200_minimum_absolute_difference.Solution

minimumAddedCoins(int[], int) - Method in class g2901_3000.s2952_minimum_number_of_coins_to_be_added.Solution

minimumArrayLength(int[]) - Method in class g3001_3100.s3012_minimize_length_of_array_using_operations.Solution

minimumAverageDifference(int[]) - Method in class g2201_2300.s2256_minimum_average_difference.Solution

minimumBeautifulSubstrings(String) - Method in class g2701_2800.s2767_partition_string_into_minimum_beautiful_substrings.Solution

minimumBoxes(int) - Method in class g1701_1800.s1739_building_boxes.Solution

minimumBuckets(String) - Method in class g2001_2100.s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses.Solution

minimumCardPickup(int[]) - Method in class g2201_2300.s2260_minimum_consecutive_cards_to_pick_up.Solution

minimumChanges(String, int) - Method in class g2901_3000.s2911_minimum_changes_to_make_k_semi_palindromes.Solution

minimumCoins(int[]) - Method in class g2901_3000.s2944_minimum_number_of_coins_for_fruits.Solution

minimumCost(int[]) - Method in class g2101_2200.s2144_minimum_cost_of_buying_candies_with_discount.Solution

minimumCost(int[]) - Method in class g2901_3000.s2967_minimum_cost_to_make_array_equalindromic.Solution

minimumCost(int[]) - Method in class g3001_3100.s3010_divide_an_array_into_subarrays_with_minimum_cost_i.Solution

minimumCost(int[], int[], int[][]) - Method in class g2601_2700.s2662_minimum_cost_of_a_path_with_special_roads.Solution

minimumCost(int[], int, int) - Method in class g3001_3100.s3013_divide_an_array_into_subarrays_with_minimum_cost_ii.Solution

minimumCost(String) - Method in class g2701_2800.s2712_minimum_cost_to_make_all_characters_equal.Solution

minimumCost(String, String, char[], char[], int[]) - Method in class g2901_3000.s2976_minimum_cost_to_convert_string_i.Solution

minimumCost(String, String, String[], String[], int[]) - Method in class g2901_3000.s2977_minimum_cost_to_convert_string_ii.Solution

minimumDeleteSum(String, String) - Method in class g0701_0800.s0712_minimum_ascii_delete_sum_for_two_strings.Solution

minimumDeletions(int[]) - Method in class g2001_2100.s2091_removing_minimum_and_maximum_from_array.Solution

minimumDeletions(String) - Method in class g1601_1700.s1653_minimum_deletions_to_make_string_balanced.Solution

minimumDeviation(int[]) - Method in class g1601_1700.s1675_minimize_deviation_in_array.Solution

minimumDifference(int[]) - Method in class g2001_2100.s2035_partition_array_into_two_arrays_to_minimize_sum_difference.Solution

minimumDifference(int[]) - Method in class g2101_2200.s2163_minimum_difference_in_sums_after_removal_of_elements.Solution

minimumDifference(int[], int) - Method in class g1901_2000.s1984_minimum_difference_between_highest_and_lowest_of_k_scores.Solution

minimumDistance(String) - Method in class g1301_1400.s1320_minimum_distance_to_type_a_word_using_two_fingers.Solution

minimumEffort(int[][]) - Method in class g1601_1700.s1665_minimum_initial_energy_to_finish_tasks.Solution

minimumEffortPath(int[][]) - Method in class g1601_1700.s1631_path_with_minimum_effort.Solution

minimumFinishTime(int[][], int, int) - Method in class g2101_2200.s2188_minimum_time_to_finish_the_race.Solution

minimumFuelCost(int[][], int) - Method in class g2401_2500.s2477_minimum_fuel_cost_to_report_to_the_capital.Solution

minimumHammingDistance(int[], int[], int[][]) - Method in class g1701_1800.s1722_minimize_hamming_distance_after_swap_operations.Solution

minimumIncompatibility(int[], int) - Method in class g1601_1700.s1681_minimum_incompatibility.Solution

minimumIndex(List<Integer>) - Method in class g2701_2800.s2780_minimum_index_of_a_valid_split.Solution

minimumJumps(int[], int, int, int) - Method in class g1601_1700.s1654_minimum_jumps_to_reach_home.Solution

minimumLength(String) - Method in class g1701_1800.s1750_minimum_length_of_string_after_deleting_similar_ends.Solution

minimumLengthEncoding(String[]) - Method in class g0801_0900.s0820_short_encoding_of_words.Solution

minimumLines(int[][]) - Method in class g2201_2300.s2280_minimum_lines_to_represent_a_line_chart.Solution

minimumMoney(int[][]) - Method in class g2401_2500.s2412_minimum_money_required_before_transactions.Solution

minimumMountainRemovals(int[]) - Method in class g1601_1700.s1671_minimum_number_of_removals_to_make_mountain_array.Solution

minimumMoves(int[][]) - Method in class g1201_1300.s1210_minimum_moves_to_reach_target_with_rotations.Solution

minimumMoves(int[][]) - Method in class g2801_2900.s2850_minimum_moves_to_spread_stones_over_grid.Solution

minimumMoves(String) - Method in class g2001_2100.s2027_minimum_moves_to_convert_string.Solution

minimumNumbers(int, int) - Method in class g2301_2400.s2310_sum_of_numbers_with_units_digit_k.Solution

minimumObstacles(int[][]) - Method in class g2201_2300.s2290_minimum_obstacle_removal_to_reach_corner.Solution

minimumOneBitOperations(int) - Method in class g1601_1700.s1611_minimum_one_bit_operations_to_make_integers_zero.Solution

minimumOperations(int[]) - Method in class g2101_2200.s2170_minimum_operations_to_make_the_array_alternating.Solution

minimumOperations(int[]) - Method in class g2301_2400.s2357_make_array_zero_by_subtracting_equal_amounts.Solution

minimumOperations(int[], int, int) - Method in class g2001_2100.s2059_minimum_operations_to_convert_number.Solution

minimumOperations(TreeNode) - Method in class g2401_2500.s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level.Solution

minimumOperations(String) - Method in class g2801_2900.s2844_minimum_operations_to_make_a_special_number.Solution

minimumOperations(List<Integer>) - Method in class g2801_2900.s2826_sorting_three_groups.Solution

minimumOperationsToMakeEqual(int, int) - Method in class g2901_3000.s2998_minimum_number_of_operations_to_make_x_and_y_equal.Solution

minimumPartition(String, int) - Method in class g2501_2600.s2522_partition_string_into_substrings_with_values_at_most_k.Solution

minimumPerimeter(long) - Method in class g1901_2000.s1954_minimum_garden_perimeter_to_collect_enough_apples.Solution

minimumPossibleSum(int, int) - Method in class g2801_2900.s2834_find_the_minimum_possible_sum_of_a_beautiful_array.Solution

minimumPushes(String) - Method in class g3001_3100.s3014_minimum_number_of_pushes_to_type_word_i.Solution

minimumPushes(String) - Method in class g3001_3100.s3016_minimum_number_of_pushes_to_type_word_ii.Solution

minimumRecolors(String, int) - Method in class g2301_2400.s2379_minimum_recolors_to_get_k_consecutive_black_blocks.Solution

minimumRefill(int[], int, int) - Method in class g2101_2200.s2105_watering_plants_ii.Solution

minimumRemoval(int[]) - Method in class g2101_2200.s2171_removing_minimum_number_of_magic_beans.Solution

minimumReplacement(int[]) - Method in class g2301_2400.s2366_minimum_replacements_to_sort_the_array.Solution

minimumRightShifts(List<Integer>) - Method in class g2801_2900.s2855_minimum_right_shifts_to_sort_the_array.Solution

minimumRounds(int[]) - Method in class g2201_2300.s2244_minimum_rounds_to_complete_all_tasks.Solution

minimumScore(int[], int[][]) - Method in class g2301_2400.s2322_minimum_score_after_removals_on_a_tree.Solution

minimumScore(String, String) - Method in class g2501_2600.s2565_subsequence_with_the_minimum_score.Solution

minimumSeconds(List<Integer>) - Method in class g2801_2900.s2808_minimum_seconds_to_equalize_a_circular_array.Solution

minimumSize(int[], int) - Method in class g1701_1800.s1760_minimum_limit_of_balls_in_a_bag.Solution

minimumSteps(String) - Method in class g2901_3000.s2938_separate_black_and_white_balls.Solution

minimumString(String, String, String) - Method in class g2701_2800.s2800_shortest_string_that_contains_three_strings.Solution

minimumSum(int) - Method in class g2101_2200.s2160_minimum_sum_of_four_digit_number_after_splitting_digits.Solution

minimumSum(int[]) - Method in class g2901_3000.s2908_minimum_sum_of_mountain_triplets_i.Solution

minimumSum(int[]) - Method in class g2901_3000.s2909_minimum_sum_of_mountain_triplets_ii.Solution

minimumSum(int, int) - Method in class g2801_2900.s2829_determine_the_minimum_sum_of_a_k_avoiding_array.Solution

minimumSwap(String, String) - Method in class g1201_1300.s1247_minimum_swaps_to_make_strings_equal.Solution

minimumTeachings(int, int[][], int[][]) - Method in class g1701_1800.s1733_minimum_number_of_people_to_teach.Solution

minimumTime(int[][]) - Method in class g2501_2600.s2577_minimum_time_to_visit_a_cell_in_a_grid.Solution

minimumTime(int[], int) - Method in class g2101_2200.s2187_minimum_time_to_complete_trips.Solution

minimumTime(int, int[][], int[]) - Method in class g2001_2100.s2050_parallel_courses_iii.Solution

minimumTime(String) - Method in class g2101_2200.s2167_minimum_time_to_remove_all_cars_containing_illegal_goods.Solution

minimumTime(List<Integer>, List<Integer>, int) - Method in class g2801_2900.s2809_minimum_time_to_make_array_sum_at_most_x.Solution

minimumTimeRequired(int[], int) - Method in class g1701_1800.s1723_find_minimum_time_to_finish_all_jobs.Solution

minimumTimeToInitialState(String, int) - Method in class g3001_3100.s3029_minimum_time_to_revert_word_to_initial_state_i.Solution

minimumTimeToInitialState(String, int) - Method in class g3001_3100.s3031_minimum_time_to_revert_word_to_initial_state_ii.Solution

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

minimumTotalCost(int[], int[]) - Method in class g2401_2500.s2499_minimum_total_cost_to_make_arrays_unequal.Solution

minimumTotalDistance(List<Integer>, int[][]) - Method in class g2401_2500.s2463_minimum_total_distance_traveled.Solution

minimumTotalPrice(int, int[][], int[], int[][]) - Method in class g2601_2700.s2646_minimize_the_total_price_of_the_trips.Solution

minimumVisitedCells(int[][]) - Method in class g2601_2700.s2617_minimum_number_of_visited_cells_in_a_grid.Solution

minimumWeight(int, int[][], int, int, int) - Method in class g2201_2300.s2203_minimum_weighted_subgraph_with_the_required_paths.Solution

minimumWhiteTiles(String, int, int) - Method in class g2201_2300.s2209_minimum_white_tiles_after_covering_with_carpets.Solution

minimumXORSum(int[], int[]) - Method in class g1801_1900.s1879_minimum_xor_sum_of_two_arrays.Solution

minIncrementForUnique(int[]) - Method in class g0901_1000.s0945_minimum_increment_to_make_array_unique.Solution

minIncrementOperations(int[], int) - Method in class g2901_3000.s2919_minimum_increment_operations_to_make_array_beautiful.Solution

minIncrements(int, int[]) - Method in class g2601_2700.s2673_make_costs_of_paths_equal_in_a_binary_tree.Solution

minInsertions(String) - Method in class g1301_1400.s1312_minimum_insertion_steps_to_make_a_string_palindrome.Solution

minInsertions(String) - Method in class g1501_1600.s1541_minimum_insertions_to_balance_a_parentheses_string.Solution

minInteger(String, int) - Method in class g1501_1600.s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits.Solution

minInterval(int[][], int[]) - Method in class g1801_1900.s1851_minimum_interval_to_include_each_query.Solution

minJumps(int[]) - Method in class g1301_1400.s1345_jump_game_iv.Solution

minKBitFlips(int[], int) - Method in class g0901_1000.s0995_minimum_number_of_k_consecutive_bit_flips.Solution

minLength(String) - Method in class g2601_2700.s2696_minimum_string_length_after_removing_substrings.Solution

minLengthAfterRemovals(List<Integer>) - Method in class g2801_2900.s2856_minimum_array_length_after_pair_removals.Solution

minMalwareSpread(int[][], int[]) - Method in class g0901_1000.s0924_minimize_malware_spread.Solution

minMalwareSpread(int[][], int[]) - Method in class g0901_1000.s0928_minimize_malware_spread_ii.Solution

minMaxDifference(int) - Method in class g2501_2600.s2566_maximum_difference_by_remapping_a_digit.Solution

minMaxGame(int[]) - Method in class g2201_2300.s2293_min_max_game.Solution

minMoves(int[]) - Method in class g0401_0500.s0453_minimum_moves_to_equal_array_elements.Solution

minMoves(int[], int) - Method in class g1601_1700.s1674_minimum_moves_to_make_array_complementary.Solution

minMoves(int[], int) - Method in class g1701_1800.s1703_minimum_adjacent_swaps_for_k_consecutive_ones.Solution

minMoves(int, int) - Method in class g2101_2200.s2139_minimum_moves_to_reach_target_score.Solution

minMoves2(int[]) - Method in class g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii.Solution

minMovesToCaptureTheQueen(int, int, int, int, int, int) - Method in class g3001_3100.s3001_minimum_moves_to_capture_the_queen.Solution

minMovesToMakePalindrome(String) - Method in class g2101_2200.s2193_minimum_number_of_moves_to_make_palindrome.Solution

minMovesToSeat(int[], int[]) - Method in class g2001_2100.s2037_minimum_number_of_moves_to_seat_everyone.Solution

minMutation(String, String, String[]) - Method in class g0401_0500.s0433_minimum_genetic_mutation.Solution

minNonZeroProduct(int) - Method in class g1901_2000.s1969_minimum_non_zero_product_of_the_array_elements.Solution

minNumber(int[], int[]) - Method in class g2601_2700.s2605_form_smallest_number_from_two_digit_arrays.Solution

minNumberOfFrogs(String) - Method in class g1401_1500.s1419_minimum_number_of_frogs_croaking.Solution

minNumberOfHours(int, int, int[], int[]) - Method in class g2301_2400.s2383_minimum_hours_of_training_to_win_a_competition.Solution

minNumberOfSemesters(int, int[][], int) - Method in class g1401_1500.s1494_parallel_courses_ii.Solution

minNumberOperations(int[]) - Method in class g1501_1600.s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array.Solution

minOperations(int) - Method in class g1501_1600.s1551_minimum_operations_to_make_array_equal.Solution

minOperations(int) - Method in class g2501_2600.s2571_minimum_operations_to_reduce_an_integer_to_0.Solution

minOperations(int[]) - Method in class g1501_1600.s1558_minimum_numbers_of_function_calls_to_make_target_array.Solution

minOperations(int[]) - Method in class g1801_1900.s1827_minimum_operations_to_make_the_array_increasing.Solution

minOperations(int[]) - Method in class g2001_2100.s2009_minimum_number_of_operations_to_make_array_continuous.Solution

minOperations(int[]) - Method in class g2601_2700.s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1.Solution

minOperations(int[]) - Method in class g2801_2900.s2870_minimum_number_of_operations_to_make_array_empty.Solution

minOperations(int[][], int) - Method in class g2001_2100.s2033_minimum_operations_to_make_a_uni_value_grid.Solution

minOperations(int[], int) - Method in class g1601_1700.s1658_minimum_operations_to_reduce_x_to_zero.Solution

minOperations(int[], int) - Method in class g2901_3000.s2997_minimum_number_of_operations_to_make_array_xor_equal_to_k.Solution

minOperations(int[], int) - Method in class g3001_3100.s3065_minimum_operations_to_exceed_threshold_value_i.Solution

minOperations(int[], int) - Method in class g3001_3100.s3066_minimum_operations_to_exceed_threshold_value_ii.Solution

minOperations(int[], int[]) - Method in class g1701_1800.s1713_minimum_operations_to_make_a_subsequence.Solution

minOperations(int[], int[]) - Method in class g1701_1800.s1775_equal_sum_arrays_with_minimum_number_of_operations.Solution

minOperations(int[], int[]) - Method in class g2301_2400.s2344_minimum_deletions_to_make_array_divisible.Solution

minOperations(int[], int[]) - Method in class g2601_2700.s2602_minimum_operations_to_make_all_array_elements_equal.Solution

minOperations(int[], int[]) - Method in class g2901_3000.s2934_minimum_operations_to_maximize_last_elements_in_arrays.Solution

minOperations(int[], int[], int) - Method in class g2501_2600.s2541_minimum_operations_to_make_array_equal_ii.Solution

minOperations(String) - Method in class g1701_1800.s1758_minimum_changes_to_make_alternating_binary_string.Solution

minOperations(String) - Method in class g1701_1800.s1769_minimum_number_of_operations_to_move_all_balls_to_each_box.Solution

minOperations(String[]) - Method in class g1501_1600.s1598_crawler_log_folder.Solution

minOperations(String, String, int) - Method in class g2801_2900.s2896_apply_operations_to_make_two_strings_equal.Solution

minOperations(List<Integer>, int) - Method in class g2801_2900.s2835_minimum_operations_to_form_subsequence_with_target_sum.Solution

minOperations(List<Integer>, int) - Method in class g2801_2900.s2869_minimum_operations_to_collect_elements.Solution

minOperationsMaxProfit(int[], int, int) - Method in class g1501_1600.s1599_maximum_profit_of_operating_a_centennial_wheel.Solution

minOperationsQueries(int, int[][], int[][]) - Method in class g2801_2900.s2846_minimum_edge_weight_equilibrium_queries_in_a_tree.Solution

minOperationsToFlip(String) - Method in class g1801_1900.s1896_minimum_cost_to_change_the_final_value_of_expression.Solution

minOrAfterOperations(int[], int) - Method in class g3001_3100.s3022_minimize_or_of_remaining_elements_using_operations.Solution

minPairSum(int[]) - Method in class g1801_1900.s1877_minimize_maximum_pair_sum_in_array.Solution

minPartitions(String) - Method in class g1601_1700.s1689_partitioning_into_minimum_number_of_deci_binary_numbers.Solution

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

minPathCost(int[][], int[][]) - Method in class g2301_2400.s2304_minimum_path_cost_in_a_grid.Solution

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

minProcessingTime(List<Integer>, List<Integer>) - Method in class g2801_2900.s2895_minimum_processing_time.Solution

minPushBox(char[][]) - Method in class g1201_1300.s1263_minimum_moves_to_move_a_box_to_their_target_location.Solution

minRefuelStops(int, int, int[][]) - Method in class g0801_0900.s0871_minimum_number_of_refueling_stops.Solution

minRemoveToMakeValid(String) - Method in class g1201_1300.s1249_minimum_remove_to_make_valid_parentheses.Solution

minReorder(int, int[][]) - Method in class g1401_1500.s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero.Solution

minReverseOperations(int, int, int[], int) - Method in class g2601_2700.s2612_minimum_reverse_operations.Solution

minScore(int, int[][]) - Method in class g2401_2500.s2492_minimum_score_of_a_path_between_two_cities.Solution

minScoreTriangulation(int[]) - Method in class g1001_1100.s1039_minimum_score_triangulation_of_polygon.Solution

minSessions(int[], int) - Method in class g1901_2000.s1986_minimum_number_of_work_sessions_to_finish_the_tasks.Solution

minSetSize(int[]) - Method in class g1301_1400.s1338_reduce_array_size_to_the_half.Solution

minSideJumps(int[]) - Method in class g1801_1900.s1824_minimum_sideway_jumps.Solution

minSizeSubarray(int[], int) - Method in class g2801_2900.s2875_minimum_size_subarray_in_infinite_array.Solution

minSkips(int[], int, int) - Method in class g1801_1900.s1883_minimum_skips_to_arrive_at_meeting_on_time.Solution

minSpaceWastedKResizing(int[], int) - Method in class g1901_2000.s1959_minimum_total_space_wasted_with_k_resizing_operations.Solution

minSpeedOnTime(int[], double) - Method in class g1801_1900.s1870_minimum_speed_to_arrive_on_time.Solution

MinStack - Class in g0101_0200.s0155_min_stack

155 - Min Stack.

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

minStartValue(int[]) - Method in class g1401_1500.s1413_minimum_value_to_get_positive_step_by_step_sum.Solution

minSteps(int) - Method in class g0601_0700.s0650_2_keys_keyboard.Solution

minSteps(String, String) - Method in class g1301_1400.s1347_minimum_number_of_steps_to_make_two_strings_anagram.Solution

minSteps(String, String) - Method in class g2101_2200.s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii.Solution

minStickers(String[], String) - Method in class g0601_0700.s0691_stickers_to_spell_word.Solution

minStoneSum(int[], int) - Method in class g1901_2000.s1962_remove_stones_to_minimize_the_total.Solution

minSubarray(int[], int) - Method in class g1501_1600.s1590_make_sum_divisible_by_p.Solution

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

minSubsequence(int[]) - Method in class g1401_1500.s1403_minimum_subsequence_in_non_increasing_order.Solution

minSum(int[], int[]) - Method in class g2901_3000.s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros.Solution

minSumOfLengths(int[], int) - Method in class g1401_1500.s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum.Solution

minSumSquareDiff(int[], int[], int, int) - Method in class g2301_2400.s2333_minimum_sum_of_squared_difference.Solution

minSwap(int[], int[]) - Method in class g0801_0900.s0801_minimum_swaps_to_make_sequences_increasing.Solution

minSwaps(int[]) - Method in class g2101_2200.s2134_minimum_swaps_to_group_all_1s_together_ii.Solution

minSwaps(int[][]) - Method in class g1501_1600.s1536_minimum_swaps_to_arrange_a_binary_grid.Solution

minSwaps(String) - Method in class g1801_1900.s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating.Solution

minSwaps(String) - Method in class g1901_2000.s1963_minimum_number_of_swaps_to_make_the_string_balanced.Solution

minSwapsCouples(int[]) - Method in class g0701_0800.s0765_couples_holding_hands.Solution

minTaps(int, int[]) - Method in class g1301_1400.s1326_minimum_number_of_taps_to_open_to_water_a_garden.Solution

minTime(int, int[][], List<Boolean>) - Method in class g1401_1500.s1443_minimum_time_to_collect_all_apples_in_a_tree.Solution

minTimeToType(String) - Method in class g1901_2000.s1974_minimum_time_to_type_word_using_special_typewriter.Solution

minTimeToVisitAllPoints(int[][]) - Method in class g1201_1300.s1266_minimum_time_visiting_all_points.Solution

minTrioDegree(int, int[][]) - Method in class g1701_1800.s1761_minimum_degree_of_a_connected_trio_in_a_graph.Solution

minWastedSpace(int[], int[][]) - Method in class g1801_1900.s1889_minimum_space_wasted_from_packaging.Solution

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

mirrorReflection(int, int) - Method in class g0801_0900.s0858_mirror_reflection.Solution

missingInteger(int[]) - Method in class g2901_3000.s2996_smallest_missing_integer_greater_than_sequential_prefix_sum.Solution

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

missingRolls(int[], int, int) - Method in class g2001_2100.s2028_find_missing_observations.Solution

MKAverage - Class in g1801_1900.s1825_finding_mk_average

1825 - Finding MK Average.

MKAverage(int, int) - Constructor for class g1801_1900.s1825_finding_mk_average.MKAverage

modifiedGraphEdges(int, int[][], int, int, int) - Method in class g2601_2700.s2699_modify_graph_edge_weights.Solution

modifiedMatrix(int[][]) - Method in class g3001_3100.s3033_modify_the_matrix.Solution

modifyString(String) - Method in class g1501_1600.s1576_replace_all_s_to_avoid_consecutive_repeating_characters.Solution

monkeyMove(int) - Method in class g2501_2600.s2550_count_collisions_of_monkeys_on_a_polygon.Solution

monotoneIncreasingDigits(int) - Method in class g0701_0800.s0738_monotone_increasing_digits.Solution

mostBooked(int, int[][]) - Method in class g2401_2500.s2402_meeting_rooms_iii.Solution

mostCommonWord(String, String[]) - Method in class g0801_0900.s0819_most_common_word.Solution

mostCompetitive(int[], int) - Method in class g1601_1700.s1673_find_the_most_competitive_subsequence.Solution

mostFrequent(int[], int) - Method in class g2101_2200.s2190_most_frequent_number_following_key_in_an_array.Solution

mostFrequentEven(int[]) - Method in class g2401_2500.s2404_most_frequent_even_element.Solution

mostFrequentPrime(int[][]) - Method in class g3001_3100.s3044_most_frequent_prime.Solution

mostPoints(int[][]) - Method in class g2101_2200.s2140_solving_questions_with_brainpower.Solution

mostPopularCreator(String[], String[], int[]) - Method in class g2401_2500.s2456_most_popular_video_creator.Solution

mostProfitablePath(int[][], int, int[]) - Method in class g2401_2500.s2467_most_profitable_path_in_a_tree.Solution

mostVisited(int, int[]) - Method in class g1501_1600.s1560_most_visited_sector_in_a_circular_track.Solution

mostWordsFound(String[]) - Method in class g2101_2200.s2114_maximum_number_of_words_found_in_sentences.Solution

movesToChessboard(int[][]) - Method in class g0701_0800.s0782_transform_to_chessboard.Solution

movesToMakeZigzag(int[]) - Method in class g1101_1200.s1144_decrease_elements_to_make_array_zigzag.Solution

movesToStamp(String, String) - Method in class g0901_1000.s0936_stamping_the_sequence.Solution

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

MovieRentingSystem - Class in g1901_2000.s1912_design_movie_rental_system

1912 - Design Movie Rental System.

MovieRentingSystem(int, int[][]) - Constructor for class g1901_2000.s1912_design_movie_rental_system.MovieRentingSystem

multAll(int) - Method in class g1601_1700.s1622_fancy_sequence.Fancy

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

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

MyCalendar - Class in g0701_0800.s0729_my_calendar_i

729 - My Calendar I.

MyCalendar() - Constructor for class g0701_0800.s0729_my_calendar_i.MyCalendar

MyCalendarThree - Class in g0701_0800.s0732_my_calendar_iii

732 - My Calendar III.

MyCalendarThree() - Constructor for class g0701_0800.s0732_my_calendar_iii.MyCalendarThree

MyCalendarTwo - Class in g0701_0800.s0731_my_calendar_ii

731 - My Calendar II.

MyCalendarTwo() - Constructor for class g0701_0800.s0731_my_calendar_ii.MyCalendarTwo

MyCircularDeque - Class in g0601_0700.s0641_design_circular_deque

641 - Design Circular Deque.

MyCircularDeque(int) - Constructor for class g0601_0700.s0641_design_circular_deque.MyCircularDeque

MyCircularQueue - Class in g0601_0700.s0622_design_circular_queue

622 - Design Circular Queue.

MyCircularQueue(int) - Constructor for class g0601_0700.s0622_design_circular_queue.MyCircularQueue

MyHashMap - Class in g0701_0800.s0706_design_hashmap

706 - Design HashMap.

MyHashMap() - Constructor for class g0701_0800.s0706_design_hashmap.MyHashMap

MyHashSet - Class in g0701_0800.s0705_design_hashset

705 - Design HashSet.

MyHashSet() - Constructor for class g0701_0800.s0705_design_hashset.MyHashSet

MyLinkedList - Class in g0701_0800.s0707_design_linked_list

707 - Design Linked List.

MyLinkedList() - Constructor for class g0701_0800.s0707_design_linked_list.MyLinkedList

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

MyQueue - Class in g0201_0300.s0232_implement_queue_using_stacks

232 - 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

225 - Implement Stack using Queues.

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

N

nearestExit(char[][], int[]) - Method in class g1901_2000.s1926_nearest_exit_from_entrance_in_maze.Solution

nearestPalindromic(String) - Method in class g0501_0600.s0564_find_the_closest_palindrome.Solution

nearestValidPoint(int, int, int[][]) - Method in class g1701_1800.s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate.Solution

neighbors - Variable in class com_github_leetcode.Node

NestedInteger - Class in com_github_leetcode

NestedInteger() - Constructor for class com_github_leetcode.NestedInteger

NestedInteger(Integer) - Constructor for class com_github_leetcode.NestedInteger

NestedInteger(List<NestedInteger>) - Constructor for class com_github_leetcode.NestedInteger

NestedIterator - Class in g0301_0400.s0341_flatten_nested_list_iterator

341 - Flatten Nested List Iterator.

NestedIterator(List<NestedInteger>) - Constructor for class g0301_0400.s0341_flatten_nested_list_iterator.NestedIterator

networkBecomesIdle(int[][], int[]) - Method in class g2001_2100.s2039_the_time_when_the_network_becomes_idle.Solution

networkDelayTime(int[][], int, int) - Method in class g0701_0800.s0743_network_delay_time.Solution

new21Game(int, int, int) - Method in class g0801_0900.s0837_new_21_game.Solution

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 - Variable in class g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node

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

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

next() - Method in class g0301_0400.s0341_flatten_nested_list_iterator.NestedIterator

next() - Method in class g1201_1300.s1286_iterator_for_combination.CombinationIterator

next(int) - Method in class g0801_0900.s0900_rle_iterator.RLEIterator

next(int) - Method in class g0901_1000.s0901_online_stock_span.StockSpanner

nextBeautifulNumber(int) - Method in class g2001_2100.s2048_next_greater_numerically_balanced_number.Solution

nextGreaterElement(int) - Method in class g0501_0600.s0556_next_greater_element_iii.Solution

nextGreaterElement(int[], int[]) - Method in class g0401_0500.s0496_next_greater_element_i.Solution

nextGreaterElements(int[]) - Method in class g0501_0600.s0503_next_greater_element_ii.Solution

nextGreatestLetter(char[], char) - Method in class g0701_0800.s0744_find_smallest_letter_greater_than_target.Solution

nextLargerNodes(ListNode) - Method in class g1001_1100.s1019_next_greater_node_in_linked_list.Solution

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 g0401_0500.s0427_construct_quad_tree

427 - Construct Quad Tree.

Node - Class in g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list

430 - Flatten a Multilevel Doubly Linked List.

Node - Class in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees

558 - Logical OR of Two Binary Grids Represented as Quad-Trees.

Node() - Constructor for class com_github_leetcode.Node

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

Node() - Constructor for class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

Node(boolean, boolean) - Constructor for class g0401_0500.s0427_construct_quad_tree.Node

Node(boolean, boolean) - Constructor for class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

Node(boolean, boolean, Node, Node, Node, Node) - Constructor for class g0401_0500.s0427_construct_quad_tree.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) - Constructor for class g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.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

nodesBetweenCriticalPoints(ListNode) - Method in class g2001_2100.s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points.Solution

nthMagicalNumber(int, int, int) - Method in class g0801_0900.s0878_nth_magical_number.Solution

nthPersonGetsNthSeat(int) - Method in class g1201_1300.s1227_airplane_seat_assignment_probability.Solution

nthSuperUglyNumber(int, int[]) - Method in class g0301_0400.s0313_super_ugly_number.Solution

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

nthUglyNumber(int, int, int, int) - Method in class g1201_1300.s1201_ugly_number_iii.Solution

NumArray - Class in g0301_0400.s0303_range_sum_query_immutable

303 - Range Sum Query - Immutable.

NumArray - Class in g0301_0400.s0307_range_sum_query_mutable

307 - Range Sum Query - Mutable.

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

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

number(IntConsumer) - Method in class g1101_1200.s1195_fizz_buzz_multithreaded.FizzBuzz

NumberContainers - Class in g2301_2400.s2349_design_a_number_container_system

2349 - Design a Number Container System.

NumberContainers() - Constructor for class g2301_2400.s2349_design_a_number_container_system.NumberContainers

numberGame(int[]) - Method in class g2901_3000.s2974_minimum_number_game.Solution

numberOfArithmeticSlices(int[]) - Method in class g0401_0500.s0413_arithmetic_slices.Solution

numberOfArithmeticSlices(int[]) - Method in class g0401_0500.s0446_arithmetic_slices_ii_subsequence.Solution

numberOfArrays(int[], int, int) - Method in class g2101_2200.s2145_count_the_hidden_sequences.Solution

numberOfArrays(String, int) - Method in class g1401_1500.s1416_restore_the_array.Solution

numberOfBeams(String[]) - Method in class g2101_2200.s2125_number_of_laser_beams_in_a_bank.Solution

numberOfBeautifulIntegers(int, int, int) - Method in class g2801_2900.s2827_number_of_beautiful_integers_in_the_range.Solution

numberOfBoomerangs(int[][]) - Method in class g0401_0500.s0447_number_of_boomerangs.Solution

numberOfCombinations(String) - Method in class g1901_2000.s1977_number_of_ways_to_separate_numbers.Solution

numberOfCuts(int) - Method in class g2401_2500.s2481_minimum_cuts_to_divide_a_circle.Solution

numberOfEmployeesWhoMetTarget(int[], int) - Method in class g2701_2800.s2798_number_of_employees_who_met_the_target.Solution

numberOfGoodPartitions(int[]) - Method in class g2901_3000.s2963_count_the_number_of_good_partitions.Solution

numberOfGoodPaths(int[], int[][]) - Method in class g2401_2500.s2421_number_of_good_paths.Solution

numberOfGoodSubarraySplits(int[]) - Method in class g2701_2800.s2750_ways_to_split_array_into_good_subarrays.Solution

numberOfGoodSubsets(int[]) - Method in class g1901_2000.s1994_the_number_of_good_subsets.Solution

numberOfLines(int[], String) - Method in class g0801_0900.s0806_number_of_lines_to_write_string.Solution

numberOfMatches(int) - Method in class g1601_1700.s1688_count_of_matches_in_tournament.Solution

numberOfPairs(int[]) - Method in class g2301_2400.s2341_maximum_number_of_pairs_in_array.Solution

numberOfPairs(int[][]) - Method in class g3001_3100.s3025_find_the_number_of_ways_to_place_people_i.Solution

numberOfPairs(int[][]) - Method in class g3001_3100.s3027_find_the_number_of_ways_to_place_people_ii.Solution

numberOfPairs(int[], int[], int) - Method in class g2401_2500.s2426_number_of_pairs_satisfying_inequality.Solution

numberOfPaths(int[][], int) - Method in class g2401_2500.s2435_paths_in_matrix_whose_sum_is_divisible_by_k.Solution

numberOfPoints(List<List<Integer>>) - Method in class g2801_2900.s2848_points_that_intersect_with_cars.Solution

numberOfPowerfulInt(long, long, int, String) - Method in class g2901_3000.s2999_count_the_number_of_powerful_integers.Solution

numberOfRounds(String, String) - Method in class g1901_2000.s1904_the_number_of_full_rounds_you_have_played.Solution

numberOfSequence(int, int[]) - Method in class g2901_3000.s2954_count_the_number_of_infection_sequences.Solution

numberOfSets(int, int) - Method in class g1601_1700.s1621_number_of_sets_of_k_non_overlapping_line_segments.Solution

numberOfSets(int, int, int[][]) - Method in class g2901_3000.s2959_number_of_possible_sets_of_closing_branches.Solution

numberOfSteps(int) - Method in class g1301_1400.s1342_number_of_steps_to_reduce_a_number_to_zero.Solution

numberOfSubarrays(int[], int) - Method in class g1201_1300.s1248_count_number_of_nice_subarrays.Solution

numberOfSubstrings(String) - Method in class g1301_1400.s1358_number_of_substrings_containing_all_three_characters.Solution

numberOfUniqueGoodSubsequences(String) - Method in class g1901_2000.s1987_number_of_unique_good_subsequences.Solution

numberOfWays(int, int) - Method in class g2701_2800.s2787_ways_to_express_an_integer_as_sum_of_powers.Solution

numberOfWays(int, int, int) - Method in class g2301_2400.s2400_number_of_ways_to_reach_a_position_after_exactly_k_steps.Solution

numberOfWays(String) - Method in class g2101_2200.s2147_number_of_ways_to_divide_a_long_corridor.Solution

numberOfWays(String) - Method in class g2201_2300.s2222_number_of_ways_to_select_buildings.Solution

numberOfWays(String, String, long) - Method in class g2801_2900.s2851_string_transformation.Solution

numberOfWeakCharacters(int[][]) - Method in class g1901_2000.s1996_the_number_of_weak_characters_in_the_game.Solution

numberOfWeeks(int[]) - Method in class g1901_2000.s1953_maximum_number_of_weeks_for_which_you_can_work.Solution

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

numberWays(List<List<Integer>>) - Method in class g1401_1500.s1434_number_of_ways_to_wear_different_hats_to_each_other.Solution

numBusesToDestination(int[][], int, int) - Method in class g0801_0900.s0815_bus_routes.Solution

numComponents(ListNode, int[]) - Method in class g0801_0900.s0817_linked_list_components.Solution

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

numDecodings(String) - Method in class g0601_0700.s0639_decode_ways_ii.Solution

numDifferentIntegers(String) - Method in class g1801_1900.s1805_number_of_different_integers_in_a_string.Solution

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

numDupDigitsAtMostN(int) - Method in class g1001_1100.s1012_numbers_with_repeated_digits.Solution

numEnclaves(int[][]) - Method in class g1001_1100.s1020_number_of_enclaves.Solution

numEquivDominoPairs(int[][]) - Method in class g1101_1200.s1128_number_of_equivalent_domino_pairs.Solution

numFactoredBinaryTrees(int[]) - Method in class g0801_0900.s0823_binary_trees_with_factors.Solution

numFriendRequests(int[]) - Method in class g0801_0900.s0825_friends_of_appropriate_ages.Solution

numIdenticalPairs(int[]) - Method in class g1501_1600.s1512_number_of_good_pairs.Solution

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

numJewelsInStones(String, String) - Method in class g0701_0800.s0771_jewels_and_stones.Solution

numMagicSquaresInside(int[][]) - Method in class g0801_0900.s0840_magic_squares_in_grid.Solution

numMatchingSubseq(String, String[]) - Method in class g0701_0800.s0792_number_of_matching_subsequences.Solution

NumMatrix - Class in g0301_0400.s0304_range_sum_query_2d_immutable

304 - Range Sum Query 2D - Immutable.

NumMatrix(int[][]) - Constructor for class g0301_0400.s0304_range_sum_query_2d_immutable.NumMatrix

numMovesStones(int, int, int) - Method in class g1001_1100.s1033_moving_stones_until_consecutive.Solution

numMovesStonesII(int[]) - Method in class g1001_1100.s1040_moving_stones_until_consecutive_ii.Solution

numMusicPlaylists(int, int, int) - Method in class g0901_1000.s0920_number_of_music_playlists.Solution

numOfArrays(int, int, int) - Method in class g1401_1500.s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons.Solution

numOfBurgers(int, int) - Method in class g1201_1300.s1276_number_of_burgers_with_no_waste_of_ingredients.Solution

numOfMinutes(int, int, int[], int[]) - Method in class g1301_1400.s1376_time_needed_to_inform_all_employees.Solution

numOfPairs(String[], String) - Method in class g2001_2100.s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target.Solution

numOfStrings(String[], String) - Method in class g1901_2000.s1967_number_of_strings_that_appear_as_substrings_in_word.Solution

numOfSubarrays(int[]) - Method in class g1501_1600.s1524_number_of_sub_arrays_with_odd_sum.Solution

numOfSubarrays(int[], int, int) - Method in class g1301_1400.s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold.Solution

numOfWays(int) - Method in class g1401_1500.s1411_number_of_ways_to_paint_n_3_grid.Solution

numOfWays(int[]) - Method in class g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution

numPairsDivisibleBy60(int[]) - Method in class g1001_1100.s1010_pairs_of_songs_with_total_durations_divisible_by_60.Solution

numPermsDISequence(String) - Method in class g0901_1000.s0903_valid_permutations_for_di_sequence.Solution

numPoints(int[][], int) - Method in class g1401_1500.s1453_maximum_number_of_darts_inside_of_a_circular_dartboard.Solution

numPrimeArrangements(int) - Method in class g1101_1200.s1175_prime_arrangements.Solution

numRabbits(int[]) - Method in class g0701_0800.s0781_rabbits_in_forest.Solution

numRescueBoats(int[], int) - Method in class g0801_0900.s0881_boats_to_save_people.Solution

numRollsToTarget(int, int, int) - Method in class g1101_1200.s1155_number_of_dice_rolls_with_target_sum.Solution

numRookCaptures(char[][]) - Method in class g0901_1000.s0999_available_captures_for_rook.Solution

numSimilarGroups(String[]) - Method in class g0801_0900.s0839_similar_string_groups.Solution

numSmallerByFrequency(String[], String[]) - Method in class g1101_1200.s1170_compare_strings_by_frequency_of_the_smallest_character.Solution

numSpecial(int[][]) - Method in class g1501_1600.s1582_special_positions_in_a_binary_matrix.Solution

numSpecialEquivGroups(String[]) - Method in class g0801_0900.s0893_groups_of_special_equivalent_strings.Solution

numSplits(String) - Method in class g1501_1600.s1525_number_of_good_ways_to_split_a_string.Solution

numSquarefulPerms(int[]) - Method in class g0901_1000.s0996_number_of_squareful_arrays.Solution

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

numsSameConsecDiff(int, int) - Method in class g0901_1000.s0967_numbers_with_same_consecutive_differences.Solution

numSteps(String) - Method in class g1401_1500.s1404_number_of_steps_to_reduce_a_number_in_binary_representation_to_one.Solution

numSub(String) - Method in class g1501_1600.s1513_number_of_substrings_with_only_1s.Solution

numSubarrayBoundedMax(int[], int, int) - Method in class g0701_0800.s0795_number_of_subarrays_with_bounded_maximum.Solution

numSubarrayProductLessThanK(int[], int) - Method in class g0701_0800.s0713_subarray_product_less_than_k.Solution

numSubarraysWithSum(int[], int) - Method in class g0901_1000.s0930_binary_subarrays_with_sum.Solution

numSubmat(int[][]) - Method in class g1501_1600.s1504_count_submatrices_with_all_ones.Solution

numSubmatrixSumTarget(int[][], int) - Method in class g1001_1100.s1074_number_of_submatrices_that_sum_to_target.Solution

numSubseq(int[], int) - Method in class g1401_1500.s1498_number_of_subsequences_that_satisfy_the_given_sum_condition.Solution

numTeams(int[]) - Method in class g1301_1400.s1395_count_number_of_teams.Solution

numTilePossibilities(String) - Method in class g1001_1100.s1079_letter_tile_possibilities.Solution

numTilings(int) - Method in class g0701_0800.s0790_domino_and_tromino_tiling.Solution

numTimesAllBlue(int[]) - Method in class g1301_1400.s1375_number_of_times_binary_string_is_prefix_aligned.Solution

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

numTriplets(int[], int[]) - Method in class g1501_1600.s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers.Solution

numUniqueEmails(String[]) - Method in class g0901_1000.s0929_unique_email_addresses.Solution

numWaterBottles(int, int) - Method in class g1501_1600.s1518_water_bottles.Solution

numWays(int, int) - Method in class g1201_1300.s1269_number_of_ways_to_stay_in_the_same_place_after_some_steps.Solution

numWays(String) - Method in class g1501_1600.s1573_number_of_ways_to_split_a_string.Solution

numWays(String[], String) - Method in class g1601_1700.s1639_number_of_ways_to_form_a_target_string_given_a_dictionary.Solution

O

odd(IntConsumer) - Method in class g1101_1200.s1116_print_zero_even_odd.ZeroEvenOdd

oddCells(int, int, int[][]) - Method in class g1201_1300.s1252_cells_with_odd_values_in_a_matrix.Solution

oddEvenJumps(int[]) - Method in class g0901_1000.s0975_odd_even_jump.Solution

oddEvenList(ListNode) - Method in class g0301_0400.s0328_odd_even_linked_list.Solution

oddString(String[]) - Method in class g2401_2500.s2451_odd_string_difference.Solution

one() - Method in class g2101_2200.s2166_design_bitset.Bitset

onesMinusZeros(int[][]) - Method in class g2401_2500.s2482_difference_between_ones_and_zeros_in_row_and_column.Solution

openLock(String[], String) - Method in class g0701_0800.s0752_open_the_lock.Solution

optimalDivision(int[]) - Method in class g0501_0600.s0553_optimal_division.Solution

orangesRotting(int[][]) - Method in class g0901_1000.s0994_rotting_oranges.Solution

OrderedStream - Class in g1601_1700.s1656_design_an_ordered_stream

1656 - Design an Ordered Stream.

OrderedStream(int) - Constructor for class g1601_1700.s1656_design_an_ordered_stream.OrderedStream

orderlyQueue(String, int) - Method in class g0801_0900.s0899_orderly_queue.Solution

orderOfLargestPlusSign(int, int[][]) - Method in class g0701_0800.s0764_largest_plus_sign.Solution

originalDigits(String) - Method in class g0401_0500.s0423_reconstruct_original_digits_from_english.Solution

outerTrees(int[][]) - Method in class g0501_0600.s0587_erect_the_fence.Solution

oxygen(Runnable) - Method in class g1101_1200.s1117_building_h2o.H2O

OxygenRunnable(H2O) - Constructor for class g1101_1200.s1117_building_h2o.H2O.OxygenRunnable

P

P - Static variable in class g1901_2000.s1931_painting_a_grid_with_three_different_colors.Solution

pacificAtlantic(int[][]) - Method in class g0401_0500.s0417_pacific_atlantic_water_flow.Solution

paintWalls(int[], int[]) - Method in class g2701_2800.s2742_painting_the_walls.Solution

pairSum(ListNode) - Method in class g2101_2200.s2130_maximum_twin_sum_of_a_linked_list.Solution

palindromePairs(String[]) - Method in class g0301_0400.s0336_palindrome_pairs.Solution

palindromePartition(String, int) - Method in class g1201_1300.s1278_palindrome_partitioning_iii.Solution

pancakeSort(int[]) - Method in class g0901_1000.s0969_pancake_sorting.Solution

ParkingSystem - Class in g1601_1700.s1603_design_parking_system

1603 - Design Parking System.

ParkingSystem(int, int, int) - Constructor for class g1601_1700.s1603_design_parking_system.ParkingSystem

parseBoolExpr(String) - Method in class g1101_1200.s1106_parsing_a_boolean_expression.Solution

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

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

partitionArray(int[], int) - Method in class g2201_2300.s2294_partition_array_such_that_maximum_difference_is_k.Solution

partitionDisjoint(int[]) - Method in class g0901_1000.s0915_partition_array_into_disjoint_intervals.Solution

partitionLabels(String) - Method in class g0701_0800.s0763_partition_labels.Solution

partitionString(String) - Method in class g2401_2500.s2405_optimal_partition_of_string.Solution

passThePillow(int, int) - Method in class g2501_2600.s2582_pass_the_pillow.Solution

pathInZigZagTree(int) - Method in class g1101_1200.s1104_path_in_zigzag_labelled_binary_tree.Solution

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

pathSum(TreeNode, int) - Method in class g0401_0500.s0437_path_sum_iii.Solution

pathsWithMaxScore(List<String>) - Method in class g1301_1400.s1301_number_of_paths_with_max_score.Solution

peakIndexInMountainArray(int[]) - Method in class g0801_0900.s0852_peak_index_in_a_mountain_array.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

284 - Peeking Iterator.

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

peopleAwareOfSecret(int, int, int) - Method in class g2301_2400.s2327_number_of_people_aware_of_a_secret.Solution

peopleIndexes(List<List<String>>) - Method in class g1401_1500.s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list.Solution

percentageLetter(String, char) - Method in class g2201_2300.s2278_percentage_of_letter_in_string.Solution

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

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

pick() - Method in class g0401_0500.s0497_random_point_in_non_overlapping_rectangles.Solution

pick() - Method in class g0701_0800.s0710_random_pick_with_blacklist.Solution

pick(int) - Method in class g0301_0400.s0398_random_pick_index.Solution

pickGifts(int[], int) - Method in class g2501_2600.s2558_take_gifts_from_the_richest_pile.Solution

pickIndex() - Method in class g0501_0600.s0528_random_pick_with_weight.Solution

ping(int) - Method in class g0901_1000.s0933_number_of_recent_calls.RecentCounter

pivotArray(int[], int) - Method in class g2101_2200.s2161_partition_array_according_to_given_pivot.Solution

pivotIndex(int[]) - Method in class g0701_0800.s0724_find_pivot_index.Solution

pivotInteger(int) - Method in class g2401_2500.s2485_find_the_pivot_integer.Solution

placedCoins(int[][], int[]) - Method in class g2901_3000.s2973_find_number_of_coins_to_place_in_tree_nodes.Solution

placeWordInCrossword(char[][], String) - Method in class g2001_2100.s2018_check_if_word_can_be_placed_in_crossword.Solution

platesBetweenCandles(String, int[][]) - Method in class g2001_2100.s2055_plates_between_candles.Solution

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

poorPigs(int, int, int) - Method in class g0401_0500.s0458_poor_pigs.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

pop() - Method in class g0801_0900.s0895_maximum_frequency_stack.FreqStack

pop() - Method in class g1101_1200.s1172_dinner_plate_stacks.DinnerPlates

pop() - Method in class g1301_1400.s1381_design_a_stack_with_increment_operation.CustomStack

popAtStack(int) - Method in class g1101_1200.s1172_dinner_plate_stacks.DinnerPlates

popBack() - Method in class g1601_1700.s1670_design_front_middle_back_queue.FrontMiddleBackQueue

popFront() - Method in class g1601_1700.s1670_design_front_middle_back_queue.FrontMiddleBackQueue

popMiddle() - Method in class g1601_1700.s1670_design_front_middle_back_queue.FrontMiddleBackQueue

popSmallest() - Method in class g2301_2400.s2336_smallest_number_in_infinite_set.SmallestInfiniteSet

possibleBipartition(int, int[][]) - Method in class g0801_0900.s0886_possible_bipartition.Solution

possibleToStamp(int[][], int, int) - Method in class g2101_2200.s2132_stamping_the_grid.Solution

possiblyEquals(String, String) - Method in class g2001_2100.s2060_check_if_an_original_string_exists_given_two_encoded_strings.Solution

postorder(Node) - Method in class g0501_0600.s0590_n_ary_tree_postorder_traversal.Solution

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

postTweet(int, int) - Method in class g0301_0400.s0355_design_twitter.Twitter

powerfulIntegers(int, int, int) - Method in class g0901_1000.s0970_powerful_integers.Solution

predictPartyVictory(String) - Method in class g0601_0700.s0649_dota2_senate.Solution

predictTheWinner(int[]) - Method in class g0401_0500.s0486_predict_the_winner.Solution

prefixCount(String[], String) - Method in class g2101_2200.s2185_counting_words_with_a_given_prefix.Solution

prefixesDivBy5(int[]) - Method in class g1001_1100.s1018_binary_prefix_divisible_by_5.Solution

preimageSizeFZF(int) - Method in class g0701_0800.s0793_preimage_size_of_factorial_zeroes_function.Solution

preorder(Node) - Method in class g0501_0600.s0589_n_ary_tree_preorder_traversal.Solution

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

prev - Variable in class g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node

prevPermOpt1(int[]) - Method in class g1001_1100.s1053_previous_permutation_with_one_swap.Solution

primePalindrome(int) - Method in class g0801_0900.s0866_prime_palindrome.Solution

primeSubOperation(int[]) - Method in class g2601_2700.s2601_prime_subtraction_operation.Solution

printTree(TreeNode) - Method in class g0601_0700.s0655_print_binary_tree.Solution

printVertically(String) - Method in class g1301_1400.s1324_print_words_vertically.Solution

prisonAfterNDays(int[], int) - Method in class g0901_1000.s0957_prison_cells_after_n_days.Solution

processQueries(int[], int) - Method in class g1401_1500.s1409_queries_on_a_permutation_with_key.Solution

productExceptSelf(int[]) - Method in class g0201_0300.s0238_product_of_array_except_self.Solution

ProductOfNumbers - Class in g1301_1400.s1352_product_of_the_last_k_numbers

1352 - Product of the Last K Numbers.

ProductOfNumbers() - Constructor for class g1301_1400.s1352_product_of_the_last_k_numbers.ProductOfNumbers

productQueries(int, int[][]) - Method in class g2401_2500.s2438_range_product_queries_of_powers.Solution

profitableSchemes(int, int, int[], int[]) - Method in class g0801_0900.s0879_profitable_schemes.Solution

projectionArea(int[][]) - Method in class g0801_0900.s0883_projection_area_of_3d_shapes.Solution

pruneTree(TreeNode) - Method in class g0801_0900.s0814_binary_tree_pruning.Solution

pseudoPalindromicPaths(TreeNode) - Method in class g1401_1500.s1457_pseudo_palindromic_paths_in_a_binary_tree.Solution

punishmentNumber(int) - Method in class g2601_2700.s2698_find_the_punishment_number_of_an_integer.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

push(int) - Method in class g0801_0900.s0895_maximum_frequency_stack.FreqStack

push(int) - Method in class g1101_1200.s1172_dinner_plate_stacks.DinnerPlates

push(int) - Method in class g1301_1400.s1381_design_a_stack_with_increment_operation.CustomStack

pushBack(int) - Method in class g1601_1700.s1670_design_front_middle_back_queue.FrontMiddleBackQueue

pushDominoes(String) - Method in class g0801_0900.s0838_push_dominoes.Solution

pushFront(int) - Method in class g1601_1700.s1670_design_front_middle_back_queue.FrontMiddleBackQueue

pushMiddle(int) - Method in class g1601_1700.s1670_design_front_middle_back_queue.FrontMiddleBackQueue

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

put(int, int) - Method in class g0401_0500.s0460_lfu_cache.LFUCache

put(int, int) - Method in class g0701_0800.s0706_design_hashmap.MyHashMap

putMarbles(int[], int) - Method in class g2501_2600.s2551_put_marbles_in_bags.Solution

pyramidTransition(String, List<String>) - Method in class g0701_0800.s0756_pyramid_transition_matrix.Solution

Q

q(int) - Method in class g0901_1000.s0911_online_election.TopVotedCandidate

queensAttacktheKing(int[][], int[]) - Method in class g1201_1300.s1222_queens_that_can_attack_the_king.Solution

query(char) - Method in class g1001_1100.s1032_stream_of_characters.StreamChecker

query(int, int, int) - Method in class g1101_1200.s1157_online_majority_element_in_subarray.MajorityChecker

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

queryRange(int, int) - Method in class g0701_0800.s0715_range_module.RangeModule

queryString(String, int) - Method in class g1001_1100.s1016_binary_string_with_substrings_representing_1_to_n.Solution

R

racecar(int) - Method in class g0801_0900.s0818_race_car.Solution

rand10() - Method in class g0401_0500.s0470_implement_rand10_using_rand7.Solution

random - Variable in class com_github_leetcode.random.Node

RandomizedCollection - Class in g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed

381 - Insert Delete GetRandom O(1) - Duplicates allowed.

RandomizedCollection() - Constructor for class g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed.RandomizedCollection

RandomizedSet - Class in g0301_0400.s0380_insert_delete_getrandom_o1

380 - Insert Delete GetRandom O(1).

RandomizedSet() - Constructor for class g0301_0400.s0380_insert_delete_getrandom_o1.RandomizedSet

randPoint() - Method in class g0401_0500.s0478_generate_random_point_in_a_circle.Solution

rangeAddQueries(int, int[][]) - Method in class g2501_2600.s2536_increment_submatrices_by_one.Solution

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

RangeFreqQuery - Class in g2001_2100.s2080_range_frequency_queries

2080 - Range Frequency Queries.

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

RangeModule - Class in g0701_0800.s0715_range_module

715 - Range Module.

RangeModule() - Constructor for class g0701_0800.s0715_range_module.RangeModule

rangeSum(int[], int, int, int) - Method in class g1501_1600.s1508_range_sum_of_sorted_subarray_sums.Solution

rangeSumBST(TreeNode, int, int) - Method in class g0901_1000.s0938_range_sum_of_bst.Solution

rankTeams(String[]) - Method in class g1301_1400.s1366_rank_teams_by_votes.Solution

reachableNodes(int[][], int, int) - Method in class g0801_0900.s0882_reachable_nodes_in_subdivided_graph.Solution

reachableNodes(int, int[][], int[]) - Method in class g2301_2400.s2368_reachable_nodes_with_restrictions.Solution

reachingPoints(int, int, int, int) - Method in class g0701_0800.s0780_reaching_points.Solution

reachNumber(int) - Method in class g0701_0800.s0754_reach_a_number.Solution

readBinaryWatch(int) - Method in class g0401_0500.s0401_binary_watch.Solution

rear() - Method in class g0601_0700.s0622_design_circular_queue.MyCircularQueue

rearrangeArray(int[]) - Method in class g1901_2000.s1968_array_with_elements_not_equal_to_average_of_neighbors.Solution

rearrangeArray(int[]) - Method in class g2101_2200.s2149_rearrange_array_elements_by_sign.Solution

rearrangeBarcodes(int[]) - Method in class g1001_1100.s1054_distant_barcodes.Solution

rearrangeCharacters(String, String) - Method in class g2201_2300.s2287_rearrange_characters_to_make_target_string.Solution

rearrangeSticks(int, int) - Method in class g1801_1900.s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible.Solution

RecentCounter - Class in g0901_1000.s0933_number_of_recent_calls

933 - Number of Recent Calls.

RecentCounter() - Constructor for class g0901_1000.s0933_number_of_recent_calls.RecentCounter

reconstructMatrix(int, int, int[]) - Method in class g1201_1300.s1253_reconstruct_a_2_row_binary_matrix.Solution

reconstructQueue(int[][]) - Method in class g0401_0500.s0406_queue_reconstruction_by_height.Solution

recordTweet(String, int) - Method in class g1301_1400.s1348_tweet_counts_per_frequency.TweetCounts

recoverArray(int[]) - Method in class g2101_2200.s2122_recover_the_original_array.Solution

recoverArray(int, int[]) - Method in class g1901_2000.s1982_find_array_given_subset_sums.Solution

recoverFromPreorder(String) - Method in class g1001_1100.s1028_recover_a_tree_from_preorder_traversal.Solution

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

rectangleArea(int[][]) - Method in class g0801_0900.s0850_rectangle_area_ii.Solution

reduce(int[]) - Method in class g1401_1500.s1419_minimum_number_of_frogs_croaking.Solution

reductionOperations(int[]) - Method in class g1801_1900.s1887_reduction_operations_to_make_the_array_elements_equal.Solution

reformat(String) - Method in class g1401_1500.s1417_reformat_the_string.Solution

reformatDate(String) - Method in class g1501_1600.s1507_reformat_date.Solution

reformatNumber(String) - Method in class g1601_1700.s1694_reformat_phone_number.Solution

regionsBySlashes(String[]) - Method in class g0901_1000.s0959_regions_cut_by_slashes.Solution

reinitializePermutation(int) - Method in class g1801_1900.s1806_minimum_number_of_operations_to_reinitialize_a_permutation.Solution

relativeSortArray(int[], int[]) - Method in class g1101_1200.s1122_relative_sort_array.Solution

relocateMarbles(int[], int[], int[]) - Method in class g2701_2800.s2766_relocate_marbles.Solution

remove(int) - Method in class g0301_0400.s0380_insert_delete_getrandom_o1.RandomizedSet

remove(int) - Method in class g0301_0400.s0381_insert_delete_getrandom_o1_duplicates_allowed.RandomizedCollection

remove(int) - Method in class g0701_0800.s0705_design_hashset.MyHashSet

remove(int) - Method in class g0701_0800.s0706_design_hashmap.MyHashMap

removeAlmostEqualCharacters(String) - Method in class g2901_3000.s2957_remove_adjacent_almost_equal_characters.Solution

removeAnagrams(String[]) - Method in class g2201_2300.s2273_find_resultant_array_after_removing_anagrams.Solution

removeBoxes(int[]) - Method in class g0501_0600.s0546_remove_boxes.Solution

removeComments(String[]) - Method in class g0701_0800.s0722_remove_comments.Solution

removeCoveredIntervals(int[][]) - Method in class g1201_1300.s1288_remove_covered_intervals.Solution

removeDigit(String, char) - Method in class g2201_2300.s2259_remove_digit_from_number_to_maximize_result.Solution

removeDuplicateLetters(String) - Method in class g0301_0400.s0316_remove_duplicate_letters.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

removeDuplicates(String) - Method in class g1001_1100.s1047_remove_all_adjacent_duplicates_in_string.Solution

removeDuplicates(String, int) - Method in class g1201_1300.s1209_remove_all_adjacent_duplicates_in_string_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

removeInvalidParentheses(String) - Method in class g0301_0400.s0301_remove_invalid_parentheses.Solution

removeKdigits(String, int) - Method in class g0401_0500.s0402_remove_k_digits.Solution

removeLeafNodes(TreeNode, int) - Method in class g1301_1400.s1325_delete_leaves_with_a_given_value.Solution

removeNodes(ListNode) - Method in class g2401_2500.s2487_remove_nodes_from_linked_list.Solution

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

removeOccurrences(String, String) - Method in class g1901_2000.s1910_remove_all_occurrences_of_a_substring.Solution

removeOuterParentheses(String) - Method in class g1001_1100.s1021_remove_outermost_parentheses.Solution

removePalindromeSub(String) - Method in class g1301_1400.s1332_remove_palindromic_subsequences.Solution

removeRange(int, int) - Method in class g0701_0800.s0715_range_module.RangeModule

removeStars(String) - Method in class g2301_2400.s2390_removing_stars_from_a_string.Solution

removeStones(int[][]) - Method in class g0901_1000.s0947_most_stones_removed_with_same_row_or_column.Solution

removeSubfolders(String[]) - Method in class g1201_1300.s1233_remove_sub_folders_from_the_filesystem.Solution

removeTrailingZeros(String) - Method in class g2701_2800.s2710_remove_trailing_zeros_from_a_string.Solution

removeZeroSumSublists(ListNode) - Method in class g1101_1200.s1171_remove_zero_sum_consecutive_nodes_from_linked_list.Solution

renew(String, int) - Method in class g1701_1800.s1797_design_authentication_manager.AuthenticationManager

rent(int, int) - Method in class g1901_2000.s1912_design_movie_rental_system.MovieRentingSystem

reorderedPowerOf2(int) - Method in class g0801_0900.s0869_reordered_power_of_2.Solution

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

reorderLogFiles(String[]) - Method in class g0901_1000.s0937_reorder_data_in_log_files.Solution

reorderSpaces(String) - Method in class g1501_1600.s1592_rearrange_spaces_between_words.Solution

reorganizeString(String) - Method in class g0701_0800.s0767_reorganize_string.Solution

repairCars(int[], int) - Method in class g2501_2600.s2594_minimum_time_to_repair_cars.Solution

repeatedCharacter(String) - Method in class g2301_2400.s2351_first_letter_to_appear_twice.Solution

repeatedNTimes(int[]) - Method in class g0901_1000.s0961_n_repeated_element_in_size_2n_array.Solution

repeatedStringMatch(String, String) - Method in class g0601_0700.s0686_repeated_string_match.Solution

repeatedSubstringPattern(String) - Method in class g0401_0500.s0459_repeated_substring_pattern.Solution

repeatLimitedString(String, int) - Method in class g2101_2200.s2182_construct_string_with_repeat_limit.Solution

replaceDigits(String) - Method in class g1801_1900.s1844_replace_all_digits_with_characters.Solution

replaceElements(int[]) - Method in class g1201_1300.s1299_replace_elements_with_greatest_element_on_right_side.Solution

replaceNonCoprimes(int[]) - Method in class g2101_2200.s2197_replace_non_coprime_numbers_in_array.Solution

replaceValueInTree(TreeNode) - Method in class g2601_2700.s2641_cousins_in_binary_tree_ii.Solution

replaceWords(List<String>, String) - Method in class g0601_0700.s0648_replace_words.Solution

report() - Method in class g1901_2000.s1912_design_movie_rental_system.MovieRentingSystem

reserve() - Method in class g1801_1900.s1845_seat_reservation_manager.SeatManager

reset() - Method in class g0301_0400.s0384_shuffle_an_array.Solution

reset() - Method in class g0501_0600.s0519_random_flip_matrix.Solution

restoreArray(int[][]) - Method in class g1701_1800.s1743_restore_the_array_from_adjacent_pairs.Solution

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

restoreMatrix(int[], int[]) - Method in class g1601_1700.s1605_find_valid_matrix_given_row_and_column_sums.Solution

restoreString(String, int[]) - Method in class g1501_1600.s1528_shuffle_string.Solution

resultArray(int[]) - Method in class g3001_3100.s3069_distribute_elements_into_two_arrays_i.Solution

resultGrid(int[][], int) - Method in class g3001_3100.s3030_find_the_grid_of_region_average.Solution

returnToBoundaryCount(int[]) - Method in class g3001_3100.s3028_ant_on_the_boundary.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

reverseEvenLengthGroups(ListNode) - Method in class g2001_2100.s2074_reverse_nodes_in_even_length_groups.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

reverseOddLevels(TreeNode) - Method in class g2401_2500.s2415_reverse_odd_levels_of_binary_tree.Solution

reverseOnlyLetters(String) - Method in class g0901_1000.s0917_reverse_only_letters.Solution

reversePairs(int[]) - Method in class g0401_0500.s0493_reverse_pairs.Solution

reverseParentheses(String) - Method in class g1101_1200.s1190_reverse_substrings_between_each_pair_of_parentheses.Solution

reversePrefix(String, char) - Method in class g1901_2000.s2000_reverse_prefix_of_word.Solution

reverseStr(String, int) - Method in class g0501_0600.s0541_reverse_string_ii.Solution

reverseString(char[]) - Method in class g0301_0400.s0344_reverse_string.Solution

reverseVowels(String) - Method in class g0301_0400.s0345_reverse_vowels_of_a_string.Solution

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

reverseWords(String) - Method in class g0501_0600.s0557_reverse_words_in_a_string_iii.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

RLEIterator - Class in g0801_0900.s0900_rle_iterator

900 - RLE Iterator.

RLEIterator(int[]) - Constructor for class g0801_0900.s0900_rle_iterator.RLEIterator

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

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

rob(TreeNode) - Method in class g0301_0400.s0337_house_robber_iii.Solution

Robot - Class in g2001_2100.s2069_walking_robot_simulation_ii

2069 - Walking Robot Simulation II.

Robot(int, int) - Constructor for class g2001_2100.s2069_walking_robot_simulation_ii.Robot

robotSim(int[], int[][]) - Method in class g0801_0900.s0874_walking_robot_simulation.Solution

robotWithString(String) - Method in class g2401_2500.s2434_using_a_robot_to_print_the_lexicographically_smallest_string.Solution

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

rootCount(int[][], int[][], int) - Method in class g2501_2600.s2581_count_number_of_possible_root_nodes.Solution

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

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

rotatedDigits(int) - Method in class g0701_0800.s0788_rotated_digits.Solution

rotateGrid(int[][], int) - Method in class g1901_2000.s1914_cyclically_rotating_a_grid.Solution

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

rotateString(String, String) - Method in class g0701_0800.s0796_rotate_string.Solution

rotateTheBox(char[][]) - Method in class g1801_1900.s1861_rotating_the_box.Solution

rowAndMaximumOnes(int[][]) - Method in class g2601_2700.s2643_row_with_maximum_ones.Solution

run() - Method in class g1101_1200.s1117_building_h2o.H2O.HydrogenRunnable

run() - Method in class g1101_1200.s1117_building_h2o.H2O.OxygenRunnable

runningSum(int[]) - Method in class g1401_1500.s1480_running_sum_of_1d_array.Solution

S

sampleStats(int[]) - Method in class g1001_1100.s1093_statistics_from_a_large_sample.Solution

scatter(int, int) - Method in class g2201_2300.s2286_booking_concert_tickets_in_groups.BookMyShow

scheduleCourse(int[][]) - Method in class g0601_0700.s0630_course_schedule_iii.Solution

scoreOfParentheses(String) - Method in class g0801_0900.s0856_score_of_parentheses.Solution

scoreOfStudents(String, int[]) - Method in class g2001_2100.s2019_the_score_of_students_solving_math_expression.Solution

search(int) - Method in class g1201_1300.s1206_design_skiplist.Skiplist

search(int) - Method in class g1901_2000.s1912_design_movie_rental_system.MovieRentingSystem

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(int[], int) - Method in class g0701_0800.s0704_binary_search.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) - Method in class g0601_0700.s0676_implement_magic_dictionary.MagicDictionary

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

searchBST(TreeNode, int) - Method in class g0601_0700.s0700_search_in_a_binary_search_tree.Solution

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

seat() - Method in class g0801_0900.s0855_exam_room.ExamRoom

SeatManager - Class in g1801_1900.s1845_seat_reservation_manager

1845 - Seat Reservation Manager.

SeatManager(int) - Constructor for class g1801_1900.s1845_seat_reservation_manager.SeatManager

second(Runnable) - Method in class g1101_1200.s1114_print_in_order.Foo

secondGreaterElement(int[]) - Method in class g2401_2500.s2454_next_greater_element_iv.Solution

secondHighest(String) - Method in class g1701_1800.s1796_second_largest_digit_in_a_string.Solution

secondMinimum(int, int[][], int, int) - Method in class g2001_2100.s2045_second_minimum_time_to_reach_destination.Solution

secondsToRemoveOccurrences(String) - Method in class g2301_2400.s2380_time_needed_to_rearrange_a_binary_string.Solution

selfDividingNumbers(int, int) - Method in class g0701_0800.s0728_self_dividing_numbers.Solution

sellingWood(int, int, int[][]) - Method in class g2301_2400.s2312_selling_pieces_of_wood.Solution

semiOrderedPermutation(int[]) - Method in class g2701_2800.s2717_semi_ordered_permutation.Solution

separateDigits(int[]) - Method in class g2501_2600.s2553_separate_the_digits_in_an_array.Solution

sequentialDigits(int, int) - Method in class g1201_1300.s1291_sequential_digits.Solution

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

serialize(TreeNode) - Method in class g0401_0500.s0449_serialize_and_deserialize_bst.Codec

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

set(int, int) - Method in class g1101_1200.s1146_snapshot_array.SnapshotArray

set(String, String, int) - Method in class g0901_1000.s0981_time_based_key_value_store.TimeMap

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

shiftGrid(int[][], int) - Method in class g1201_1300.s1260_shift_2d_grid.Solution

shiftingLetters(String, int[]) - Method in class g0801_0900.s0848_shifting_letters.Solution

shiftingLetters(String, int[][]) - Method in class g2301_2400.s2381_shifting_letters_ii.Solution

shipWithinDays(int[], int) - Method in class g1001_1100.s1011_capacity_to_ship_packages_within_d_days.Solution

shoppingOffers(List<Integer>, List<List<Integer>>, List<Integer>) - Method in class g0601_0700.s0638_shopping_offers.Solution

shortestAlternatingPaths(int, int[][], int[][]) - Method in class g1101_1200.s1129_shortest_path_with_alternating_colors.Solution

shortestBeautifulSubstring(String, int) - Method in class g2901_3000.s2904_shortest_and_lexicographically_smallest_beautiful_string.Solution

shortestBridge(int[][]) - Method in class g0901_1000.s0934_shortest_bridge.Solution

shortestCommonSupersequence(String, String) - Method in class g1001_1100.s1092_shortest_common_supersequence.Solution

shortestCompletingWord(String, String[]) - Method in class g0701_0800.s0748_shortest_completing_word.Solution

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

shortestPath(int[][], int) - Method in class g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination.Solution

shortestPath(int, int) - Method in class g2601_2700.s2642_design_graph_with_shortest_path_calculator.Graph

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

shortestPathBinaryMatrix(int[][]) - Method in class g1001_1100.s1091_shortest_path_in_binary_matrix.Solution

shortestPathLength(int[][]) - Method in class g0801_0900.s0847_shortest_path_visiting_all_nodes.Solution

shortestSequence(int[], int) - Method in class g2301_2400.s2350_shortest_impossible_sequence_of_rolls.Solution

shortestSubarray(int[], int) - Method in class g0801_0900.s0862_shortest_subarray_with_sum_at_least_k.Solution

shortestSuperstring(String[]) - Method in class g0901_1000.s0943_find_the_shortest_superstring.Solution

shortestToChar(String, char) - Method in class g0801_0900.s0821_shortest_distance_to_a_character.Solution

shuffle() - Method in class g0301_0400.s0384_shuffle_an_array.Solution

shuffle(int[], int) - Method in class g1401_1500.s1470_shuffle_the_array.Solution

similarPairs(String[]) - Method in class g2501_2600.s2506_count_pairs_of_similar_strings.Solution

simplifiedFractions(int) - Method in class g1401_1500.s1447_simplified_fractions.Solution

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

singleNonDuplicate(int[]) - Method in class g0501_0600.s0540_single_element_in_a_sorted_array.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

Skiplist - Class in g1201_1300.s1206_design_skiplist

1206 - Design Skiplist.

Skiplist() - Constructor for class g1201_1300.s1206_design_skiplist.Skiplist

Skiplist(int) - Constructor for class g1201_1300.s1206_design_skiplist.Skiplist

slidingPuzzle(int[][]) - Method in class g0701_0800.s0773_sliding_puzzle.Solution

slowestKey(int[], String) - Method in class g1601_1700.s1629_slowest_key.Solution

smallerNumbersThanCurrent(int[]) - Method in class g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number.Solution

smallestBeautifulString(String, int) - Method in class g2601_2700.s2663_lexicographically_smallest_beautiful_string.Solution

smallestChair(int[][], int) - Method in class g1901_2000.s1942_the_number_of_the_smallest_unoccupied_chair.Solution

smallestDistancePair(int[], int) - Method in class g0701_0800.s0719_find_k_th_smallest_pair_distance.Solution

smallestDivisor(int[], int) - Method in class g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold.Solution

smallestEqual(int[]) - Method in class g2001_2100.s2057_smallest_index_with_equal_value.Solution

smallestEquivalentString(String, String, String) - Method in class g1001_1100.s1061_lexicographically_smallest_equivalent_string.Solution

smallestEvenMultiple(int) - Method in class g2401_2500.s2413_smallest_even_multiple.Solution

smallestFromLeaf(TreeNode) - Method in class g0901_1000.s0988_smallest_string_starting_from_leaf.Solution

smallestGoodBase(String) - Method in class g0401_0500.s0483_smallest_good_base.Solution

SmallestInfiniteSet - Class in g2301_2400.s2336_smallest_number_in_infinite_set

2336 - Smallest Number in Infinite Set.

SmallestInfiniteSet() - Constructor for class g2301_2400.s2336_smallest_number_in_infinite_set.SmallestInfiniteSet

smallestMissingValueSubtree(int[], int[]) - Method in class g2001_2100.s2003_smallest_missing_genetic_value_in_each_subtree.Solution

smallestNumber(long) - Method in class g2101_2200.s2165_smallest_value_of_the_rearranged_number.Solution

smallestNumber(String) - Method in class g2301_2400.s2375_construct_smallest_number_from_di_string.Solution

smallestRange(List<List<Integer>>) - Method in class g0601_0700.s0632_smallest_range_covering_elements_from_k_lists.Solution

smallestRangeI(int[], int) - Method in class g0901_1000.s0908_smallest_range_i.Solution

smallestRangeII(int[], int) - Method in class g0901_1000.s0910_smallest_range_ii.Solution

smallestRepunitDivByK(int) - Method in class g1001_1100.s1015_smallest_integer_divisible_by_k.Solution

smallestString(String) - Method in class g2701_2800.s2734_lexicographically_smallest_string_after_substring_operation.Solution

smallestStringWithSwaps(String, List<List<Integer>>) - Method in class g1201_1300.s1202_smallest_string_with_swaps.Solution

smallestSubarrays(int[]) - Method in class g2401_2500.s2411_smallest_subarrays_with_maximum_bitwise_or.Solution

smallestSubsequence(String) - Method in class g1001_1100.s1081_smallest_subsequence_of_distinct_characters.Solution

smallestSubsequence(String, int, char, int) - Method in class g2001_2100.s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter.Solution

smallestSufficientTeam(String[], List<List<String>>) - Method in class g1101_1200.s1125_smallest_sufficient_team.Solution

smallestTrimmedNumbers(String[], int[][]) - Method in class g2301_2400.s2343_query_kth_smallest_trimmed_number.Solution

smallestValue(int) - Method in class g2501_2600.s2507_smallest_value_after_replacing_with_sum_of_prime_factors.Solution

snakesAndLadders(int[][]) - Method in class g0901_1000.s0909_snakes_and_ladders.Solution

snap() - Method in class g1101_1200.s1146_snapshot_array.SnapshotArray

SnapshotArray - Class in g1101_1200.s1146_snapshot_array

1146 - Snapshot Array.

SnapshotArray(int) - Constructor for class g1101_1200.s1146_snapshot_array.SnapshotArray

Solution - Class in g0001_0100.s0001_two_sum

1 - Two Sum.

Solution - Class in g0001_0100.s0002_add_two_numbers

2 - Add Two Numbers.

Solution - Class in g0001_0100.s0003_longest_substring_without_repeating_characters

3 - Longest Substring Without Repeating Characters.

Solution - Class in g0001_0100.s0004_median_of_two_sorted_arrays

4 - Median of Two Sorted Arrays.

Solution - Class in g0001_0100.s0005_longest_palindromic_substring

5 - Longest Palindromic Substring.

Solution - Class in g0001_0100.s0006_zigzag_conversion

6 - Zigzag Conversion.

Solution - Class in g0001_0100.s0007_reverse_integer

7 - Reverse Integer.

Solution - Class in g0001_0100.s0008_string_to_integer_atoi

8 - String to Integer (atoi).

Solution - Class in g0001_0100.s0009_palindrome_number

9 - Palindrome Number.

Solution - Class in g0001_0100.s0010_regular_expression_matching

10 - Regular Expression Matching.

Solution - Class in g0001_0100.s0011_container_with_most_water

11 - Container With Most Water.

Solution - Class in g0001_0100.s0012_integer_to_roman

12 - Integer to Roman.

Solution - Class in g0001_0100.s0013_roman_to_integer

13 - Roman to Integer.

Solution - Class in g0001_0100.s0014_longest_common_prefix

14 - Longest Common Prefix.

Solution - Class in g0001_0100.s0015_3sum

15 - 3Sum.

Solution - Class in g0001_0100.s0016_3sum_closest

16 - 3Sum Closest.

Solution - Class in g0001_0100.s0017_letter_combinations_of_a_phone_number

17 - Letter Combinations of a Phone Number.

Solution - Class in g0001_0100.s0018_4sum

18 - 4Sum.

Solution - Class in g0001_0100.s0019_remove_nth_node_from_end_of_list

19 - Remove Nth Node From End of List.

Solution - Class in g0001_0100.s0020_valid_parentheses

20 - Valid Parentheses.

Solution - Class in g0001_0100.s0021_merge_two_sorted_lists

21 - Merge Two Sorted Lists.

Solution - Class in g0001_0100.s0022_generate_parentheses

22 - Generate Parentheses.

Solution - Class in g0001_0100.s0023_merge_k_sorted_lists

23 - Merge k Sorted Lists.

Solution - Class in g0001_0100.s0024_swap_nodes_in_pairs

24 - Swap Nodes in Pairs.

Solution - Class in g0001_0100.s0025_reverse_nodes_in_k_group

25 - Reverse Nodes in k-Group.

Solution - Class in g0001_0100.s0026_remove_duplicates_from_sorted_array

26 - Remove Duplicates from Sorted Array.

Solution - Class in g0001_0100.s0027_remove_element

27 - Remove Element.

Solution - Class in g0001_0100.s0028_find_the_index_of_the_first_occurrence_in_a_string

28 - Implement strStr().

Solution - Class in g0001_0100.s0029_divide_two_integers

29 - Divide Two Integers.

Solution - Class in g0001_0100.s0030_substring_with_concatenation_of_all_words

30 - Substring with Concatenation of All Words.

Solution - Class in g0001_0100.s0031_next_permutation

31 - Next Permutation.

Solution - Class in g0001_0100.s0032_longest_valid_parentheses

32 - Longest Valid Parentheses.

Solution - Class in g0001_0100.s0033_search_in_rotated_sorted_array

33 - Search in Rotated Sorted Array.

Solution - Class in g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array

34 - Find First and Last Position of Element in Sorted Array.

Solution - Class in g0001_0100.s0035_search_insert_position

35 - Search Insert Position.

Solution - Class in g0001_0100.s0036_valid_sudoku

36 - Valid Sudoku.

Solution - Class in g0001_0100.s0037_sudoku_solver

37 - Sudoku Solver.

Solution - Class in g0001_0100.s0038_count_and_say

38 - Count and Say.

Solution - Class in g0001_0100.s0039_combination_sum

39 - Combination Sum.

Solution - Class in g0001_0100.s0040_combination_sum_ii

40 - Combination Sum II.

Solution - Class in g0001_0100.s0041_first_missing_positive

41 - First Missing Positive.

Solution - Class in g0001_0100.s0042_trapping_rain_water

42 - Trapping Rain Water.

Solution - Class in g0001_0100.s0043_multiply_strings

43 - Multiply Strings.

Solution - Class in g0001_0100.s0044_wildcard_matching

44 - Wildcard Matching.

Solution - Class in g0001_0100.s0045_jump_game_ii

45 - Jump Game II.

Solution - Class in g0001_0100.s0046_permutations

46 - Permutations.

Solution - Class in g0001_0100.s0047_permutations_ii

47 - Permutations II.

Solution - Class in g0001_0100.s0048_rotate_image

48 - Rotate Image.

Solution - Class in g0001_0100.s0049_group_anagrams

49 - Group Anagrams.

Solution - Class in g0001_0100.s0050_powx_n

50 - Pow(x, n).

Solution - Class in g0001_0100.s0051_n_queens

51 - N-Queens.

Solution - Class in g0001_0100.s0052_n_queens_ii

52 - N-Queens II.

Solution - Class in g0001_0100.s0053_maximum_subarray

53 - Maximum Subarray.

Solution - Class in g0001_0100.s0054_spiral_matrix

54 - Spiral Matrix.

Solution - Class in g0001_0100.s0055_jump_game

55 - Jump Game.

Solution - Class in g0001_0100.s0056_merge_intervals

56 - Merge Intervals.

Solution - Class in g0001_0100.s0057_insert_interval

57 - Insert Interval.

Solution - Class in g0001_0100.s0058_length_of_last_word

58 - Length of Last Word.

Solution - Class in g0001_0100.s0059_spiral_matrix_ii

59 - Spiral Matrix II.

Solution - Class in g0001_0100.s0060_permutation_sequence

60 - Permutation Sequence.

Solution - Class in g0001_0100.s0061_rotate_list

61 - Rotate List.

Solution - Class in g0001_0100.s0062_unique_paths

62 - Unique Paths.

Solution - Class in g0001_0100.s0063_unique_paths_ii

63 - Unique Paths II.

Solution - Class in g0001_0100.s0064_minimum_path_sum

64 - Minimum Path Sum.

Solution - Class in g0001_0100.s0065_valid_number

65 - Valid Number.

Solution - Class in g0001_0100.s0066_plus_one

66 - Plus One.

Solution - Class in g0001_0100.s0067_add_binary

67 - Add Binary.

Solution - Class in g0001_0100.s0068_text_justification

68 - Text Justification.

Solution - Class in g0001_0100.s0069_sqrtx

69 - Sqrt(x).

Solution - Class in g0001_0100.s0070_climbing_stairs

70 - Climbing Stairs.

Solution - Class in g0001_0100.s0071_simplify_path

71 - Simplify Path.

Solution - Class in g0001_0100.s0072_edit_distance

72 - Edit Distance.

Solution - Class in g0001_0100.s0073_set_matrix_zeroes

73 - Set Matrix Zeroes.

Solution - Class in g0001_0100.s0074_search_a_2d_matrix

74 - Search a 2D Matrix.

Solution - Class in g0001_0100.s0075_sort_colors

75 - Sort Colors.

Solution - Class in g0001_0100.s0076_minimum_window_substring

76 - Minimum Window Substring.

Solution - Class in g0001_0100.s0077_combinations

77 - Combinations.

Solution - Class in g0001_0100.s0078_subsets

78 - Subsets.

Solution - Class in g0001_0100.s0079_word_search

79 - Word Search.

Solution - Class in g0001_0100.s0080_remove_duplicates_from_sorted_array_ii

80 - Remove Duplicates from Sorted Array II.

Solution - Class in g0001_0100.s0081_search_in_rotated_sorted_array_ii

81 - Search in Rotated Sorted Array II.

Solution - Class in g0001_0100.s0082_remove_duplicates_from_sorted_list_ii

82 - Remove Duplicates from Sorted List II.

Solution - Class in g0001_0100.s0083_remove_duplicates_from_sorted_list

83 - Remove Duplicates from Sorted List.

Solution - Class in g0001_0100.s0084_largest_rectangle_in_histogram

84 - Largest Rectangle in Histogram.

Solution - Class in g0001_0100.s0085_maximal_rectangle

85 - Maximal Rectangle.

Solution - Class in g0001_0100.s0086_partition_list

86 - Partition List.

Solution - Class in g0001_0100.s0087_scramble_string

87 - Scramble String.

Solution - Class in g0001_0100.s0088_merge_sorted_array

88 - Merge Sorted Array.

Solution - Class in g0001_0100.s0089_gray_code

89 - Gray Code.

Solution - Class in g0001_0100.s0090_subsets_ii

90 - Subsets II.

Solution - Class in g0001_0100.s0091_decode_ways

91 - Decode Ways.

Solution - Class in g0001_0100.s0092_reverse_linked_list_ii

92 - Reverse Linked List II.

Solution - Class in g0001_0100.s0093_restore_ip_addresses

93 - Restore IP Addresses.

Solution - Class in g0001_0100.s0094_binary_tree_inorder_traversal

94 - Binary Tree Inorder Traversal.

Solution - Class in g0001_0100.s0095_unique_binary_search_trees_ii

95 - Unique Binary Search Trees II.

Solution - Class in g0001_0100.s0096_unique_binary_search_trees

96 - Unique Binary Search Trees.

Solution - Class in g0001_0100.s0097_interleaving_string

97 - Interleaving String.

Solution - Class in g0001_0100.s0098_validate_binary_search_tree

98 - Validate Binary Search Tree.

Solution - Class in g0001_0100.s0099_recover_binary_search_tree

99 - Recover Binary Search Tree.

Solution - Class in g0001_0100.s0100_same_tree

100 - Same Tree.

Solution - Class in g0101_0200.s0101_symmetric_tree

101 - Symmetric Tree.

Solution - Class in g0101_0200.s0102_binary_tree_level_order_traversal

102 - Binary Tree Level Order Traversal.

Solution - Class in g0101_0200.s0103_binary_tree_zigzag_level_order_traversal

103 - Binary Tree Zigzag Level Order Traversal.

Solution - Class in g0101_0200.s0104_maximum_depth_of_binary_tree

104 - Maximum Depth of Binary Tree.

Solution - Class in g0101_0200.s0105_construct_binary_tree_from_preorder_and_inorder_traversal

105 - Construct Binary Tree from Preorder and Inorder Traversal.

Solution - Class in g0101_0200.s0106_construct_binary_tree_from_inorder_and_postorder_traversal

106 - Construct Binary Tree from Inorder and Postorder Traversal.

Solution - Class in g0101_0200.s0107_binary_tree_level_order_traversal_ii

107 - Binary Tree Level Order Traversal II.

Solution - Class in g0101_0200.s0108_convert_sorted_array_to_binary_search_tree

108 - Convert Sorted Array to Binary Search Tree.

Solution - Class in g0101_0200.s0109_convert_sorted_list_to_binary_search_tree

109 - Convert Sorted List to Binary Search Tree.

Solution - Class in g0101_0200.s0110_balanced_binary_tree

110 - Balanced Binary Tree.

Solution - Class in g0101_0200.s0111_minimum_depth_of_binary_tree

111 - Minimum Depth of Binary Tree.

Solution - Class in g0101_0200.s0112_path_sum

112 - Path Sum.

Solution - Class in g0101_0200.s0113_path_sum_ii

113 - Path Sum II.

Solution - Class in g0101_0200.s0114_flatten_binary_tree_to_linked_list

114 - Flatten Binary Tree to Linked List.

Solution - Class in g0101_0200.s0115_distinct_subsequences

115 - Distinct Subsequences.

Solution - Class in g0101_0200.s0116_populating_next_right_pointers_in_each_node

116 - Populating Next Right Pointers in Each Node.

Solution - Class in g0101_0200.s0117_populating_next_right_pointers_in_each_node_ii

117 - Populating Next Right Pointers in Each Node II.

Solution - Class in g0101_0200.s0118_pascals_triangle

118 - Pascal’s Triangle.

Solution - Class in g0101_0200.s0119_pascals_triangle_ii

119 - Pascal’s Triangle II.

Solution - Class in g0101_0200.s0120_triangle

120 - Triangle.

Solution - Class in g0101_0200.s0121_best_time_to_buy_and_sell_stock

121 - Best Time to Buy and Sell Stock.

Solution - Class in g0101_0200.s0122_best_time_to_buy_and_sell_stock_ii

122 - Best Time to Buy and Sell Stock II.

Solution - Class in g0101_0200.s0123_best_time_to_buy_and_sell_stock_iii

123 - Best Time to Buy and Sell Stock III.

Solution - Class in g0101_0200.s0124_binary_tree_maximum_path_sum

124 - Binary Tree Maximum Path Sum.

Solution - Class in g0101_0200.s0125_valid_palindrome

125 - Valid Palindrome.

Solution - Class in g0101_0200.s0126_word_ladder_ii

126 - Word Ladder II.

Solution - Class in g0101_0200.s0127_word_ladder

127 - Word Ladder.

Solution - Class in g0101_0200.s0128_longest_consecutive_sequence

128 - Longest Consecutive Sequence.

Solution - Class in g0101_0200.s0129_sum_root_to_leaf_numbers

129 - Sum Root to Leaf Numbers.

Solution - Class in g0101_0200.s0130_surrounded_regions

130 - Surrounded Regions.

Solution - Class in g0101_0200.s0131_palindrome_partitioning

131 - Palindrome Partitioning.

Solution - Class in g0101_0200.s0132_palindrome_partitioning_ii

132 - Palindrome Partitioning II.

Solution - Class in g0101_0200.s0133_clone_graph

133 - Clone Graph.

Solution - Class in g0101_0200.s0134_gas_station

134 - Gas Station.

Solution - Class in g0101_0200.s0135_candy

135 - Candy.

Solution - Class in g0101_0200.s0136_single_number

136 - Single Number.

Solution - Class in g0101_0200.s0137_single_number_ii

137 - Single Number II.

Solution - Class in g0101_0200.s0138_copy_list_with_random_pointer

138 - Copy List with Random Pointer.

Solution - Class in g0101_0200.s0139_word_break

139 - Word Break.

Solution - Class in g0101_0200.s0140_word_break_ii

140 - Word Break II.

Solution - Class in g0101_0200.s0141_linked_list_cycle

141 - Linked List Cycle.

Solution - Class in g0101_0200.s0142_linked_list_cycle_ii

142 - Linked List Cycle II.

Solution - Class in g0101_0200.s0143_reorder_list

143 - Reorder List.

Solution - Class in g0101_0200.s0144_binary_tree_preorder_traversal

144 - Binary Tree Preorder Traversal.

Solution - Class in g0101_0200.s0145_binary_tree_postorder_traversal

145 - Binary Tree Postorder Traversal.

Solution - Class in g0101_0200.s0147_insertion_sort_list

147 - Insertion Sort List.

Solution - Class in g0101_0200.s0148_sort_list

148 - Sort List.

Solution - Class in g0101_0200.s0149_max_points_on_a_line

149 - Max Points on a Line.

Solution - Class in g0101_0200.s0150_evaluate_reverse_polish_notation

150 - Evaluate Reverse Polish Notation.

Solution - Class in g0101_0200.s0151_reverse_words_in_a_string

151 - Reverse Words in a String.

Solution - Class in g0101_0200.s0152_maximum_product_subarray

152 - Maximum Product Subarray.

Solution - Class in g0101_0200.s0153_find_minimum_in_rotated_sorted_array

153 - Find Minimum in Rotated Sorted Array.

Solution - Class in g0101_0200.s0154_find_minimum_in_rotated_sorted_array_ii

154 - Find Minimum in Rotated Sorted Array II.

Solution - Class in g0101_0200.s0160_intersection_of_two_linked_lists

160 - Intersection of Two Linked Lists.

Solution - Class in g0101_0200.s0162_find_peak_element

162 - Find Peak Element.

Solution - Class in g0101_0200.s0164_maximum_gap

164 - Maximum Gap.

Solution - Class in g0101_0200.s0165_compare_version_numbers

165 - Compare Version Numbers.

Solution - Class in g0101_0200.s0166_fraction_to_recurring_decimal

166 - Fraction to Recurring Decimal.

Solution - Class in g0101_0200.s0167_two_sum_ii_input_array_is_sorted

167 - Two Sum II - Input Array Is Sorted.

Solution - Class in g0101_0200.s0168_excel_sheet_column_title

168 - Excel Sheet Column Title.

Solution - Class in g0101_0200.s0169_majority_element

169 - Majority Element.

Solution - Class in g0101_0200.s0171_excel_sheet_column_number

171 - Excel Sheet Column Number.

Solution - Class in g0101_0200.s0172_factorial_trailing_zeroes

172 - Factorial Trailing Zeroes.

Solution - Class in g0101_0200.s0174_dungeon_game

174 - Dungeon Game.

Solution - Class in g0101_0200.s0179_largest_number

179 - Largest Number.

Solution - Class in g0101_0200.s0187_repeated_dna_sequences

187 - Repeated DNA Sequences.

Solution - Class in g0101_0200.s0188_best_time_to_buy_and_sell_stock_iv

188 - Best Time to Buy and Sell Stock IV.

Solution - Class in g0101_0200.s0189_rotate_array

189 - Rotate Array.

Solution - Class in g0101_0200.s0190_reverse_bits

190 - Reverse Bits.

Solution - Class in g0101_0200.s0191_number_of_1_bits

191 - Number of 1 Bits.

Solution - Class in g0101_0200.s0198_house_robber

198 - House Robber.

Solution - Class in g0101_0200.s0199_binary_tree_right_side_view

199 - Binary Tree Right Side View.

Solution - Class in g0101_0200.s0200_number_of_islands

200 - Number of Islands.

Solution - Class in g0201_0300.s0201_bitwise_and_of_numbers_range

201 - Bitwise AND of Numbers Range.

Solution - Class in g0201_0300.s0202_happy_number

202 - Happy Number.

Solution - Class in g0201_0300.s0203_remove_linked_list_elements

203 - Remove Linked List Elements.

Solution - Class in g0201_0300.s0204_count_primes

204 - Count Primes.

Solution - Class in g0201_0300.s0205_isomorphic_strings

205 - Isomorphic Strings.

Solution - Class in g0201_0300.s0206_reverse_linked_list

206 - Reverse Linked List.

Solution - Class in g0201_0300.s0207_course_schedule

207 - Course Schedule.

Solution - Class in g0201_0300.s0209_minimum_size_subarray_sum

209 - Minimum Size Subarray Sum.

Solution - Class in g0201_0300.s0210_course_schedule_ii

210 - Course Schedule II.

Solution - Class in g0201_0300.s0212_word_search_ii

212 - Word Search II.

Solution - Class in g0201_0300.s0213_house_robber_ii

213 - House Robber II.

Solution - Class in g0201_0300.s0214_shortest_palindrome

214 - Shortest Palindrome.

Solution - Class in g0201_0300.s0215_kth_largest_element_in_an_array

215 - Kth Largest Element in an Array.

Solution - Class in g0201_0300.s0216_combination_sum_iii

216 - Combination Sum III.

Solution - Class in g0201_0300.s0217_contains_duplicate

217 - Contains Duplicate.

Solution - Class in g0201_0300.s0218_the_skyline_problem

218 - The Skyline Problem.

Solution - Class in g0201_0300.s0219_contains_duplicate_ii

219 - Contains Duplicate II.

Solution - Class in g0201_0300.s0220_contains_duplicate_iii

220 - Contains Duplicate III.

Solution - Class in g0201_0300.s0221_maximal_square

221 - Maximal Square.

Solution - Class in g0201_0300.s0222_count_complete_tree_nodes

222 - Count Complete Tree Nodes.

Solution - Class in g0201_0300.s0223_rectangle_area

223 - Rectangle Area.

Solution - Class in g0201_0300.s0224_basic_calculator

224 - Basic Calculator.

Solution - Class in g0201_0300.s0226_invert_binary_tree

226 - Invert Binary Tree.

Solution - Class in g0201_0300.s0227_basic_calculator_ii

227 - Basic Calculator II.

Solution - Class in g0201_0300.s0228_summary_ranges

228 - Summary Ranges.

Solution - Class in g0201_0300.s0229_majority_element_ii

229 - Majority Element II.

Solution - Class in g0201_0300.s0230_kth_smallest_element_in_a_bst

230 - Kth Smallest Element in a BST.

Solution - Class in g0201_0300.s0231_power_of_two

231 - Power of Two.

Solution - Class in g0201_0300.s0233_number_of_digit_one

233 - Number of Digit One.

Solution - Class in g0201_0300.s0234_palindrome_linked_list

234 - Palindrome Linked List.

Solution - Class in g0201_0300.s0235_lowest_common_ancestor_of_a_binary_search_tree

235 - Lowest Common Ancestor of a Binary Search Tree.

Solution - Class in g0201_0300.s0236_lowest_common_ancestor_of_a_binary_tree

236 - Lowest Common Ancestor of a Binary Tree.

Solution - Class in g0201_0300.s0237_delete_node_in_a_linked_list

237 - Delete Node in a Linked List.

Solution - Class in g0201_0300.s0238_product_of_array_except_self

238 - Product of Array Except Self.

Solution - Class in g0201_0300.s0239_sliding_window_maximum

239 - Sliding Window Maximum.

Solution - Class in g0201_0300.s0240_search_a_2d_matrix_ii

240 - Search a 2D Matrix II.

Solution - Class in g0201_0300.s0241_different_ways_to_add_parentheses

241 - Different Ways to Add Parentheses.

Solution - Class in g0201_0300.s0242_valid_anagram

242 - Valid Anagram.

Solution - Class in g0201_0300.s0257_binary_tree_paths

257 - Binary Tree Paths.

Solution - Class in g0201_0300.s0258_add_digits

258 - Add Digits.

Solution - Class in g0201_0300.s0260_single_number_iii

260 - Single Number III.

Solution - Class in g0201_0300.s0263_ugly_number

263 - Ugly Number.

Solution - Class in g0201_0300.s0264_ugly_number_ii

264 - Ugly Number II.

Solution - Class in g0201_0300.s0268_missing_number

268 - Missing Number.

Solution - Class in g0201_0300.s0273_integer_to_english_words

273 - Integer to English Words.

Solution - Class in g0201_0300.s0274_h_index

274 - H-Index.

Solution - Class in g0201_0300.s0275_h_index_ii

275 - H-Index II.

Solution - Class in g0201_0300.s0278_first_bad_version

278 - First Bad Version.

Solution - Class in g0201_0300.s0279_perfect_squares

279 - Perfect Squares.

Solution - Class in g0201_0300.s0282_expression_add_operators

282 - Expression Add Operators.

Solution - Class in g0201_0300.s0283_move_zeroes

283 - Move Zeroes.

Solution - Class in g0201_0300.s0287_find_the_duplicate_number

287 - Find the Duplicate Number.

Solution - Class in g0201_0300.s0289_game_of_life

289 - Game of Life.

Solution - Class in g0201_0300.s0290_word_pattern

290 - Word Pattern.

Solution - Class in g0201_0300.s0292_nim_game

292 - Nim Game.

Solution - Class in g0201_0300.s0299_bulls_and_cows

299 - Bulls and Cows.

Solution - Class in g0201_0300.s0300_longest_increasing_subsequence

300 - Longest Increasing Subsequence.

Solution - Class in g0301_0400.s0301_remove_invalid_parentheses

301 - Remove Invalid Parentheses.

Solution - Class in g0301_0400.s0306_additive_number

306 - Additive Number.

Solution - Class in g0301_0400.s0309_best_time_to_buy_and_sell_stock_with_cooldown

309 - Best Time to Buy and Sell Stock with Cooldown.

Solution - Class in g0301_0400.s0310_minimum_height_trees

310 - Minimum Height Trees.

Solution - Class in g0301_0400.s0312_burst_balloons

312 - Burst Balloons.

Solution - Class in g0301_0400.s0313_super_ugly_number

313 - Super Ugly Number.

Solution - Class in g0301_0400.s0315_count_of_smaller_numbers_after_self

315 - Count of Smaller Numbers After Self.

Solution - Class in g0301_0400.s0316_remove_duplicate_letters

316 - Remove Duplicate Letters.

Solution - Class in g0301_0400.s0318_maximum_product_of_word_lengths

318 - Maximum Product of Word Lengths.

Solution - Class in g0301_0400.s0319_bulb_switcher

319 - Bulb Switcher.

Solution - Class in g0301_0400.s0321_create_maximum_number

321 - Create Maximum Number.

Solution - Class in g0301_0400.s0322_coin_change

322 - Coin Change.

Solution - Class in g0301_0400.s0324_wiggle_sort_ii

324 - Wiggle Sort II.

Solution - Class in g0301_0400.s0326_power_of_three

326 - Power of Three.

Solution - Class in g0301_0400.s0327_count_of_range_sum

327 - Count of Range Sum.

Solution - Class in g0301_0400.s0328_odd_even_linked_list

328 - Odd Even Linked List.

Solution - Class in g0301_0400.s0329_longest_increasing_path_in_a_matrix

329 - Longest Increasing Path in a Matrix.

Solution - Class in g0301_0400.s0330_patching_array

330 - Patching Array.

Solution - Class in g0301_0400.s0331_verify_preorder_serialization_of_a_binary_tree

331 - Verify Preorder Serialization of a Binary Tree.

Solution - Class in g0301_0400.s0332_reconstruct_itinerary

332 - Reconstruct Itinerary.

Solution - Class in g0301_0400.s0334_increasing_triplet_subsequence

334 - Increasing Triplet Subsequence.

Solution - Class in g0301_0400.s0335_self_crossing

335 - Self Crossing.

Solution - Class in g0301_0400.s0336_palindrome_pairs

336 - Palindrome Pairs.

Solution - Class in g0301_0400.s0337_house_robber_iii

337 - House Robber III.

Solution - Class in g0301_0400.s0338_counting_bits

338 - Counting Bits.

Solution - Class in g0301_0400.s0342_power_of_four

342 - Power of Four.

Solution - Class in g0301_0400.s0343_integer_break

343 - Integer Break.

Solution - Class in g0301_0400.s0344_reverse_string

344 - Reverse String.

Solution - Class in g0301_0400.s0345_reverse_vowels_of_a_string

345 - Reverse Vowels of a String.

Solution - Class in g0301_0400.s0347_top_k_frequent_elements

347 - Top K Frequent Elements.

Solution - Class in g0301_0400.s0349_intersection_of_two_arrays

349 - Intersection of Two Arrays.

Solution - Class in g0301_0400.s0350_intersection_of_two_arrays_ii

350 - Intersection of Two Arrays II.

Solution - Class in g0301_0400.s0354_russian_doll_envelopes

354 - Russian Doll Envelopes.

Solution - Class in g0301_0400.s0357_count_numbers_with_unique_digits

357 - Count Numbers with Unique Digits.

Solution - Class in g0301_0400.s0363_max_sum_of_rectangle_no_larger_than_k

363 - Max Sum of Rectangle No Larger Than K.

Solution - Class in g0301_0400.s0365_water_and_jug_problem

365 - Water and Jug Problem.

Solution - Class in g0301_0400.s0367_valid_perfect_square

367 - Valid Perfect Square.

Solution - Class in g0301_0400.s0368_largest_divisible_subset

368 - Largest Divisible Subset.

Solution - Class in g0301_0400.s0371_sum_of_two_integers

371 - Sum of Two Integers.

Solution - Class in g0301_0400.s0372_super_pow

372 - Super Pow.

Solution - Class in g0301_0400.s0373_find_k_pairs_with_smallest_sums

373 - Find K Pairs with Smallest Sums.

Solution - Class in g0301_0400.s0374_guess_number_higher_or_lower

374 - Guess Number Higher or Lower.

Solution - Class in g0301_0400.s0375_guess_number_higher_or_lower_ii

375 - Guess Number Higher or Lower II.

Solution - Class in g0301_0400.s0376_wiggle_subsequence

376 - Wiggle Subsequence.

Solution - Class in g0301_0400.s0377_combination_sum_iv

377 - Combination Sum IV.

Solution - Class in g0301_0400.s0378_kth_smallest_element_in_a_sorted_matrix

378 - Kth Smallest Element in a Sorted Matrix.

Solution - Class in g0301_0400.s0382_linked_list_random_node

382 - Linked List Random Node.

Solution - Class in g0301_0400.s0383_ransom_note

383 - Ransom Note.

Solution - Class in g0301_0400.s0384_shuffle_an_array

384 - Shuffle an Array.

Solution - Class in g0301_0400.s0385_mini_parser

385 - Mini Parser.

Solution - Class in g0301_0400.s0386_lexicographical_numbers

386 - Lexicographical Numbers.

Solution - Class in g0301_0400.s0387_first_unique_character_in_a_string

387 - First Unique Character in a String.

Solution - Class in g0301_0400.s0388_longest_absolute_file_path

388 - Longest Absolute File Path.

Solution - Class in g0301_0400.s0389_find_the_difference

389 - Find the Difference.

Solution - Class in g0301_0400.s0390_elimination_game

390 - Elimination Game.

Solution - Class in g0301_0400.s0391_perfect_rectangle

391 - Perfect Rectangle.

Solution - Class in g0301_0400.s0392_is_subsequence

392 - Is Subsequence.

Solution - Class in g0301_0400.s0393_utf_8_validation

393 - UTF-8 Validation.

Solution - Class in g0301_0400.s0394_decode_string

394 - Decode String.

Solution - Class in g0301_0400.s0395_longest_substring_with_at_least_k_repeating_characters

395 - Longest Substring with At Least K Repeating Characters.

Solution - Class in g0301_0400.s0396_rotate_function

396 - Rotate Function.

Solution - Class in g0301_0400.s0397_integer_replacement

397 - Integer Replacement.

Solution - Class in g0301_0400.s0398_random_pick_index

398 - Random Pick Index.

Solution - Class in g0301_0400.s0399_evaluate_division

399 - Evaluate Division.

Solution - Class in g0301_0400.s0400_nth_digit

400 - Nth Digit.

Solution - Class in g0401_0500.s0401_binary_watch

401 - Binary Watch.

Solution - Class in g0401_0500.s0402_remove_k_digits

402 - Remove K Digits.

Solution - Class in g0401_0500.s0403_frog_jump

403 - Frog Jump.

Solution - Class in g0401_0500.s0404_sum_of_left_leaves

404 - Sum of Left Leaves.

Solution - Class in g0401_0500.s0405_convert_a_number_to_hexadecimal

405 - Convert a Number to Hexadecimal.

Solution - Class in g0401_0500.s0406_queue_reconstruction_by_height

406 - Queue Reconstruction by Height.

Solution - Class in g0401_0500.s0407_trapping_rain_water_ii

407 - Trapping Rain Water II.

Solution - Class in g0401_0500.s0409_longest_palindrome

409 - Longest Palindrome.

Solution - Class in g0401_0500.s0410_split_array_largest_sum

410 - Split Array Largest Sum.

Solution - Class in g0401_0500.s0412_fizz_buzz

412 - Fizz Buzz.

Solution - Class in g0401_0500.s0413_arithmetic_slices

413 - Arithmetic Slices.

Solution - Class in g0401_0500.s0414_third_maximum_number

414 - Third Maximum Number.

Solution - Class in g0401_0500.s0415_add_strings

415 - Add Strings.

Solution - Class in g0401_0500.s0416_partition_equal_subset_sum

416 - Partition Equal Subset Sum.

Solution - Class in g0401_0500.s0417_pacific_atlantic_water_flow

417 - Pacific Atlantic Water Flow.

Solution - Class in g0401_0500.s0419_battleships_in_a_board

419 - Battleships in a Board.

Solution - Class in g0401_0500.s0420_strong_password_checker

420 - Strong Password Checker.

Solution - Class in g0401_0500.s0421_maximum_xor_of_two_numbers_in_an_array

421 - Maximum XOR of Two Numbers in an Array.

Solution - Class in g0401_0500.s0423_reconstruct_original_digits_from_english

423 - Reconstruct Original Digits from English.

Solution - Class in g0401_0500.s0424_longest_repeating_character_replacement

424 - Longest Repeating Character Replacement.

Solution - Class in g0401_0500.s0427_construct_quad_tree

427 - Construct Quad Tree.

Solution - Class in g0401_0500.s0429_n_ary_tree_level_order_traversal

429 - N-ary Tree Level Order Traversal.

Solution - Class in g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list

430 - Flatten a Multilevel Doubly Linked List.

Solution - Class in g0401_0500.s0433_minimum_genetic_mutation

433 - Minimum Genetic Mutation.

Solution - Class in g0401_0500.s0434_number_of_segments_in_a_string

434 - Number of Segments in a String.

Solution - Class in g0401_0500.s0435_non_overlapping_intervals

435 - Non-overlapping Intervals.

Solution - Class in g0401_0500.s0436_find_right_interval

436 - Find Right Interval.

Solution - Class in g0401_0500.s0437_path_sum_iii

437 - Path Sum III.

Solution - Class in g0401_0500.s0438_find_all_anagrams_in_a_string

438 - Find All Anagrams in a String.

Solution - Class in g0401_0500.s0440_k_th_smallest_in_lexicographical_order

440 - K-th Smallest in Lexicographical Order.

Solution - Class in g0401_0500.s0441_arranging_coins

441 - Arranging Coins.

Solution - Class in g0401_0500.s0442_find_all_duplicates_in_an_array

442 - Find All Duplicates in an Array.

Solution - Class in g0401_0500.s0443_string_compression

443 - String Compression.

Solution - Class in g0401_0500.s0445_add_two_numbers_ii

445 - Add Two Numbers II.

Solution - Class in g0401_0500.s0446_arithmetic_slices_ii_subsequence

446 - Arithmetic Slices II - Subsequence.

Solution - Class in g0401_0500.s0447_number_of_boomerangs

447 - Number of Boomerangs.

Solution - Class in g0401_0500.s0448_find_all_numbers_disappeared_in_an_array

448 - Find All Numbers Disappeared in an Array.

Solution - Class in g0401_0500.s0450_delete_node_in_a_bst

450 - Delete Node in a BST.

Solution - Class in g0401_0500.s0451_sort_characters_by_frequency

451 - Sort Characters By Frequency.

Solution - Class in g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons

452 - Minimum Number of Arrows to Burst Balloons.

Solution - Class in g0401_0500.s0453_minimum_moves_to_equal_array_elements

453 - Minimum Moves to Equal Array Elements.

Solution - Class in g0401_0500.s0454_4sum_ii

454 - 4Sum II.

Solution - Class in g0401_0500.s0455_assign_cookies

455 - Assign Cookies.

Solution - Class in g0401_0500.s0456_132_pattern

456 - 132 Pattern.

Solution - Class in g0401_0500.s0457_circular_array_loop

457 - Circular Array Loop.

Solution - Class in g0401_0500.s0458_poor_pigs

458 - Poor Pigs.

Solution - Class in g0401_0500.s0459_repeated_substring_pattern

459 - Repeated Substring Pattern.

Solution - Class in g0401_0500.s0461_hamming_distance

461 - Hamming Distance.

Solution - Class in g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii

462 - Minimum Moves to Equal Array Elements II.

Solution - Class in g0401_0500.s0463_island_perimeter

463 - Island Perimeter.

Solution - Class in g0401_0500.s0464_can_i_win

464 - Can I Win.

Solution - Class in g0401_0500.s0466_count_the_repetitions

466 - Count The Repetitions.

Solution - Class in g0401_0500.s0467_unique_substrings_in_wraparound_string

467 - Unique Substrings in Wraparound String.

Solution - Class in g0401_0500.s0468_validate_ip_address

468 - Validate IP Address.

Solution - Class in g0401_0500.s0470_implement_rand10_using_rand7

470 - Implement Rand10() Using Rand7().

Solution - Class in g0401_0500.s0472_concatenated_words

472 - Concatenated Words.

Solution - Class in g0401_0500.s0473_matchsticks_to_square

473 - Matchsticks to Square.

Solution - Class in g0401_0500.s0474_ones_and_zeroes

474 - Ones and Zeroes.

Solution - Class in g0401_0500.s0475_heaters

475 - Heaters.

Solution - Class in g0401_0500.s0476_number_complement

476 - Number Complement.

Solution - Class in g0401_0500.s0477_total_hamming_distance

477 - Total Hamming Distance.

Solution - Class in g0401_0500.s0478_generate_random_point_in_a_circle

478 - Generate Random Point in a Circle.

Solution - Class in g0401_0500.s0479_largest_palindrome_product

479 - Largest Palindrome Product.

Solution - Class in g0401_0500.s0480_sliding_window_median

480 - Sliding Window Median.

Solution - Class in g0401_0500.s0481_magical_string

481 - Magical String.

Solution - Class in g0401_0500.s0482_license_key_formatting

482 - License Key Formatting.

Solution - Class in g0401_0500.s0483_smallest_good_base

483 - Smallest Good Base.

Solution - Class in g0401_0500.s0485_max_consecutive_ones

485 - Max Consecutive Ones.

Solution - Class in g0401_0500.s0486_predict_the_winner

486 - Predict the Winner.

Solution - Class in g0401_0500.s0488_zuma_game

488 - Zuma Game.

Solution - Class in g0401_0500.s0491_increasing_subsequences

491 - Increasing Subsequences.

Solution - Class in g0401_0500.s0492_construct_the_rectangle

492 - Construct the Rectangle.

Solution - Class in g0401_0500.s0493_reverse_pairs

493 - Reverse Pairs.

Solution - Class in g0401_0500.s0494_target_sum

494 - Target Sum.

Solution - Class in g0401_0500.s0495_teemo_attacking

495 - Teemo Attacking.

Solution - Class in g0401_0500.s0496_next_greater_element_i

496 - Next Greater Element I.

Solution - Class in g0401_0500.s0497_random_point_in_non_overlapping_rectangles

497 - Random Point in Non-overlapping Rectangles.

Solution - Class in g0401_0500.s0498_diagonal_traverse

498 - Diagonal Traverse.

Solution - Class in g0401_0500.s0500_keyboard_row

500 - Keyboard Row.

Solution - Class in g0501_0600.s0501_find_mode_in_binary_search_tree

501 - Find Mode in Binary Search Tree.

Solution - Class in g0501_0600.s0502_ipo

502 - IPO.

Solution - Class in g0501_0600.s0503_next_greater_element_ii

503 - Next Greater Element II.

Solution - Class in g0501_0600.s0504_base_7

504 - Base 7.

Solution - Class in g0501_0600.s0506_relative_ranks

506 - Relative Ranks.

Solution - Class in g0501_0600.s0507_perfect_number

507 - Perfect Number.

Solution - Class in g0501_0600.s0508_most_frequent_subtree_sum

508 - Most Frequent Subtree Sum.

Solution - Class in g0501_0600.s0509_fibonacci_number

509 - Fibonacci Number.

Solution - Class in g0501_0600.s0513_find_bottom_left_tree_value

513 - Find Bottom Left Tree Value.

Solution - Class in g0501_0600.s0514_freedom_trail

514 - Freedom Trail.

Solution - Class in g0501_0600.s0515_find_largest_value_in_each_tree_row

515 - Find Largest Value in Each Tree Row.

Solution - Class in g0501_0600.s0516_longest_palindromic_subsequence

516 - Longest Palindromic Subsequence.

Solution - Class in g0501_0600.s0517_super_washing_machines

517 - Super Washing Machines.

Solution - Class in g0501_0600.s0518_coin_change_2

518 - Coin Change 2.

Solution - Class in g0501_0600.s0519_random_flip_matrix

519 - Random Flip Matrix.

Solution - Class in g0501_0600.s0520_detect_capital

520 - Detect Capital.

Solution - Class in g0501_0600.s0521_longest_uncommon_subsequence_i

521 - Longest Uncommon Subsequence I.

Solution - Class in g0501_0600.s0522_longest_uncommon_subsequence_ii

522 - Longest Uncommon Subsequence II.

Solution - Class in g0501_0600.s0523_continuous_subarray_sum

523 - Continuous Subarray Sum.

Solution - Class in g0501_0600.s0524_longest_word_in_dictionary_through_deleting

524 - Longest Word in Dictionary through Deleting.

Solution - Class in g0501_0600.s0525_contiguous_array

525 - Contiguous Array.

Solution - Class in g0501_0600.s0526_beautiful_arrangement

526 - Beautiful Arrangement.

Solution - Class in g0501_0600.s0528_random_pick_with_weight

528 - Random Pick with Weight.

Solution - Class in g0501_0600.s0529_minesweeper

529 - Minesweeper.

Solution - Class in g0501_0600.s0530_minimum_absolute_difference_in_bst

530 - Minimum Absolute Difference in BST.

Solution - Class in g0501_0600.s0532_k_diff_pairs_in_an_array

532 - K-diff Pairs in an Array.

Solution - Class in g0501_0600.s0537_complex_number_multiplication

537 - Complex Number Multiplication.

Solution - Class in g0501_0600.s0538_convert_bst_to_greater_tree

538 - Convert BST to Greater Tree.

Solution - Class in g0501_0600.s0539_minimum_time_difference

539 - Minimum Time Difference.

Solution - Class in g0501_0600.s0540_single_element_in_a_sorted_array

540 - Single Element in a Sorted Array.

Solution - Class in g0501_0600.s0541_reverse_string_ii

541 - Reverse String II.

Solution - Class in g0501_0600.s0542_01_matrix

542 - 01 Matrix.

Solution - Class in g0501_0600.s0543_diameter_of_binary_tree

543 - Diameter of Binary Tree.

Solution - Class in g0501_0600.s0546_remove_boxes

546 - Remove Boxes.

Solution - Class in g0501_0600.s0547_number_of_provinces

547 - Number of Provinces.

Solution - Class in g0501_0600.s0551_student_attendance_record_i

551 - Student Attendance Record I.

Solution - Class in g0501_0600.s0552_student_attendance_record_ii

552 - Student Attendance Record II.

Solution - Class in g0501_0600.s0553_optimal_division

553 - Optimal Division.

Solution - Class in g0501_0600.s0554_brick_wall

554 - Brick Wall.

Solution - Class in g0501_0600.s0556_next_greater_element_iii

556 - Next Greater Element III.

Solution - Class in g0501_0600.s0557_reverse_words_in_a_string_iii

557 - Reverse Words in a String III.

Solution - Class in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees

558 - Logical OR of Two Binary Grids Represented as Quad-Trees.

Solution - Class in g0501_0600.s0559_maximum_depth_of_n_ary_tree

559 - Maximum Depth of N-ary Tree.

Solution - Class in g0501_0600.s0560_subarray_sum_equals_k

560 - Subarray Sum Equals K.

Solution - Class in g0501_0600.s0561_array_partition_i

561 - Array Partition I.

Solution - Class in g0501_0600.s0563_binary_tree_tilt

563 - Binary Tree Tilt.

Solution - Class in g0501_0600.s0564_find_the_closest_palindrome

564 - Find the Closest Palindrome.

Solution - Class in g0501_0600.s0565_array_nesting

565 - Array Nesting.

Solution - Class in g0501_0600.s0566_reshape_the_matrix

566 - Reshape the Matrix.

Solution - Class in g0501_0600.s0567_permutation_in_string

567 - Permutation in String.

Solution - Class in g0501_0600.s0572_subtree_of_another_tree

572 - Subtree of Another Tree.

Solution - Class in g0501_0600.s0575_distribute_candies

575 - Distribute Candies.

Solution - Class in g0501_0600.s0576_out_of_boundary_paths

576 - Out of Boundary Paths.

Solution - Class in g0501_0600.s0581_shortest_unsorted_continuous_subarray

581 - Shortest Unsorted Continuous Subarray.

Solution - Class in g0501_0600.s0583_delete_operation_for_two_strings

583 - Delete Operation for Two Strings.

Solution - Class in g0501_0600.s0587_erect_the_fence

587 - Erect the Fence.

Solution - Class in g0501_0600.s0589_n_ary_tree_preorder_traversal

589 - N-ary Tree Preorder Traversal.

Solution - Class in g0501_0600.s0590_n_ary_tree_postorder_traversal

590 - N-ary Tree Postorder Traversal.

Solution - Class in g0501_0600.s0591_tag_validator

591 - Tag Validator.

Solution - Class in g0501_0600.s0592_fraction_addition_and_subtraction

592 - Fraction Addition and Subtraction.

Solution - Class in g0501_0600.s0593_valid_square

593 - Valid Square.

Solution - Class in g0501_0600.s0594_longest_harmonious_subsequence

594 - Longest Harmonious Subsequence.

Solution - Class in g0501_0600.s0598_range_addition_ii

598 - Range Addition II.

Solution - Class in g0501_0600.s0599_minimum_index_sum_of_two_lists

599 - Minimum Index Sum of Two Lists.

Solution - Class in g0501_0600.s0600_non_negative_integers_without_consecutive_ones

600 - Non-negative Integers without Consecutive Ones.

Solution - Class in g0601_0700.s0605_can_place_flowers

605 - Can Place Flowers.

Solution - Class in g0601_0700.s0606_construct_string_from_binary_tree

606 - Construct String from Binary Tree.

Solution - Class in g0601_0700.s0609_find_duplicate_file_in_system

609 - Find Duplicate File in System.

Solution - Class in g0601_0700.s0611_valid_triangle_number

611 - Valid Triangle Number.

Solution - Class in g0601_0700.s0617_merge_two_binary_trees

617 - Merge Two Binary Trees.

Solution - Class in g0601_0700.s0621_task_scheduler

621 - Task Scheduler.

Solution - Class in g0601_0700.s0623_add_one_row_to_tree

623 - Add One Row to Tree.

Solution - Class in g0601_0700.s0628_maximum_product_of_three_numbers

628 - Maximum Product of Three Numbers.

Solution - Class in g0601_0700.s0629_k_inverse_pairs_array

629 - K Inverse Pairs Array.

Solution - Class in g0601_0700.s0630_course_schedule_iii

630 - Course Schedule III.

Solution - Class in g0601_0700.s0632_smallest_range_covering_elements_from_k_lists

Solution - Class in g0601_0700.s0633_sum_of_square_numbers

633 - Sum of Square Numbers.

Solution - Class in g0601_0700.s0636_exclusive_time_of_functions

636 - Exclusive Time of Functions.

Solution - Class in g0601_0700.s0637_average_of_levels_in_binary_tree

637 - Average of Levels in Binary Tree.

Solution - Class in g0601_0700.s0638_shopping_offers

638 - Shopping Offers.

Solution - Class in g0601_0700.s0639_decode_ways_ii

639 - Decode Ways II.

Solution - Class in g0601_0700.s0640_solve_the_equation

640 - Solve the Equation.

Solution - Class in g0601_0700.s0643_maximum_average_subarray_i

643 - Maximum Average Subarray I.

Solution - Class in g0601_0700.s0645_set_mismatch

645 - Set Mismatch.

Solution - Class in g0601_0700.s0646_maximum_length_of_pair_chain

646 - Maximum Length of Pair Chain.

Solution - Class in g0601_0700.s0647_palindromic_substrings

647 - Palindromic Substrings.

Solution - Class in g0601_0700.s0648_replace_words

648 - Replace Words.

Solution - Class in g0601_0700.s0649_dota2_senate

649 - Dota2 Senate.

Solution - Class in g0601_0700.s0650_2_keys_keyboard

650 - 2 Keys Keyboard.

Solution - Class in g0601_0700.s0652_find_duplicate_subtrees

652 - Find Duplicate Subtrees.

Solution - Class in g0601_0700.s0653_two_sum_iv_input_is_a_bst

653 - Two Sum IV - Input is a BST.

Solution - Class in g0601_0700.s0654_maximum_binary_tree

654 - Maximum Binary Tree.

Solution - Class in g0601_0700.s0655_print_binary_tree

655 - Print Binary Tree.

Solution - Class in g0601_0700.s0657_robot_return_to_origin

657 - Robot Return to Origin.

Solution - Class in g0601_0700.s0658_find_k_closest_elements

658 - Find K Closest Elements.

Solution - Class in g0601_0700.s0659_split_array_into_consecutive_subsequences

659 - Split Array into Consecutive Subsequences.

Solution - Class in g0601_0700.s0661_image_smoother

661 - Image Smoother.

Solution - Class in g0601_0700.s0662_maximum_width_of_binary_tree

662 - Maximum Width of Binary Tree.

Solution - Class in g0601_0700.s0664_strange_printer

664 - Strange Printer.

Solution - Class in g0601_0700.s0665_non_decreasing_array

665 - Non-decreasing Array.

Solution - Class in g0601_0700.s0667_beautiful_arrangement_ii

667 - Beautiful Arrangement II.

Solution - Class in g0601_0700.s0668_kth_smallest_number_in_multiplication_table

668 - Kth Smallest Number in Multiplication Table.

Solution - Class in g0601_0700.s0669_trim_a_binary_search_tree

669 - Trim a Binary Search Tree.

Solution - Class in g0601_0700.s0670_maximum_swap

670 - Maximum Swap.

Solution - Class in g0601_0700.s0671_second_minimum_node_in_a_binary_tree

671 - Second Minimum Node In a Binary Tree.

Solution - Class in g0601_0700.s0672_bulb_switcher_ii

672 - Bulb Switcher II.

Solution - Class in g0601_0700.s0673_number_of_longest_increasing_subsequence

673 - Number of Longest Increasing Subsequence.

Solution - Class in g0601_0700.s0674_longest_continuous_increasing_subsequence

674 - Longest Continuous Increasing Subsequence.

Solution - Class in g0601_0700.s0675_cut_off_trees_for_golf_event

675 - Cut Off Trees for Golf Event.

Solution - Class in g0601_0700.s0678_valid_parenthesis_string

678 - Valid Parenthesis String.

Solution - Class in g0601_0700.s0679_24_game

679 - 24 Game.

Solution - Class in g0601_0700.s0680_valid_palindrome_ii

680 - Valid Palindrome II.

Solution - Class in g0601_0700.s0682_baseball_game

682 - Baseball Game.

Solution - Class in g0601_0700.s0684_redundant_connection

684 - Redundant Connection.

Solution - Class in g0601_0700.s0685_redundant_connection_ii

685 - Redundant Connection II.

Solution - Class in g0601_0700.s0686_repeated_string_match

686 - Repeated String Match.

Solution - Class in g0601_0700.s0687_longest_univalue_path

687 - Longest Univalue Path.

Solution - Class in g0601_0700.s0688_knight_probability_in_chessboard

688 - Knight Probability in Chessboard.

Solution - Class in g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays

689 - Maximum Sum of 3 Non-Overlapping Subarrays.

Solution - Class in g0601_0700.s0690_employee_importance

690 - Employee Importance.

Solution - Class in g0601_0700.s0691_stickers_to_spell_word

691 - Stickers to Spell Word.

Solution - Class in g0601_0700.s0692_top_k_frequent_words

692 - Top K Frequent Words.

Solution - Class in g0601_0700.s0693_binary_number_with_alternating_bits

693 - Binary Number with Alternating Bits.

Solution - Class in g0601_0700.s0695_max_area_of_island

695 - Max Area of Island.

Solution - Class in g0601_0700.s0696_count_binary_substrings

696 - Count Binary Substrings.

Solution - Class in g0601_0700.s0697_degree_of_an_array

697 - Degree of an Array.

Solution - Class in g0601_0700.s0698_partition_to_k_equal_sum_subsets

698 - Partition to K Equal Sum Subsets.

Solution - Class in g0601_0700.s0699_falling_squares

699 - Falling Squares.

Solution - Class in g0601_0700.s0700_search_in_a_binary_search_tree

700 - Search in a Binary Search Tree.

Solution - Class in g0701_0800.s0701_insert_into_a_binary_search_tree

701 - Insert into a Binary Search Tree.

Solution - Class in g0701_0800.s0704_binary_search

704 - Binary Search.

Solution - Class in g0701_0800.s0709_to_lower_case

709 - To Lower Case.

Solution - Class in g0701_0800.s0710_random_pick_with_blacklist

710 - Random Pick with Blacklist.

Solution - Class in g0701_0800.s0712_minimum_ascii_delete_sum_for_two_strings

712 - Minimum ASCII Delete Sum for Two Strings.

Solution - Class in g0701_0800.s0713_subarray_product_less_than_k

713 - Subarray Product Less Than K.

Solution - Class in g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee

714 - Best Time to Buy and Sell Stock with Transaction Fee.

Solution - Class in g0701_0800.s0717_1_bit_and_2_bit_characters

717 - 1-bit and 2-bit Characters.

Solution - Class in g0701_0800.s0718_maximum_length_of_repeated_subarray

718 - Maximum Length of Repeated Subarray.

Solution - Class in g0701_0800.s0719_find_k_th_smallest_pair_distance

719 - Find K-th Smallest Pair Distance.

Solution - Class in g0701_0800.s0720_longest_word_in_dictionary

720 - Longest Word in Dictionary.

Solution - Class in g0701_0800.s0721_accounts_merge

721 - Accounts Merge.

Solution - Class in g0701_0800.s0722_remove_comments

722 - Remove Comments.

Solution - Class in g0701_0800.s0724_find_pivot_index

724 - Find Pivot Index.

Solution - Class in g0701_0800.s0725_split_linked_list_in_parts

725 - Split Linked List in Parts.

Solution - Class in g0701_0800.s0726_number_of_atoms

726 - Number of Atoms.

Solution - Class in g0701_0800.s0728_self_dividing_numbers

728 - Self Dividing Numbers.

Solution - Class in g0701_0800.s0730_count_different_palindromic_subsequences

730 - Count Different Palindromic Subsequences.

Solution - Class in g0701_0800.s0733_flood_fill

733 - Flood Fill.

Solution - Class in g0701_0800.s0735_asteroid_collision

735 - Asteroid Collision.

Solution - Class in g0701_0800.s0736_parse_lisp_expression

736 - Parse Lisp Expression.

Solution - Class in g0701_0800.s0738_monotone_increasing_digits

738 - Monotone Increasing Digits.

Solution - Class in g0701_0800.s0739_daily_temperatures

739 - Daily Temperatures.

Solution - Class in g0701_0800.s0740_delete_and_earn

740 - Delete and Earn.

Solution - Class in g0701_0800.s0741_cherry_pickup

741 - Cherry Pickup.

Solution - Class in g0701_0800.s0743_network_delay_time

743 - Network Delay Time.

Solution - Class in g0701_0800.s0744_find_smallest_letter_greater_than_target

744 - Find Smallest Letter Greater Than Target.

Solution - Class in g0701_0800.s0746_min_cost_climbing_stairs

746 - Min Cost Climbing Stairs.

Solution - Class in g0701_0800.s0747_largest_number_at_least_twice_of_others

747 - Largest Number At Least Twice of Others.

Solution - Class in g0701_0800.s0748_shortest_completing_word

748 - Shortest Completing Word.

Solution - Class in g0701_0800.s0749_contain_virus

749 - Contain Virus.

Solution - Class in g0701_0800.s0752_open_the_lock

752 - Open the Lock.

Solution - Class in g0701_0800.s0753_cracking_the_safe

753 - Cracking the Safe.

Solution - Class in g0701_0800.s0754_reach_a_number

754 - Reach a Number.

Solution - Class in g0701_0800.s0756_pyramid_transition_matrix

756 - Pyramid Transition Matrix.

Solution - Class in g0701_0800.s0757_set_intersection_size_at_least_two

757 - Set Intersection Size At Least Two.

Solution - Class in g0701_0800.s0761_special_binary_string

761 - Special Binary String.

Solution - Class in g0701_0800.s0762_prime_number_of_set_bits_in_binary_representation

762 - Prime Number of Set Bits in Binary Representation.

Solution - Class in g0701_0800.s0763_partition_labels

763 - Partition Labels.

Solution - Class in g0701_0800.s0764_largest_plus_sign

764 - Largest Plus Sign.

Solution - Class in g0701_0800.s0765_couples_holding_hands

765 - Couples Holding Hands.

Solution - Class in g0701_0800.s0766_toeplitz_matrix

766 - Toeplitz Matrix.

Solution - Class in g0701_0800.s0767_reorganize_string

767 - Reorganize String.

Solution - Class in g0701_0800.s0768_max_chunks_to_make_sorted_ii

768 - Max Chunks To Make Sorted II.

Solution - Class in g0701_0800.s0769_max_chunks_to_make_sorted

769 - Max Chunks To Make Sorted.

Solution - Class in g0701_0800.s0770_basic_calculator_iv

770 - Basic Calculator IV.

Solution - Class in g0701_0800.s0771_jewels_and_stones

771 - Jewels and Stones.

Solution - Class in g0701_0800.s0773_sliding_puzzle

773 - Sliding Puzzle.

Solution - Class in g0701_0800.s0775_global_and_local_inversions

775 - Global and Local Inversions.

Solution - Class in g0701_0800.s0777_swap_adjacent_in_lr_string

777 - Swap Adjacent in LR String.

Solution - Class in g0701_0800.s0778_swim_in_rising_water

778 - Swim in Rising Water.

Solution - Class in g0701_0800.s0779_k_th_symbol_in_grammar

779 - K-th Symbol in Grammar.

Solution - Class in g0701_0800.s0780_reaching_points

780 - Reaching Points.

Solution - Class in g0701_0800.s0781_rabbits_in_forest

781 - Rabbits in Forest.

Solution - Class in g0701_0800.s0782_transform_to_chessboard

782 - Transform to Chessboard.

Solution - Class in g0701_0800.s0783_minimum_distance_between_bst_nodes

783 - Minimum Distance Between BST Nodes.

Solution - Class in g0701_0800.s0784_letter_case_permutation

784 - Letter Case Permutation.

Solution - Class in g0701_0800.s0785_is_graph_bipartite

785 - Is Graph Bipartite?

Solution - Class in g0701_0800.s0786_k_th_smallest_prime_fraction

786 - K-th Smallest Prime Fraction.

Solution - Class in g0701_0800.s0787_cheapest_flights_within_k_stops

787 - Cheapest Flights Within K Stops.

Solution - Class in g0701_0800.s0788_rotated_digits

788 - Rotated Digits.

Solution - Class in g0701_0800.s0789_escape_the_ghosts

789 - Escape The Ghosts.

Solution - Class in g0701_0800.s0790_domino_and_tromino_tiling

790 - Domino and Tromino Tiling.

Solution - Class in g0701_0800.s0791_custom_sort_string

791 - Custom Sort String.

Solution - Class in g0701_0800.s0792_number_of_matching_subsequences

792 - Number of Matching Subsequences.

Solution - Class in g0701_0800.s0793_preimage_size_of_factorial_zeroes_function

793 - Preimage Size of Factorial Zeroes Function.

Solution - Class in g0701_0800.s0794_valid_tic_tac_toe_state

794 - Valid Tic-Tac-Toe State.

Solution - Class in g0701_0800.s0795_number_of_subarrays_with_bounded_maximum

795 - Number of Subarrays with Bounded Maximum.

Solution - Class in g0701_0800.s0796_rotate_string

796 - Rotate String.

Solution - Class in g0701_0800.s0797_all_paths_from_source_to_target

797 - All Paths From Source to Target.

Solution - Class in g0701_0800.s0798_smallest_rotation_with_highest_score

798 - Smallest Rotation with Highest Score.

Solution - Class in g0701_0800.s0799_champagne_tower

799 - Champagne Tower.

Solution - Class in g0801_0900.s0801_minimum_swaps_to_make_sequences_increasing

801 - Minimum Swaps To Make Sequences Increasing.

Solution - Class in g0801_0900.s0802_find_eventual_safe_states

802 - Find Eventual Safe States.

Solution - Class in g0801_0900.s0803_bricks_falling_when_hit

803 - Bricks Falling When Hit.

Solution - Class in g0801_0900.s0804_unique_morse_code_words

804 - Unique Morse Code Words.

Solution - Class in g0801_0900.s0805_split_array_with_same_average

805 - Split Array With Same Average.

Solution - Class in g0801_0900.s0806_number_of_lines_to_write_string

806 - Number of Lines To Write String.

Solution - Class in g0801_0900.s0807_max_increase_to_keep_city_skyline

807 - Max Increase to Keep City Skyline.

Solution - Class in g0801_0900.s0808_soup_servings

808 - Soup Servings.

Solution - Class in g0801_0900.s0809_expressive_words

809 - Expressive Words.

Solution - Class in g0801_0900.s0810_chalkboard_xor_game

810 - Chalkboard XOR Game.

Solution - Class in g0801_0900.s0811_subdomain_visit_count

811 - Subdomain Visit Count.

Solution - Class in g0801_0900.s0812_largest_triangle_area

812 - Largest Triangle Area.

Solution - Class in g0801_0900.s0813_largest_sum_of_averages

813 - Largest Sum of Averages.

Solution - Class in g0801_0900.s0814_binary_tree_pruning

814 - Binary Tree Pruning.

Solution - Class in g0801_0900.s0815_bus_routes

815 - Bus Routes.

Solution - Class in g0801_0900.s0816_ambiguous_coordinates

816 - Ambiguous Coordinates.

Solution - Class in g0801_0900.s0817_linked_list_components

817 - Linked List Components.

Solution - Class in g0801_0900.s0818_race_car

818 - Race Car.

Solution - Class in g0801_0900.s0819_most_common_word

819 - Most Common Word.

Solution - Class in g0801_0900.s0820_short_encoding_of_words

820 - Short Encoding of Words.

Solution - Class in g0801_0900.s0821_shortest_distance_to_a_character

821 - Shortest Distance to a Character.

Solution - Class in g0801_0900.s0822_card_flipping_game

822 - Card Flipping Game.

Solution - Class in g0801_0900.s0823_binary_trees_with_factors

823 - Binary Trees With Factors.

Solution - Class in g0801_0900.s0824_goat_latin

824 - Goat Latin.

Solution - Class in g0801_0900.s0825_friends_of_appropriate_ages

825 - Friends Of Appropriate Ages.

Solution - Class in g0801_0900.s0826_most_profit_assigning_work

826 - Most Profit Assigning Work.

Solution - Class in g0801_0900.s0827_making_a_large_island

827 - Making A Large Island.

Solution - Class in g0801_0900.s0828_count_unique_characters_of_all_substrings_of_a_given_string

828 - Count Unique Characters of All Substrings of a Given String.

Solution - Class in g0801_0900.s0829_consecutive_numbers_sum

829 - Consecutive Numbers Sum.

Solution - Class in g0801_0900.s0830_positions_of_large_groups

830 - Positions of Large Groups.

Solution - Class in g0801_0900.s0831_masking_personal_information

831 - Masking Personal Information.

Solution - Class in g0801_0900.s0832_flipping_an_image

832 - Flipping an Image.

Solution - Class in g0801_0900.s0833_find_and_replace_in_string

833 - Find And Replace in String.

Solution - Class in g0801_0900.s0834_sum_of_distances_in_tree

834 - Sum of Distances in Tree.

Solution - Class in g0801_0900.s0835_image_overlap

835 - Image Overlap.

Solution - Class in g0801_0900.s0836_rectangle_overlap

836 - Rectangle Overlap.

Solution - Class in g0801_0900.s0837_new_21_game

837 - New 21 Game.

Solution - Class in g0801_0900.s0838_push_dominoes

838 - Push Dominoes.

Solution - Class in g0801_0900.s0839_similar_string_groups

839 - Similar String Groups.

Solution - Class in g0801_0900.s0840_magic_squares_in_grid

840 - Magic Squares In Grid.

Solution - Class in g0801_0900.s0841_keys_and_rooms

841 - Keys and Rooms.

Solution - Class in g0801_0900.s0842_split_array_into_fibonacci_sequence

842 - Split Array into Fibonacci Sequence.

Solution - Class in g0801_0900.s0843_guess_the_word

843 - Guess the Word.

Solution - Class in g0801_0900.s0844_backspace_string_compare

844 - Backspace String Compare.

Solution - Class in g0801_0900.s0845_longest_mountain_in_array

845 - Longest Mountain in Array.

Solution - Class in g0801_0900.s0846_hand_of_straights

846 - Hand of Straights.

Solution - Class in g0801_0900.s0847_shortest_path_visiting_all_nodes

847 - Shortest Path Visiting All Nodes.

Solution - Class in g0801_0900.s0848_shifting_letters

848 - Shifting Letters.

Solution - Class in g0801_0900.s0849_maximize_distance_to_closest_person

849 - Maximize Distance to Closest Person.

Solution - Class in g0801_0900.s0850_rectangle_area_ii

850 - Rectangle Area II.

Solution - Class in g0801_0900.s0851_loud_and_rich

851 - Loud and Rich.

Solution - Class in g0801_0900.s0852_peak_index_in_a_mountain_array

852 - Peak Index in a Mountain Array.

Solution - Class in g0801_0900.s0853_car_fleet

853 - Car Fleet.

Solution - Class in g0801_0900.s0854_k_similar_strings

854 - K-Similar Strings.

Solution - Class in g0801_0900.s0856_score_of_parentheses

856 - Score of Parentheses.

Solution - Class in g0801_0900.s0857_minimum_cost_to_hire_k_workers

857 - Minimum Cost to Hire K Workers.

Solution - Class in g0801_0900.s0858_mirror_reflection

858 - Mirror Reflection.

Solution - Class in g0801_0900.s0859_buddy_strings

859 - Buddy Strings.

Solution - Class in g0801_0900.s0860_lemonade_change

860 - Lemonade Change.

Solution - Class in g0801_0900.s0861_score_after_flipping_matrix

861 - Score After Flipping Matrix.

Solution - Class in g0801_0900.s0862_shortest_subarray_with_sum_at_least_k

862 - Shortest Subarray with Sum at Least K.

Solution - Class in g0801_0900.s0863_all_nodes_distance_k_in_binary_tree

863 - All Nodes Distance K in Binary Tree.

Solution - Class in g0801_0900.s0864_shortest_path_to_get_all_keys

864 - Shortest Path to Get All Keys.

Solution - Class in g0801_0900.s0865_smallest_subtree_with_all_the_deepest_nodes

865 - Smallest Subtree with all the Deepest Nodes.

Solution - Class in g0801_0900.s0866_prime_palindrome

866 - Prime Palindrome.

Solution - Class in g0801_0900.s0867_transpose_matrix

867 - Transpose Matrix.

Solution - Class in g0801_0900.s0868_binary_gap

868 - Binary Gap.

Solution - Class in g0801_0900.s0869_reordered_power_of_2

869 - Reordered Power of 2.

Solution - Class in g0801_0900.s0870_advantage_shuffle

870 - Advantage Shuffle.

Solution - Class in g0801_0900.s0871_minimum_number_of_refueling_stops

871 - Minimum Number of Refueling Stops.

Solution - Class in g0801_0900.s0872_leaf_similar_trees

872 - Leaf-Similar Trees.

Solution - Class in g0801_0900.s0873_length_of_longest_fibonacci_subsequence

873 - Length of Longest Fibonacci Subsequence.

Solution - Class in g0801_0900.s0874_walking_robot_simulation

874 - Walking Robot Simulation.

Solution - Class in g0801_0900.s0875_koko_eating_bananas

875 - Koko Eating Bananas.

Solution - Class in g0801_0900.s0876_middle_of_the_linked_list

876 - Middle of the Linked List.

Solution - Class in g0801_0900.s0877_stone_game

877 - Stone Game.

Solution - Class in g0801_0900.s0878_nth_magical_number

878 - Nth Magical Number.

Solution - Class in g0801_0900.s0879_profitable_schemes

879 - Profitable Schemes.

Solution - Class in g0801_0900.s0880_decoded_string_at_index

880 - Decoded String at Index.

Solution - Class in g0801_0900.s0881_boats_to_save_people

881 - Boats to Save People.

Solution - Class in g0801_0900.s0882_reachable_nodes_in_subdivided_graph

882 - Reachable Nodes In Subdivided Graph.

Solution - Class in g0801_0900.s0883_projection_area_of_3d_shapes

883 - Projection Area of 3D Shapes.

Solution - Class in g0801_0900.s0884_uncommon_words_from_two_sentences

884 - Uncommon Words from Two Sentences.

Solution - Class in g0801_0900.s0885_spiral_matrix_iii

885 - Spiral Matrix III.

Solution - Class in g0801_0900.s0886_possible_bipartition

886 - Possible Bipartition.

Solution - Class in g0801_0900.s0887_super_egg_drop

887 - Super Egg Drop.

Solution - Class in g0801_0900.s0888_fair_candy_swap

888 - Fair Candy Swap.

Solution - Class in g0801_0900.s0889_construct_binary_tree_from_preorder_and_postorder_traversal

889 - Construct Binary Tree from Preorder and Postorder Traversal.

Solution - Class in g0801_0900.s0890_find_and_replace_pattern

890 - Find and Replace Pattern.

Solution - Class in g0801_0900.s0891_sum_of_subsequence_widths

891 - Sum of Subsequence Widths.

Solution - Class in g0801_0900.s0892_surface_area_of_3d_shapes

892 - Surface Area of 3D Shapes.

Solution - Class in g0801_0900.s0893_groups_of_special_equivalent_strings

893 - Groups of Special-Equivalent Strings.

Solution - Class in g0801_0900.s0896_monotonic_array

896 - Monotonic Array.

Solution - Class in g0801_0900.s0897_increasing_order_search_tree

897 - Increasing Order Search Tree.

Solution - Class in g0801_0900.s0898_bitwise_ors_of_subarrays

898 - Bitwise ORs of Subarrays.

Solution - Class in g0801_0900.s0899_orderly_queue

899 - Orderly Queue.

Solution - Class in g0901_1000.s0902_numbers_at_most_n_given_digit_set

902 - Numbers At Most N Given Digit Set.

Solution - Class in g0901_1000.s0903_valid_permutations_for_di_sequence

903 - Valid Permutations for DI Sequence.

Solution - Class in g0901_1000.s0904_fruit_into_baskets

904 - Fruit Into Baskets.

Solution - Class in g0901_1000.s0905_sort_array_by_parity

905 - Sort Array By Parity.

Solution - Class in g0901_1000.s0906_super_palindromes

906 - Super Palindromes.

Solution - Class in g0901_1000.s0907_sum_of_subarray_minimums

907 - Sum of Subarray Minimums.

Solution - Class in g0901_1000.s0908_smallest_range_i

908 - Smallest Range I.

Solution - Class in g0901_1000.s0909_snakes_and_ladders

909 - Snakes and Ladders.

Solution - Class in g0901_1000.s0910_smallest_range_ii

910 - Smallest Range II.

Solution - Class in g0901_1000.s0912_sort_an_array

912 - Sort an Array.

Solution - Class in g0901_1000.s0913_cat_and_mouse

913 - Cat and Mouse.

Solution - Class in g0901_1000.s0914_x_of_a_kind_in_a_deck_of_cards

914 - X of a Kind in a Deck of Cards.

Solution - Class in g0901_1000.s0915_partition_array_into_disjoint_intervals

915 - Partition Array into Disjoint Intervals.

Solution - Class in g0901_1000.s0916_word_subsets

916 - Word Subsets.

Solution - Class in g0901_1000.s0917_reverse_only_letters

917 - Reverse Only Letters.

Solution - Class in g0901_1000.s0918_maximum_sum_circular_subarray

918 - Maximum Sum Circular Subarray.

Solution - Class in g0901_1000.s0920_number_of_music_playlists

920 - Number of Music Playlists.

Solution - Class in g0901_1000.s0921_minimum_add_to_make_parentheses_valid

921 - Minimum Add to Make Parentheses Valid.

Solution - Class in g0901_1000.s0922_sort_array_by_parity_ii

922 - Sort Array By Parity II.

Solution - Class in g0901_1000.s0923_3sum_with_multiplicity

923 - 3Sum With Multiplicity.

Solution - Class in g0901_1000.s0924_minimize_malware_spread

924 - Minimize Malware Spread.

Solution - Class in g0901_1000.s0925_long_pressed_name

925 - Long Pressed Name.

Solution - Class in g0901_1000.s0926_flip_string_to_monotone_increasing

926 - Flip String to Monotone Increasing.

Solution - Class in g0901_1000.s0927_three_equal_parts

927 - Three Equal Parts.

Solution - Class in g0901_1000.s0928_minimize_malware_spread_ii

928 - Minimize Malware Spread II.

Solution - Class in g0901_1000.s0929_unique_email_addresses

929 - Unique Email Addresses.

Solution - Class in g0901_1000.s0930_binary_subarrays_with_sum

930 - Binary Subarrays With Sum.

Solution - Class in g0901_1000.s0931_minimum_falling_path_sum

931 - Minimum Falling Path Sum.

Solution - Class in g0901_1000.s0932_beautiful_array

932 - Beautiful Array.

Solution - Class in g0901_1000.s0934_shortest_bridge

934 - Shortest Bridge.

Solution - Class in g0901_1000.s0935_knight_dialer

935 - Knight Dialer.

Solution - Class in g0901_1000.s0936_stamping_the_sequence

936 - Stamping The Sequence.

Solution - Class in g0901_1000.s0937_reorder_data_in_log_files

937 - Reorder Data in Log Files.

Solution - Class in g0901_1000.s0938_range_sum_of_bst

938 - Range Sum of BST.

Solution - Class in g0901_1000.s0939_minimum_area_rectangle

939 - Minimum Area Rectangle.

Solution - Class in g0901_1000.s0940_distinct_subsequences_ii

940 - Distinct Subsequences II.

Solution - Class in g0901_1000.s0941_valid_mountain_array

941 - Valid Mountain Array.

Solution - Class in g0901_1000.s0942_di_string_match

942 - DI String Match.

Solution - Class in g0901_1000.s0943_find_the_shortest_superstring

943 - Find the Shortest Superstring.

Solution - Class in g0901_1000.s0944_delete_columns_to_make_sorted

944 - Delete Columns to Make Sorted.

Solution - Class in g0901_1000.s0945_minimum_increment_to_make_array_unique

945 - Minimum Increment to Make Array Unique.

Solution - Class in g0901_1000.s0946_validate_stack_sequences

946 - Validate Stack Sequences.

Solution - Class in g0901_1000.s0947_most_stones_removed_with_same_row_or_column

947 - Most Stones Removed with Same Row or Column.

Solution - Class in g0901_1000.s0948_bag_of_tokens

948 - Bag of Tokens.

Solution - Class in g0901_1000.s0949_largest_time_for_given_digits

949 - Largest Time for Given Digits.

Solution - Class in g0901_1000.s0950_reveal_cards_in_increasing_order

950 - Reveal Cards In Increasing Order.

Solution - Class in g0901_1000.s0951_flip_equivalent_binary_trees

951 - Flip Equivalent Binary Trees.

Solution - Class in g0901_1000.s0952_largest_component_size_by_common_factor

952 - Largest Component Size by Common Factor.

Solution - Class in g0901_1000.s0953_verifying_an_alien_dictionary

953 - Verifying an Alien Dictionary.

Solution - Class in g0901_1000.s0954_array_of_doubled_pairs

954 - Array of Doubled Pairs.

Solution - Class in g0901_1000.s0955_delete_columns_to_make_sorted_ii

955 - Delete Columns to Make Sorted II.

Solution - Class in g0901_1000.s0956_tallest_billboard

956 - Tallest Billboard.

Solution - Class in g0901_1000.s0957_prison_cells_after_n_days

957 - Prison Cells After N Days.

Solution - Class in g0901_1000.s0958_check_completeness_of_a_binary_tree

958 - Check Completeness of a Binary Tree.

Solution - Class in g0901_1000.s0959_regions_cut_by_slashes

959 - Regions Cut By Slashes.

Solution - Class in g0901_1000.s0960_delete_columns_to_make_sorted_iii

960 - Delete Columns to Make Sorted III.

Solution - Class in g0901_1000.s0961_n_repeated_element_in_size_2n_array

961 - N-Repeated Element in Size 2N Array.

Solution - Class in g0901_1000.s0962_maximum_width_ramp

962 - Maximum Width Ramp.

Solution - Class in g0901_1000.s0963_minimum_area_rectangle_ii

963 - Minimum Area Rectangle II.

Solution - Class in g0901_1000.s0964_least_operators_to_express_number

964 - Least Operators to Express Number.

Solution - Class in g0901_1000.s0965_univalued_binary_tree

965 - Univalued Binary Tree.

Solution - Class in g0901_1000.s0966_vowel_spellchecker

966 - Vowel Spellchecker.

Solution - Class in g0901_1000.s0967_numbers_with_same_consecutive_differences

967 - Numbers With Same Consecutive Differences.

Solution - Class in g0901_1000.s0968_binary_tree_cameras

968 - Binary Tree Cameras.

Solution - Class in g0901_1000.s0969_pancake_sorting

969 - Pancake Sorting.

Solution - Class in g0901_1000.s0970_powerful_integers

970 - Powerful Integers.

Solution - Class in g0901_1000.s0971_flip_binary_tree_to_match_preorder_traversal

971 - Flip Binary Tree To Match Preorder Traversal.

Solution - Class in g0901_1000.s0972_equal_rational_numbers

972 - Equal Rational Numbers.

Solution - Class in g0901_1000.s0973_k_closest_points_to_origin

973 - K Closest Points to Origin.

Solution - Class in g0901_1000.s0974_subarray_sums_divisible_by_k

974 - Subarray Sums Divisible by K.

Solution - Class in g0901_1000.s0975_odd_even_jump

975 - Odd Even Jump.

Solution - Class in g0901_1000.s0976_largest_perimeter_triangle

976 - Largest Perimeter Triangle.

Solution - Class in g0901_1000.s0977_squares_of_a_sorted_array

977 - Squares of a Sorted Array.

Solution - Class in g0901_1000.s0978_longest_turbulent_subarray

978 - Longest Turbulent Subarray.

Solution - Class in g0901_1000.s0979_distribute_coins_in_binary_tree

979 - Distribute Coins in Binary Tree.

Solution - Class in g0901_1000.s0980_unique_paths_iii

980 - Unique Paths III.

Solution - Class in g0901_1000.s0982_triples_with_bitwise_and_equal_to_zero

982 - Triples with Bitwise AND Equal To Zero.

Solution - Class in g0901_1000.s0983_minimum_cost_for_tickets

983 - Minimum Cost For Tickets.

Solution - Class in g0901_1000.s0984_string_without_aaa_or_bbb

984 - String Without AAA or BBB.

Solution - Class in g0901_1000.s0985_sum_of_even_numbers_after_queries

985 - Sum of Even Numbers After Queries.

Solution - Class in g0901_1000.s0986_interval_list_intersections

986 - Interval List Intersections.

Solution - Class in g0901_1000.s0987_vertical_order_traversal_of_a_binary_tree

987 - Vertical Order Traversal of a Binary Tree.

Solution - Class in g0901_1000.s0988_smallest_string_starting_from_leaf

988 - Smallest String Starting From Leaf.

Solution - Class in g0901_1000.s0989_add_to_array_form_of_integer

989 - Add to Array-Form of Integer.

Solution - Class in g0901_1000.s0990_satisfiability_of_equality_equations

990 - Satisfiability of Equality Equations.

Solution - Class in g0901_1000.s0991_broken_calculator

991 - Broken Calculator.

Solution - Class in g0901_1000.s0992_subarrays_with_k_different_integers

992 - Subarrays with K Different Integers.

Solution - Class in g0901_1000.s0993_cousins_in_binary_tree

993 - Cousins in Binary Tree.

Solution - Class in g0901_1000.s0994_rotting_oranges

994 - Rotting Oranges.

Solution - Class in g0901_1000.s0995_minimum_number_of_k_consecutive_bit_flips

995 - Minimum Number of K Consecutive Bit Flips.

Solution - Class in g0901_1000.s0996_number_of_squareful_arrays

996 - Number of Squareful Arrays.

Solution - Class in g0901_1000.s0997_find_the_town_judge

997 - Find the Town Judge.

Solution - Class in g0901_1000.s0998_maximum_binary_tree_ii

998 - Maximum Binary Tree II.

Solution - Class in g0901_1000.s0999_available_captures_for_rook

999 - Available Captures for Rook.

Solution - Class in g0901_1000.s1000_minimum_cost_to_merge_stones

1000 - Minimum Cost to Merge Stones.

Solution - Class in g1001_1100.s1001_grid_illumination

1001 - Grid Illumination.

Solution - Class in g1001_1100.s1002_find_common_characters

1002 - Find Common Characters.

Solution - Class in g1001_1100.s1003_check_if_word_is_valid_after_substitutions

1003 - Check If Word Is Valid After Substitutions.

Solution - Class in g1001_1100.s1004_max_consecutive_ones_iii

1004 - Max Consecutive Ones III.

Solution - Class in g1001_1100.s1005_maximize_sum_of_array_after_k_negations

1005 - Maximize Sum Of Array After K Negations.

Solution - Class in g1001_1100.s1006_clumsy_factorial

1006 - Clumsy Factorial.

Solution - Class in g1001_1100.s1007_minimum_domino_rotations_for_equal_row

1007 - Minimum Domino Rotations For Equal Row.

Solution - Class in g1001_1100.s1008_construct_binary_search_tree_from_preorder_traversal

1008 - Construct Binary Search Tree from Preorder Traversal.

Solution - Class in g1001_1100.s1009_complement_of_base_10_integer

1009 - Complement of Base 10 Integer.

Solution - Class in g1001_1100.s1010_pairs_of_songs_with_total_durations_divisible_by_60

1010 - Pairs of Songs With Total Durations Divisible by 60.

Solution - Class in g1001_1100.s1011_capacity_to_ship_packages_within_d_days

1011 - Capacity To Ship Packages Within D Days.

Solution - Class in g1001_1100.s1012_numbers_with_repeated_digits

1012 - Numbers With Repeated Digits.

Solution - Class in g1001_1100.s1013_partition_array_into_three_parts_with_equal_sum

1013 - Partition Array Into Three Parts With Equal Sum.

Solution - Class in g1001_1100.s1014_best_sightseeing_pair

1014 - Best Sightseeing Pair.

Solution - Class in g1001_1100.s1015_smallest_integer_divisible_by_k

1015 - Smallest Integer Divisible by K.

Solution - Class in g1001_1100.s1016_binary_string_with_substrings_representing_1_to_n

1016 - Binary String With Substrings Representing 1 To N.

Solution - Class in g1001_1100.s1017_convert_to_base_2

1017 - Convert to Base -2.

Solution - Class in g1001_1100.s1018_binary_prefix_divisible_by_5

1018 - Binary Prefix Divisible By 5.

Solution - Class in g1001_1100.s1019_next_greater_node_in_linked_list

1019 - Next Greater Node In Linked List.

Solution - Class in g1001_1100.s1020_number_of_enclaves

1020 - Number of Enclaves.

Solution - Class in g1001_1100.s1021_remove_outermost_parentheses

1021 - Remove Outermost Parentheses.

Solution - Class in g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers

1022 - Sum of Root To Leaf Binary Numbers.

Solution - Class in g1001_1100.s1023_camelcase_matching

1023 - Camelcase Matching.

Solution - Class in g1001_1100.s1024_video_stitching

1024 - Video Stitching.

Solution - Class in g1001_1100.s1025_divisor_game

1025 - Divisor Game.

Solution - Class in g1001_1100.s1026_maximum_difference_between_node_and_ancestor

1026 - Maximum Difference Between Node and Ancestor.

Solution - Class in g1001_1100.s1027_longest_arithmetic_subsequence

1027 - Longest Arithmetic Subsequence.

Solution - Class in g1001_1100.s1028_recover_a_tree_from_preorder_traversal

1028 - Recover a Tree From Preorder Traversal.

Solution - Class in g1001_1100.s1029_two_city_scheduling

1029 - Two City Scheduling.

Solution - Class in g1001_1100.s1030_matrix_cells_in_distance_order

1030 - Matrix Cells in Distance Order.

Solution - Class in g1001_1100.s1031_maximum_sum_of_two_non_overlapping_subarrays

1031 - Maximum Sum of Two Non-Overlapping Subarrays.

Solution - Class in g1001_1100.s1033_moving_stones_until_consecutive

1033 - Moving Stones Until Consecutive.

Solution - Class in g1001_1100.s1034_coloring_a_border

1034 - Coloring A Border.

Solution - Class in g1001_1100.s1035_uncrossed_lines

1035 - Uncrossed Lines.

Solution - Class in g1001_1100.s1036_escape_a_large_maze

1036 - Escape a Large Maze.

Solution - Class in g1001_1100.s1037_valid_boomerang

1037 - Valid Boomerang.

Solution - Class in g1001_1100.s1038_binary_search_tree_to_greater_sum_tree

1038 - Binary Search Tree to Greater Sum Tree.

Solution - Class in g1001_1100.s1039_minimum_score_triangulation_of_polygon

1039 - Minimum Score Triangulation of Polygon.

Solution - Class in g1001_1100.s1040_moving_stones_until_consecutive_ii

1040 - Moving Stones Until Consecutive II.

Solution - Class in g1001_1100.s1041_robot_bounded_in_circle

1041 - Robot Bounded In Circle.

Solution - Class in g1001_1100.s1042_flower_planting_with_no_adjacent

1042 - Flower Planting With No Adjacent.

Solution - Class in g1001_1100.s1043_partition_array_for_maximum_sum

1043 - Partition Array for Maximum Sum.

Solution - Class in g1001_1100.s1044_longest_duplicate_substring

1044 - Longest Duplicate Substring.

Solution - Class in g1001_1100.s1046_last_stone_weight

1046 - Last Stone Weight.

Solution - Class in g1001_1100.s1047_remove_all_adjacent_duplicates_in_string

1047 - Remove All Adjacent Duplicates In String.

Solution - Class in g1001_1100.s1048_longest_string_chain

1048 - Longest String Chain.

Solution - Class in g1001_1100.s1049_last_stone_weight_ii

1049 - Last Stone Weight II.

Solution - Class in g1001_1100.s1051_height_checker

1051 - Height Checker.

Solution - Class in g1001_1100.s1052_grumpy_bookstore_owner

1052 - Grumpy Bookstore Owner.

Solution - Class in g1001_1100.s1053_previous_permutation_with_one_swap

1053 - Previous Permutation With One Swap.

Solution - Class in g1001_1100.s1054_distant_barcodes

1054 - Distant Barcodes.

Solution - Class in g1001_1100.s1061_lexicographically_smallest_equivalent_string

1061 - Lexicographically Smallest Equivalent String.

Solution - Class in g1001_1100.s1071_greatest_common_divisor_of_strings

1071 - Greatest Common Divisor of Strings.

Solution - Class in g1001_1100.s1072_flip_columns_for_maximum_number_of_equal_rows

1072 - Flip Columns For Maximum Number of Equal Rows.

Solution - Class in g1001_1100.s1073_adding_two_negabinary_numbers

1073 - Adding Two Negabinary Numbers.

Solution - Class in g1001_1100.s1074_number_of_submatrices_that_sum_to_target

1074 - Number of Submatrices That Sum to Target.

Solution - Class in g1001_1100.s1078_occurrences_after_bigram

1078 - Occurrences After Bigram.

Solution - Class in g1001_1100.s1079_letter_tile_possibilities

1079 - Letter Tile Possibilities.

Solution - Class in g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths

1080 - Insufficient Nodes in Root to Leaf Paths.

Solution - Class in g1001_1100.s1081_smallest_subsequence_of_distinct_characters

1081 - Smallest Subsequence of Distinct Characters.

Solution - Class in g1001_1100.s1089_duplicate_zeros

1089 - Duplicate Zeros.

Solution - Class in g1001_1100.s1090_largest_values_from_labels

1090 - Largest Values From Labels.

Solution - Class in g1001_1100.s1091_shortest_path_in_binary_matrix

1091 - Shortest Path in Binary Matrix.

Solution - Class in g1001_1100.s1092_shortest_common_supersequence

1092 - Shortest Common Supersequence.

Solution - Class in g1001_1100.s1093_statistics_from_a_large_sample

1093 - Statistics from a Large Sample.

Solution - Class in g1001_1100.s1094_car_pooling

1094 - Car Pooling.

Solution - Class in g1001_1100.s1095_find_in_mountain_array

1095 - Find in Mountain Array.

Solution - Class in g1001_1100.s1096_brace_expansion_ii

1096 - Brace Expansion II.

Solution - Class in g1101_1200.s1103_distribute_candies_to_people

1103 - Distribute Candies to People.

Solution - Class in g1101_1200.s1104_path_in_zigzag_labelled_binary_tree

1104 - Path In Zigzag Labelled Binary Tree.

Solution - Class in g1101_1200.s1105_filling_bookcase_shelves

1105 - Filling Bookcase Shelves.

Solution - Class in g1101_1200.s1106_parsing_a_boolean_expression

1106 - Parsing A Boolean Expression.

Solution - Class in g1101_1200.s1108_defanging_an_ip_address

1108 - Defanging an IP Address.

Solution - Class in g1101_1200.s1109_corporate_flight_bookings

1109 - Corporate Flight Bookings.

Solution - Class in g1101_1200.s1110_delete_nodes_and_return_forest

1110 - Delete Nodes And Return Forest.

Solution - Class in g1101_1200.s1111_maximum_nesting_depth_of_two_valid_parentheses_strings

1111 - Maximum Nesting Depth of Two Valid Parentheses Strings.

Solution - Class in g1101_1200.s1122_relative_sort_array

1122 - Relative Sort Array.

Solution - Class in g1101_1200.s1123_lowest_common_ancestor_of_deepest_leaves

1123 - Lowest Common Ancestor of Deepest Leaves.

Solution - Class in g1101_1200.s1124_longest_well_performing_interval

1124 - Longest Well-Performing Interval.

Solution - Class in g1101_1200.s1125_smallest_sufficient_team

1125 - Smallest Sufficient Team.

Solution - Class in g1101_1200.s1128_number_of_equivalent_domino_pairs

1128 - Number of Equivalent Domino Pairs.

Solution - Class in g1101_1200.s1129_shortest_path_with_alternating_colors

1129 - Shortest Path with Alternating Colors.

Solution - Class in g1101_1200.s1130_minimum_cost_tree_from_leaf_values

1130 - Minimum Cost Tree From Leaf Values.

Solution - Class in g1101_1200.s1131_maximum_of_absolute_value_expression

1131 - Maximum of Absolute Value Expression.

Solution - Class in g1101_1200.s1137_n_th_tribonacci_number

1137 - N-th Tribonacci Number.

Solution - Class in g1101_1200.s1138_alphabet_board_path

1138 - Alphabet Board Path.

Solution - Class in g1101_1200.s1139_largest_1_bordered_square

1139 - Largest 1-Bordered Square.

Solution - Class in g1101_1200.s1140_stone_game_ii

1140 - Stone Game II.

Solution - Class in g1101_1200.s1143_longest_common_subsequence

1143 - Longest Common Subsequence.

Solution - Class in g1101_1200.s1144_decrease_elements_to_make_array_zigzag

1144 - Decrease Elements To Make Array Zigzag.

Solution - Class in g1101_1200.s1145_binary_tree_coloring_game

1145 - Binary Tree Coloring Game.

Solution - Class in g1101_1200.s1147_longest_chunked_palindrome_decomposition

1147 - Longest Chunked Palindrome Decomposition.

Solution - Class in g1101_1200.s1154_day_of_the_year

1154 - Day of the Year.

Solution - Class in g1101_1200.s1155_number_of_dice_rolls_with_target_sum

1155 - Number of Dice Rolls With Target Sum.

Solution - Class in g1101_1200.s1156_swap_for_longest_repeated_character_substring

1156 - Swap For Longest Repeated Character Substring.

Solution - Class in g1101_1200.s1160_find_words_that_can_be_formed_by_characters

1160 - Find Words That Can Be Formed by Characters.

Solution - Class in g1101_1200.s1161_maximum_level_sum_of_a_binary_tree

1161 - Maximum Level Sum of a Binary Tree.

Solution - Class in g1101_1200.s1162_as_far_from_land_as_possible

1162 - As Far from Land as Possible.

Solution - Class in g1101_1200.s1163_last_substring_in_lexicographical_order

1163 - Last Substring in Lexicographical Order.

Solution - Class in g1101_1200.s1169_invalid_transactions

1169 - Invalid Transactions.

Solution - Class in g1101_1200.s1170_compare_strings_by_frequency_of_the_smallest_character

1170 - Compare Strings by Frequency of the Smallest Character.

Solution - Class in g1101_1200.s1171_remove_zero_sum_consecutive_nodes_from_linked_list

1171 - Remove Zero Sum Consecutive Nodes from Linked List.

Solution - Class in g1101_1200.s1175_prime_arrangements

1175 - Prime Arrangements.

Solution - Class in g1101_1200.s1177_can_make_palindrome_from_substring

1177 - Can Make Palindrome from Substring.

Solution - Class in g1101_1200.s1178_number_of_valid_words_for_each_puzzle

1178 - Number of Valid Words for Each Puzzle.

Solution - Class in g1101_1200.s1184_distance_between_bus_stops

1184 - Distance Between Bus Stops.

Solution - Class in g1101_1200.s1185_day_of_the_week

1185 - Day of the Week.

Solution - Class in g1101_1200.s1186_maximum_subarray_sum_with_one_deletion

1186 - Maximum Subarray Sum with One Deletion.

Solution - Class in g1101_1200.s1187_make_array_strictly_increasing

1187 - Make Array Strictly Increasing.

Solution - Class in g1101_1200.s1189_maximum_number_of_balloons

1189 - Maximum Number of Balloons.

Solution - Class in g1101_1200.s1190_reverse_substrings_between_each_pair_of_parentheses

1190 - Reverse Substrings Between Each Pair of Parentheses.

Solution - Class in g1101_1200.s1191_k_concatenation_maximum_sum

1191 - K-Concatenation Maximum Sum.

Solution - Class in g1101_1200.s1192_critical_connections_in_a_network

1192 - Critical Connections in a Network.

Solution - Class in g1101_1200.s1200_minimum_absolute_difference

1200 - Minimum Absolute Difference.

Solution - Class in g1201_1300.s1201_ugly_number_iii

1201 - Ugly Number III.

Solution - Class in g1201_1300.s1202_smallest_string_with_swaps

1202 - Smallest String With Swaps.

Solution - Class in g1201_1300.s1203_sort_items_by_groups_respecting_dependencies

1203 - Sort Items by Groups Respecting Dependencies.

Solution - Class in g1201_1300.s1207_unique_number_of_occurrences

1207 - Unique Number of Occurrences.

Solution - Class in g1201_1300.s1208_get_equal_substrings_within_budget

1208 - Get Equal Substrings Within Budget.

Solution - Class in g1201_1300.s1209_remove_all_adjacent_duplicates_in_string_ii

1209 - Remove All Adjacent Duplicates in String II.

Solution - Class in g1201_1300.s1210_minimum_moves_to_reach_target_with_rotations

1210 - Minimum Moves to Reach Target with Rotations.

Solution - Class in g1201_1300.s1217_minimum_cost_to_move_chips_to_the_same_position

1217 - Minimum Cost to Move Chips to The Same Position.

Solution - Class in g1201_1300.s1218_longest_arithmetic_subsequence_of_given_difference

1218 - Longest Arithmetic Subsequence of Given Difference.

Solution - Class in g1201_1300.s1219_path_with_maximum_gold

1219 - Path with Maximum Gold.

Solution - Class in g1201_1300.s1220_count_vowels_permutation

1220 - Count Vowels Permutation.

Solution - Class in g1201_1300.s1221_split_a_string_in_balanced_strings

1221 - Split a String in Balanced Strings.

Solution - Class in g1201_1300.s1222_queens_that_can_attack_the_king

1222 - Queens That Can Attack the King.

Solution - Class in g1201_1300.s1223_dice_roll_simulation

1223 - Dice Roll Simulation.

Solution - Class in g1201_1300.s1224_maximum_equal_frequency

1224 - Maximum Equal Frequency.

Solution - Class in g1201_1300.s1227_airplane_seat_assignment_probability

1227 - Airplane Seat Assignment Probability.

Solution - Class in g1201_1300.s1232_check_if_it_is_a_straight_line

1232 - Check If It Is a Straight Line.

Solution - Class in g1201_1300.s1233_remove_sub_folders_from_the_filesystem

1233 - Remove Sub-Folders from the Filesystem.

Solution - Class in g1201_1300.s1234_replace_the_substring_for_balanced_string

1234 - Replace the Substring for Balanced String.

Solution - Class in g1201_1300.s1235_maximum_profit_in_job_scheduling

1235 - Maximum Profit in Job Scheduling.

Solution - Class in g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation

1237 - Find Positive Integer Solution for a Given Equation.

Solution - Class in g1201_1300.s1238_circular_permutation_in_binary_representation

1238 - Circular Permutation in Binary Representation.

Solution - Class in g1201_1300.s1239_maximum_length_of_a_concatenated_string_with_unique_characters

1239 - Maximum Length of a Concatenated String with Unique Characters.

Solution - Class in g1201_1300.s1240_tiling_a_rectangle_with_the_fewest_squares

1240 - Tiling a Rectangle with the Fewest Squares.

Solution - Class in g1201_1300.s1247_minimum_swaps_to_make_strings_equal

1247 - Minimum Swaps to Make Strings Equal.

Solution - Class in g1201_1300.s1248_count_number_of_nice_subarrays

1248 - Count Number of Nice Subarrays.

Solution - Class in g1201_1300.s1249_minimum_remove_to_make_valid_parentheses

1249 - Minimum Remove to Make Valid Parentheses.

Solution - Class in g1201_1300.s1250_check_if_it_is_a_good_array

1250 - Check If It Is a Good Array.

Solution - Class in g1201_1300.s1252_cells_with_odd_values_in_a_matrix

1252 - Cells with Odd Values in a Matrix.

Solution - Class in g1201_1300.s1253_reconstruct_a_2_row_binary_matrix

1253 - Reconstruct a 2-Row Binary Matrix.

Solution - Class in g1201_1300.s1254_number_of_closed_islands

1254 - Number of Closed Islands.

Solution - Class in g1201_1300.s1255_maximum_score_words_formed_by_letters

1255 - Maximum Score Words Formed by Letters.

Solution - Class in g1201_1300.s1260_shift_2d_grid

1260 - Shift 2D Grid.

Solution - Class in g1201_1300.s1262_greatest_sum_divisible_by_three

1262 - Greatest Sum Divisible by Three.

Solution - Class in g1201_1300.s1263_minimum_moves_to_move_a_box_to_their_target_location

1263 - Minimum Moves to Move a Box to Their Target Location.

Solution - Class in g1201_1300.s1266_minimum_time_visiting_all_points

1266 - Minimum Time Visiting All Points.

Solution - Class in g1201_1300.s1267_count_servers_that_communicate

1267 - Count Servers that Communicate.

Solution - Class in g1201_1300.s1268_search_suggestions_system

1268 - Search Suggestions System.

Solution - Class in g1201_1300.s1269_number_of_ways_to_stay_in_the_same_place_after_some_steps

1269 - Number of Ways to Stay in the Same Place After Some Steps.

Solution - Class in g1201_1300.s1275_find_winner_on_a_tic_tac_toe_game

1275 - Find Winner on a Tic Tac Toe Game.

Solution - Class in g1201_1300.s1276_number_of_burgers_with_no_waste_of_ingredients

1276 - Number of Burgers with No Waste of Ingredients.

Solution - Class in g1201_1300.s1277_count_square_submatrices_with_all_ones

1277 - Count Square Submatrices with All Ones.

Solution - Class in g1201_1300.s1278_palindrome_partitioning_iii

1278 - Palindrome Partitioning III.

Solution - Class in g1201_1300.s1281_subtract_the_product_and_sum_of_digits_of_an_integer

1281 - Subtract the Product and Sum of Digits of an Integer.

Solution - Class in g1201_1300.s1282_group_the_people_given_the_group_size_they_belong_to

1282 - Group the People Given the Group Size They Belong To.

Solution - Class in g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold

1283 - Find the Smallest Divisor Given a Threshold.

Solution - Class in g1201_1300.s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix

1284 - Minimum Number of Flips to Convert Binary Matrix to Zero Matrix.

Solution - Class in g1201_1300.s1287_element_appearing_more_than_25_in_sorted_array

1287 - Element Appearing More Than 25% In Sorted Array.

Solution - Class in g1201_1300.s1288_remove_covered_intervals

1288 - Remove Covered Intervals.

Solution - Class in g1201_1300.s1289_minimum_falling_path_sum_ii

1289 - Minimum Falling Path Sum II.

Solution - Class in g1201_1300.s1290_convert_binary_number_in_a_linked_list_to_integer

1290 - Convert Binary Number in a Linked List to Integer.

Solution - Class in g1201_1300.s1291_sequential_digits

1291 - Sequential Digits.

Solution - Class in g1201_1300.s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold

1292 - Maximum Side Length of a Square with Sum Less than or Equal to Threshold.

Solution - Class in g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination

1293 - Shortest Path in a Grid with Obstacles Elimination.

Solution - Class in g1201_1300.s1295_find_numbers_with_even_number_of_digits

1295 - Find Numbers with Even Number of Digits.

Solution - Class in g1201_1300.s1296_divide_array_in_sets_of_k_consecutive_numbers

1296 - Divide Array in Sets of K Consecutive Numbers.

Solution - Class in g1201_1300.s1297_maximum_number_of_occurrences_of_a_substring

1297 - Maximum Number of Occurrences of a Substring.

Solution - Class in g1201_1300.s1298_maximum_candies_you_can_get_from_boxes

1298 - Maximum Candies You Can Get from Boxes.

Solution - Class in g1201_1300.s1299_replace_elements_with_greatest_element_on_right_side

1299 - Replace Elements with Greatest Element on Right Side.

Solution - Class in g1201_1300.s1300_sum_of_mutated_array_closest_to_target

1300 - Sum of Mutated Array Closest to Target.

Solution - Class in g1301_1400.s1301_number_of_paths_with_max_score

1301 - Number of Paths with Max Score.

Solution - Class in g1301_1400.s1302_deepest_leaves_sum

1302 - Deepest Leaves Sum.

Solution - Class in g1301_1400.s1304_find_n_unique_integers_sum_up_to_zero

1304 - Find N Unique Integers Sum up to Zero.

Solution - Class in g1301_1400.s1305_all_elements_in_two_binary_search_trees

1305 - All Elements in Two Binary Search Trees.

Solution - Class in g1301_1400.s1306_jump_game_iii

1306 - Jump Game III.

Solution - Class in g1301_1400.s1307_verbal_arithmetic_puzzle

1307 - Verbal Arithmetic Puzzle.

Solution - Class in g1301_1400.s1309_decrypt_string_from_alphabet_to_integer_mapping

1309 - Decrypt String from Alphabet to Integer Mapping.

Solution - Class in g1301_1400.s1310_xor_queries_of_a_subarray

1310 - XOR Queries of a Subarray.

Solution - Class in g1301_1400.s1311_get_watched_videos_by_your_friends

1311 - Get Watched Videos by Your Friends.

Solution - Class in g1301_1400.s1312_minimum_insertion_steps_to_make_a_string_palindrome

1312 - Minimum Insertion Steps to Make a String Palindrome.

Solution - Class in g1301_1400.s1313_decompress_run_length_encoded_list

1313 - Decompress Run-Length Encoded List.

Solution - Class in g1301_1400.s1314_matrix_block_sum

1314 - Matrix Block Sum.

Solution - Class in g1301_1400.s1315_sum_of_nodes_with_even_valued_grandparent

1315 - Sum of Nodes with Even-Valued Grandparent.

Solution - Class in g1301_1400.s1316_distinct_echo_substrings

1316 - Distinct Echo Substrings.

Solution - Class in g1301_1400.s1317_convert_integer_to_the_sum_of_two_no_zero_integers

1317 - Convert Integer to the Sum of Two No-Zero Integers.

Solution - Class in g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c

1318 - Minimum Flips to Make a OR b Equal to c.

Solution - Class in g1301_1400.s1319_number_of_operations_to_make_network_connected

1319 - Number of Operations to Make Network Connected.

Solution - Class in g1301_1400.s1320_minimum_distance_to_type_a_word_using_two_fingers

1320 - Minimum Distance to Type a Word Using Two Fingers.

Solution - Class in g1301_1400.s1323_maximum_69_number

1323 - Maximum 69 Number.

Solution - Class in g1301_1400.s1324_print_words_vertically

1324 - Print Words Vertically.

Solution - Class in g1301_1400.s1325_delete_leaves_with_a_given_value

1325 - Delete Leaves With a Given Value.

Solution - Class in g1301_1400.s1326_minimum_number_of_taps_to_open_to_water_a_garden

1326 - Minimum Number of Taps to Open to Water a Garden.

Solution - Class in g1301_1400.s1328_break_a_palindrome

1328 - Break a Palindrome.

Solution - Class in g1301_1400.s1329_sort_the_matrix_diagonally

1329 - Sort the Matrix Diagonally.

Solution - Class in g1301_1400.s1330_reverse_subarray_to_maximize_array_value

1330 - Reverse Subarray To Maximize Array Value.

Solution - Class in g1301_1400.s1331_rank_transform_of_an_array

1331 - Rank Transform of an Array.

Solution - Class in g1301_1400.s1332_remove_palindromic_subsequences

1332 - Remove Palindromic Subsequences.

Solution - Class in g1301_1400.s1333_filter_restaurants_by_vegan_friendly_price_and_distance

1333 - Filter Restaurants by Vegan-Friendly, Price and Distance.

Solution - Class in g1301_1400.s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance

1334 - Find the City With the Smallest Number of Neighbors at a Threshold Distance.

Solution - Class in g1301_1400.s1335_minimum_difficulty_of_a_job_schedule

1335 - Minimum Difficulty of a Job Schedule.

Solution - Class in g1301_1400.s1337_the_k_weakest_rows_in_a_matrix

1337 - The K Weakest Rows in a Matrix.

Solution - Class in g1301_1400.s1338_reduce_array_size_to_the_half

1338 - Reduce Array Size to The Half.

Solution - Class in g1301_1400.s1339_maximum_product_of_splitted_binary_tree

1339 - Maximum Product of Splitted Binary Tree.

Solution - Class in g1301_1400.s1340_jump_game_v

1340 - Jump Game V.

Solution - Class in g1301_1400.s1342_number_of_steps_to_reduce_a_number_to_zero

1342 - Number of Steps to Reduce a Number to Zero.

Solution - Class in g1301_1400.s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold

1343 - Number of Sub-arrays of Size K and Average Greater than or Equal to Threshold.

Solution - Class in g1301_1400.s1344_angle_between_hands_of_a_clock

1344 - Angle Between Hands of a Clock.

Solution - Class in g1301_1400.s1345_jump_game_iv

1345 - Jump Game IV.

Solution - Class in g1301_1400.s1346_check_if_n_and_its_double_exist

1346 - Check If N and Its Double Exist.

Solution - Class in g1301_1400.s1347_minimum_number_of_steps_to_make_two_strings_anagram

1347 - Minimum Number of Steps to Make Two Strings Anagram.

Solution - Class in g1301_1400.s1349_maximum_students_taking_exam

1349 - Maximum Students Taking Exam.

Solution - Class in g1301_1400.s1351_count_negative_numbers_in_a_sorted_matrix

1351 - Count Negative Numbers in a Sorted Matrix.

Solution - Class in g1301_1400.s1353_maximum_number_of_events_that_can_be_attended

1353 - Maximum Number of Events That Can Be Attended.

Solution - Class in g1301_1400.s1354_construct_target_array_with_multiple_sums

1354 - Construct Target Array With Multiple Sums.

Solution - Class in g1301_1400.s1356_sort_integers_by_the_number_of_1_bits

1356 - Sort Integers by The Number of 1 Bits.

Solution - Class in g1301_1400.s1358_number_of_substrings_containing_all_three_characters

1358 - Number of Substrings Containing All Three Characters.

Solution - Class in g1301_1400.s1359_count_all_valid_pickup_and_delivery_options

1359 - Count All Valid Pickup and Delivery Options.

Solution - Class in g1301_1400.s1360_number_of_days_between_two_dates

1360 - Number of Days Between Two Dates.

Solution - Class in g1301_1400.s1361_validate_binary_tree_nodes

1361 - Validate Binary Tree Nodes.

Solution - Class in g1301_1400.s1362_closest_divisors

1362 - Closest Divisors.

Solution - Class in g1301_1400.s1363_largest_multiple_of_three

1363 - Largest Multiple of Three.

Solution - Class in g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number

1365 - How Many Numbers Are Smaller Than the Current Number.

Solution - Class in g1301_1400.s1366_rank_teams_by_votes

1366 - Rank Teams by Votes.

Solution - Class in g1301_1400.s1367_linked_list_in_binary_tree

1367 - Linked List in Binary Tree.

Solution - Class in g1301_1400.s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid

1368 - Minimum Cost to Make at Least One Valid Path in a Grid.

Solution - Class in g1301_1400.s1370_increasing_decreasing_string

1370 - Increasing Decreasing String.

Solution - Class in g1301_1400.s1371_find_the_longest_substring_containing_vowels_in_even_counts

1371 - Find the Longest Substring Containing Vowels in Even Counts.

Solution - Class in g1301_1400.s1372_longest_zigzag_path_in_a_binary_tree

1372 - Longest ZigZag Path in a Binary Tree.

Solution - Class in g1301_1400.s1373_maximum_sum_bst_in_binary_tree

1373 - Maximum Sum BST in Binary Tree.

Solution - Class in g1301_1400.s1374_generate_a_string_with_characters_that_have_odd_counts

1374 - Generate a String With Characters That Have Odd Counts.

Solution - Class in g1301_1400.s1375_number_of_times_binary_string_is_prefix_aligned

1375 - Number of Times Binary String Is Prefix-Aligned.

Solution - Class in g1301_1400.s1376_time_needed_to_inform_all_employees

1376 - Time Needed to Inform All Employees.

Solution - Class in g1301_1400.s1377_frog_position_after_t_seconds

1377 - Frog Position After T Seconds.

Solution - Class in g1301_1400.s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree

1379 - Find a Corresponding Node of a Binary Tree in a Clone of That Tree.

Solution - Class in g1301_1400.s1380_lucky_numbers_in_a_matrix

1380 - Lucky Numbers in a Matrix.

Solution - Class in g1301_1400.s1382_balance_a_binary_search_tree

1382 - Balance a Binary Search Tree.

Solution - Class in g1301_1400.s1383_maximum_performance_of_a_team

1383 - Maximum Performance of a Team.

Solution - Class in g1301_1400.s1385_find_the_distance_value_between_two_arrays

1385 - Find the Distance Value Between Two Arrays.

Solution - Class in g1301_1400.s1386_cinema_seat_allocation

1386 - Cinema Seat Allocation.

Solution - Class in g1301_1400.s1387_sort_integers_by_the_power_value

1387 - Sort Integers by The Power Value.

Solution - Class in g1301_1400.s1388_pizza_with_3n_slices

1388 - Pizza With 3n Slices.

Solution - Class in g1301_1400.s1389_create_target_array_in_the_given_order

1389 - Create Target Array in the Given Order.

Solution - Class in g1301_1400.s1390_four_divisors

1390 - Four Divisors.

Solution - Class in g1301_1400.s1391_check_if_there_is_a_valid_path_in_a_grid

1391 - Check if There is a Valid Path in a Grid.

Solution - Class in g1301_1400.s1392_longest_happy_prefix

1392 - Longest Happy Prefix.

Solution - Class in g1301_1400.s1394_find_lucky_integer_in_an_array

1394 - Find Lucky Integer in an Array.

Solution - Class in g1301_1400.s1395_count_number_of_teams

1395 - Count Number of Teams.

Solution - Class in g1301_1400.s1397_find_all_good_strings

1397 - Find All Good Strings.

Solution - Class in g1301_1400.s1399_count_largest_group

1399 - Count Largest Group.

Solution - Class in g1301_1400.s1400_construct_k_palindrome_strings

1400 - Construct K Palindrome Strings.

Solution - Class in g1401_1500.s1401_circle_and_rectangle_overlapping

1401 - Circle and Rectangle Overlapping.

Solution - Class in g1401_1500.s1402_reducing_dishes

1402 - Reducing Dishes.

Solution - Class in g1401_1500.s1403_minimum_subsequence_in_non_increasing_order

1403 - Minimum Subsequence in Non-Increasing Order.

Solution - Class in g1401_1500.s1404_number_of_steps_to_reduce_a_number_in_binary_representation_to_one

1404 - Number of Steps to Reduce a Number in Binary Representation to One.

Solution - Class in g1401_1500.s1405_longest_happy_string

1405 - Longest Happy String.

Solution - Class in g1401_1500.s1406_stone_game_iii

1406 - Stone Game III.

Solution - Class in g1401_1500.s1408_string_matching_in_an_array

1408 - String Matching in an Array.

Solution - Class in g1401_1500.s1409_queries_on_a_permutation_with_key

1409 - Queries on a Permutation With Key.

Solution - Class in g1401_1500.s1410_html_entity_parser

1410 - HTML Entity Parser.

Solution - Class in g1401_1500.s1411_number_of_ways_to_paint_n_3_grid

1411 - Number of Ways to Paint N × 3 Grid.

Solution - Class in g1401_1500.s1413_minimum_value_to_get_positive_step_by_step_sum

1413 - Minimum Value to Get Positive Step by Step Sum.

Solution - Class in g1401_1500.s1414_find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k

1414 - Find the Minimum Number of Fibonacci Numbers Whose Sum Is K.

Solution - Class in g1401_1500.s1415_the_k_th_lexicographical_string_of_all_happy_strings_of_length_n

1415 - The k-th Lexicographical String of All Happy Strings of Length n.

Solution - Class in g1401_1500.s1416_restore_the_array

1416 - Restore The Array.

Solution - Class in g1401_1500.s1417_reformat_the_string

1417 - Reformat The String.

Solution - Class in g1401_1500.s1418_display_table_of_food_orders_in_a_restaurant

1418 - Display Table of Food Orders in a Restaurant.

Solution - Class in g1401_1500.s1419_minimum_number_of_frogs_croaking

1419 - Minimum Number of Frogs Croaking.

Solution - Class in g1401_1500.s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons

1420 - Build Array Where You Can Find The Maximum Exactly K Comparisons.

Solution - Class in g1401_1500.s1422_maximum_score_after_splitting_a_string

1422 - Maximum Score After Splitting a String.

Solution - Class in g1401_1500.s1423_maximum_points_you_can_obtain_from_cards

1423 - Maximum Points You Can Obtain from Cards.

Solution - Class in g1401_1500.s1424_diagonal_traverse_ii

1424 - Diagonal Traverse II.

Solution - Class in g1401_1500.s1425_constrained_subsequence_sum

1425 - Constrained Subsequence Sum.

Solution - Class in g1401_1500.s1431_kids_with_the_greatest_number_of_candies

1431 - Kids With the Greatest Number of Candies.

Solution - Class in g1401_1500.s1432_max_difference_you_can_get_from_changing_an_integer

1432 - Max Difference You Can Get From Changing an Integer.

Solution - Class in g1401_1500.s1433_check_if_a_string_can_break_another_string

1433 - Check If a String Can Break Another String.

Solution - Class in g1401_1500.s1434_number_of_ways_to_wear_different_hats_to_each_other

1434 - Number of Ways to Wear Different Hats to Each Other.

Solution - Class in g1401_1500.s1436_destination_city

1436 - Destination City.

Solution - Class in g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away

1437 - Check If All 1’s Are at Least Length K Places Away.

Solution - Class in g1401_1500.s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit

1438 - Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limit.

Solution - Class in g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows

1439 - Find the Kth Smallest Sum of a Matrix With Sorted Rows.

Solution - Class in g1401_1500.s1441_build_an_array_with_stack_operations

1441 - Build an Array With Stack Operations.

Solution - Class in g1401_1500.s1442_count_triplets_that_can_form_two_arrays_of_equal_xor

1442 - Count Triplets That Can Form Two Arrays of Equal XOR.

Solution - Class in g1401_1500.s1443_minimum_time_to_collect_all_apples_in_a_tree

1443 - Minimum Time to Collect All Apples in a Tree.

Solution - Class in g1401_1500.s1444_number_of_ways_of_cutting_a_pizza

1444 - Number of Ways of Cutting a Pizza.

Solution - Class in g1401_1500.s1446_consecutive_characters

1446 - Consecutive Characters.

Solution - Class in g1401_1500.s1447_simplified_fractions

1447 - Simplified Fractions.

Solution - Class in g1401_1500.s1448_count_good_nodes_in_binary_tree

1448 - Count Good Nodes in Binary Tree.

Solution - Class in g1401_1500.s1449_form_largest_integer_with_digits_that_add_up_to_target

1449 - Form Largest Integer With Digits That Add up to Target.

Solution - Class in g1401_1500.s1450_number_of_students_doing_homework_at_a_given_time

1450 - Number of Students Doing Homework at a Given Time.

Solution - Class in g1401_1500.s1451_rearrange_words_in_a_sentence

1451 - Rearrange Words in a Sentence.

Solution - Class in g1401_1500.s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list

1452 - People Whose List of Favorite Companies Is Not a Subset of Another List.

Solution - Class in g1401_1500.s1453_maximum_number_of_darts_inside_of_a_circular_dartboard

1453 - Maximum Number of Darts Inside of a Circular Dartboard.

Solution - Class in g1401_1500.s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence

1455 - Check If a Word Occurs As a Prefix of Any Word in a Sentence.

Solution - Class in g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length

1456 - Maximum Number of Vowels in a Substring of Given Length.

Solution - Class in g1401_1500.s1457_pseudo_palindromic_paths_in_a_binary_tree

1457 - Pseudo-Palindromic Paths in a Binary Tree.

Solution - Class in g1401_1500.s1458_max_dot_product_of_two_subsequences

1458 - Max Dot Product of Two Subsequences.

Solution - Class in g1401_1500.s1460_make_two_arrays_equal_by_reversing_sub_arrays

1460 - Make Two Arrays Equal by Reversing Sub-arrays.

Solution - Class in g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k

1461 - Check If a String Contains All Binary Codes of Size K.

Solution - Class in g1401_1500.s1462_course_schedule_iv

1462 - Course Schedule IV.

Solution - Class in g1401_1500.s1463_cherry_pickup_ii

1463 - Cherry Pickup II.

Solution - Class in g1401_1500.s1464_maximum_product_of_two_elements_in_an_array

1464 - Maximum Product of Two Elements in an Array.

Solution - Class in g1401_1500.s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts

1465 - Maximum Area of a Piece of Cake After Horizontal and Vertical Cuts.

Solution - Class in g1401_1500.s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero

1466 - Reorder Routes to Make All Paths Lead to the City Zero.

Solution - Class in g1401_1500.s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls

1467 - Probability of a Two Boxes Having The Same Number of Distinct Balls.

Solution - Class in g1401_1500.s1470_shuffle_the_array

1470 - Shuffle the Array.

Solution - Class in g1401_1500.s1471_the_k_strongest_values_in_an_array

1471 - The k Strongest Values in an Array.

Solution - Class in g1401_1500.s1473_paint_house_iii

1473 - Paint House III.

Solution - Class in g1401_1500.s1475_final_prices_with_a_special_discount_in_a_shop

1475 - Final Prices With a Special Discount in a Shop.

Solution - Class in g1401_1500.s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum

1477 - Find Two Non-overlapping Sub-arrays Each With Target Sum.

Solution - Class in g1401_1500.s1478_allocate_mailboxes

1478 - Allocate Mailboxes.

Solution - Class in g1401_1500.s1480_running_sum_of_1d_array

1480 - Running Sum of 1d Array.

Solution - Class in g1401_1500.s1481_least_number_of_unique_integers_after_k_removals

1481 - Least Number of Unique Integers after K Removals.

Solution - Class in g1401_1500.s1482_minimum_number_of_days_to_make_m_bouquets

1482 - Minimum Number of Days to Make m Bouquets.

Solution - Class in g1401_1500.s1486_xor_operation_in_an_array

1486 - XOR Operation in an Array.

Solution - Class in g1401_1500.s1487_making_file_names_unique

1487 - Making File Names Unique.

Solution - Class in g1401_1500.s1488_avoid_flood_in_the_city

1488 - Avoid Flood in The City.

Solution - Class in g1401_1500.s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree

1489 - Find Critical and Pseudo-Critical Edges in Minimum Spanning Tree.

Solution - Class in g1401_1500.s1491_average_salary_excluding_the_minimum_and_maximum_salary

1491 - Average Salary Excluding the Minimum and Maximum Salary.

Solution - Class in g1401_1500.s1492_the_kth_factor_of_n

1492 - The kth Factor of n.

Solution - Class in g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element

1493 - Longest Subarray of 1’s After Deleting One Element.

Solution - Class in g1401_1500.s1494_parallel_courses_ii

1494 - Parallel Courses II.

Solution - Class in g1401_1500.s1496_path_crossing

1496 - Path Crossing.

Solution - Class in g1401_1500.s1497_check_if_array_pairs_are_divisible_by_k

1497 - Check If Array Pairs Are Divisible by k.

Solution - Class in g1401_1500.s1498_number_of_subsequences_that_satisfy_the_given_sum_condition

1498 - Number of Subsequences That Satisfy the Given Sum Condition.

Solution - Class in g1401_1500.s1499_max_value_of_equation

1499 - Max Value of Equation.

Solution - Class in g1501_1600.s1502_can_make_arithmetic_progression_from_sequence

1502 - Can Make Arithmetic Progression From Sequence.

Solution - Class in g1501_1600.s1503_last_moment_before_all_ants_fall_out_of_a_plank

1503 - Last Moment Before All Ants Fall Out of a Plank.

Solution - Class in g1501_1600.s1504_count_submatrices_with_all_ones

1504 - Count Submatrices With All Ones.

Solution - Class in g1501_1600.s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits

1505 - Minimum Possible Integer After at Most K Adjacent Swaps On Digits.

Solution - Class in g1501_1600.s1507_reformat_date

1507 - Reformat Date.

Solution - Class in g1501_1600.s1508_range_sum_of_sorted_subarray_sums

1508 - Range Sum of Sorted Subarray Sums.

Solution - Class in g1501_1600.s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves

1509 - Minimum Difference Between Largest and Smallest Value in Three Moves.

Solution - Class in g1501_1600.s1510_stone_game_iv

1510 - Stone Game IV.

Solution - Class in g1501_1600.s1512_number_of_good_pairs

1512 - Number of Good Pairs.

Solution - Class in g1501_1600.s1513_number_of_substrings_with_only_1s

1513 - Number of Substrings With Only 1s.

Solution - Class in g1501_1600.s1514_path_with_maximum_probability

1514 - Path with Maximum Probability.

Solution - Class in g1501_1600.s1515_best_position_for_a_service_centre

1515 - Best Position for a Service Centre.

Solution - Class in g1501_1600.s1518_water_bottles

1518 - Water Bottles.

Solution - Class in g1501_1600.s1519_number_of_nodes_in_the_sub_tree_with_the_same_label

1519 - Number of Nodes in the Sub-Tree With the Same Label.

Solution - Class in g1501_1600.s1520_maximum_number_of_non_overlapping_substrings

1520 - Maximum Number of Non-Overlapping Substrings.

Solution - Class in g1501_1600.s1521_find_a_value_of_a_mysterious_function_closest_to_target

1521 - Find a Value of a Mysterious Function Closest to Target.

Solution - Class in g1501_1600.s1523_count_odd_numbers_in_an_interval_range

1523 - Count Odd Numbers in an Interval Range.

Solution - Class in g1501_1600.s1524_number_of_sub_arrays_with_odd_sum

1524 - Number of Sub-arrays With Odd Sum.

Solution - Class in g1501_1600.s1525_number_of_good_ways_to_split_a_string

1525 - Number of Good Ways to Split a String.

Solution - Class in g1501_1600.s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array

1526 - Minimum Number of Increments on Subarrays to Form a Target Array.

Solution - Class in g1501_1600.s1528_shuffle_string

1528 - Shuffle String.

Solution - Class in g1501_1600.s1529_bulb_switcher_iv

1529 - Minimum Suffix Flips.

Solution - Class in g1501_1600.s1530_number_of_good_leaf_nodes_pairs

1530 - Number of Good Leaf Nodes Pairs.

Solution - Class in g1501_1600.s1531_string_compression_ii

1531 - String Compression II.

Solution - Class in g1501_1600.s1534_count_good_triplets

1534 - Count Good Triplets.

Solution - Class in g1501_1600.s1535_find_the_winner_of_an_array_game

1535 - Find the Winner of an Array Game.

Solution - Class in g1501_1600.s1536_minimum_swaps_to_arrange_a_binary_grid

1536 - Minimum Swaps to Arrange a Binary Grid.

Solution - Class in g1501_1600.s1537_get_the_maximum_score

1537 - Get the Maximum Score.

Solution - Class in g1501_1600.s1539_kth_missing_positive_number

1539 - Kth Missing Positive Number.

Solution - Class in g1501_1600.s1540_can_convert_string_in_k_moves

1540 - Can Convert String in K Moves.

Solution - Class in g1501_1600.s1541_minimum_insertions_to_balance_a_parentheses_string

1541 - Minimum Insertions to Balance a Parentheses String.

Solution - Class in g1501_1600.s1542_find_longest_awesome_substring

1542 - Find Longest Awesome Substring.

Solution - Class in g1501_1600.s1544_make_the_string_great

1544 - Make The String Great.

Solution - Class in g1501_1600.s1545_find_kth_bit_in_nth_binary_string

1545 - Find Kth Bit in Nth Binary String.

Solution - Class in g1501_1600.s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target

1546 - Maximum Number of Non-Overlapping Subarrays With Sum Equals Target.

Solution - Class in g1501_1600.s1547_minimum_cost_to_cut_a_stick

1547 - Minimum Cost to Cut a Stick.

Solution - Class in g1501_1600.s1550_three_consecutive_odds

1550 - Three Consecutive Odds.

Solution - Class in g1501_1600.s1551_minimum_operations_to_make_array_equal

1551 - Minimum Operations to Make Array Equal.

Solution - Class in g1501_1600.s1552_magnetic_force_between_two_balls

1552 - Magnetic Force Between Two Balls.

Solution - Class in g1501_1600.s1553_minimum_number_of_days_to_eat_n_oranges

1553 - Minimum Number of Days to Eat N Oranges.

Solution - Class in g1501_1600.s1556_thousand_separator

1556 - Thousand Separator.

Solution - Class in g1501_1600.s1557_minimum_number_of_vertices_to_reach_all_nodes

1557 - Minimum Number of Vertices to Reach All Nodes.

Solution - Class in g1501_1600.s1558_minimum_numbers_of_function_calls_to_make_target_array

1558 - Minimum Numbers of Function Calls to Make Target Array.

Solution - Class in g1501_1600.s1559_detect_cycles_in_2d_grid

1559 - Detect Cycles in 2D Grid.

Solution - Class in g1501_1600.s1560_most_visited_sector_in_a_circular_track

1560 - Most Visited Sector in a Circular Track.

Solution - Class in g1501_1600.s1561_maximum_number_of_coins_you_can_get

1561 - Maximum Number of Coins You Can Get.

Solution - Class in g1501_1600.s1562_find_latest_group_of_size_m

1562 - Find Latest Group of Size M.

Solution - Class in g1501_1600.s1563_stone_game_v

1563 - Stone Game V.

Solution - Class in g1501_1600.s1566_detect_pattern_of_length_m_repeated_k_or_more_times

1566 - Detect Pattern of Length M Repeated K or More Times.

Solution - Class in g1501_1600.s1567_maximum_length_of_subarray_with_positive_product

1567 - Maximum Length of Subarray With Positive Product.

Solution - Class in g1501_1600.s1568_minimum_number_of_days_to_disconnect_island

1568 - Minimum Number of Days to Disconnect Island.

Solution - Class in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst

1569 - Number of Ways to Reorder Array to Get Same BST.

Solution - Class in g1501_1600.s1572_matrix_diagonal_sum

1572 - Matrix Diagonal Sum.

Solution - Class in g1501_1600.s1573_number_of_ways_to_split_a_string

1573 - Number of Ways to Split a String.

Solution - Class in g1501_1600.s1574_shortest_subarray_to_be_removed_to_make_array_sorted

1574 - Shortest Subarray to be Removed to Make Array Sorted.

Solution - Class in g1501_1600.s1575_count_all_possible_routes

1575 - Count All Possible Routes.

Solution - Class in g1501_1600.s1576_replace_all_s_to_avoid_consecutive_repeating_characters

1576 - Replace All ?’

Solution - Class in g1501_1600.s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers

1577 - Number of Ways Where Square of Number Is Equal to Product of Two Numbers.

Solution - Class in g1501_1600.s1578_minimum_time_to_make_rope_colorful

1578 - Minimum Time to Make Rope Colorful.

Solution - Class in g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable

1579 - Remove Max Number of Edges to Keep Graph Fully Traversable.

Solution - Class in g1501_1600.s1582_special_positions_in_a_binary_matrix

1582 - Special Positions in a Binary Matrix.

Solution - Class in g1501_1600.s1583_count_unhappy_friends

1583 - Count Unhappy Friends.

Solution - Class in g1501_1600.s1584_min_cost_to_connect_all_points

1584 - Min Cost to Connect All Points.

Solution - Class in g1501_1600.s1585_check_if_string_is_transformable_with_substring_sort_operations

1585 - Check If String Is Transformable With Substring Sort Operations.

Solution - Class in g1501_1600.s1588_sum_of_all_odd_length_subarrays

1588 - Sum of All Odd Length Subarrays.

Solution - Class in g1501_1600.s1589_maximum_sum_obtained_of_any_permutation

1589 - Maximum Sum Obtained of Any Permutation.

Solution - Class in g1501_1600.s1590_make_sum_divisible_by_p

1590 - Make Sum Divisible by P.

Solution - Class in g1501_1600.s1591_strange_printer_ii

1591 - Strange Printer II.

Solution - Class in g1501_1600.s1592_rearrange_spaces_between_words

1592 - Rearrange Spaces Between Words.

Solution - Class in g1501_1600.s1593_split_a_string_into_the_max_number_of_unique_substrings

1593 - Split a String Into the Max Number of Unique Substrings.

Solution - Class in g1501_1600.s1594_maximum_non_negative_product_in_a_matrix

1594 - Maximum Non Negative Product in a Matrix.

Solution - Class in g1501_1600.s1595_minimum_cost_to_connect_two_groups_of_points

1595 - Minimum Cost to Connect Two Groups of Points.

Solution - Class in g1501_1600.s1598_crawler_log_folder

1598 - Crawler Log Folder.

Solution - Class in g1501_1600.s1599_maximum_profit_of_operating_a_centennial_wheel

1599 - Maximum Profit of Operating a Centennial Wheel.

Solution - Class in g1601_1700.s1601_maximum_number_of_achievable_transfer_requests

1601 - Maximum Number of Achievable Transfer Requests.

Solution - Class in g1601_1700.s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period

1604 - Alert Using Same Key-Card Three or More Times in a One Hour Period.

Solution - Class in g1601_1700.s1605_find_valid_matrix_given_row_and_column_sums

1605 - Find Valid Matrix Given Row and Column Sums.

Solution - Class in g1601_1700.s1606_find_servers_that_handled_most_number_of_requests

1606 - Find Servers That Handled Most Number of Requests.

Solution - Class in g1601_1700.s1608_special_array_with_x_elements_greater_than_or_equal_x

1608 - Special Array With X Elements Greater Than or Equal X.

Solution - Class in g1601_1700.s1609_even_odd_tree

1609 - Even Odd Tree.

Solution - Class in g1601_1700.s1610_maximum_number_of_visible_points

1610 - Maximum Number of Visible Points.

Solution - Class in g1601_1700.s1611_minimum_one_bit_operations_to_make_integers_zero

1611 - Minimum One Bit Operations to Make Integers Zero.

Solution - Class in g1601_1700.s1614_maximum_nesting_depth_of_the_parentheses

1614 - Maximum Nesting Depth of the Parentheses.

Solution - Class in g1601_1700.s1615_maximal_network_rank

1615 - Maximal Network Rank.

Solution - Class in g1601_1700.s1616_split_two_strings_to_make_palindrome

1616 - Split Two Strings to Make Palindrome.

Solution - Class in g1601_1700.s1617_count_subtrees_with_max_distance_between_cities

1617 - Count Subtrees With Max Distance Between Cities.

Solution - Class in g1601_1700.s1619_mean_of_array_after_removing_some_elements

1619 - Mean of Array After Removing Some Elements.

Solution - Class in g1601_1700.s1620_coordinate_with_maximum_network_quality

1620 - Coordinate With Maximum Network Quality.

Solution - Class in g1601_1700.s1621_number_of_sets_of_k_non_overlapping_line_segments

1621 - Number of Sets of K Non-Overlapping Line Segments.

Solution - Class in g1601_1700.s1624_largest_substring_between_two_equal_characters

1624 - Largest Substring Between Two Equal Characters.

Solution - Class in g1601_1700.s1625_lexicographically_smallest_string_after_applying_operations

1625 - Lexicographically Smallest String After Applying Operations.

Solution - Class in g1601_1700.s1626_best_team_with_no_conflicts

1626 - Best Team With No Conflicts.

Solution - Class in g1601_1700.s1627_graph_connectivity_with_threshold

1627 - Graph Connectivity With Threshold.

Solution - Class in g1601_1700.s1629_slowest_key

1629 - Slowest Key.

Solution - Class in g1601_1700.s1630_arithmetic_subarrays

1630 - Arithmetic Subarrays.

Solution - Class in g1601_1700.s1631_path_with_minimum_effort

1631 - Path With Minimum Effort.

Solution - Class in g1601_1700.s1632_rank_transform_of_a_matrix

1632 - Rank Transform of a Matrix.

Solution - Class in g1601_1700.s1636_sort_array_by_increasing_frequency

1636 - Sort Array by Increasing Frequency.

Solution - Class in g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points

1637 - Widest Vertical Area Between Two Points Containing No Points.

Solution - Class in g1601_1700.s1638_count_substrings_that_differ_by_one_character

1638 - Count Substrings That Differ by One Character.

Solution - Class in g1601_1700.s1639_number_of_ways_to_form_a_target_string_given_a_dictionary

1639 - Number of Ways to Form a Target String Given a Dictionary.

Solution - Class in g1601_1700.s1640_check_array_formation_through_concatenation

1640 - Check Array Formation Through Concatenation.

Solution - Class in g1601_1700.s1641_count_sorted_vowel_strings

1641 - Count Sorted Vowel Strings.

Solution - Class in g1601_1700.s1642_furthest_building_you_can_reach

1642 - Furthest Building You Can Reach.

Solution - Class in g1601_1700.s1643_kth_smallest_instructions

1643 - Kth Smallest Instructions.

Solution - Class in g1601_1700.s1646_get_maximum_in_generated_array

1646 - Get Maximum in Generated Array.

Solution - Class in g1601_1700.s1647_minimum_deletions_to_make_character_frequencies_unique

1647 - Minimum Deletions to Make Character Frequencies Unique.

Solution - Class in g1601_1700.s1648_sell_diminishing_valued_colored_balls

1648 - Sell Diminishing-Valued Colored Balls.

Solution - Class in g1601_1700.s1649_create_sorted_array_through_instructions

1649 - Create Sorted Array through Instructions.

Solution - Class in g1601_1700.s1652_defuse_the_bomb

1652 - Defuse the Bomb.

Solution - Class in g1601_1700.s1653_minimum_deletions_to_make_string_balanced

1653 - Minimum Deletions to Make String Balanced.

Solution - Class in g1601_1700.s1654_minimum_jumps_to_reach_home

1654 - Minimum Jumps to Reach Home.

Solution - Class in g1601_1700.s1655_distribute_repeating_integers

1655 - Distribute Repeating Integers.

Solution - Class in g1601_1700.s1657_determine_if_two_strings_are_close

1657 - Determine if Two Strings Are Close.

Solution - Class in g1601_1700.s1658_minimum_operations_to_reduce_x_to_zero

1658 - Minimum Operations to Reduce X to Zero.

Solution - Class in g1601_1700.s1659_maximize_grid_happiness

1659 - Maximize Grid Happiness.

Solution - Class in g1601_1700.s1662_check_if_two_string_arrays_are_equivalent

1662 - Check If Two String Arrays are Equivalent.

Solution - Class in g1601_1700.s1663_smallest_string_with_a_given_numeric_value

1663 - Smallest String With A Given Numeric Value.

Solution - Class in g1601_1700.s1664_ways_to_make_a_fair_array

1664 - Ways to Make a Fair Array.

Solution - Class in g1601_1700.s1665_minimum_initial_energy_to_finish_tasks

1665 - Minimum Initial Energy to Finish Tasks.

Solution - Class in g1601_1700.s1668_maximum_repeating_substring

1668 - Maximum Repeating Substring.

Solution - Class in g1601_1700.s1669_merge_in_between_linked_lists

1669 - Merge In Between Linked Lists.

Solution - Class in g1601_1700.s1671_minimum_number_of_removals_to_make_mountain_array

1671 - Minimum Number of Removals to Make Mountain Array.

Solution - Class in g1601_1700.s1672_richest_customer_wealth

1672 - Richest Customer Wealth.

Solution - Class in g1601_1700.s1673_find_the_most_competitive_subsequence

1673 - Find the Most Competitive Subsequence.

Solution - Class in g1601_1700.s1674_minimum_moves_to_make_array_complementary

1674 - Minimum Moves to Make Array Complementary.

Solution - Class in g1601_1700.s1675_minimize_deviation_in_array

1675 - Minimize Deviation in Array.

Solution - Class in g1601_1700.s1678_goal_parser_interpretation

1678 - Goal Parser Interpretation.

Solution - Class in g1601_1700.s1679_max_number_of_k_sum_pairs

1679 - Max Number of K-Sum Pairs.

Solution - Class in g1601_1700.s1680_concatenation_of_consecutive_binary_numbers

1680 - Concatenation of Consecutive Binary Numbers.

Solution - Class in g1601_1700.s1681_minimum_incompatibility

1681 - Minimum Incompatibility.

Solution - Class in g1601_1700.s1684_count_the_number_of_consistent_strings

1684 - Count the Number of Consistent Strings.

Solution - Class in g1601_1700.s1685_sum_of_absolute_differences_in_a_sorted_array

1685 - Sum of Absolute Differences in a Sorted Array.

Solution - Class in g1601_1700.s1686_stone_game_vi

1686 - Stone Game VI.

Solution - Class in g1601_1700.s1687_delivering_boxes_from_storage_to_ports

1687 - Delivering Boxes from Storage to Ports.

Solution - Class in g1601_1700.s1688_count_of_matches_in_tournament

1688 - Count of Matches in Tournament.

Solution - Class in g1601_1700.s1689_partitioning_into_minimum_number_of_deci_binary_numbers

1689 - Partitioning Into Minimum Number Of Deci-Binary Numbers.

Solution - Class in g1601_1700.s1690_stone_game_vii

1690 - Stone Game VII.

Solution - Class in g1601_1700.s1691_maximum_height_by_stacking_cuboids

1691 - Maximum Height by Stacking Cuboids.

Solution - Class in g1601_1700.s1694_reformat_phone_number

1694 - Reformat Phone Number.

Solution - Class in g1601_1700.s1695_maximum_erasure_value

1695 - Maximum Erasure Value.

Solution - Class in g1601_1700.s1696_jump_game_vi

1696 - Jump Game VI.

Solution - Class in g1601_1700.s1697_checking_existence_of_edge_length_limited_paths

1697 - Checking Existence of Edge Length Limited Paths.

Solution - Class in g1601_1700.s1700_number_of_students_unable_to_eat_lunch

1700 - Number of Students Unable to Eat Lunch.

Solution - Class in g1701_1800.s1701_average_waiting_time

1701 - Average Waiting Time.

Solution - Class in g1701_1800.s1702_maximum_binary_string_after_change

1702 - Maximum Binary String After Change.

Solution - Class in g1701_1800.s1703_minimum_adjacent_swaps_for_k_consecutive_ones

1703 - Minimum Adjacent Swaps for K Consecutive Ones.

Solution - Class in g1701_1800.s1704_determine_if_string_halves_are_alike

1704 - Determine if String Halves Are Alike.

Solution - Class in g1701_1800.s1705_maximum_number_of_eaten_apples

1705 - Maximum Number of Eaten Apples.

Solution - Class in g1701_1800.s1706_where_will_the_ball_fall

1706 - Where Will the Ball Fall.

Solution - Class in g1701_1800.s1707_maximum_xor_with_an_element_from_array

1707 - Maximum XOR With an Element From Array.

Solution - Class in g1701_1800.s1710_maximum_units_on_a_truck

1710 - Maximum Units on a Truck.

Solution - Class in g1701_1800.s1711_count_good_meals

1711 - Count Good Meals.

Solution - Class in g1701_1800.s1712_ways_to_split_array_into_three_subarrays

1712 - Ways to Split Array Into Three Subarrays.

Solution - Class in g1701_1800.s1713_minimum_operations_to_make_a_subsequence

1713 - Minimum Operations to Make a Subsequence.

Solution - Class in g1701_1800.s1716_calculate_money_in_leetcode_bank

1716 - Calculate Money in Leetcode Bank.

Solution - Class in g1701_1800.s1717_maximum_score_from_removing_substrings

1717 - Maximum Score From Removing Substrings.

Solution - Class in g1701_1800.s1718_construct_the_lexicographically_largest_valid_sequence

1718 - Construct the Lexicographically Largest Valid Sequence.

Solution - Class in g1701_1800.s1719_number_of_ways_to_reconstruct_a_tree

1719 - Number Of Ways To Reconstruct A Tree.

Solution - Class in g1701_1800.s1720_decode_xored_array

1720 - Decode XORed Array.

Solution - Class in g1701_1800.s1721_swapping_nodes_in_a_linked_list

1721 - Swapping Nodes in a Linked List.

Solution - Class in g1701_1800.s1722_minimize_hamming_distance_after_swap_operations

1722 - Minimize Hamming Distance After Swap Operations.

Solution - Class in g1701_1800.s1723_find_minimum_time_to_finish_all_jobs

1723 - Find Minimum Time to Finish All Jobs.

Solution - Class in g1701_1800.s1725_number_of_rectangles_that_can_form_the_largest_square

1725 - Number Of Rectangles That Can Form The Largest Square.

Solution - Class in g1701_1800.s1726_tuple_with_same_product

1726 - Tuple with Same Product.

Solution - Class in g1701_1800.s1727_largest_submatrix_with_rearrangements

1727 - Largest Submatrix With Rearrangements.

Solution - Class in g1701_1800.s1728_cat_and_mouse_ii

1728 - Cat and Mouse II.

Solution - Class in g1701_1800.s1732_find_the_highest_altitude

1732 - Find the Highest Altitude.

Solution - Class in g1701_1800.s1733_minimum_number_of_people_to_teach

1733 - Minimum Number of People to Teach.

Solution - Class in g1701_1800.s1734_decode_xored_permutation

1734 - Decode XORed Permutation.

Solution - Class in g1701_1800.s1735_count_ways_to_make_array_with_product

1735 - Count Ways to Make Array With Product.

Solution - Class in g1701_1800.s1736_latest_time_by_replacing_hidden_digits

1736 - Latest Time by Replacing Hidden Digits.

Solution - Class in g1701_1800.s1737_change_minimum_characters_to_satisfy_one_of_three_conditions

1737 - Change Minimum Characters to Satisfy One of Three Conditions.

Solution - Class in g1701_1800.s1738_find_kth_largest_xor_coordinate_value

1738 - Find Kth Largest XOR Coordinate Value.

Solution - Class in g1701_1800.s1739_building_boxes

1739 - Building Boxes.

Solution - Class in g1701_1800.s1742_maximum_number_of_balls_in_a_box

1742 - Maximum Number of Balls in a Box.

Solution - Class in g1701_1800.s1743_restore_the_array_from_adjacent_pairs

1743 - Restore the Array From Adjacent Pairs.

Solution - Class in g1701_1800.s1744_can_you_eat_your_favorite_candy_on_your_favorite_day

1744 - Can You Eat Your Favorite Candy on Your Favorite Day?

Solution - Class in g1701_1800.s1745_palindrome_partitioning_iv

1745 - Palindrome Partitioning IV.

Solution - Class in g1701_1800.s1748_sum_of_unique_elements

1748 - Sum of Unique Elements.

Solution - Class in g1701_1800.s1749_maximum_absolute_sum_of_any_subarray

1749 - Maximum Absolute Sum of Any Subarray.

Solution - Class in g1701_1800.s1750_minimum_length_of_string_after_deleting_similar_ends

1750 - Minimum Length of String After Deleting Similar Ends.

Solution - Class in g1701_1800.s1751_maximum_number_of_events_that_can_be_attended_ii

1751 - Maximum Number of Events That Can Be Attended II.

Solution - Class in g1701_1800.s1752_check_if_array_is_sorted_and_rotated

1752 - Check if Array Is Sorted and Rotated.

Solution - Class in g1701_1800.s1753_maximum_score_from_removing_stones

1753 - Maximum Score From Removing Stones.

Solution - Class in g1701_1800.s1754_largest_merge_of_two_strings

1754 - Largest Merge Of Two Strings.

Solution - Class in g1701_1800.s1755_closest_subsequence_sum

1755 - Closest Subsequence Sum.

Solution - Class in g1701_1800.s1758_minimum_changes_to_make_alternating_binary_string

1758 - Minimum Changes To Make Alternating Binary String.

Solution - Class in g1701_1800.s1759_count_number_of_homogenous_substrings

1759 - Count Number of Homogenous Substrings.

Solution - Class in g1701_1800.s1760_minimum_limit_of_balls_in_a_bag

1760 - Minimum Limit of Balls in a Bag.

Solution - Class in g1701_1800.s1761_minimum_degree_of_a_connected_trio_in_a_graph

1761 - Minimum Degree of a Connected Trio in a Graph.

Solution - Class in g1701_1800.s1763_longest_nice_substring

1763 - Longest Nice Substring.

Solution - Class in g1701_1800.s1764_form_array_by_concatenating_subarrays_of_another_array

1764 - Form Array by Concatenating Subarrays of Another Array.

Solution - Class in g1701_1800.s1765_map_of_highest_peak

1765 - Map of Highest Peak.

Solution - Class in g1701_1800.s1766_tree_of_coprimes

1766 - Tree of Coprimes.

Solution - Class in g1701_1800.s1768_merge_strings_alternately

1768 - Merge Strings Alternately.

Solution - Class in g1701_1800.s1769_minimum_number_of_operations_to_move_all_balls_to_each_box

1769 - Minimum Number of Operations to Move All Balls to Each Box.

Solution - Class in g1701_1800.s1770_maximum_score_from_performing_multiplication_operations

1770 - Maximum Score from Performing Multiplication Operations.

Solution - Class in g1701_1800.s1771_maximize_palindrome_length_from_subsequences

1771 - Maximize Palindrome Length From Subsequences.

Solution - Class in g1701_1800.s1773_count_items_matching_a_rule

1773 - Count Items Matching a Rule.

Solution - Class in g1701_1800.s1774_closest_dessert_cost

1774 - Closest Dessert Cost.

Solution - Class in g1701_1800.s1775_equal_sum_arrays_with_minimum_number_of_operations

1775 - Equal Sum Arrays With Minimum Number of Operations.

Solution - Class in g1701_1800.s1776_car_fleet_ii

1776 - Car Fleet II.

Solution - Class in g1701_1800.s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate

1779 - Find Nearest Point That Has the Same X or Y Coordinate.

Solution - Class in g1701_1800.s1780_check_if_number_is_a_sum_of_powers_of_three

1780 - Check if Number is a Sum of Powers of Three.

Solution - Class in g1701_1800.s1781_sum_of_beauty_of_all_substrings

1781 - Sum of Beauty of All Substrings.

Solution - Class in g1701_1800.s1782_count_pairs_of_nodes

1782 - Count Pairs Of Nodes.

Solution - Class in g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones

1784 - Check if Binary String Has at Most One Segment of Ones.

Solution - Class in g1701_1800.s1785_minimum_elements_to_add_to_form_a_given_sum

1785 - Minimum Elements to Add to Form a Given Sum.

Solution - Class in g1701_1800.s1786_number_of_restricted_paths_from_first_to_last_node

1786 - Number of Restricted Paths From First to Last Node.

Solution - Class in g1701_1800.s1787_make_the_xor_of_all_segments_equal_to_zero

1787 - Make the XOR of All Segments Equal to Zero.

Solution - Class in g1701_1800.s1790_check_if_one_string_swap_can_make_strings_equal

1790 - Check if One String Swap Can Make Strings Equal.

Solution - Class in g1701_1800.s1791_find_center_of_star_graph

1791 - Find Center of Star Graph.

Solution - Class in g1701_1800.s1792_maximum_average_pass_ratio

1792 - Maximum Average Pass Ratio.

Solution - Class in g1701_1800.s1793_maximum_score_of_a_good_subarray

1793 - Maximum Score of a Good Subarray.

Solution - Class in g1701_1800.s1796_second_largest_digit_in_a_string

1796 - Second Largest Digit in a String.

Solution - Class in g1701_1800.s1798_maximum_number_of_consecutive_values_you_can_make

1798 - Maximum Number of Consecutive Values You Can Make.

Solution - Class in g1701_1800.s1799_maximize_score_after_n_operations

1799 - Maximize Score After N Operations.

Solution - Class in g1701_1800.s1800_maximum_ascending_subarray_sum

1800 - Maximum Ascending Subarray Sum.

Solution - Class in g1801_1900.s1801_number_of_orders_in_the_backlog

1801 - Number of Orders in the Backlog.

Solution - Class in g1801_1900.s1802_maximum_value_at_a_given_index_in_a_bounded_array

1802 - Maximum Value at a Given Index in a Bounded Array.

Solution - Class in g1801_1900.s1803_count_pairs_with_xor_in_a_range

1803 - Count Pairs With XOR in a Range.

Solution - Class in g1801_1900.s1805_number_of_different_integers_in_a_string

1805 - Number of Different Integers in a String.

Solution - Class in g1801_1900.s1806_minimum_number_of_operations_to_reinitialize_a_permutation

1806 - Minimum Number of Operations to Reinitialize a Permutation.

Solution - Class in g1801_1900.s1807_evaluate_the_bracket_pairs_of_a_string

1807 - Evaluate the Bracket Pairs of a String.

Solution - Class in g1801_1900.s1808_maximize_number_of_nice_divisors

1808 - Maximize Number of Nice Divisors.

Solution - Class in g1801_1900.s1812_determine_color_of_a_chessboard_square

1812 - Determine Color of a Chessboard Square.

Solution - Class in g1801_1900.s1813_sentence_similarity_iii

1813 - Sentence Similarity III.

Solution - Class in g1801_1900.s1814_count_nice_pairs_in_an_array

1814 - Count Nice Pairs in an Array.

Solution - Class in g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts

1815 - Maximum Number of Groups Getting Fresh Donuts.

Solution - Class in g1801_1900.s1816_truncate_sentence

1816 - Truncate Sentence.

Solution - Class in g1801_1900.s1817_finding_the_users_active_minutes

1817 - Finding the Users Active Minutes.

Solution - Class in g1801_1900.s1818_minimum_absolute_sum_difference

1818 - Minimum Absolute Sum Difference.

Solution - Class in g1801_1900.s1819_number_of_different_subsequences_gcds

1819 - Number of Different Subsequences GCDs.

Solution - Class in g1801_1900.s1822_sign_of_the_product_of_an_array

1822 - Sign of the Product of an Array.

Solution - Class in g1801_1900.s1823_find_the_winner_of_the_circular_game

1823 - Find the Winner of the Circular Game.

Solution - Class in g1801_1900.s1824_minimum_sideway_jumps

1824 - Minimum Sideway Jumps.

Solution - Class in g1801_1900.s1827_minimum_operations_to_make_the_array_increasing

1827 - Minimum Operations to Make the Array Increasing.

Solution - Class in g1801_1900.s1828_queries_on_number_of_points_inside_a_circle

1828 - Queries on Number of Points Inside a Circle.

Solution - Class in g1801_1900.s1829_maximum_xor_for_each_query

1829 - Maximum XOR for Each Query.

Solution - Class in g1801_1900.s1830_minimum_number_of_operations_to_make_string_sorted

1830 - Minimum Number of Operations to Make String Sorted.

Solution - Class in g1801_1900.s1832_check_if_the_sentence_is_pangram

1832 - Check if the Sentence Is Pangram.

Solution - Class in g1801_1900.s1833_maximum_ice_cream_bars

1833 - Maximum Ice Cream Bars.

Solution - Class in g1801_1900.s1834_single_threaded_cpu

1834 - Single-Threaded CPU.

Solution - Class in g1801_1900.s1835_find_xor_sum_of_all_pairs_bitwise_and

1835 - Find XOR Sum of All Pairs Bitwise AND.

Solution - Class in g1801_1900.s1837_sum_of_digits_in_base_k

1837 - Sum of Digits in Base K.

Solution - Class in g1801_1900.s1838_frequency_of_the_most_frequent_element

1838 - Frequency of the Most Frequent Element.

Solution - Class in g1801_1900.s1839_longest_substring_of_all_vowels_in_order

1839 - Longest Substring Of All Vowels in Order.

Solution - Class in g1801_1900.s1840_maximum_building_height

1840 - Maximum Building Height.

Solution - Class in g1801_1900.s1844_replace_all_digits_with_characters

1844 - Replace All Digits with Characters.

Solution - Class in g1801_1900.s1846_maximum_element_after_decreasing_and_rearranging

1846 - Maximum Element After Decreasing and Rearranging.

Solution - Class in g1801_1900.s1847_closest_room

1847 - Closest Room.

Solution - Class in g1801_1900.s1848_minimum_distance_to_the_target_element

1848 - Minimum Distance to the Target Element.

Solution - Class in g1801_1900.s1849_splitting_a_string_into_descending_consecutive_values

1849 - Splitting a String Into Descending Consecutive Values.

Solution - Class in g1801_1900.s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number

1850 - Minimum Adjacent Swaps to Reach the Kth Smallest Number.

Solution - Class in g1801_1900.s1851_minimum_interval_to_include_each_query

1851 - Minimum Interval to Include Each Query.

Solution - Class in g1801_1900.s1854_maximum_population_year

1854 - Maximum Population Year.

Solution - Class in g1801_1900.s1855_maximum_distance_between_a_pair_of_values

1855 - Maximum Distance Between a Pair of Values.

Solution - Class in g1801_1900.s1856_maximum_subarray_min_product

1856 - Maximum Subarray Min-Product.

Solution - Class in g1801_1900.s1857_largest_color_value_in_a_directed_graph

1857 - Largest Color Value in a Directed Graph.

Solution - Class in g1801_1900.s1859_sorting_the_sentence

1859 - Sorting the Sentence.

Solution - Class in g1801_1900.s1860_incremental_memory_leak

1860 - Incremental Memory Leak.

Solution - Class in g1801_1900.s1861_rotating_the_box

1861 - Rotating the Box.

Solution - Class in g1801_1900.s1862_sum_of_floored_pairs

1862 - Sum of Floored Pairs.

Solution - Class in g1801_1900.s1863_sum_of_all_subset_xor_totals

1863 - Sum of All Subset XOR Totals.

Solution - Class in g1801_1900.s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating

1864 - Minimum Number of Swaps to Make the Binary String Alternating.

Solution - Class in g1801_1900.s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible

1866 - Number of Ways to Rearrange Sticks With K Sticks Visible.

Solution - Class in g1801_1900.s1869_longer_contiguous_segments_of_ones_than_zeros

1869 - Longer Contiguous Segments of Ones than Zeros.

Solution - Class in g1801_1900.s1870_minimum_speed_to_arrive_on_time

1870 - Minimum Speed to Arrive on Time.

Solution - Class in g1801_1900.s1871_jump_game_vii

1871 - Jump Game VII.

Solution - Class in g1801_1900.s1872_stone_game_viii

1872 - Stone Game VIII.

Solution - Class in g1801_1900.s1876_substrings_of_size_three_with_distinct_characters

1876 - Substrings of Size Three with Distinct Characters.

Solution - Class in g1801_1900.s1877_minimize_maximum_pair_sum_in_array

1877 - Minimize Maximum Pair Sum in Array.

Solution - Class in g1801_1900.s1878_get_biggest_three_rhombus_sums_in_a_grid

1878 - Get Biggest Three Rhombus Sums in a Grid.

Solution - Class in g1801_1900.s1879_minimum_xor_sum_of_two_arrays

1879 - Minimum XOR Sum of Two Arrays.

Solution - Class in g1801_1900.s1880_check_if_word_equals_summation_of_two_words

1880 - Check if Word Equals Summation of Two Words.

Solution - Class in g1801_1900.s1881_maximum_value_after_insertion

1881 - Maximum Value after Insertion.

Solution - Class in g1801_1900.s1882_process_tasks_using_servers

1882 - Process Tasks Using Servers.

Solution - Class in g1801_1900.s1883_minimum_skips_to_arrive_at_meeting_on_time

1883 - Minimum Skips to Arrive at Meeting On Time.

Solution - Class in g1801_1900.s1884_egg_drop_with_2_eggs_and_n_floors

1884 - Egg Drop With 2 Eggs and N Floors.

Solution - Class in g1801_1900.s1886_determine_whether_matrix_can_be_obtained_by_rotation

1886 - Determine Whether Matrix Can Be Obtained By Rotation.

Solution - Class in g1801_1900.s1887_reduction_operations_to_make_the_array_elements_equal

1887 - Reduction Operations to Make the Array Elements Equal.

Solution - Class in g1801_1900.s1888_minimum_number_of_flips_to_make_the_binary_string_alternating

1888 - Minimum Number of Flips to Make the Binary String Alternating.

Solution - Class in g1801_1900.s1889_minimum_space_wasted_from_packaging

1889 - Minimum Space Wasted From Packaging.

Solution - Class in g1801_1900.s1893_check_if_all_the_integers_in_a_range_are_covered

1893 - Check if All the Integers in a Range Are Covered.

Solution - Class in g1801_1900.s1894_find_the_student_that_will_replace_the_chalk

1894 - Find the Student that Will Replace the Chalk.

Solution - Class in g1801_1900.s1895_largest_magic_square

1895 - Largest Magic Square.

Solution - Class in g1801_1900.s1896_minimum_cost_to_change_the_final_value_of_expression

1896 - Minimum Cost to Change the Final Value of Expression.

Solution - Class in g1801_1900.s1897_redistribute_characters_to_make_all_strings_equal

1897 - Redistribute Characters to Make All Strings Equal.

Solution - Class in g1801_1900.s1898_maximum_number_of_removable_characters

1898 - Maximum Number of Removable Characters.

Solution - Class in g1801_1900.s1899_merge_triplets_to_form_target_triplet

1899 - Merge Triplets to Form Target Triplet.

Solution - Class in g1801_1900.s1900_the_earliest_and_latest_rounds_where_players_compete

1900 - The Earliest and Latest Rounds Where Players Compete.

Solution - Class in g1901_2000.s1901_find_a_peak_element_ii

1901 - Find a Peak Element II.

Solution - Class in g1901_2000.s1903_largest_odd_number_in_string

1903 - Largest Odd Number in String.

Solution - Class in g1901_2000.s1904_the_number_of_full_rounds_you_have_played

1904 - The Number of Full Rounds You Have Played.

Solution - Class in g1901_2000.s1905_count_sub_islands

1905 - Count Sub Islands.

Solution - Class in g1901_2000.s1906_minimum_absolute_difference_queries

1906 - Minimum Absolute Difference Queries.

Solution - Class in g1901_2000.s1909_remove_one_element_to_make_the_array_strictly_increasing

1909 - Remove One Element to Make the Array Strictly Increasing.

Solution - Class in g1901_2000.s1910_remove_all_occurrences_of_a_substring

1910 - Remove All Occurrences of a Substring.

Solution - Class in g1901_2000.s1911_maximum_alternating_subsequence_sum

1911 - Maximum Alternating Subsequence Sum.

Solution - Class in g1901_2000.s1913_maximum_product_difference_between_two_pairs

1913 - Maximum Product Difference Between Two Pairs.

Solution - Class in g1901_2000.s1914_cyclically_rotating_a_grid

1914 - Cyclically Rotating a Grid.

Solution - Class in g1901_2000.s1915_number_of_wonderful_substrings

1915 - Number of Wonderful Substrings.

Solution - Class in g1901_2000.s1916_count_ways_to_build_rooms_in_an_ant_colony

1916 - Count Ways to Build Rooms in an Ant Colony.

Solution - Class in g1901_2000.s1920_build_array_from_permutation

1920 - Build Array from Permutation.

Solution - Class in g1901_2000.s1921_eliminate_maximum_number_of_monsters

1921 - Eliminate Maximum Number of Monsters.

Solution - Class in g1901_2000.s1922_count_good_numbers

1922 - Count Good Numbers.

Solution - Class in g1901_2000.s1923_longest_common_subpath

1923 - Longest Common Subpath.

Solution - Class in g1901_2000.s1925_count_square_sum_triples

1925 - Count Square Sum Triples.

Solution - Class in g1901_2000.s1926_nearest_exit_from_entrance_in_maze

1926 - Nearest Exit from Entrance in Maze.

Solution - Class in g1901_2000.s1927_sum_game

1927 - Sum Game.

Solution - Class in g1901_2000.s1928_minimum_cost_to_reach_destination_in_time

1928 - Minimum Cost to Reach Destination in Time.

Solution - Class in g1901_2000.s1929_concatenation_of_array

1929 - Concatenation of Array.

Solution - Class in g1901_2000.s1930_unique_length_3_palindromic_subsequences

1930 - Unique Length-3 Palindromic Subsequences.

Solution - Class in g1901_2000.s1931_painting_a_grid_with_three_different_colors

1931 - Painting a Grid With Three Different Colors.

Solution - Class in g1901_2000.s1932_merge_bsts_to_create_single_bst

1932 - Merge BSTs to Create Single BST.

Solution - Class in g1901_2000.s1935_maximum_number_of_words_you_can_type

1935 - Maximum Number of Words You Can Type.

Solution - Class in g1901_2000.s1936_add_minimum_number_of_rungs

1936 - Add Minimum Number of Rungs.

Solution - Class in g1901_2000.s1937_maximum_number_of_points_with_cost

1937 - Maximum Number of Points with Cost.

Solution - Class in g1901_2000.s1938_maximum_genetic_difference_query

1938 - Maximum Genetic Difference Query.

Solution - Class in g1901_2000.s1941_check_if_all_characters_have_equal_number_of_occurrences

1941 - Check if All Characters Have Equal Number of Occurrences.

Solution - Class in g1901_2000.s1942_the_number_of_the_smallest_unoccupied_chair

1942 - The Number of the Smallest Unoccupied Chair.

Solution - Class in g1901_2000.s1943_describe_the_painting

1943 - Describe the Painting.

Solution - Class in g1901_2000.s1944_number_of_visible_people_in_a_queue

1944 - Number of Visible People in a Queue.

Solution - Class in g1901_2000.s1945_sum_of_digits_of_string_after_convert

1945 - Sum of Digits of String After Convert.

Solution - Class in g1901_2000.s1946_largest_number_after_mutating_substring

1946 - Largest Number After Mutating Substring.

Solution - Class in g1901_2000.s1947_maximum_compatibility_score_sum

1947 - Maximum Compatibility Score Sum.

Solution - Class in g1901_2000.s1948_delete_duplicate_folders_in_system

1948 - Delete Duplicate Folders in System.

Solution - Class in g1901_2000.s1952_three_divisors

1952 - Three Divisors.

Solution - Class in g1901_2000.s1953_maximum_number_of_weeks_for_which_you_can_work

1953 - Maximum Number of Weeks for Which You Can Work.

Solution - Class in g1901_2000.s1954_minimum_garden_perimeter_to_collect_enough_apples

1954 - Minimum Garden Perimeter to Collect Enough Apples.

Solution - Class in g1901_2000.s1955_count_number_of_special_subsequences

1955 - Count Number of Special Subsequences.

Solution - Class in g1901_2000.s1957_delete_characters_to_make_fancy_string

1957 - Delete Characters to Make Fancy String.

Solution - Class in g1901_2000.s1958_check_if_move_is_legal

1958 - Check if Move is Legal.

Solution - Class in g1901_2000.s1959_minimum_total_space_wasted_with_k_resizing_operations

1959 - Minimum Total Space Wasted With K Resizing Operations.

Solution - Class in g1901_2000.s1960_maximum_product_of_the_length_of_two_palindromic_substrings

1960 - Maximum Product of the Length of Two Palindromic Substrings.

Solution - Class in g1901_2000.s1961_check_if_string_is_a_prefix_of_array

1961 - Check If String Is a Prefix of Array.

Solution - Class in g1901_2000.s1962_remove_stones_to_minimize_the_total

1962 - Remove Stones to Minimize the Total.

Solution - Class in g1901_2000.s1963_minimum_number_of_swaps_to_make_the_string_balanced

1963 - Minimum Number of Swaps to Make the String Balanced.

Solution - Class in g1901_2000.s1964_find_the_longest_valid_obstacle_course_at_each_position

1964 - Find the Longest Valid Obstacle Course at Each Position.

Solution - Class in g1901_2000.s1967_number_of_strings_that_appear_as_substrings_in_word

1967 - Number of Strings That Appear as Substrings in Word.

Solution - Class in g1901_2000.s1968_array_with_elements_not_equal_to_average_of_neighbors

1968 - Array With Elements Not Equal to Average of Neighbors.

Solution - Class in g1901_2000.s1969_minimum_non_zero_product_of_the_array_elements

1969 - Minimum Non-Zero Product of the Array Elements.

Solution - Class in g1901_2000.s1970_last_day_where_you_can_still_cross

1970 - Last Day Where You Can Still Cross.

Solution - Class in g1901_2000.s1971_find_if_path_exists_in_graph

1971 - Find if Path Exists in Graph.

Solution - Class in g1901_2000.s1974_minimum_time_to_type_word_using_special_typewriter

1974 - Minimum Time to Type Word Using Special Typewriter.

Solution - Class in g1901_2000.s1975_maximum_matrix_sum

1975 - Maximum Matrix Sum.

Solution - Class in g1901_2000.s1976_number_of_ways_to_arrive_at_destination

1976 - Number of Ways to Arrive at Destination.

Solution - Class in g1901_2000.s1977_number_of_ways_to_separate_numbers

1977 - Number of Ways to Separate Numbers.

Solution - Class in g1901_2000.s1979_find_greatest_common_divisor_of_array

1979 - Find Greatest Common Divisor of Array.

Solution - Class in g1901_2000.s1980_find_unique_binary_string

1980 - Find Unique Binary String.

Solution - Class in g1901_2000.s1981_minimize_the_difference_between_target_and_chosen_elements

1981 - Minimize the Difference Between Target and Chosen Elements.

Solution - Class in g1901_2000.s1982_find_array_given_subset_sums

1982 - Find Array Given Subset Sums.

Solution - Class in g1901_2000.s1984_minimum_difference_between_highest_and_lowest_of_k_scores

1984 - Minimum Difference Between Highest and Lowest of K Scores.

Solution - Class in g1901_2000.s1985_find_the_kth_largest_integer_in_the_array

1985 - Find the Kth Largest Integer in the Array.

Solution - Class in g1901_2000.s1986_minimum_number_of_work_sessions_to_finish_the_tasks

1986 - Minimum Number of Work Sessions to Finish the Tasks.

Solution - Class in g1901_2000.s1987_number_of_unique_good_subsequences

1987 - Number of Unique Good Subsequences.

Solution - Class in g1901_2000.s1991_find_the_middle_index_in_array

1991 - Find the Middle Index in Array.

Solution - Class in g1901_2000.s1992_find_all_groups_of_farmland

1992 - Find All Groups of Farmland.

Solution - Class in g1901_2000.s1994_the_number_of_good_subsets

1994 - The Number of Good Subsets.

Solution - Class in g1901_2000.s1995_count_special_quadruplets

1995 - Count Special Quadruplets.

Solution - Class in g1901_2000.s1996_the_number_of_weak_characters_in_the_game

1996 - The Number of Weak Characters in the Game.

Solution - Class in g1901_2000.s1997_first_day_where_you_have_been_in_all_the_rooms

1997 - First Day Where You Have Been in All the Rooms.

Solution - Class in g1901_2000.s1998_gcd_sort_of_an_array

1998 - GCD Sort of an Array.

Solution - Class in g1901_2000.s2000_reverse_prefix_of_word

2000 - Reverse Prefix of Word.

Solution - Class in g2001_2100.s2001_number_of_pairs_of_interchangeable_rectangles

2001 - Number of Pairs of Interchangeable Rectangles.

Solution - Class in g2001_2100.s2002_maximum_product_of_the_length_of_two_palindromic_subsequences

2002 - Maximum Product of the Length of Two Palindromic Subsequences.

Solution - Class in g2001_2100.s2003_smallest_missing_genetic_value_in_each_subtree

2003 - Smallest Missing Genetic Value in Each Subtree.

Solution - Class in g2001_2100.s2006_count_number_of_pairs_with_absolute_difference_k

2006 - Count Number of Pairs With Absolute Difference K.

Solution - Class in g2001_2100.s2007_find_original_array_from_doubled_array

2007 - Find Original Array From Doubled Array.

Solution - Class in g2001_2100.s2008_maximum_earnings_from_taxi

2008 - Maximum Earnings From Taxi.

Solution - Class in g2001_2100.s2009_minimum_number_of_operations_to_make_array_continuous

2009 - Minimum Number of Operations to Make Array Continuous.

Solution - Class in g2001_2100.s2011_final_value_of_variable_after_performing_operations

2011 - Final Value of Variable After Performing Operations.

Solution - Class in g2001_2100.s2012_sum_of_beauty_in_the_array

2012 - Sum of Beauty in the Array.

Solution - Class in g2001_2100.s2014_longest_subsequence_repeated_k_times

2014 - Longest Subsequence Repeated k Times.

Solution - Class in g2001_2100.s2016_maximum_difference_between_increasing_elements

2016 - Maximum Difference Between Increasing Elements.

Solution - Class in g2001_2100.s2017_grid_game

2017 - Grid Game.

Solution - Class in g2001_2100.s2018_check_if_word_can_be_placed_in_crossword

2018 - Check if Word Can Be Placed In Crossword.

Solution - Class in g2001_2100.s2019_the_score_of_students_solving_math_expression

2019 - The Score of Students Solving Math Expression.

Solution - Class in g2001_2100.s2022_convert_1d_array_into_2d_array

2022 - Convert 1D Array Into 2D Array.

Solution - Class in g2001_2100.s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target

2023 - Number of Pairs of Strings With Concatenation Equal to Target.

Solution - Class in g2001_2100.s2024_maximize_the_confusion_of_an_exam

2024 - Maximize the Confusion of an Exam.

Solution - Class in g2001_2100.s2025_maximum_number_of_ways_to_partition_an_array

2025 - Maximum Number of Ways to Partition an Array.

Solution - Class in g2001_2100.s2027_minimum_moves_to_convert_string

2027 - Minimum Moves to Convert String.

Solution - Class in g2001_2100.s2028_find_missing_observations

2028 - Find Missing Observations.

Solution - Class in g2001_2100.s2029_stone_game_ix

2029 - Stone Game IX.

Solution - Class in g2001_2100.s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter

2030 - Smallest K-Length Subsequence With Occurrences of a Letter.

Solution - Class in g2001_2100.s2032_two_out_of_three

2032 - Two Out of Three.

Solution - Class in g2001_2100.s2033_minimum_operations_to_make_a_uni_value_grid

2033 - Minimum Operations to Make a Uni-Value Grid.

Solution - Class in g2001_2100.s2035_partition_array_into_two_arrays_to_minimize_sum_difference

2035 - Partition Array Into Two Arrays to Minimize Sum Difference.

Solution - Class in g2001_2100.s2037_minimum_number_of_moves_to_seat_everyone

2037 - Minimum Number of Moves to Seat Everyone.

Solution - Class in g2001_2100.s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color

2038 - Remove Colored Pieces if Both Neighbors are the Same Color.

Solution - Class in g2001_2100.s2039_the_time_when_the_network_becomes_idle

2039 - The Time When the Network Becomes Idle.

Solution - Class in g2001_2100.s2040_kth_smallest_product_of_two_sorted_arrays

2040 - Kth Smallest Product of Two Sorted Arrays.

Solution - Class in g2001_2100.s2042_check_if_numbers_are_ascending_in_a_sentence

2042 - Check if Numbers Are Ascending in a Sentence.

Solution - Class in g2001_2100.s2044_count_number_of_maximum_bitwise_or_subsets

2044 - Count Number of Maximum Bitwise-OR Subsets.

Solution - Class in g2001_2100.s2045_second_minimum_time_to_reach_destination

2045 - Second Minimum Time to Reach Destination.

Solution - Class in g2001_2100.s2047_number_of_valid_words_in_a_sentence

2047 - Number of Valid Words in a Sentence.

Solution - Class in g2001_2100.s2048_next_greater_numerically_balanced_number

2048 - Next Greater Numerically Balanced Number.

Solution - Class in g2001_2100.s2049_count_nodes_with_the_highest_score

2049 - Count Nodes With the Highest Score.

Solution - Class in g2001_2100.s2050_parallel_courses_iii

2050 - Parallel Courses III.

Solution - Class in g2001_2100.s2053_kth_distinct_string_in_an_array

2053 - Kth Distinct String in an Array.

Solution - Class in g2001_2100.s2054_two_best_non_overlapping_events

2054 - Two Best Non-Overlapping Events.

Solution - Class in g2001_2100.s2055_plates_between_candles

2055 - Plates Between Candles.

Solution - Class in g2001_2100.s2056_number_of_valid_move_combinations_on_chessboard

2056 - Number of Valid Move Combinations On Chessboard.

Solution - Class in g2001_2100.s2057_smallest_index_with_equal_value

2057 - Smallest Index With Equal Value.

Solution - Class in g2001_2100.s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points

2058 - Find the Minimum and Maximum Number of Nodes Between Critical Points.

Solution - Class in g2001_2100.s2059_minimum_operations_to_convert_number

2059 - Minimum Operations to Convert Number.

Solution - Class in g2001_2100.s2060_check_if_an_original_string_exists_given_two_encoded_strings

2060 - Check if an Original String Exists Given Two Encoded Strings.

Solution - Class in g2001_2100.s2062_count_vowel_substrings_of_a_string

2062 - Count Vowel Substrings of a String.

Solution - Class in g2001_2100.s2063_vowels_of_all_substrings

2063 - Vowels of All Substrings.

Solution - Class in g2001_2100.s2064_minimized_maximum_of_products_distributed_to_any_store

2064 - Minimized Maximum of Products Distributed to Any Store.

Solution - Class in g2001_2100.s2065_maximum_path_quality_of_a_graph

2065 - Maximum Path Quality of a Graph.

Solution - Class in g2001_2100.s2068_check_whether_two_strings_are_almost_equivalent

2068 - Check Whether Two Strings are Almost Equivalent.

Solution - Class in g2001_2100.s2070_most_beautiful_item_for_each_query

2070 - Most Beautiful Item for Each Query.

Solution - Class in g2001_2100.s2071_maximum_number_of_tasks_you_can_assign

2071 - Maximum Number of Tasks You Can Assign.

Solution - Class in g2001_2100.s2073_time_needed_to_buy_tickets

2073 - Time Needed to Buy Tickets.

Solution - Class in g2001_2100.s2074_reverse_nodes_in_even_length_groups

2074 - Reverse Nodes in Even Length Groups.

Solution - Class in g2001_2100.s2075_decode_the_slanted_ciphertext

2075 - Decode the Slanted Ciphertext.

Solution - Class in g2001_2100.s2076_process_restricted_friend_requests

2076 - Process Restricted Friend Requests.

Solution - Class in g2001_2100.s2078_two_furthest_houses_with_different_colors

2078 - Two Furthest Houses With Different Colors.

Solution - Class in g2001_2100.s2079_watering_plants

2079 - Watering Plants.

Solution - Class in g2001_2100.s2081_sum_of_k_mirror_numbers

2081 - Sum of k-Mirror Numbers.

Solution - Class in g2001_2100.s2085_count_common_words_with_one_occurrence

2085 - Count Common Words With One Occurrence.

Solution - Class in g2001_2100.s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses

2086 - Minimum Number of Buckets Required to Collect Rainwater from Houses.

Solution - Class in g2001_2100.s2087_minimum_cost_homecoming_of_a_robot_in_a_grid

2087 - Minimum Cost Homecoming of a Robot in a Grid.

Solution - Class in g2001_2100.s2088_count_fertile_pyramids_in_a_land

2088 - Count Fertile Pyramids in a Land.

Solution - Class in g2001_2100.s2089_find_target_indices_after_sorting_array

2089 - Find Target Indices After Sorting Array.

Solution - Class in g2001_2100.s2090_k_radius_subarray_averages

2090 - K Radius Subarray Averages.

Solution - Class in g2001_2100.s2091_removing_minimum_and_maximum_from_array

2091 - Removing Minimum and Maximum From Array.

Solution - Class in g2001_2100.s2092_find_all_people_with_secret

2092 - Find All People With Secret.

Solution - Class in g2001_2100.s2094_finding_3_digit_even_numbers

2094 - Finding 3-Digit Even Numbers.

Solution - Class in g2001_2100.s2095_delete_the_middle_node_of_a_linked_list

2095 - Delete the Middle Node of a Linked List.

Solution - Class in g2001_2100.s2096_step_by_step_directions_from_a_binary_tree_node_to_another

2096 - Step-By-Step Directions From a Binary Tree Node to Another.

Solution - Class in g2001_2100.s2097_valid_arrangement_of_pairs

2097 - Valid Arrangement of Pairs.

Solution - Class in g2001_2100.s2099_find_subsequence_of_length_k_with_the_largest_sum

2099 - Find Subsequence of Length K With the Largest Sum.

Solution - Class in g2001_2100.s2100_find_good_days_to_rob_the_bank

2100 - Find Good Days to Rob the Bank.

Solution - Class in g2101_2200.s2101_detonate_the_maximum_bombs

2101 - Detonate the Maximum Bombs.

Solution - Class in g2101_2200.s2103_rings_and_rods

2103 - Rings and Rods.

Solution - Class in g2101_2200.s2104_sum_of_subarray_ranges

2104 - Sum of Subarray Ranges.

Solution - Class in g2101_2200.s2105_watering_plants_ii

2105 - Watering Plants II.

Solution - Class in g2101_2200.s2106_maximum_fruits_harvested_after_at_most_k_steps

2106 - Maximum Fruits Harvested After at Most K Steps.

Solution - Class in g2101_2200.s2108_find_first_palindromic_string_in_the_array

2108 - Find First Palindromic String in the Array.

Solution - Class in g2101_2200.s2109_adding_spaces_to_a_string

2109 - Adding Spaces to a String.

Solution - Class in g2101_2200.s2110_number_of_smooth_descent_periods_of_a_stock

2110 - Number of Smooth Descent Periods of a Stock.

Solution - Class in g2101_2200.s2111_minimum_operations_to_make_the_array_k_increasing

2111 - Minimum Operations to Make the Array K-Increasing.

Solution - Class in g2101_2200.s2114_maximum_number_of_words_found_in_sentences

2114 - Maximum Number of Words Found in Sentences.

Solution - Class in g2101_2200.s2115_find_all_possible_recipes_from_given_supplies

2115 - Find All Possible Recipes from Given Supplies.

Solution - Class in g2101_2200.s2116_check_if_a_parentheses_string_can_be_valid

2116 - Check if a Parentheses String Can Be Valid.

Solution - Class in g2101_2200.s2117_abbreviating_the_product_of_a_range

2117 - Abbreviating the Product of a Range.

Solution - Class in g2101_2200.s2119_a_number_after_a_double_reversal

2119 - A Number After a Double Reversal.

Solution - Class in g2101_2200.s2120_execution_of_all_suffix_instructions_staying_in_a_grid

2120 - Execution of All Suffix Instructions Staying in a Grid.

Solution - Class in g2101_2200.s2121_intervals_between_identical_elements

2121 - Intervals Between Identical Elements.

Solution - Class in g2101_2200.s2122_recover_the_original_array

2122 - Recover the Original Array.

Solution - Class in g2101_2200.s2124_check_if_all_as_appears_before_all_bs

2124 - Check if All A’s Appears Before All B’s.

Solution - Class in g2101_2200.s2125_number_of_laser_beams_in_a_bank

2125 - Number of Laser Beams in a Bank.

Solution - Class in g2101_2200.s2126_destroying_asteroids

2126 - Destroying Asteroids.

Solution - Class in g2101_2200.s2127_maximum_employees_to_be_invited_to_a_meeting

2127 - Maximum Employees to Be Invited to a Meeting.

Solution - Class in g2101_2200.s2129_capitalize_the_title

2129 - Capitalize the Title.

Solution - Class in g2101_2200.s2130_maximum_twin_sum_of_a_linked_list

2130 - Maximum Twin Sum of a Linked List.

Solution - Class in g2101_2200.s2131_longest_palindrome_by_concatenating_two_letter_words

2131 - Longest Palindrome by Concatenating Two Letter Words.

Solution - Class in g2101_2200.s2132_stamping_the_grid

2132 - Stamping the Grid.

Solution - Class in g2101_2200.s2133_check_if_every_row_and_column_contains_all_numbers

2133 - Check if Every Row and Column Contains All Numbers.

Solution - Class in g2101_2200.s2134_minimum_swaps_to_group_all_1s_together_ii

2134 - Minimum Swaps to Group All 1’s Together II.

Solution - Class in g2101_2200.s2135_count_words_obtained_after_adding_a_letter

2135 - Count Words Obtained After Adding a Letter.

Solution - Class in g2101_2200.s2136_earliest_possible_day_of_full_bloom

2136 - Earliest Possible Day of Full Bloom.

Solution - Class in g2101_2200.s2138_divide_a_string_into_groups_of_size_k

2138 - Divide a String Into Groups of Size k.

Solution - Class in g2101_2200.s2139_minimum_moves_to_reach_target_score

2139 - Minimum Moves to Reach Target Score.

Solution - Class in g2101_2200.s2140_solving_questions_with_brainpower

2140 - Solving Questions With Brainpower.

Solution - Class in g2101_2200.s2141_maximum_running_time_of_n_computers

2141 - Maximum Running Time of N Computers.

Solution - Class in g2101_2200.s2144_minimum_cost_of_buying_candies_with_discount

2144 - Minimum Cost of Buying Candies With Discount.

Solution - Class in g2101_2200.s2145_count_the_hidden_sequences

2145 - Count the Hidden Sequences.

Solution - Class in g2101_2200.s2146_k_highest_ranked_items_within_a_price_range

2146 - K Highest Ranked Items Within a Price Range.

Solution - Class in g2101_2200.s2147_number_of_ways_to_divide_a_long_corridor

2147 - Number of Ways to Divide a Long Corridor.

Solution - Class in g2101_2200.s2148_count_elements_with_strictly_smaller_and_greater_elements

2148 - Count Elements With Strictly Smaller and Greater Elements.

Solution - Class in g2101_2200.s2149_rearrange_array_elements_by_sign

2149 - Rearrange Array Elements by Sign.

Solution - Class in g2101_2200.s2150_find_all_lonely_numbers_in_the_array

2150 - Find All Lonely Numbers in the Array.

Solution - Class in g2101_2200.s2151_maximum_good_people_based_on_statements

2151 - Maximum Good People Based on Statements.

Solution - Class in g2101_2200.s2154_keep_multiplying_found_values_by_two

2154 - Keep Multiplying Found Values by Two.

Solution - Class in g2101_2200.s2155_all_divisions_with_the_highest_score_of_a_binary_array

2155 - All Divisions With the Highest Score of a Binary Array.

Solution - Class in g2101_2200.s2156_find_substring_with_given_hash_value

2156 - Find Substring With Given Hash Value.

Solution - Class in g2101_2200.s2157_groups_of_strings

2157 - Groups of Strings.

Solution - Class in g2101_2200.s2160_minimum_sum_of_four_digit_number_after_splitting_digits

2160 - Minimum Sum of Four Digit Number After Splitting Digits.

Solution - Class in g2101_2200.s2161_partition_array_according_to_given_pivot

2161 - Partition Array According to Given Pivot.

Solution - Class in g2101_2200.s2162_minimum_cost_to_set_cooking_time

2162 - Minimum Cost to Set Cooking Time.

Solution - Class in g2101_2200.s2163_minimum_difference_in_sums_after_removal_of_elements

2163 - Minimum Difference in Sums After Removal of Elements.

Solution - Class in g2101_2200.s2164_sort_even_and_odd_indices_independently

2164 - Sort Even and Odd Indices Independently.

Solution - Class in g2101_2200.s2165_smallest_value_of_the_rearranged_number

2165 - Smallest Value of the Rearranged Number.

Solution - Class in g2101_2200.s2167_minimum_time_to_remove_all_cars_containing_illegal_goods

2167 - Minimum Time to Remove All Cars Containing Illegal Goods.

Solution - Class in g2101_2200.s2169_count_operations_to_obtain_zero

2169 - Count Operations to Obtain Zero.

Solution - Class in g2101_2200.s2170_minimum_operations_to_make_the_array_alternating

2170 - Minimum Operations to Make the Array Alternating.

Solution - Class in g2101_2200.s2171_removing_minimum_number_of_magic_beans

2171 - Removing Minimum Number of Magic Beans.

Solution - Class in g2101_2200.s2172_maximum_and_sum_of_array

2172 - Maximum AND Sum of Array.

Solution - Class in g2101_2200.s2176_count_equal_and_divisible_pairs_in_an_array

2176 - Count Equal and Divisible Pairs in an Array.

Solution - Class in g2101_2200.s2177_find_three_consecutive_integers_that_sum_to_a_given_number

2177 - Find Three Consecutive Integers That Sum to a Given Number.

Solution - Class in g2101_2200.s2178_maximum_split_of_positive_even_integers

2178 - Maximum Split of Positive Even Integers.

Solution - Class in g2101_2200.s2179_count_good_triplets_in_an_array

2179 - Count Good Triplets in an Array.

Solution - Class in g2101_2200.s2180_count_integers_with_even_digit_sum

2180 - Count Integers With Even Digit Sum.

Solution - Class in g2101_2200.s2181_merge_nodes_in_between_zeros

2181 - Merge Nodes in Between Zeros.

Solution - Class in g2101_2200.s2182_construct_string_with_repeat_limit

2182 - Construct String With Repeat Limit.

Solution - Class in g2101_2200.s2183_count_array_pairs_divisible_by_k

2183 - Count Array Pairs Divisible by K.

Solution - Class in g2101_2200.s2185_counting_words_with_a_given_prefix

2185 - Counting Words With a Given Prefix.

Solution - Class in g2101_2200.s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii

2186 - Minimum Number of Steps to Make Two Strings Anagram II.

Solution - Class in g2101_2200.s2187_minimum_time_to_complete_trips

2187 - Minimum Time to Complete Trips.

Solution - Class in g2101_2200.s2188_minimum_time_to_finish_the_race

2188 - Minimum Time to Finish the Race.

Solution - Class in g2101_2200.s2190_most_frequent_number_following_key_in_an_array

2190 - Most Frequent Number Following Key In an Array.

Solution - Class in g2101_2200.s2191_sort_the_jumbled_numbers

2191 - Sort the Jumbled Numbers.

Solution - Class in g2101_2200.s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph

2192 - All Ancestors of a Node in a Directed Acyclic Graph.

Solution - Class in g2101_2200.s2193_minimum_number_of_moves_to_make_palindrome

2193 - Minimum Number of Moves to Make Palindrome.

Solution - Class in g2101_2200.s2194_cells_in_a_range_on_an_excel_sheet

2194 - Cells in a Range on an Excel Sheet.

Solution - Class in g2101_2200.s2195_append_k_integers_with_minimal_sum

2195 - Append K Integers With Minimal Sum.

Solution - Class in g2101_2200.s2196_create_binary_tree_from_descriptions

2196 - Create Binary Tree From Descriptions.

Solution - Class in g2101_2200.s2197_replace_non_coprime_numbers_in_array

2197 - Replace Non-Coprime Numbers in Array.

Solution - Class in g2101_2200.s2200_find_all_k_distant_indices_in_an_array

2200 - Find All K-Distant Indices in an Array.

Solution - Class in g2201_2300.s2201_count_artifacts_that_can_be_extracted

2201 - Count Artifacts That Can Be Extracted.

Solution - Class in g2201_2300.s2202_maximize_the_topmost_element_after_k_moves

2202 - Maximize the Topmost Element After K Moves.

Solution - Class in g2201_2300.s2203_minimum_weighted_subgraph_with_the_required_paths

2203 - Minimum Weighted Subgraph With the Required Paths.

Solution - Class in g2201_2300.s2206_divide_array_into_equal_pairs

2206 - Divide Array Into Equal Pairs.

Solution - Class in g2201_2300.s2207_maximize_number_of_subsequences_in_a_string

2207 - Maximize Number of Subsequences in a String.

Solution - Class in g2201_2300.s2208_minimum_operations_to_halve_array_sum

2208 - Minimum Operations to Halve Array Sum.

Solution - Class in g2201_2300.s2209_minimum_white_tiles_after_covering_with_carpets

2209 - Minimum White Tiles After Covering With Carpets.

Solution - Class in g2201_2300.s2210_count_hills_and_valleys_in_an_array

2210 - Count Hills and Valleys in an Array.

Solution - Class in g2201_2300.s2211_count_collisions_on_a_road

2211 - Count Collisions on a Road.

Solution - Class in g2201_2300.s2212_maximum_points_in_an_archery_competition

2212 - Maximum Points in an Archery Competition.

Solution - Class in g2201_2300.s2213_longest_substring_of_one_repeating_character

2213 - Longest Substring of One Repeating Character.

Solution - Class in g2201_2300.s2215_find_the_difference_of_two_arrays

2215 - Find the Difference of Two Arrays.

Solution - Class in g2201_2300.s2216_minimum_deletions_to_make_array_beautiful

2216 - Minimum Deletions to Make Array Beautiful.

Solution - Class in g2201_2300.s2217_find_palindrome_with_fixed_length

2217 - Find Palindrome With Fixed Length.

Solution - Class in g2201_2300.s2218_maximum_value_of_k_coins_from_piles

2218 - Maximum Value of K Coins From Piles.

Solution - Class in g2201_2300.s2220_minimum_bit_flips_to_convert_number

2220 - Minimum Bit Flips to Convert Number.

Solution - Class in g2201_2300.s2221_find_triangular_sum_of_an_array

2221 - Find Triangular Sum of an Array.

Solution - Class in g2201_2300.s2222_number_of_ways_to_select_buildings

2222 - Number of Ways to Select Buildings.

Solution - Class in g2201_2300.s2223_sum_of_scores_of_built_strings

2223 - Sum of Scores of Built Strings.

Solution - Class in g2201_2300.s2224_minimum_number_of_operations_to_convert_time

2224 - Minimum Number of Operations to Convert Time.

Solution - Class in g2201_2300.s2225_find_players_with_zero_or_one_losses

2225 - Find Players With Zero or One Losses.

Solution - Class in g2201_2300.s2226_maximum_candies_allocated_to_k_children

2226 - Maximum Candies Allocated to K Children.

Solution - Class in g2201_2300.s2231_largest_number_after_digit_swaps_by_parity

2231 - Largest Number After Digit Swaps by Parity.

Solution - Class in g2201_2300.s2232_minimize_result_by_adding_parentheses_to_expression

2232 - Minimize Result by Adding Parentheses to Expression.

Solution - Class in g2201_2300.s2233_maximum_product_after_k_increments

2233 - Maximum Product After K Increments.

Solution - Class in g2201_2300.s2234_maximum_total_beauty_of_the_gardens

2234 - Maximum Total Beauty of the Gardens.

Solution - Class in g2201_2300.s2235_add_two_integers

2235 - Add Two Integers.

Solution - Class in g2201_2300.s2236_root_equals_sum_of_children

2236 - Root Equals Sum of Children.

Solution - Class in g2201_2300.s2239_find_closest_number_to_zero

2239 - Find Closest Number to Zero.

Solution - Class in g2201_2300.s2240_number_of_ways_to_buy_pens_and_pencils

2240 - Number of Ways to Buy Pens and Pencils.

Solution - Class in g2201_2300.s2242_maximum_score_of_a_node_sequence

2242 - Maximum Score of a Node Sequence.

Solution - Class in g2201_2300.s2243_calculate_digit_sum_of_a_string

2243 - Calculate Digit Sum of a String.

Solution - Class in g2201_2300.s2244_minimum_rounds_to_complete_all_tasks

2244 - Minimum Rounds to Complete All Tasks.

Solution - Class in g2201_2300.s2245_maximum_trailing_zeros_in_a_cornered_path

2245 - Maximum Trailing Zeros in a Cornered Path.

Solution - Class in g2201_2300.s2246_longest_path_with_different_adjacent_characters

2246 - Longest Path With Different Adjacent Characters.

Solution - Class in g2201_2300.s2248_intersection_of_multiple_arrays

2248 - Intersection of Multiple Arrays.

Solution - Class in g2201_2300.s2249_count_lattice_points_inside_a_circle

2249 - Count Lattice Points Inside a Circle.

Solution - Class in g2201_2300.s2250_count_number_of_rectangles_containing_each_point

2250 - Count Number of Rectangles Containing Each Point.

Solution - Class in g2201_2300.s2251_number_of_flowers_in_full_bloom

2251 - Number of Flowers in Full Bloom.

Solution - Class in g2201_2300.s2255_count_prefixes_of_a_given_string

2255 - Count Prefixes of a Given String.

Solution - Class in g2201_2300.s2256_minimum_average_difference

2256 - Minimum Average Difference.

Solution - Class in g2201_2300.s2257_count_unguarded_cells_in_the_grid

2257 - Count Unguarded Cells in the Grid.

Solution - Class in g2201_2300.s2258_escape_the_spreading_fire

2258 - Escape the Spreading Fire.

Solution - Class in g2201_2300.s2259_remove_digit_from_number_to_maximize_result

2259 - Remove Digit From Number to Maximize Result.

Solution - Class in g2201_2300.s2260_minimum_consecutive_cards_to_pick_up

2260 - Minimum Consecutive Cards to Pick Up.

Solution - Class in g2201_2300.s2261_k_divisible_elements_subarrays

2261 - K Divisible Elements Subarrays.

Solution - Class in g2201_2300.s2262_total_appeal_of_a_string

2262 - Total Appeal of A String.

Solution - Class in g2201_2300.s2264_largest_3_same_digit_number_in_string

2264 - Largest 3-Same-Digit Number in String.

Solution - Class in g2201_2300.s2265_count_nodes_equal_to_average_of_subtree

2265 - Count Nodes Equal to Average of Subtree.

Solution - Class in g2201_2300.s2266_count_number_of_texts

2266 - Count Number of Texts.

Solution - Class in g2201_2300.s2267_check_if_there_is_a_valid_parentheses_string_path

2267 - Check if There Is a Valid Parentheses String Path.

Solution - Class in g2201_2300.s2269_find_the_k_beauty_of_a_number

2269 - Find the K-Beauty of a Number.

Solution - Class in g2201_2300.s2270_number_of_ways_to_split_array

2270 - Number of Ways to Split Array.

Solution - Class in g2201_2300.s2271_maximum_white_tiles_covered_by_a_carpet

2271 - Maximum White Tiles Covered by a Carpet.

Solution - Class in g2201_2300.s2272_substring_with_largest_variance

2272 - Substring With Largest Variance.

Solution - Class in g2201_2300.s2273_find_resultant_array_after_removing_anagrams

2273 - Find Resultant Array After Removing Anagrams.

Solution - Class in g2201_2300.s2274_maximum_consecutive_floors_without_special_floors

2274 - Maximum Consecutive Floors Without Special Floors.

Solution - Class in g2201_2300.s2275_largest_combination_with_bitwise_and_greater_than_zero

2275 - Largest Combination With Bitwise AND Greater Than Zero.

Solution - Class in g2201_2300.s2278_percentage_of_letter_in_string

2278 - Percentage of Letter in String.

Solution - Class in g2201_2300.s2279_maximum_bags_with_full_capacity_of_rocks

2279 - Maximum Bags With Full Capacity of Rocks.

Solution - Class in g2201_2300.s2280_minimum_lines_to_represent_a_line_chart

2280 - Minimum Lines to Represent a Line Chart.

Solution - Class in g2201_2300.s2281_sum_of_total_strength_of_wizards

2281 - Sum of Total Strength of Wizards.

Solution - Class in g2201_2300.s2283_check_if_number_has_equal_digit_count_and_digit_value

2283 - Check if Number Has Equal Digit Count and Digit Value.

Solution - Class in g2201_2300.s2284_sender_with_largest_word_count

2284 - Sender With Largest Word Count.

Solution - Class in g2201_2300.s2285_maximum_total_importance_of_roads

2285 - Maximum Total Importance of Roads.

Solution - Class in g2201_2300.s2287_rearrange_characters_to_make_target_string

2287 - Rearrange Characters to Make Target String.

Solution - Class in g2201_2300.s2288_apply_discount_to_prices

2288 - Apply Discount to Prices.

Solution - Class in g2201_2300.s2289_steps_to_make_array_non_decreasing

2289 - Steps to Make Array Non-decreasing.

Solution - Class in g2201_2300.s2290_minimum_obstacle_removal_to_reach_corner

2290 - Minimum Obstacle Removal to Reach Corner.

Solution - Class in g2201_2300.s2293_min_max_game

2293 - Min Max Game.

Solution - Class in g2201_2300.s2294_partition_array_such_that_maximum_difference_is_k

2294 - Partition Array Such That Maximum Difference Is K.

Solution - Class in g2201_2300.s2295_replace_elements_in_an_array

2295 - Replace Elements in an Array.

Solution - Class in g2201_2300.s2299_strong_password_checker_ii

2299 - Strong Password Checker II.

Solution - Class in g2201_2300.s2300_successful_pairs_of_spells_and_potions

2300 - Successful Pairs of Spells and Potions.

Solution - Class in g2301_2400.s2301_match_substring_after_replacement

2301 - Match Substring After Replacement.

Solution - Class in g2301_2400.s2302_count_subarrays_with_score_less_than_k

2302 - Count Subarrays With Score Less Than K.

Solution - Class in g2301_2400.s2303_calculate_amount_paid_in_taxes

2303 - Calculate Amount Paid in Taxes.

Solution - Class in g2301_2400.s2304_minimum_path_cost_in_a_grid

2304 - Minimum Path Cost in a Grid.

Solution - Class in g2301_2400.s2305_fair_distribution_of_cookies

2305 - Fair Distribution of Cookies.

Solution - Class in g2301_2400.s2306_naming_a_company

2306 - Naming a Company.

Solution - Class in g2301_2400.s2309_greatest_english_letter_in_upper_and_lower_case

2309 - Greatest English Letter in Upper and Lower Case.

Solution - Class in g2301_2400.s2310_sum_of_numbers_with_units_digit_k

2310 - Sum of Numbers With Units Digit K.

Solution - Class in g2301_2400.s2311_longest_binary_subsequence_less_than_or_equal_to_k

2311 - Longest Binary Subsequence Less Than or Equal to K.

Solution - Class in g2301_2400.s2312_selling_pieces_of_wood

2312 - Selling Pieces of Wood.

Solution - Class in g2301_2400.s2315_count_asterisks

2315 - Count Asterisks.

Solution - Class in g2301_2400.s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph

2316 - Count Unreachable Pairs of Nodes in an Undirected Graph.

Solution - Class in g2301_2400.s2317_maximum_xor_after_operations

2317 - Maximum XOR After Operations.

Solution - Class in g2301_2400.s2318_number_of_distinct_roll_sequences

2318 - Number of Distinct Roll Sequences.

Solution - Class in g2301_2400.s2319_check_if_matrix_is_x_matrix

2319 - Check if Matrix Is X-Matrix.

Solution - Class in g2301_2400.s2320_count_number_of_ways_to_place_houses

2320 - Count Number of Ways to Place Houses.

Solution - Class in g2301_2400.s2321_maximum_score_of_spliced_array

2321 - Maximum Score Of Spliced Array.

Solution - Class in g2301_2400.s2322_minimum_score_after_removals_on_a_tree

2322 - Minimum Score After Removals on a Tree.

Solution - Class in g2301_2400.s2325_decode_the_message

2325 - Decode the Message.

Solution - Class in g2301_2400.s2326_spiral_matrix_iv

2326 - Spiral Matrix IV.

Solution - Class in g2301_2400.s2327_number_of_people_aware_of_a_secret

2327 - Number of People Aware of a Secret.

Solution - Class in g2301_2400.s2328_number_of_increasing_paths_in_a_grid

2328 - Number of Increasing Paths in a Grid.

Solution - Class in g2301_2400.s2331_evaluate_boolean_binary_tree

2331 - Evaluate Boolean Binary Tree.

Solution - Class in g2301_2400.s2332_the_latest_time_to_catch_a_bus

2332 - The Latest Time to Catch a Bus.

Solution - Class in g2301_2400.s2333_minimum_sum_of_squared_difference

2333 - Minimum Sum of Squared Difference.

Solution - Class in g2301_2400.s2334_subarray_with_elements_greater_than_varying_threshold

2334 - Subarray With Elements Greater Than Varying Threshold.

Solution - Class in g2301_2400.s2335_minimum_amount_of_time_to_fill_cups

2335 - Minimum Amount of Time to Fill Cups.

Solution - Class in g2301_2400.s2337_move_pieces_to_obtain_a_string

2337 - Move Pieces to Obtain a String.

Solution - Class in g2301_2400.s2338_count_the_number_of_ideal_arrays

2338 - Count the Number of Ideal Arrays.

Solution - Class in g2301_2400.s2341_maximum_number_of_pairs_in_array

2341 - Maximum Number of Pairs in Array.

Solution - Class in g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits

2342 - Max Sum of a Pair With Equal Sum of Digits.

Solution - Class in g2301_2400.s2343_query_kth_smallest_trimmed_number

2343 - Query Kth Smallest Trimmed Number.

Solution - Class in g2301_2400.s2344_minimum_deletions_to_make_array_divisible

2344 - Minimum Deletions to Make Array Divisible.

Solution - Class in g2301_2400.s2347_best_poker_hand

2347 - Best Poker Hand.

Solution - Class in g2301_2400.s2348_number_of_zero_filled_subarrays

2348 - Number of Zero-Filled Subarrays.

Solution - Class in g2301_2400.s2350_shortest_impossible_sequence_of_rolls

2350 - Shortest Impossible Sequence of Rolls.

Solution - Class in g2301_2400.s2351_first_letter_to_appear_twice

2351 - First Letter to Appear Twice.

Solution - Class in g2301_2400.s2352_equal_row_and_column_pairs

2352 - Equal Row and Column Pairs.

Solution - Class in g2301_2400.s2354_number_of_excellent_pairs

2354 - Number of Excellent Pairs.

Solution - Class in g2301_2400.s2357_make_array_zero_by_subtracting_equal_amounts

2357 - Make Array Zero by Subtracting Equal Amounts.

Solution - Class in g2301_2400.s2358_maximum_number_of_groups_entering_a_competition

2358 - Maximum Number of Groups Entering a Competition.

Solution - Class in g2301_2400.s2359_find_closest_node_to_given_two_nodes

2359 - Find Closest Node to Given Two Nodes.

Solution - Class in g2301_2400.s2360_longest_cycle_in_a_graph

2360 - Longest Cycle in a Graph.

Solution - Class in g2301_2400.s2363_merge_similar_items

2363 - Merge Similar Items.

Solution - Class in g2301_2400.s2364_count_number_of_bad_pairs

2364 - Count Number of Bad Pairs.

Solution - Class in g2301_2400.s2365_task_scheduler_ii

2365 - Task Scheduler II.

Solution - Class in g2301_2400.s2366_minimum_replacements_to_sort_the_array

2366 - Minimum Replacements to Sort the Array.

Solution - Class in g2301_2400.s2367_number_of_arithmetic_triplets

2367 - Number of Arithmetic Triplets.

Solution - Class in g2301_2400.s2368_reachable_nodes_with_restrictions

2368 - Reachable Nodes With Restrictions.

Solution - Class in g2301_2400.s2369_check_if_there_is_a_valid_partition_for_the_array

2369 - Check if There is a Valid Partition For The Array.

Solution - Class in g2301_2400.s2370_longest_ideal_subsequence

2370 - Longest Ideal Subsequence.

Solution - Class in g2301_2400.s2373_largest_local_values_in_a_matrix

2373 - Largest Local Values in a Matrix.

Solution - Class in g2301_2400.s2374_node_with_highest_edge_score

2374 - Node With Highest Edge Score.

Solution - Class in g2301_2400.s2375_construct_smallest_number_from_di_string

2375 - Construct Smallest Number From DI String.

Solution - Class in g2301_2400.s2376_count_special_integers

2376 - Count Special Integers.

Solution - Class in g2301_2400.s2379_minimum_recolors_to_get_k_consecutive_black_blocks

2379 - Minimum Recolors to Get K Consecutive Black Blocks.

Solution - Class in g2301_2400.s2380_time_needed_to_rearrange_a_binary_string

2380 - Time Needed to Rearrange a Binary String.

Solution - Class in g2301_2400.s2381_shifting_letters_ii

2381 - Shifting Letters II.

Solution - Class in g2301_2400.s2382_maximum_segment_sum_after_removals

2382 - Maximum Segment Sum After Removals.

Solution - Class in g2301_2400.s2383_minimum_hours_of_training_to_win_a_competition

2383 - Minimum Hours of Training to Win a Competition.

Solution - Class in g2301_2400.s2384_largest_palindromic_number

2384 - Largest Palindromic Number.

Solution - Class in g2301_2400.s2385_amount_of_time_for_binary_tree_to_be_infected

2385 - Amount of Time for Binary Tree to Be Infected.

Solution - Class in g2301_2400.s2386_find_the_k_sum_of_an_array

2386 - Find the K-Sum of an Array.

Solution - Class in g2301_2400.s2389_longest_subsequence_with_limited_sum

2389 - Longest Subsequence With Limited Sum.

Solution - Class in g2301_2400.s2390_removing_stars_from_a_string

2390 - Removing Stars From a String.

Solution - Class in g2301_2400.s2391_minimum_amount_of_time_to_collect_garbage

2391 - Minimum Amount of Time to Collect Garbage.

Solution - Class in g2301_2400.s2392_build_a_matrix_with_conditions

2392 - Build a Matrix With Conditions.

Solution - Class in g2301_2400.s2395_find_subarrays_with_equal_sum

2395 - Find Subarrays With Equal Sum.

Solution - Class in g2301_2400.s2396_strictly_palindromic_number

2396 - Strictly Palindromic Number.

Solution - Class in g2301_2400.s2397_maximum_rows_covered_by_columns

2397 - Maximum Rows Covered by Columns.

Solution - Class in g2301_2400.s2398_maximum_number_of_robots_within_budget

2398 - Maximum Number of Robots Within Budget.

Solution - Class in g2301_2400.s2399_check_distances_between_same_letters

2399 - Check Distances Between Same Letters.

Solution - Class in g2301_2400.s2400_number_of_ways_to_reach_a_position_after_exactly_k_steps

2400 - Number of Ways to Reach a Position After Exactly k Steps.

Solution - Class in g2401_2500.s2401_longest_nice_subarray

2401 - Longest Nice Subarray.

Solution - Class in g2401_2500.s2402_meeting_rooms_iii

2402 - Meeting Rooms III.

Solution - Class in g2401_2500.s2404_most_frequent_even_element

2404 - Most Frequent Even Element.

Solution - Class in g2401_2500.s2405_optimal_partition_of_string

2405 - Optimal Partition of String.

Solution - Class in g2401_2500.s2406_divide_intervals_into_minimum_number_of_groups

2406 - Divide Intervals Into Minimum Number of Groups.

Solution - Class in g2401_2500.s2407_longest_increasing_subsequence_ii

2407 - Longest Increasing Subsequence II.

Solution - Class in g2401_2500.s2409_count_days_spent_together

2409 - Count Days Spent Together.

Solution - Class in g2401_2500.s2410_maximum_matching_of_players_with_trainers

2410 - Maximum Matching of Players With Trainers.

Solution - Class in g2401_2500.s2411_smallest_subarrays_with_maximum_bitwise_or

2411 - Smallest Subarrays With Maximum Bitwise OR.

Solution - Class in g2401_2500.s2412_minimum_money_required_before_transactions

2412 - Minimum Money Required Before Transactions.

Solution - Class in g2401_2500.s2413_smallest_even_multiple

2413 - Smallest Even Multiple.

Solution - Class in g2401_2500.s2414_length_of_the_longest_alphabetical_continuous_substring

2414 - Length of the Longest Alphabetical Continuous Substring.

Solution - Class in g2401_2500.s2415_reverse_odd_levels_of_binary_tree

2415 - Reverse Odd Levels of Binary Tree.

Solution - Class in g2401_2500.s2416_sum_of_prefix_scores_of_strings

2416 - Sum of Prefix Scores of Strings.

Solution - Class in g2401_2500.s2418_sort_the_people

2418 - Sort the People.

Solution - Class in g2401_2500.s2419_longest_subarray_with_maximum_bitwise_and

2419 - Longest Subarray With Maximum Bitwise AND.

Solution - Class in g2401_2500.s2420_find_all_good_indices

2420 - Find All Good Indices.

Solution - Class in g2401_2500.s2421_number_of_good_paths

2421 - Number of Good Paths.

Solution - Class in g2401_2500.s2423_remove_letter_to_equalize_frequency

2423 - Remove Letter To Equalize Frequency.

Solution - Class in g2401_2500.s2425_bitwise_xor_of_all_pairings

2425 - Bitwise XOR of All Pairings.

Solution - Class in g2401_2500.s2426_number_of_pairs_satisfying_inequality

2426 - Number of Pairs Satisfying Inequality.

Solution - Class in g2401_2500.s2427_number_of_common_factors

2427 - Number of Common Factors.

Solution - Class in g2401_2500.s2428_maximum_sum_of_an_hourglass

2428 - Maximum Sum of an Hourglass.

Solution - Class in g2401_2500.s2429_minimize_xor

2429 - Minimize XOR.

Solution - Class in g2401_2500.s2430_maximum_deletions_on_a_string

2430 - Maximum Deletions on a String.

Solution - Class in g2401_2500.s2432_the_employee_that_worked_on_the_longest_task

2432 - The Employee That Worked on the Longest Task.

Solution - Class in g2401_2500.s2433_find_the_original_array_of_prefix_xor

2433 - Find The Original Array of Prefix Xor.

Solution - Class in g2401_2500.s2434_using_a_robot_to_print_the_lexicographically_smallest_string

2434 - Using a Robot to Print the Lexicographically Smallest String.

Solution - Class in g2401_2500.s2435_paths_in_matrix_whose_sum_is_divisible_by_k

2435 - Paths in Matrix Whose Sum Is Divisible by K.

Solution - Class in g2401_2500.s2437_number_of_valid_clock_times

2437 - Number of Valid Clock Times.

Solution - Class in g2401_2500.s2438_range_product_queries_of_powers

2438 - Range Product Queries of Powers.

Solution - Class in g2401_2500.s2439_minimize_maximum_of_array

2439 - Minimize Maximum of Array.

Solution - Class in g2401_2500.s2440_create_components_with_same_value

2440 - Create Components With Same Value.

Solution - Class in g2401_2500.s2441_largest_positive_integer_that_exists_with_its_negative

2441 - Largest Positive Integer That Exists With Its Negative.

Solution - Class in g2401_2500.s2442_count_number_of_distinct_integers_after_reverse_operations

2442 - Count Number of Distinct Integers After Reverse Operations.

Solution - Class in g2401_2500.s2443_sum_of_number_and_its_reverse

2443 - Sum of Number and Its Reverse.

Solution - Class in g2401_2500.s2444_count_subarrays_with_fixed_bounds

2444 - Count Subarrays With Fixed Bounds.

Solution - Class in g2401_2500.s2446_determine_if_two_events_have_conflict

2446 - Determine if Two Events Have Conflict.

Solution - Class in g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k

2447 - Number of Subarrays With GCD Equal to K.

Solution - Class in g2401_2500.s2448_minimum_cost_to_make_array_equal

2448 - Minimum Cost to Make Array Equal.

Solution - Class in g2401_2500.s2449_minimum_number_of_operations_to_make_arrays_similar

2449 - Minimum Number of Operations to Make Arrays Similar.

Solution - Class in g2401_2500.s2451_odd_string_difference

2451 - Odd String Difference.

Solution - Class in g2401_2500.s2452_words_within_two_edits_of_dictionary

2452 - Words Within Two Edits of Dictionary.

Solution - Class in g2401_2500.s2453_destroy_sequential_targets

2453 - Destroy Sequential Targets.

Solution - Class in g2401_2500.s2454_next_greater_element_iv

2454 - Next Greater Element IV.

Solution - Class in g2401_2500.s2455_average_value_of_even_numbers_that_are_divisible_by_three

2455 - Average Value of Even Numbers That Are Divisible by Three.

Solution - Class in g2401_2500.s2456_most_popular_video_creator

2456 - Most Popular Video Creator.

Solution - Class in g2401_2500.s2457_minimum_addition_to_make_integer_beautiful

2457 - Minimum Addition to Make Integer Beautiful.

Solution - Class in g2401_2500.s2458_height_of_binary_tree_after_subtree_removal_queries

2458 - Height of Binary Tree After Subtree Removal Queries.

Solution - Class in g2401_2500.s2460_apply_operations_to_an_array

2460 - Apply Operations to an Array.

Solution - Class in g2401_2500.s2461_maximum_sum_of_distinct_subarrays_with_length_k

2461 - Maximum Sum of Distinct Subarrays With Length K.

Solution - Class in g2401_2500.s2462_total_cost_to_hire_k_workers

2462 - Total Cost to Hire K Workers.

Solution - Class in g2401_2500.s2463_minimum_total_distance_traveled

2463 - Minimum Total Distance Traveled.

Solution - Class in g2401_2500.s2465_number_of_distinct_averages

2465 - Number of Distinct Averages.

Solution - Class in g2401_2500.s2466_count_ways_to_build_good_strings

2466 - Count Ways To Build Good Strings.

Solution - Class in g2401_2500.s2467_most_profitable_path_in_a_tree

2467 - Most Profitable Path in a Tree.

Solution - Class in g2401_2500.s2468_split_message_based_on_limit

2468 - Split Message Based on Limit.

Solution - Class in g2401_2500.s2469_convert_the_temperature

2469 - Convert the Temperature.

Solution - Class in g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k

2470 - Number of Subarrays With LCM Equal to K.

Solution - Class in g2401_2500.s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level

2471 - Minimum Number of Operations to Sort a Binary Tree by Level.

Solution - Class in g2401_2500.s2472_maximum_number_of_non_overlapping_palindrome_substrings

2472 - Maximum Number of Non-overlapping Palindrome Substrings.

Solution - Class in g2401_2500.s2475_number_of_unequal_triplets_in_array

2475 - Number of Unequal Triplets in Array.

Solution - Class in g2401_2500.s2476_closest_nodes_queries_in_a_binary_search_tree

2476 - Closest Nodes Queries in a Binary Search Tree.

Solution - Class in g2401_2500.s2477_minimum_fuel_cost_to_report_to_the_capital

2477 - Minimum Fuel Cost to Report to the Capital.

Solution - Class in g2401_2500.s2478_number_of_beautiful_partitions

2478 - Number of Beautiful Partitions.

Solution - Class in g2401_2500.s2481_minimum_cuts_to_divide_a_circle

2481 - Minimum Cuts to Divide a Circle.

Solution - Class in g2401_2500.s2482_difference_between_ones_and_zeros_in_row_and_column

2482 - Difference Between Ones and Zeros in Row and Column.

Solution - Class in g2401_2500.s2483_minimum_penalty_for_a_shop

2483 - Minimum Penalty for a Shop.

Solution - Class in g2401_2500.s2484_count_palindromic_subsequences

2484 - Count Palindromic Subsequences.

Solution - Class in g2401_2500.s2485_find_the_pivot_integer

2485 - Find the Pivot Integer.

Solution - Class in g2401_2500.s2486_append_characters_to_string_to_make_subsequence

2486 - Append Characters to String to Make Subsequence.

Solution - Class in g2401_2500.s2487_remove_nodes_from_linked_list

2487 - Remove Nodes From Linked List.

Solution - Class in g2401_2500.s2488_count_subarrays_with_median_k

2488 - Count Subarrays With Median K.

Solution - Class in g2401_2500.s2490_circular_sentence

2490 - Circular Sentence.

Solution - Class in g2401_2500.s2491_divide_players_into_teams_of_equal_skill

2491 - Divide Players Into Teams of Equal Skill.

Solution - Class in g2401_2500.s2492_minimum_score_of_a_path_between_two_cities

2492 - Minimum Score of a Path Between Two Cities.

Solution - Class in g2401_2500.s2493_divide_nodes_into_the_maximum_number_of_groups

2493 - Divide Nodes Into the Maximum Number of Groups.

Solution - Class in g2401_2500.s2496_maximum_value_of_a_string_in_an_array

2496 - Maximum Value of a String in an Array.

Solution - Class in g2401_2500.s2497_maximum_star_sum_of_a_graph

2497 - Maximum Star Sum of a Graph.

Solution - Class in g2401_2500.s2498_frog_jump_ii

2498 - Frog Jump II.

Solution - Class in g2401_2500.s2499_minimum_total_cost_to_make_arrays_unequal

2499 - Minimum Total Cost to Make Arrays Unequal.

Solution - Class in g2401_2500.s2500_delete_greatest_value_in_each_row

2500 - Delete Greatest Value in Each Row.

Solution - Class in g2501_2600.s2501_longest_square_streak_in_an_array

2501 - Longest Square Streak in an Array.

Solution - Class in g2501_2600.s2503_maximum_number_of_points_from_grid_queries

2503 - Maximum Number of Points From Grid Queries.

Solution - Class in g2501_2600.s2506_count_pairs_of_similar_strings

2506 - Count Pairs Of Similar Strings.

Solution - Class in g2501_2600.s2507_smallest_value_after_replacing_with_sum_of_prime_factors

2507 - Smallest Value After Replacing With Sum of Prime Factors.

Solution - Class in g2501_2600.s2508_add_edges_to_make_degrees_of_all_nodes_even

2508 - Add Edges to Make Degrees of All Nodes Even.

Solution - Class in g2501_2600.s2509_cycle_length_queries_in_a_tree

2509 - Cycle Length Queries in a Tree.

Solution - Class in g2501_2600.s2511_maximum_enemy_forts_that_can_be_captured

2511 - Maximum Enemy Forts That Can Be Captured.

Solution - Class in g2501_2600.s2512_reward_top_k_students

2512 - Reward Top K Students.

Solution - Class in g2501_2600.s2513_minimize_the_maximum_of_two_arrays

2513 - Minimize the Maximum of Two Arrays.

Solution - Class in g2501_2600.s2514_count_anagrams

2514 - Count Anagrams.

Solution - Class in g2501_2600.s2515_shortest_distance_to_target_string_in_a_circular_array

2515 - Shortest Distance to Target String in a Circular Array.

Solution - Class in g2501_2600.s2516_take_k_of_each_character_from_left_and_right

2516 - Take K of Each Character From Left and Right.

Solution - Class in g2501_2600.s2517_maximum_tastiness_of_candy_basket

2517 - Maximum Tastiness of Candy Basket.

Solution - Class in g2501_2600.s2518_number_of_great_partitions

2518 - Number of Great Partitions.

Solution - Class in g2501_2600.s2520_count_the_digits_that_divide_a_number

2520 - Count the Digits That Divide a Number.

Solution - Class in g2501_2600.s2521_distinct_prime_factors_of_product_of_array

2521 - Distinct Prime Factors of Product of Array.

Solution - Class in g2501_2600.s2522_partition_string_into_substrings_with_values_at_most_k

2522 - Partition String Into Substrings With Values at Most K.

Solution - Class in g2501_2600.s2523_closest_prime_numbers_in_range

2523 - Closest Prime Numbers in Range.

Solution - Class in g2501_2600.s2525_categorize_box_according_to_criteria

2525 - Categorize Box According to Criteria.

Solution - Class in g2501_2600.s2527_find_xor_beauty_of_array

2527 - Find Xor-Beauty of Array.

Solution - Class in g2501_2600.s2528_maximize_the_minimum_powered_city

2528 - Maximize the Minimum Powered City.

Solution - Class in g2501_2600.s2529_maximum_count_of_positive_integer_and_negative_integer

2529 - Maximum Count of Positive Integer and Negative Integer.

Solution - Class in g2501_2600.s2530_maximal_score_after_applying_k_operations

2530 - Maximal Score After Applying K Operations.

Solution - Class in g2501_2600.s2531_make_number_of_distinct_characters_equal

2531 - Make Number of Distinct Characters Equal.

Solution - Class in g2501_2600.s2532_time_to_cross_a_bridge

2532 - Time to Cross a Bridge.

Solution - Class in g2501_2600.s2535_difference_between_element_sum_and_digit_sum_of_an_array

2535 - Difference Between Element Sum and Digit Sum of an Array.

Solution - Class in g2501_2600.s2536_increment_submatrices_by_one

2536 - Increment Submatrices by One.

Solution - Class in g2501_2600.s2537_count_the_number_of_good_subarrays

2537 - Count the Number of Good Subarrays.

Solution - Class in g2501_2600.s2538_difference_between_maximum_and_minimum_price_sum

2538 - Difference Between Maximum and Minimum Price Sum.

Solution - Class in g2501_2600.s2540_minimum_common_value

2540 - Minimum Common Value.

Solution - Class in g2501_2600.s2541_minimum_operations_to_make_array_equal_ii

2541 - Minimum Operations to Make Array Equal II.

Solution - Class in g2501_2600.s2542_maximum_subsequence_score

2542 - Maximum Subsequence Score.

Solution - Class in g2501_2600.s2543_check_if_point_is_reachable

2543 - Check if Point Is Reachable.

Solution - Class in g2501_2600.s2544_alternating_digit_sum

2544 - Alternating Digit Sum.

Solution - Class in g2501_2600.s2545_sort_the_students_by_their_kth_score

2545 - Sort the Students by Their Kth Score.

Solution - Class in g2501_2600.s2546_apply_bitwise_operations_to_make_strings_equal

2546 - Apply Bitwise Operations to Make Strings Equal.

Solution - Class in g2501_2600.s2547_minimum_cost_to_split_an_array

2547 - Minimum Cost to Split an Array.

Solution - Class in g2501_2600.s2549_count_distinct_numbers_on_board

2549 - Count Distinct Numbers on Board.

Solution - Class in g2501_2600.s2550_count_collisions_of_monkeys_on_a_polygon

2550 - Count Collisions of Monkeys on a Polygon.

Solution - Class in g2501_2600.s2551_put_marbles_in_bags

2551 - Put Marbles in Bags.

Solution - Class in g2501_2600.s2552_count_increasing_quadruplets

2552 - Count Increasing Quadruplets.

Solution - Class in g2501_2600.s2553_separate_the_digits_in_an_array

2553 - Separate the Digits in an Array.

Solution - Class in g2501_2600.s2554_maximum_number_of_integers_to_choose_from_a_range_i

2554 - Maximum Number of Integers to Choose From a Range I.

Solution - Class in g2501_2600.s2555_maximize_win_from_two_segments

2555 - Maximize Win From Two Segments.

Solution - Class in g2501_2600.s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip

2556 - Disconnect Path in a Binary Matrix by at Most One Flip.

Solution - Class in g2501_2600.s2558_take_gifts_from_the_richest_pile

2558 - Take Gifts From the Richest Pile.

Solution - Class in g2501_2600.s2559_count_vowel_strings_in_ranges

2559 - Count Vowel Strings in Ranges.

Solution - Class in g2501_2600.s2560_house_robber_iv

2560 - House Robber IV.

Solution - Class in g2501_2600.s2561_rearranging_fruits

2561 - Rearranging Fruits.

Solution - Class in g2501_2600.s2562_find_the_array_concatenation_value

2562 - Find the Array Concatenation Value.

Solution - Class in g2501_2600.s2563_count_the_number_of_fair_pairs

2563 - Count the Number of Fair Pairs.

Solution - Class in g2501_2600.s2564_substring_xor_queries

2564 - Substring XOR Queries.

Solution - Class in g2501_2600.s2565_subsequence_with_the_minimum_score

2565 - Subsequence With the Minimum Score.

Solution - Class in g2501_2600.s2566_maximum_difference_by_remapping_a_digit

2566 - Maximum Difference by Remapping a Digit.

Solution - Class in g2501_2600.s2567_minimum_score_by_changing_two_elements

2567 - Minimum Score by Changing Two Elements.

Solution - Class in g2501_2600.s2568_minimum_impossible_or

2568 - Minimum Impossible OR.

Solution - Class in g2501_2600.s2569_handling_sum_queries_after_update

2569 - Handling Sum Queries After Update.

Solution - Class in g2501_2600.s2570_merge_two_2d_arrays_by_summing_values

2570 - Merge Two 2D Arrays by Summing Values.

Solution - Class in g2501_2600.s2571_minimum_operations_to_reduce_an_integer_to_0

2571 - Minimum Operations to Reduce an Integer to 0.

Solution - Class in g2501_2600.s2572_count_the_number_of_square_free_subsets

2572 - Count the Number of Square-Free Subsets.

Solution - Class in g2501_2600.s2573_find_the_string_with_lcp

2573 - Find the String with LCP.

Solution - Class in g2501_2600.s2574_left_and_right_sum_differences

2574 - Left and Right Sum Differences.

Solution - Class in g2501_2600.s2575_find_the_divisibility_array_of_a_string

2575 - Find the Divisibility Array of a String.

Solution - Class in g2501_2600.s2576_find_the_maximum_number_of_marked_indices

2576 - Find the Maximum Number of Marked Indices.

Solution - Class in g2501_2600.s2577_minimum_time_to_visit_a_cell_in_a_grid

2577 - Minimum Time to Visit a Cell In a Grid.

Solution - Class in g2501_2600.s2578_split_with_minimum_sum

2578 - Split With Minimum Sum.

Solution - Class in g2501_2600.s2579_count_total_number_of_colored_cells

2579 - Count Total Number of Colored Cells.

Solution - Class in g2501_2600.s2580_count_ways_to_group_overlapping_ranges

2580 - Count Ways to Group Overlapping Ranges.

Solution - Class in g2501_2600.s2581_count_number_of_possible_root_nodes

2581 - Count Number of Possible Root Nodes.

Solution - Class in g2501_2600.s2582_pass_the_pillow

2582 - Pass the Pillow.

Solution - Class in g2501_2600.s2583_kth_largest_sum_in_a_binary_tree

2583 - Kth Largest Sum in a Binary Tree.

Solution - Class in g2501_2600.s2584_split_the_array_to_make_coprime_products

2584 - Split the Array to Make Coprime Products.

Solution - Class in g2501_2600.s2585_number_of_ways_to_earn_points

2585 - Number of Ways to Earn Points.

Solution - Class in g2501_2600.s2586_count_the_number_of_vowel_strings_in_range

2586 - Count the Number of Vowel Strings in Range.

Solution - Class in g2501_2600.s2587_rearrange_array_to_maximize_prefix_score

2587 - Rearrange Array to Maximize Prefix Score.

Solution - Class in g2501_2600.s2588_count_the_number_of_beautiful_subarrays

2588 - Count the Number of Beautiful Subarrays.

Solution - Class in g2501_2600.s2589_minimum_time_to_complete_all_tasks

2589 - Minimum Time to Complete All Tasks.

Solution - Class in g2501_2600.s2591_distribute_money_to_maximum_children

2591 - Distribute Money to Maximum Children.

Solution - Class in g2501_2600.s2592_maximize_greatness_of_an_array

2592 - Maximize Greatness of an Array.

Solution - Class in g2501_2600.s2593_find_score_of_an_array_after_marking_all_elements

2593 - Find Score of an Array After Marking All Elements.

Solution - Class in g2501_2600.s2594_minimum_time_to_repair_cars

2594 - Minimum Time to Repair Cars.

Solution - Class in g2501_2600.s2595_number_of_even_and_odd_bits

2595 - Number of Even and Odd Bits.

Solution - Class in g2501_2600.s2596_check_knight_tour_configuration

2596 - Check Knight Tour Configuration.

Solution - Class in g2501_2600.s2597_the_number_of_beautiful_subsets

2597 - The Number of Beautiful Subsets.

Solution - Class in g2501_2600.s2598_smallest_missing_non_negative_integer_after_operations

2598 - Smallest Missing Non-negative Integer After Operations.

Solution - Class in g2501_2600.s2600_k_items_with_the_maximum_sum

2600 - K Items With the Maximum Sum.

Solution - Class in g2601_2700.s2601_prime_subtraction_operation

2601 - Prime Subtraction Operation.

Solution - Class in g2601_2700.s2602_minimum_operations_to_make_all_array_elements_equal

2602 - Minimum Operations to Make All Array Elements Equal.

Solution - Class in g2601_2700.s2603_collect_coins_in_a_tree

2603 - Collect Coins in a Tree.

Solution - Class in g2601_2700.s2605_form_smallest_number_from_two_digit_arrays

2605 - Form Smallest Number From Two Digit Arrays.

Solution - Class in g2601_2700.s2606_find_the_substring_with_maximum_cost

2606 - Find the Substring With Maximum Cost.

Solution - Class in g2601_2700.s2607_make_k_subarray_sums_equal

2607 - Make K-Subarray Sums Equal.

Solution - Class in g2601_2700.s2608_shortest_cycle_in_a_graph

2608 - Shortest Cycle in a Graph.

Solution - Class in g2601_2700.s2609_find_the_longest_balanced_substring_of_a_binary_string

2609 - Find the Longest Balanced Substring of a Binary String.

Solution - Class in g2601_2700.s2610_convert_an_array_into_a_2d_array_with_conditions

2610 - Convert an Array Into a 2D Array With Conditions.

Solution - Class in g2601_2700.s2611_mice_and_cheese

2611 - Mice and Cheese.

Solution - Class in g2601_2700.s2612_minimum_reverse_operations

2612 - Minimum Reverse Operations.

Solution - Class in g2601_2700.s2614_prime_in_diagonal

2614 - Prime In Diagonal.

Solution - Class in g2601_2700.s2615_sum_of_distances

2615 - Sum of Distances.

Solution - Class in g2601_2700.s2616_minimize_the_maximum_difference_of_pairs

2616 - Minimize the Maximum Difference of Pairs.

Solution - Class in g2601_2700.s2617_minimum_number_of_visited_cells_in_a_grid

2617 - Minimum Number of Visited Cells in a Grid.

Solution - Class in g2601_2700.s2639_find_the_width_of_columns_of_a_grid

2639 - Find the Width of Columns of a Grid.

Solution - Class in g2601_2700.s2640_find_the_score_of_all_prefixes_of_an_array

2640 - Find the Score of All Prefixes of an Array.

Solution - Class in g2601_2700.s2641_cousins_in_binary_tree_ii

2641 - Cousins in Binary Tree II.

Solution - Class in g2601_2700.s2643_row_with_maximum_ones

2643 - Row With Maximum Ones.

Solution - Class in g2601_2700.s2644_find_the_maximum_divisibility_score

2644 - Find the Maximum Divisibility Score.

Solution - Class in g2601_2700.s2645_minimum_additions_to_make_valid_string

2645 - Minimum Additions to Make Valid String.

Solution - Class in g2601_2700.s2646_minimize_the_total_price_of_the_trips

2646 - Minimize the Total Price of the Trips.

Solution - Class in g2601_2700.s2651_calculate_delayed_arrival_time

2651 - Calculate Delayed Arrival Time.

Solution - Class in g2601_2700.s2652_sum_multiples

2652 - Sum Multiples.

Solution - Class in g2601_2700.s2653_sliding_subarray_beauty

2653 - Sliding Subarray Beauty.

Solution - Class in g2601_2700.s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1

2654 - Minimum Number of Operations to Make All Array Elements Equal to 1.

Solution - Class in g2601_2700.s2656_maximum_sum_with_exactly_k_elements

2656 - Maximum Sum With Exactly K Elements.

Solution - Class in g2601_2700.s2657_find_the_prefix_common_array_of_two_arrays

2657 - Find the Prefix Common Array of Two Arrays.

Solution - Class in g2601_2700.s2658_maximum_number_of_fish_in_a_grid

2658 - Maximum Number of Fish in a Grid.

Solution - Class in g2601_2700.s2659_make_array_empty

2659 - Make Array Empty.

Solution - Class in g2601_2700.s2660_determine_the_winner_of_a_bowling_game

2660 - Determine the Winner of a Bowling Game.

Solution - Class in g2601_2700.s2661_first_completely_painted_row_or_column

2661 - First Completely Painted Row or Column.

Solution - Class in g2601_2700.s2662_minimum_cost_of_a_path_with_special_roads

2662 - Minimum Cost of a Path With Special Roads.

Solution - Class in g2601_2700.s2663_lexicographically_smallest_beautiful_string

2663 - Lexicographically Smallest Beautiful String.

Solution - Class in g2601_2700.s2670_find_the_distinct_difference_array

2670 - Find the Distinct Difference Array.

Solution - Class in g2601_2700.s2672_number_of_adjacent_elements_with_the_same_color

2672 - Number of Adjacent Elements With the Same Color.

Solution - Class in g2601_2700.s2673_make_costs_of_paths_equal_in_a_binary_tree

2673 - Make Costs of Paths Equal in a Binary Tree.

Solution - Class in g2601_2700.s2678_number_of_senior_citizens

2678 - Number of Senior Citizens.

Solution - Class in g2601_2700.s2679_sum_in_a_matrix

2679 - Sum in a Matrix.

Solution - Class in g2601_2700.s2680_maximum_or

2680 - Maximum OR.

Solution - Class in g2601_2700.s2681_power_of_heroes

2681 - Power of Heroes.

Solution - Class in g2601_2700.s2682_find_the_losers_of_the_circular_game

2682 - Find the Losers of the Circular Game.

Solution - Class in g2601_2700.s2683_neighboring_bitwise_xor

2683 - Neighboring Bitwise XOR.

Solution - Class in g2601_2700.s2684_maximum_number_of_moves_in_a_grid

2684 - Maximum Number of Moves in a Grid.

Solution - Class in g2601_2700.s2685_count_the_number_of_complete_components

2685 - Count the Number of Complete Components.

Solution - Class in g2601_2700.s2696_minimum_string_length_after_removing_substrings

2696 - Minimum String Length After Removing Substrings.

Solution - Class in g2601_2700.s2697_lexicographically_smallest_palindrome

2697 - Lexicographically Smallest Palindrome.

Solution - Class in g2601_2700.s2698_find_the_punishment_number_of_an_integer

2698 - Find the Punishment Number of an Integer.

Solution - Class in g2601_2700.s2699_modify_graph_edge_weights

2699 - Modify Graph Edge Weights.

Solution - Class in g2701_2800.s2706_buy_two_chocolates

2706 - Buy Two Chocolates.

Solution - Class in g2701_2800.s2707_extra_characters_in_a_string

2707 - Extra Characters in a String.

Solution - Class in g2701_2800.s2708_maximum_strength_of_a_group

2708 - Maximum Strength of a Group.

Solution - Class in g2701_2800.s2709_greatest_common_divisor_traversal

2709 - Greatest Common Divisor Traversal.

Solution - Class in g2701_2800.s2710_remove_trailing_zeros_from_a_string

2710 - Remove Trailing Zeros From a String.

Solution - Class in g2701_2800.s2711_difference_of_number_of_distinct_values_on_diagonals

2711 - Difference of Number of Distinct Values on Diagonals.

Solution - Class in g2701_2800.s2712_minimum_cost_to_make_all_characters_equal

2712 - Minimum Cost to Make All Characters Equal.

Solution - Class in g2701_2800.s2713_maximum_strictly_increasing_cells_in_a_matrix

2713 - Maximum Strictly Increasing Cells in a Matrix.

Solution - Class in g2701_2800.s2716_minimize_string_length

2716 - Minimize String Length.

Solution - Class in g2701_2800.s2717_semi_ordered_permutation

2717 - Semi-Ordered Permutation.

Solution - Class in g2701_2800.s2718_sum_of_matrix_after_queries

2718 - Sum of Matrix After Queries.

Solution - Class in g2701_2800.s2719_count_of_integers

2719 - Count of Integers.

Solution - Class in g2701_2800.s2729_check_if_the_number_is_fascinating

2729 - Check if The Number is Fascinating.

Solution - Class in g2701_2800.s2730_find_the_longest_semi_repetitive_substring

2730 - Find the Longest Semi-Repetitive Substring.

Solution - Class in g2701_2800.s2731_movement_of_robots

2731 - Movement of Robots.

Solution - Class in g2701_2800.s2732_find_a_good_subset_of_the_matrix

2732 - Find a Good Subset of the Matrix.

Solution - Class in g2701_2800.s2733_neither_minimum_nor_maximum

2733 - Neither Minimum nor Maximum.

Solution - Class in g2701_2800.s2734_lexicographically_smallest_string_after_substring_operation

2734 - Lexicographically Smallest String After Substring Operation.

Solution - Class in g2701_2800.s2735_collecting_chocolates

2735 - Collecting Chocolates.

Solution - Class in g2701_2800.s2736_maximum_sum_queries

2736 - Maximum Sum Queries.

Solution - Class in g2701_2800.s2739_total_distance_traveled

2739 - Total Distance Traveled.

Solution - Class in g2701_2800.s2740_find_the_value_of_the_partition

2740 - Find the Value of the Partition.

Solution - Class in g2701_2800.s2741_special_permutations

2741 - Special Permutations.

Solution - Class in g2701_2800.s2742_painting_the_walls

2742 - Painting the Walls.

Solution - Class in g2701_2800.s2744_find_maximum_number_of_string_pairs

2744 - Find Maximum Number of String Pairs.

Solution - Class in g2701_2800.s2745_construct_the_longest_new_string

2745 - Construct the Longest New String.

Solution - Class in g2701_2800.s2746_decremental_string_concatenation

2746 - Decremental String Concatenation.

Solution - Class in g2701_2800.s2747_count_zero_request_servers

2747 - Count Zero Request Servers.

Solution - Class in g2701_2800.s2748_number_of_beautiful_pairs

2748 - Number of Beautiful Pairs.

Solution - Class in g2701_2800.s2749_minimum_operations_to_make_the_integer_zero

2749 - Minimum Operations to Make the Integer Zero.

Solution - Class in g2701_2800.s2750_ways_to_split_array_into_good_subarrays

2750 - Ways to Split Array Into Good Subarrays.

Solution - Class in g2701_2800.s2751_robot_collisions

2751 - Robot Collisions.

Solution - Class in g2701_2800.s2760_longest_even_odd_subarray_with_threshold

2760 - Longest Even Odd Subarray With Threshold.

Solution - Class in g2701_2800.s2761_prime_pairs_with_target_sum

2761 - Prime Pairs With Target Sum.

Solution - Class in g2701_2800.s2762_continuous_subarrays

2762 - Continuous Subarrays.

Solution - Class in g2701_2800.s2763_sum_of_imbalance_numbers_of_all_subarrays

2763 - Sum of Imbalance Numbers of All Subarrays.

Solution - Class in g2701_2800.s2765_longest_alternating_subarray

2765 - Longest Alternating Subarray.

Solution - Class in g2701_2800.s2766_relocate_marbles

2766 - Relocate Marbles.

Solution - Class in g2701_2800.s2767_partition_string_into_minimum_beautiful_substrings

2767 - Partition String Into Minimum Beautiful Substrings.

Solution - Class in g2701_2800.s2768_number_of_black_blocks

2768 - Number of Black Blocks.

Solution - Class in g2701_2800.s2769_find_the_maximum_achievable_number

2769 - Find the Maximum Achievable Number.

Solution - Class in g2701_2800.s2770_maximum_number_of_jumps_to_reach_the_last_index

2770 - Maximum Number of Jumps to Reach the Last Index.

Solution - Class in g2701_2800.s2771_longest_non_decreasing_subarray_from_two_arrays

2771 - Longest Non-decreasing Subarray From Two Arrays.

Solution - Class in g2701_2800.s2772_apply_operations_to_make_all_array_elements_equal_to_zero

2772 - Apply Operations to Make All Array Elements Equal to Zero.

Solution - Class in g2701_2800.s2778_sum_of_squares_of_special_elements

2778 - Sum of Squares of Special Elements.

Solution - Class in g2701_2800.s2779_maximum_beauty_of_an_array_after_applying_operation

2779 - Maximum Beauty of an Array After Applying Operation.

Solution - Class in g2701_2800.s2780_minimum_index_of_a_valid_split

2780 - Minimum Index of a Valid Split.

Solution - Class in g2701_2800.s2781_length_of_the_longest_valid_substring

2781 - Length of the Longest Valid Substring.

Solution - Class in g2701_2800.s2784_check_if_array_is_good

2784 - Check if Array is Good.

Solution - Class in g2701_2800.s2785_sort_vowels_in_a_string

2785 - Sort Vowels in a String.

Solution - Class in g2701_2800.s2786_visit_array_positions_to_maximize_score

2786 - Visit Array Positions to Maximize Score.

Solution - Class in g2701_2800.s2787_ways_to_express_an_integer_as_sum_of_powers

2787 - Ways to Express an Integer as Sum of Powers.

Solution - Class in g2701_2800.s2788_split_strings_by_separator

2788 - Split Strings by Separator.

Solution - Class in g2701_2800.s2789_largest_element_in_an_array_after_merge_operations

2789 - Largest Element in an Array after Merge Operations.

Solution - Class in g2701_2800.s2790_maximum_number_of_groups_with_increasing_length

2790 - Maximum Number of Groups With Increasing Length.

Solution - Class in g2701_2800.s2791_count_paths_that_can_form_a_palindrome_in_a_tree

2791 - Count Paths That Can Form a Palindrome in a Tree.

Solution - Class in g2701_2800.s2798_number_of_employees_who_met_the_target

2798 - Number of Employees Who Met the Target.

Solution - Class in g2701_2800.s2799_count_complete_subarrays_in_an_array

2799 - Count Complete Subarrays in an Array.

Solution - Class in g2701_2800.s2800_shortest_string_that_contains_three_strings

2800 - Shortest String That Contains Three Strings.

Solution - Class in g2801_2900.s2801_count_stepping_numbers_in_range

2801 - Count Stepping Numbers in Range.

Solution - Class in g2801_2900.s2806_account_balance_after_rounded_purchase

2806 - Account Balance After Rounded Purchase.

Solution - Class in g2801_2900.s2807_insert_greatest_common_divisors_in_linked_list

2807 - Insert Greatest Common Divisors in Linked List.

Solution - Class in g2801_2900.s2808_minimum_seconds_to_equalize_a_circular_array

2808 - Minimum Seconds to Equalize a Circular Array.

Solution - Class in g2801_2900.s2809_minimum_time_to_make_array_sum_at_most_x

2809 - Minimum Time to Make Array Sum At Most x.

Solution - Class in g2801_2900.s2810_faulty_keyboard

2810 - Faulty Keyboard.

Solution - Class in g2801_2900.s2811_check_if_it_is_possible_to_split_array

2811 - Check if it is Possible to Split Array.

Solution - Class in g2801_2900.s2812_find_the_safest_path_in_a_grid

2812 - Find the Safest Path in a Grid.

Solution - Class in g2801_2900.s2813_maximum_elegance_of_a_k_length_subsequence

2813 - Maximum Elegance of a K-Length Subsequence.

Solution - Class in g2801_2900.s2815_max_pair_sum_in_an_array

2815 - Max Pair Sum in an Array.

Solution - Class in g2801_2900.s2816_double_a_number_represented_as_a_linked_list

2816 - Double a Number Represented as a Linked List.

Solution - Class in g2801_2900.s2817_minimum_absolute_difference_between_elements_with_constraint

2817 - Minimum Absolute Difference Between Elements With Constraint.

Solution - Class in g2801_2900.s2818_apply_operations_to_maximize_score

2818 - Apply Operations to Maximize Score.

Solution - Class in g2801_2900.s2824_count_pairs_whose_sum_is_less_than_target

2824 - Count Pairs Whose Sum is Less than Target.

Solution - Class in g2801_2900.s2825_make_string_a_subsequence_using_cyclic_increments

2825 - Make String a Subsequence Using Cyclic Increments.

Solution - Class in g2801_2900.s2826_sorting_three_groups

2826 - Sorting Three Groups.

Solution - Class in g2801_2900.s2827_number_of_beautiful_integers_in_the_range

2827 - Number of Beautiful Integers in the Range.

Solution - Class in g2801_2900.s2828_check_if_a_string_is_an_acronym_of_words

2828 - Check if a String Is an Acronym of Words.

Solution - Class in g2801_2900.s2829_determine_the_minimum_sum_of_a_k_avoiding_array

2829 - Determine the Minimum Sum of a k-avoiding Array.

Solution - Class in g2801_2900.s2830_maximize_the_profit_as_the_salesman

2830 - Maximize the Profit as the Salesman.

Solution - Class in g2801_2900.s2831_find_the_longest_equal_subarray

2831 - Find the Longest Equal Subarray.

Solution - Class in g2801_2900.s2833_furthest_point_from_origin

2833 - Furthest Point From Origin.

Solution - Class in g2801_2900.s2834_find_the_minimum_possible_sum_of_a_beautiful_array

2834 - Find the Minimum Possible Sum of a Beautiful Array.

Solution - Class in g2801_2900.s2835_minimum_operations_to_form_subsequence_with_target_sum

2835 - Minimum Operations to Form Subsequence With Target Sum.

Solution - Class in g2801_2900.s2836_maximize_value_of_function_in_a_ball_passing_game

2836 - Maximize Value of Function in a Ball Passing Game.

Solution - Class in g2801_2900.s2839_check_if_strings_can_be_made_equal_with_operations_i

2839 - Check if Strings Can be Made Equal With Operations I.

Solution - Class in g2801_2900.s2840_check_if_strings_can_be_made_equal_with_operations_ii

2840 - Check if Strings Can be Made Equal With Operations II.

Solution - Class in g2801_2900.s2841_maximum_sum_of_almost_unique_subarray

2841 - Maximum Sum of Almost Unique Subarray.

Solution - Class in g2801_2900.s2842_count_k_subsequences_of_a_string_with_maximum_beauty

2842 - Count K-Subsequences of a String With Maximum Beauty.

Solution - Class in g2801_2900.s2843_count_symmetric_integers

2843 - Count Symmetric Integers.

Solution - Class in g2801_2900.s2844_minimum_operations_to_make_a_special_number

2844 - Minimum Operations to Make a Special Number.

Solution - Class in g2801_2900.s2845_count_of_interesting_subarrays

2845 - Count of Interesting Subarrays.

Solution - Class in g2801_2900.s2846_minimum_edge_weight_equilibrium_queries_in_a_tree

2846 - Minimum Edge Weight Equilibrium Queries in a Tree.

Solution - Class in g2801_2900.s2848_points_that_intersect_with_cars

2848 - Points That Intersect With Cars.

Solution - Class in g2801_2900.s2849_determine_if_a_cell_is_reachable_at_a_given_time

2849 - Determine if a Cell Is Reachable at a Given Time.

Solution - Class in g2801_2900.s2850_minimum_moves_to_spread_stones_over_grid

2850 - Minimum Moves to Spread Stones Over Grid.

Solution - Class in g2801_2900.s2851_string_transformation

2851 - String Transformation.

Solution - Class in g2801_2900.s2855_minimum_right_shifts_to_sort_the_array

2855 - Minimum Right Shifts to Sort the Array.

Solution - Class in g2801_2900.s2856_minimum_array_length_after_pair_removals

2856 - Minimum Array Length After Pair Removals.

Solution - Class in g2801_2900.s2857_count_pairs_of_points_with_distance_k

2857 - Count Pairs of Points With Distance k.

Solution - Class in g2801_2900.s2858_minimum_edge_reversals_so_every_node_is_reachable

2858 - Minimum Edge Reversals So Every Node Is Reachable.

Solution - Class in g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits

2859 - Sum of Values at Indices With K Set Bits.

Solution - Class in g2801_2900.s2860_happy_students

2860 - Happy Students.

Solution - Class in g2801_2900.s2861_maximum_number_of_alloys

2861 - Maximum Number of Alloys.

Solution - Class in g2801_2900.s2862_maximum_element_sum_of_a_complete_subset_of_indices

2862 - Maximum Element-Sum of a Complete Subset of Indices.

Solution - Class in g2801_2900.s2864_maximum_odd_binary_number

2864 - Maximum Odd Binary Number.

Solution - Class in g2801_2900.s2865_beautiful_towers_i

2865 - Beautiful Towers I.

Solution - Class in g2801_2900.s2866_beautiful_towers_ii

2866 - Beautiful Towers II.

Solution - Class in g2801_2900.s2867_count_valid_paths_in_a_tree

2867 - Count Valid Paths in a Tree.

Solution - Class in g2801_2900.s2869_minimum_operations_to_collect_elements

2869 - Minimum Operations to Collect Elements.

Solution - Class in g2801_2900.s2870_minimum_number_of_operations_to_make_array_empty

2870 - Minimum Number of Operations to Make Array Empty.

Solution - Class in g2801_2900.s2871_split_array_into_maximum_number_of_subarrays

2871 - Split Array Into Maximum Number of Subarrays.

Solution - Class in g2801_2900.s2872_maximum_number_of_k_divisible_components

2872 - Maximum Number of K-Divisible Components.

Solution - Class in g2801_2900.s2873_maximum_value_of_an_ordered_triplet_i

2873 - Maximum Value of an Ordered Triplet I.

Solution - Class in g2801_2900.s2874_maximum_value_of_an_ordered_triplet_ii

2874 - Maximum Value of an Ordered Triplet II.

Solution - Class in g2801_2900.s2875_minimum_size_subarray_in_infinite_array

2875 - Minimum Size Subarray in Infinite Array.

Solution - Class in g2801_2900.s2876_count_visited_nodes_in_a_directed_graph

2876 - Count Visited Nodes in a Directed Graph.

Solution - Class in g2801_2900.s2894_divisible_and_non_divisible_sums_difference

2894 - Divisible and Non-divisible Sums Difference.

Solution - Class in g2801_2900.s2895_minimum_processing_time

2895 - Minimum Processing Time.

Solution - Class in g2801_2900.s2896_apply_operations_to_make_two_strings_equal

2896 - Apply Operations to Make Two Strings Equal.

Solution - Class in g2801_2900.s2897_apply_operations_on_array_to_maximize_sum_of_squares

2897 - Apply Operations on Array to Maximize Sum of Squares.

Solution - Class in g2801_2900.s2899_last_visited_integers

2899 - Last Visited Integers.

Solution - Class in g2801_2900.s2900_longest_unequal_adjacent_groups_subsequence_i

2900 - Longest Unequal Adjacent Groups Subsequence I.

Solution - Class in g2901_3000.s2901_longest_unequal_adjacent_groups_subsequence_ii

2901 - Longest Unequal Adjacent Groups Subsequence II.

Solution - Class in g2901_3000.s2902_count_of_sub_multisets_with_bounded_sum

2902 - Count of Sub-Multisets With Bounded Sum.

Solution - Class in g2901_3000.s2903_find_indices_with_index_and_value_difference_i

2903 - Find Indices With Index and Value Difference I.

Solution - Class in g2901_3000.s2904_shortest_and_lexicographically_smallest_beautiful_string

2904 - Shortest and Lexicographically Smallest Beautiful String.

Solution - Class in g2901_3000.s2905_find_indices_with_index_and_value_difference_ii

2905 - Find Indices With Index and Value Difference II.

Solution - Class in g2901_3000.s2906_construct_product_matrix

2906 - Construct Product Matrix.

Solution - Class in g2901_3000.s2908_minimum_sum_of_mountain_triplets_i

2908 - Minimum Sum of Mountain Triplets I.

Solution - Class in g2901_3000.s2909_minimum_sum_of_mountain_triplets_ii

2909 - Minimum Sum of Mountain Triplets II.

Solution - Class in g2901_3000.s2910_minimum_number_of_groups_to_create_a_valid_assignment

2910 - Minimum Number of Groups to Create a Valid Assignment.

Solution - Class in g2901_3000.s2911_minimum_changes_to_make_k_semi_palindromes

2911 - Minimum Changes to Make K Semi-palindromes.

Solution - Class in g2901_3000.s2913_subarrays_distinct_element_sum_of_squares_i

2913 - Subarrays Distinct Element Sum of Squares I.

Solution - Class in g2901_3000.s2914_minimum_number_of_changes_to_make_binary_string_beautiful

2914 - Minimum Number of Changes to Make Binary String Beautiful.

Solution - Class in g2901_3000.s2915_length_of_the_longest_subsequence_that_sums_to_target

2915 - Length of the Longest Subsequence That Sums to Target.

Solution - Class in g2901_3000.s2916_subarrays_distinct_element_sum_of_squares_ii

2916 - Subarrays Distinct Element Sum of Squares II.

Solution - Class in g2901_3000.s2917_find_the_k_or_of_an_array

2917 - Find the K-or of an Array.

Solution - Class in g2901_3000.s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros

2918 - Minimum Equal Sum of Two Arrays After Replacing Zeros.

Solution - Class in g2901_3000.s2919_minimum_increment_operations_to_make_array_beautiful

2919 - Minimum Increment Operations to Make Array Beautiful.

Solution - Class in g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes

2920 - Maximum Points After Collecting Coins From All Nodes.

Solution - Class in g2901_3000.s2923_find_champion_i

2923 - Find Champion I.

Solution - Class in g2901_3000.s2924_find_champion_ii

2924 - Find Champion II.

Solution - Class in g2901_3000.s2925_maximum_score_after_applying_operations_on_a_tree

2925 - Maximum Score After Applying Operations on a Tree.

Solution - Class in g2901_3000.s2926_maximum_balanced_subsequence_sum

2926 - Maximum Balanced Subsequence Sum.

Solution - Class in g2901_3000.s2928_distribute_candies_among_children_i

2928 - Distribute Candies Among Children I.

Solution - Class in g2901_3000.s2929_distribute_candies_among_children_ii

2929 - Distribute Candies Among Children II.

Solution - Class in g2901_3000.s2930_number_of_strings_which_can_be_rearranged_to_contain_substring

2930 - Number of Strings Which Can Be Rearranged to Contain Substring.

Solution - Class in g2901_3000.s2931_maximum_spending_after_buying_items

2931 - Maximum Spending After Buying Items.

Solution - Class in g2901_3000.s2932_maximum_strong_pair_xor_i

2932 - Maximum Strong Pair XOR I.

Solution - Class in g2901_3000.s2933_high_access_employees

2933 - High-Access Employees.

Solution - Class in g2901_3000.s2934_minimum_operations_to_maximize_last_elements_in_arrays

2934 - Minimum Operations to Maximize Last Elements in Arrays.

Solution - Class in g2901_3000.s2935_maximum_strong_pair_xor_ii

2935 - Maximum Strong Pair XOR II.

Solution - Class in g2901_3000.s2937_make_three_strings_equal

2937 - Make Three Strings Equal.

Solution - Class in g2901_3000.s2938_separate_black_and_white_balls

2938 - Separate Black and White Balls.

Solution - Class in g2901_3000.s2939_maximum_xor_product

2939 - Maximum Xor Product.

Solution - Class in g2901_3000.s2940_find_building_where_alice_and_bob_can_meet

2940 - Find Building Where Alice and Bob Can Meet.

Solution - Class in g2901_3000.s2942_find_words_containing_character

2942 - Find Words Containing Character.

Solution - Class in g2901_3000.s2943_maximize_area_of_square_hole_in_grid

2943 - Maximize Area of Square Hole in Grid.

Solution - Class in g2901_3000.s2944_minimum_number_of_coins_for_fruits

2944 - Minimum Number of Coins for Fruits.

Solution - Class in g2901_3000.s2945_find_maximum_non_decreasing_array_length

2945 - Find Maximum Non-decreasing Array Length.

Solution - Class in g2901_3000.s2946_matrix_similarity_after_cyclic_shifts

2946 - Matrix Similarity After Cyclic Shifts.

Solution - Class in g2901_3000.s2947_count_beautiful_substrings_i

2947 - Count Beautiful Substrings I.

Solution - Class in g2901_3000.s2948_make_lexicographically_smallest_array_by_swapping_elements

2948 - Make Lexicographically Smallest Array by Swapping Elements.

Solution - Class in g2901_3000.s2949_count_beautiful_substrings_ii

2949 - Count Beautiful Substrings II.

Solution - Class in g2901_3000.s2951_find_the_peaks

2951 - Find the Peaks.

Solution - Class in g2901_3000.s2952_minimum_number_of_coins_to_be_added

2952 - Minimum Number of Coins to be Added.

Solution - Class in g2901_3000.s2953_count_complete_substrings

2953 - Count Complete Substrings.

Solution - Class in g2901_3000.s2954_count_the_number_of_infection_sequences

2954 - Count the Number of Infection Sequences.

Solution - Class in g2901_3000.s2956_find_common_elements_between_two_arrays

2956 - Find Common Elements Between Two Arrays.

Solution - Class in g2901_3000.s2957_remove_adjacent_almost_equal_characters

2957 - Remove Adjacent Almost-Equal Characters.

Solution - Class in g2901_3000.s2958_length_of_longest_subarray_with_at_most_k_frequency

2958 - Length of Longest Subarray With at Most K Frequency.

Solution - Class in g2901_3000.s2959_number_of_possible_sets_of_closing_branches

2959 - Number of Possible Sets of Closing Branches.

Solution - Class in g2901_3000.s2960_count_tested_devices_after_test_operations

2960 - Count Tested Devices After Test Operations.

Solution - Class in g2901_3000.s2961_double_modular_exponentiation

2961 - Double Modular Exponentiation.

Solution - Class in g2901_3000.s2962_count_subarrays_where_max_element_appears_at_least_k_times

2962 - Count Subarrays Where Max Element Appears at Least K Times.

Solution - Class in g2901_3000.s2963_count_the_number_of_good_partitions

2963 - Count the Number of Good Partitions.

Solution - Class in g2901_3000.s2965_find_missing_and_repeated_values

2965 - Find Missing and Repeated Values.

Solution - Class in g2901_3000.s2966_divide_array_into_arrays_with_max_difference

2966 - Divide Array Into Arrays With Max Difference.

Solution - Class in g2901_3000.s2967_minimum_cost_to_make_array_equalindromic

2967 - Minimum Cost to Make Array Equalindromic.

Solution - Class in g2901_3000.s2968_apply_operations_to_maximize_frequency_score

2968 - Apply Operations to Maximize Frequency Score.

Solution - Class in g2901_3000.s2970_count_the_number_of_incremovable_subarrays_i

2970 - Count the Number of Incremovable Subarrays I.

Solution - Class in g2901_3000.s2971_find_polygon_with_the_largest_perimeter

2971 - Find Polygon With the Largest Perimeter.

Solution - Class in g2901_3000.s2972_count_the_number_of_incremovable_subarrays_ii

2972 - Count the Number of Incremovable Subarrays II.

Solution - Class in g2901_3000.s2973_find_number_of_coins_to_place_in_tree_nodes

2973 - Find Number of Coins to Place in Tree Nodes.

Solution - Class in g2901_3000.s2974_minimum_number_game

2974 - Minimum Number Game.

Solution - Class in g2901_3000.s2975_maximum_square_area_by_removing_fences_from_a_field

2975 - Maximum Square Area by Removing Fences From a Field.

Solution - Class in g2901_3000.s2976_minimum_cost_to_convert_string_i

2976 - Minimum Cost to Convert String I.

Solution - Class in g2901_3000.s2977_minimum_cost_to_convert_string_ii

2977 - Minimum Cost to Convert String II.

Solution - Class in g2901_3000.s2980_check_if_bitwise_or_has_trailing_zeros

2980 - Check if Bitwise OR Has Trailing Zeros.

Solution - Class in g2901_3000.s2981_find_longest_special_substring_that_occurs_thrice_i

2981 - Find Longest Special Substring That Occurs Thrice I.

Solution - Class in g2901_3000.s2982_find_longest_special_substring_that_occurs_thrice_ii

2982 - Find Longest Special Substring That Occurs Thrice II.

Solution - Class in g2901_3000.s2983_palindrome_rearrangement_queries

2983 - Palindrome Rearrangement Queries.

Solution - Class in g2901_3000.s2996_smallest_missing_integer_greater_than_sequential_prefix_sum

2996 - Smallest Missing Integer Greater Than Sequential Prefix Sum.

Solution - Class in g2901_3000.s2997_minimum_number_of_operations_to_make_array_xor_equal_to_k

2997 - Minimum Number of Operations to Make Array XOR Equal to K.

Solution - Class in g2901_3000.s2998_minimum_number_of_operations_to_make_x_and_y_equal

2998 - Minimum Number of Operations to Make X and Y Equal.

Solution - Class in g2901_3000.s2999_count_the_number_of_powerful_integers

2999 - Count the Number of Powerful Integers.

Solution - Class in g2901_3000.s3000_maximum_area_of_longest_diagonal_rectangle

3000 - Maximum Area of Longest Diagonal Rectangle.

Solution - Class in g3001_3100.s3001_minimum_moves_to_capture_the_queen

3001 - Minimum Moves to Capture The Queen.

Solution - Class in g3001_3100.s3002_maximum_size_of_a_set_after_removals

3002 - Maximum Size of a Set After Removals.

Solution - Class in g3001_3100.s3003_maximize_the_number_of_partitions_after_operations

3003 - Maximize the Number of Partitions After Operations.

Solution - Class in g3001_3100.s3005_count_elements_with_maximum_frequency

3005 - Count Elements With Maximum Frequency.

Solution - Class in g3001_3100.s3006_find_beautiful_indices_in_the_given_array_i

3006 - Find Beautiful Indices in the Given Array I.

Solution - Class in g3001_3100.s3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k

3007 - Maximum Number That Sum of the Prices Is Less Than or Equal to K.

Solution - Class in g3001_3100.s3008_find_beautiful_indices_in_the_given_array_ii

3008 - Find Beautiful Indices in the Given Array II.

Solution - Class in g3001_3100.s3010_divide_an_array_into_subarrays_with_minimum_cost_i

3010 - Divide an Array Into Subarrays With Minimum Cost I.

Solution - Class in g3001_3100.s3011_find_if_array_can_be_sorted

3011 - Find if Array Can Be Sorted.

Solution - Class in g3001_3100.s3012_minimize_length_of_array_using_operations

3012 - Minimize Length of Array Using Operations.

Solution - Class in g3001_3100.s3013_divide_an_array_into_subarrays_with_minimum_cost_ii

3013 - Divide an Array Into Subarrays With Minimum Cost II.

Solution - Class in g3001_3100.s3014_minimum_number_of_pushes_to_type_word_i

3014 - Minimum Number of Pushes to Type Word I.

Solution - Class in g3001_3100.s3015_count_the_number_of_houses_at_a_certain_distance_i

3015 - Count the Number of Houses at a Certain Distance I.

Solution - Class in g3001_3100.s3016_minimum_number_of_pushes_to_type_word_ii

3016 - Minimum Number of Pushes to Type Word II.

Solution - Class in g3001_3100.s3017_count_the_number_of_houses_at_a_certain_distance_ii

3017 - Count the Number of Houses at a Certain Distance II.

Solution - Class in g3001_3100.s3019_number_of_changing_keys

3019 - Number of Changing Keys.

Solution - Class in g3001_3100.s3020_find_the_maximum_number_of_elements_in_subset

3020 - Find the Maximum Number of Elements in Subset.

Solution - Class in g3001_3100.s3021_alice_and_bob_playing_flower_game

3021 - Alice and Bob Playing Flower Game.

Solution - Class in g3001_3100.s3022_minimize_or_of_remaining_elements_using_operations

3022 - Minimize OR of Remaining Elements Using Operations.

Solution - Class in g3001_3100.s3024_type_of_triangle

3024 - Type of Triangle.

Solution - Class in g3001_3100.s3025_find_the_number_of_ways_to_place_people_i

3025 - Find the Number of Ways to Place People I.

Solution - Class in g3001_3100.s3026_maximum_good_subarray_sum

3026 - Maximum Good Subarray Sum.

Solution - Class in g3001_3100.s3027_find_the_number_of_ways_to_place_people_ii

3027 - Find the Number of Ways to Place People II.

Solution - Class in g3001_3100.s3028_ant_on_the_boundary

3028 - Ant on the Boundary.

Solution - Class in g3001_3100.s3029_minimum_time_to_revert_word_to_initial_state_i

3029 - Minimum Time to Revert Word to Initial State I.

Solution - Class in g3001_3100.s3030_find_the_grid_of_region_average

3030 - Find the Grid of Region Average.

Solution - Class in g3001_3100.s3031_minimum_time_to_revert_word_to_initial_state_ii

3031 - Minimum Time to Revert Word to Initial State II.

Solution - Class in g3001_3100.s3033_modify_the_matrix

3033 - Modify the Matrix.

Solution - Class in g3001_3100.s3034_number_of_subarrays_that_match_a_pattern_i

3034 - Number of Subarrays That Match a Pattern I.

Solution - Class in g3001_3100.s3035_maximum_palindromes_after_operations

3035 - Maximum Palindromes After Operations.

Solution - Class in g3001_3100.s3036_number_of_subarrays_that_match_a_pattern_ii

3036 - Number of Subarrays That Match a Pattern II.

Solution - Class in g3001_3100.s3038_maximum_number_of_operations_with_the_same_score_i

3038 - Maximum Number of Operations With the Same Score I.

Solution - Class in g3001_3100.s3039_apply_operations_to_make_string_empty

3039 - Apply Operations to Make String Empty.

Solution - Class in g3001_3100.s3040_maximum_number_of_operations_with_the_same_score_ii

3040 - Maximum Number of Operations With the Same Score II.

Solution - Class in g3001_3100.s3041_maximize_consecutive_elements_in_an_array_after_modification

3041 - Maximize Consecutive Elements in an Array After Modification.

Solution - Class in g3001_3100.s3042_count_prefix_and_suffix_pairs_i

3042 - Count Prefix and Suffix Pairs I.

Solution - Class in g3001_3100.s3043_find_the_length_of_the_longest_common_prefix

3043 - Find the Length of the Longest Common Prefix.

Solution - Class in g3001_3100.s3044_most_frequent_prime

3044 - Most Frequent Prime.

Solution - Class in g3001_3100.s3045_count_prefix_and_suffix_pairs_ii

3045 - Count Prefix and Suffix Pairs II.

Solution - Class in g3001_3100.s3046_split_the_array

3046 - Split the Array.

Solution - Class in g3001_3100.s3047_find_the_largest_area_of_square_inside_two_rectangles

3047 - Find the Largest Area of Square Inside Two Rectangles.

Solution - Class in g3001_3100.s3048_earliest_second_to_mark_indices_i

3048 - Earliest Second to Mark Indices I.

Solution - Class in g3001_3100.s3049_earliest_second_to_mark_indices_ii

3049 - Earliest Second to Mark Indices II.

Solution - Class in g3001_3100.s3065_minimum_operations_to_exceed_threshold_value_i

3065 - Minimum Operations to Exceed Threshold Value I.

Solution - Class in g3001_3100.s3066_minimum_operations_to_exceed_threshold_value_ii

3066 - Minimum Operations to Exceed Threshold Value II.

Solution - Class in g3001_3100.s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network

3067 - Count Pairs of Connectable Servers in a Weighted Tree Network.

Solution - Class in g3001_3100.s3068_find_the_maximum_sum_of_node_values

3068 - Find the Maximum Sum of Node Values.

Solution - Class in g3001_3100.s3069_distribute_elements_into_two_arrays_i

3069 - Distribute Elements Into Two Arrays I.

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_3sum.Solution

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

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

Solution() - Constructor for class g0001_0100.s0018_4sum.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_find_the_index_of_the_first_occurrence_in_a_string.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_multiply_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_word_search.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.s0235_lowest_common_ancestor_of_a_binary_search_tree.Solution

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

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

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

Solution() - Constructor for class g0201_0300.s0239_sliding_window_maximum.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.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.s0301_remove_invalid_parentheses.Solution

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution() - Constructor for class g0301_0400.s0329_longest_increasing_path_in_a_matrix.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 g0301_0400.s0335_self_crossing.Solution

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution() - Constructor for class g0401_0500.s0401_binary_watch.Solution

Solution() - Constructor for class g0401_0500.s0402_remove_k_digits.Solution

Solution() - Constructor for class g0401_0500.s0403_frog_jump.Solution

Solution() - Constructor for class g0401_0500.s0404_sum_of_left_leaves.Solution

Solution() - Constructor for class g0401_0500.s0405_convert_a_number_to_hexadecimal.Solution

Solution() - Constructor for class g0401_0500.s0406_queue_reconstruction_by_height.Solution

Solution() - Constructor for class g0401_0500.s0407_trapping_rain_water_ii.Solution

Solution() - Constructor for class g0401_0500.s0409_longest_palindrome.Solution

Solution() - Constructor for class g0401_0500.s0410_split_array_largest_sum.Solution

Solution() - Constructor for class g0401_0500.s0412_fizz_buzz.Solution

Solution() - Constructor for class g0401_0500.s0413_arithmetic_slices.Solution

Solution() - Constructor for class g0401_0500.s0414_third_maximum_number.Solution

Solution() - Constructor for class g0401_0500.s0415_add_strings.Solution

Solution() - Constructor for class g0401_0500.s0416_partition_equal_subset_sum.Solution

Solution() - Constructor for class g0401_0500.s0417_pacific_atlantic_water_flow.Solution

Solution() - Constructor for class g0401_0500.s0419_battleships_in_a_board.Solution

Solution() - Constructor for class g0401_0500.s0420_strong_password_checker.Solution

Solution() - Constructor for class g0401_0500.s0421_maximum_xor_of_two_numbers_in_an_array.Solution

Solution() - Constructor for class g0401_0500.s0423_reconstruct_original_digits_from_english.Solution

Solution() - Constructor for class g0401_0500.s0424_longest_repeating_character_replacement.Solution

Solution() - Constructor for class g0401_0500.s0427_construct_quad_tree.Solution

Solution() - Constructor for class g0401_0500.s0429_n_ary_tree_level_order_traversal.Solution

Solution() - Constructor for class g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Solution

Solution() - Constructor for class g0401_0500.s0433_minimum_genetic_mutation.Solution

Solution() - Constructor for class g0401_0500.s0434_number_of_segments_in_a_string.Solution

Solution() - Constructor for class g0401_0500.s0435_non_overlapping_intervals.Solution

Solution() - Constructor for class g0401_0500.s0436_find_right_interval.Solution

Solution() - Constructor for class g0401_0500.s0437_path_sum_iii.Solution

Solution() - Constructor for class g0401_0500.s0438_find_all_anagrams_in_a_string.Solution

Solution() - Constructor for class g0401_0500.s0440_k_th_smallest_in_lexicographical_order.Solution

Solution() - Constructor for class g0401_0500.s0441_arranging_coins.Solution

Solution() - Constructor for class g0401_0500.s0442_find_all_duplicates_in_an_array.Solution

Solution() - Constructor for class g0401_0500.s0443_string_compression.Solution

Solution() - Constructor for class g0401_0500.s0445_add_two_numbers_ii.Solution

Solution() - Constructor for class g0401_0500.s0446_arithmetic_slices_ii_subsequence.Solution

Solution() - Constructor for class g0401_0500.s0447_number_of_boomerangs.Solution

Solution() - Constructor for class g0401_0500.s0448_find_all_numbers_disappeared_in_an_array.Solution

Solution() - Constructor for class g0401_0500.s0450_delete_node_in_a_bst.Solution

Solution() - Constructor for class g0401_0500.s0451_sort_characters_by_frequency.Solution

Solution() - Constructor for class g0401_0500.s0452_minimum_number_of_arrows_to_burst_balloons.Solution

Solution() - Constructor for class g0401_0500.s0453_minimum_moves_to_equal_array_elements.Solution

Solution() - Constructor for class g0401_0500.s0454_4sum_ii.Solution

Solution() - Constructor for class g0401_0500.s0455_assign_cookies.Solution

Solution() - Constructor for class g0401_0500.s0456_132_pattern.Solution

Solution() - Constructor for class g0401_0500.s0457_circular_array_loop.Solution

Solution() - Constructor for class g0401_0500.s0458_poor_pigs.Solution

Solution() - Constructor for class g0401_0500.s0459_repeated_substring_pattern.Solution

Solution() - Constructor for class g0401_0500.s0461_hamming_distance.Solution

Solution() - Constructor for class g0401_0500.s0462_minimum_moves_to_equal_array_elements_ii.Solution

Solution() - Constructor for class g0401_0500.s0463_island_perimeter.Solution

Solution() - Constructor for class g0401_0500.s0464_can_i_win.Solution

Solution() - Constructor for class g0401_0500.s0466_count_the_repetitions.Solution

Solution() - Constructor for class g0401_0500.s0467_unique_substrings_in_wraparound_string.Solution

Solution() - Constructor for class g0401_0500.s0468_validate_ip_address.Solution

Solution() - Constructor for class g0401_0500.s0470_implement_rand10_using_rand7.Solution

Solution() - Constructor for class g0401_0500.s0472_concatenated_words.Solution

Solution() - Constructor for class g0401_0500.s0473_matchsticks_to_square.Solution

Solution() - Constructor for class g0401_0500.s0474_ones_and_zeroes.Solution

Solution() - Constructor for class g0401_0500.s0475_heaters.Solution

Solution() - Constructor for class g0401_0500.s0476_number_complement.Solution

Solution() - Constructor for class g0401_0500.s0477_total_hamming_distance.Solution

Solution() - Constructor for class g0401_0500.s0479_largest_palindrome_product.Solution

Solution() - Constructor for class g0401_0500.s0480_sliding_window_median.Solution

Solution() - Constructor for class g0401_0500.s0481_magical_string.Solution

Solution() - Constructor for class g0401_0500.s0482_license_key_formatting.Solution

Solution() - Constructor for class g0401_0500.s0483_smallest_good_base.Solution

Solution() - Constructor for class g0401_0500.s0485_max_consecutive_ones.Solution

Solution() - Constructor for class g0401_0500.s0486_predict_the_winner.Solution

Solution() - Constructor for class g0401_0500.s0488_zuma_game.Solution

Solution() - Constructor for class g0401_0500.s0491_increasing_subsequences.Solution

Solution() - Constructor for class g0401_0500.s0492_construct_the_rectangle.Solution

Solution() - Constructor for class g0401_0500.s0493_reverse_pairs.Solution

Solution() - Constructor for class g0401_0500.s0494_target_sum.Solution

Solution() - Constructor for class g0401_0500.s0495_teemo_attacking.Solution

Solution() - Constructor for class g0401_0500.s0496_next_greater_element_i.Solution

Solution() - Constructor for class g0401_0500.s0498_diagonal_traverse.Solution

Solution() - Constructor for class g0401_0500.s0500_keyboard_row.Solution

Solution() - Constructor for class g0501_0600.s0501_find_mode_in_binary_search_tree.Solution

Solution() - Constructor for class g0501_0600.s0502_ipo.Solution

Solution() - Constructor for class g0501_0600.s0503_next_greater_element_ii.Solution

Solution() - Constructor for class g0501_0600.s0504_base_7.Solution

Solution() - Constructor for class g0501_0600.s0506_relative_ranks.Solution

Solution() - Constructor for class g0501_0600.s0507_perfect_number.Solution

Solution() - Constructor for class g0501_0600.s0508_most_frequent_subtree_sum.Solution

Solution() - Constructor for class g0501_0600.s0509_fibonacci_number.Solution

Solution() - Constructor for class g0501_0600.s0513_find_bottom_left_tree_value.Solution

Solution() - Constructor for class g0501_0600.s0514_freedom_trail.Solution

Solution() - Constructor for class g0501_0600.s0515_find_largest_value_in_each_tree_row.Solution

Solution() - Constructor for class g0501_0600.s0516_longest_palindromic_subsequence.Solution

Solution() - Constructor for class g0501_0600.s0517_super_washing_machines.Solution

Solution() - Constructor for class g0501_0600.s0518_coin_change_2.Solution

Solution() - Constructor for class g0501_0600.s0520_detect_capital.Solution

Solution() - Constructor for class g0501_0600.s0521_longest_uncommon_subsequence_i.Solution

Solution() - Constructor for class g0501_0600.s0522_longest_uncommon_subsequence_ii.Solution

Solution() - Constructor for class g0501_0600.s0523_continuous_subarray_sum.Solution

Solution() - Constructor for class g0501_0600.s0524_longest_word_in_dictionary_through_deleting.Solution

Solution() - Constructor for class g0501_0600.s0525_contiguous_array.Solution

Solution() - Constructor for class g0501_0600.s0526_beautiful_arrangement.Solution

Solution() - Constructor for class g0501_0600.s0529_minesweeper.Solution

Solution() - Constructor for class g0501_0600.s0530_minimum_absolute_difference_in_bst.Solution

Solution() - Constructor for class g0501_0600.s0532_k_diff_pairs_in_an_array.Solution

Solution() - Constructor for class g0501_0600.s0537_complex_number_multiplication.Solution

Solution() - Constructor for class g0501_0600.s0538_convert_bst_to_greater_tree.Solution

Solution() - Constructor for class g0501_0600.s0539_minimum_time_difference.Solution

Solution() - Constructor for class g0501_0600.s0540_single_element_in_a_sorted_array.Solution

Solution() - Constructor for class g0501_0600.s0541_reverse_string_ii.Solution

Solution() - Constructor for class g0501_0600.s0542_01_matrix.Solution

Solution() - Constructor for class g0501_0600.s0543_diameter_of_binary_tree.Solution

Solution() - Constructor for class g0501_0600.s0546_remove_boxes.Solution

Solution() - Constructor for class g0501_0600.s0547_number_of_provinces.Solution

Solution() - Constructor for class g0501_0600.s0551_student_attendance_record_i.Solution

Solution() - Constructor for class g0501_0600.s0552_student_attendance_record_ii.Solution

Solution() - Constructor for class g0501_0600.s0553_optimal_division.Solution

Solution() - Constructor for class g0501_0600.s0554_brick_wall.Solution

Solution() - Constructor for class g0501_0600.s0556_next_greater_element_iii.Solution

Solution() - Constructor for class g0501_0600.s0557_reverse_words_in_a_string_iii.Solution

Solution() - Constructor for class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Solution

Solution() - Constructor for class g0501_0600.s0559_maximum_depth_of_n_ary_tree.Solution

Solution() - Constructor for class g0501_0600.s0560_subarray_sum_equals_k.Solution

Solution() - Constructor for class g0501_0600.s0561_array_partition_i.Solution

Solution() - Constructor for class g0501_0600.s0563_binary_tree_tilt.Solution

Solution() - Constructor for class g0501_0600.s0564_find_the_closest_palindrome.Solution

Solution() - Constructor for class g0501_0600.s0565_array_nesting.Solution

Solution() - Constructor for class g0501_0600.s0566_reshape_the_matrix.Solution

Solution() - Constructor for class g0501_0600.s0567_permutation_in_string.Solution

Solution() - Constructor for class g0501_0600.s0572_subtree_of_another_tree.Solution

Solution() - Constructor for class g0501_0600.s0575_distribute_candies.Solution

Solution() - Constructor for class g0501_0600.s0576_out_of_boundary_paths.Solution

Solution() - Constructor for class g0501_0600.s0581_shortest_unsorted_continuous_subarray.Solution

Solution() - Constructor for class g0501_0600.s0583_delete_operation_for_two_strings.Solution

Solution() - Constructor for class g0501_0600.s0587_erect_the_fence.Solution

Solution() - Constructor for class g0501_0600.s0589_n_ary_tree_preorder_traversal.Solution

Solution() - Constructor for class g0501_0600.s0590_n_ary_tree_postorder_traversal.Solution

Solution() - Constructor for class g0501_0600.s0591_tag_validator.Solution

Solution() - Constructor for class g0501_0600.s0592_fraction_addition_and_subtraction.Solution

Solution() - Constructor for class g0501_0600.s0593_valid_square.Solution

Solution() - Constructor for class g0501_0600.s0594_longest_harmonious_subsequence.Solution

Solution() - Constructor for class g0501_0600.s0598_range_addition_ii.Solution

Solution() - Constructor for class g0501_0600.s0599_minimum_index_sum_of_two_lists.Solution

Solution() - Constructor for class g0501_0600.s0600_non_negative_integers_without_consecutive_ones.Solution

Solution() - Constructor for class g0601_0700.s0605_can_place_flowers.Solution

Solution() - Constructor for class g0601_0700.s0606_construct_string_from_binary_tree.Solution

Solution() - Constructor for class g0601_0700.s0609_find_duplicate_file_in_system.Solution

Solution() - Constructor for class g0601_0700.s0611_valid_triangle_number.Solution

Solution() - Constructor for class g0601_0700.s0617_merge_two_binary_trees.Solution

Solution() - Constructor for class g0601_0700.s0621_task_scheduler.Solution

Solution() - Constructor for class g0601_0700.s0623_add_one_row_to_tree.Solution

Solution() - Constructor for class g0601_0700.s0628_maximum_product_of_three_numbers.Solution

Solution() - Constructor for class g0601_0700.s0629_k_inverse_pairs_array.Solution

Solution() - Constructor for class g0601_0700.s0630_course_schedule_iii.Solution

Solution() - Constructor for class g0601_0700.s0632_smallest_range_covering_elements_from_k_lists.Solution

Solution() - Constructor for class g0601_0700.s0633_sum_of_square_numbers.Solution

Solution() - Constructor for class g0601_0700.s0636_exclusive_time_of_functions.Solution

Solution() - Constructor for class g0601_0700.s0637_average_of_levels_in_binary_tree.Solution

Solution() - Constructor for class g0601_0700.s0638_shopping_offers.Solution

Solution() - Constructor for class g0601_0700.s0639_decode_ways_ii.Solution

Solution() - Constructor for class g0601_0700.s0640_solve_the_equation.Solution

Solution() - Constructor for class g0601_0700.s0643_maximum_average_subarray_i.Solution

Solution() - Constructor for class g0601_0700.s0645_set_mismatch.Solution

Solution() - Constructor for class g0601_0700.s0646_maximum_length_of_pair_chain.Solution

Solution() - Constructor for class g0601_0700.s0647_palindromic_substrings.Solution

Solution() - Constructor for class g0601_0700.s0648_replace_words.Solution

Solution() - Constructor for class g0601_0700.s0649_dota2_senate.Solution

Solution() - Constructor for class g0601_0700.s0650_2_keys_keyboard.Solution

Solution() - Constructor for class g0601_0700.s0652_find_duplicate_subtrees.Solution

Solution() - Constructor for class g0601_0700.s0653_two_sum_iv_input_is_a_bst.Solution

Solution() - Constructor for class g0601_0700.s0654_maximum_binary_tree.Solution

Solution() - Constructor for class g0601_0700.s0655_print_binary_tree.Solution

Solution() - Constructor for class g0601_0700.s0657_robot_return_to_origin.Solution

Solution() - Constructor for class g0601_0700.s0658_find_k_closest_elements.Solution

Solution() - Constructor for class g0601_0700.s0659_split_array_into_consecutive_subsequences.Solution

Solution() - Constructor for class g0601_0700.s0661_image_smoother.Solution

Solution() - Constructor for class g0601_0700.s0662_maximum_width_of_binary_tree.Solution

Solution() - Constructor for class g0601_0700.s0664_strange_printer.Solution

Solution() - Constructor for class g0601_0700.s0665_non_decreasing_array.Solution

Solution() - Constructor for class g0601_0700.s0667_beautiful_arrangement_ii.Solution

Solution() - Constructor for class g0601_0700.s0668_kth_smallest_number_in_multiplication_table.Solution

Solution() - Constructor for class g0601_0700.s0669_trim_a_binary_search_tree.Solution

Solution() - Constructor for class g0601_0700.s0670_maximum_swap.Solution

Solution() - Constructor for class g0601_0700.s0671_second_minimum_node_in_a_binary_tree.Solution

Solution() - Constructor for class g0601_0700.s0672_bulb_switcher_ii.Solution

Solution() - Constructor for class g0601_0700.s0673_number_of_longest_increasing_subsequence.Solution

Solution() - Constructor for class g0601_0700.s0674_longest_continuous_increasing_subsequence.Solution

Solution() - Constructor for class g0601_0700.s0675_cut_off_trees_for_golf_event.Solution

Solution() - Constructor for class g0601_0700.s0678_valid_parenthesis_string.Solution

Solution() - Constructor for class g0601_0700.s0679_24_game.Solution

Solution() - Constructor for class g0601_0700.s0680_valid_palindrome_ii.Solution

Solution() - Constructor for class g0601_0700.s0682_baseball_game.Solution

Solution() - Constructor for class g0601_0700.s0684_redundant_connection.Solution

Solution() - Constructor for class g0601_0700.s0685_redundant_connection_ii.Solution

Solution() - Constructor for class g0601_0700.s0686_repeated_string_match.Solution

Solution() - Constructor for class g0601_0700.s0687_longest_univalue_path.Solution

Solution() - Constructor for class g0601_0700.s0688_knight_probability_in_chessboard.Solution

Solution() - Constructor for class g0601_0700.s0689_maximum_sum_of_3_non_overlapping_subarrays.Solution

Solution() - Constructor for class g0601_0700.s0690_employee_importance.Solution

Solution() - Constructor for class g0601_0700.s0691_stickers_to_spell_word.Solution

Solution() - Constructor for class g0601_0700.s0692_top_k_frequent_words.Solution

Solution() - Constructor for class g0601_0700.s0693_binary_number_with_alternating_bits.Solution

Solution() - Constructor for class g0601_0700.s0695_max_area_of_island.Solution

Solution() - Constructor for class g0601_0700.s0696_count_binary_substrings.Solution

Solution() - Constructor for class g0601_0700.s0697_degree_of_an_array.Solution

Solution() - Constructor for class g0601_0700.s0698_partition_to_k_equal_sum_subsets.Solution

Solution() - Constructor for class g0601_0700.s0699_falling_squares.Solution

Solution() - Constructor for class g0601_0700.s0700_search_in_a_binary_search_tree.Solution

Solution() - Constructor for class g0701_0800.s0701_insert_into_a_binary_search_tree.Solution

Solution() - Constructor for class g0701_0800.s0704_binary_search.Solution

Solution() - Constructor for class g0701_0800.s0709_to_lower_case.Solution

Solution() - Constructor for class g0701_0800.s0712_minimum_ascii_delete_sum_for_two_strings.Solution

Solution() - Constructor for class g0701_0800.s0713_subarray_product_less_than_k.Solution

Solution() - Constructor for class g0701_0800.s0714_best_time_to_buy_and_sell_stock_with_transaction_fee.Solution

Solution() - Constructor for class g0701_0800.s0717_1_bit_and_2_bit_characters.Solution

Solution() - Constructor for class g0701_0800.s0718_maximum_length_of_repeated_subarray.Solution

Solution() - Constructor for class g0701_0800.s0719_find_k_th_smallest_pair_distance.Solution

Solution() - Constructor for class g0701_0800.s0720_longest_word_in_dictionary.Solution

Solution() - Constructor for class g0701_0800.s0721_accounts_merge.Solution

Solution() - Constructor for class g0701_0800.s0722_remove_comments.Solution

Solution() - Constructor for class g0701_0800.s0724_find_pivot_index.Solution

Solution() - Constructor for class g0701_0800.s0725_split_linked_list_in_parts.Solution

Solution() - Constructor for class g0701_0800.s0726_number_of_atoms.Solution

Solution() - Constructor for class g0701_0800.s0728_self_dividing_numbers.Solution

Solution() - Constructor for class g0701_0800.s0730_count_different_palindromic_subsequences.Solution

Solution() - Constructor for class g0701_0800.s0733_flood_fill.Solution

Solution() - Constructor for class g0701_0800.s0735_asteroid_collision.Solution

Solution() - Constructor for class g0701_0800.s0736_parse_lisp_expression.Solution

Solution() - Constructor for class g0701_0800.s0738_monotone_increasing_digits.Solution

Solution() - Constructor for class g0701_0800.s0739_daily_temperatures.Solution

Solution() - Constructor for class g0701_0800.s0740_delete_and_earn.Solution

Solution() - Constructor for class g0701_0800.s0741_cherry_pickup.Solution

Solution() - Constructor for class g0701_0800.s0743_network_delay_time.Solution

Solution() - Constructor for class g0701_0800.s0744_find_smallest_letter_greater_than_target.Solution

Solution() - Constructor for class g0701_0800.s0746_min_cost_climbing_stairs.Solution

Solution() - Constructor for class g0701_0800.s0747_largest_number_at_least_twice_of_others.Solution

Solution() - Constructor for class g0701_0800.s0748_shortest_completing_word.Solution

Solution() - Constructor for class g0701_0800.s0749_contain_virus.Solution

Solution() - Constructor for class g0701_0800.s0752_open_the_lock.Solution

Solution() - Constructor for class g0701_0800.s0753_cracking_the_safe.Solution

Solution() - Constructor for class g0701_0800.s0754_reach_a_number.Solution

Solution() - Constructor for class g0701_0800.s0756_pyramid_transition_matrix.Solution

Solution() - Constructor for class g0701_0800.s0757_set_intersection_size_at_least_two.Solution

Solution() - Constructor for class g0701_0800.s0761_special_binary_string.Solution

Solution() - Constructor for class g0701_0800.s0762_prime_number_of_set_bits_in_binary_representation.Solution

Solution() - Constructor for class g0701_0800.s0763_partition_labels.Solution

Solution() - Constructor for class g0701_0800.s0764_largest_plus_sign.Solution

Solution() - Constructor for class g0701_0800.s0765_couples_holding_hands.Solution

Solution() - Constructor for class g0701_0800.s0766_toeplitz_matrix.Solution

Solution() - Constructor for class g0701_0800.s0767_reorganize_string.Solution

Solution() - Constructor for class g0701_0800.s0768_max_chunks_to_make_sorted_ii.Solution

Solution() - Constructor for class g0701_0800.s0769_max_chunks_to_make_sorted.Solution

Solution() - Constructor for class g0701_0800.s0770_basic_calculator_iv.Solution

Solution() - Constructor for class g0701_0800.s0771_jewels_and_stones.Solution

Solution() - Constructor for class g0701_0800.s0773_sliding_puzzle.Solution

Solution() - Constructor for class g0701_0800.s0775_global_and_local_inversions.Solution

Solution() - Constructor for class g0701_0800.s0777_swap_adjacent_in_lr_string.Solution

Solution() - Constructor for class g0701_0800.s0778_swim_in_rising_water.Solution

Solution() - Constructor for class g0701_0800.s0779_k_th_symbol_in_grammar.Solution

Solution() - Constructor for class g0701_0800.s0780_reaching_points.Solution

Solution() - Constructor for class g0701_0800.s0781_rabbits_in_forest.Solution

Solution() - Constructor for class g0701_0800.s0782_transform_to_chessboard.Solution

Solution() - Constructor for class g0701_0800.s0783_minimum_distance_between_bst_nodes.Solution

Solution() - Constructor for class g0701_0800.s0784_letter_case_permutation.Solution

Solution() - Constructor for class g0701_0800.s0785_is_graph_bipartite.Solution

Solution() - Constructor for class g0701_0800.s0786_k_th_smallest_prime_fraction.Solution

Solution() - Constructor for class g0701_0800.s0787_cheapest_flights_within_k_stops.Solution

Solution() - Constructor for class g0701_0800.s0788_rotated_digits.Solution

Solution() - Constructor for class g0701_0800.s0789_escape_the_ghosts.Solution

Solution() - Constructor for class g0701_0800.s0790_domino_and_tromino_tiling.Solution

Solution() - Constructor for class g0701_0800.s0791_custom_sort_string.Solution

Solution() - Constructor for class g0701_0800.s0792_number_of_matching_subsequences.Solution

Solution() - Constructor for class g0701_0800.s0793_preimage_size_of_factorial_zeroes_function.Solution

Solution() - Constructor for class g0701_0800.s0794_valid_tic_tac_toe_state.Solution

Solution() - Constructor for class g0701_0800.s0795_number_of_subarrays_with_bounded_maximum.Solution

Solution() - Constructor for class g0701_0800.s0796_rotate_string.Solution

Solution() - Constructor for class g0701_0800.s0797_all_paths_from_source_to_target.Solution

Solution() - Constructor for class g0701_0800.s0798_smallest_rotation_with_highest_score.Solution

Solution() - Constructor for class g0701_0800.s0799_champagne_tower.Solution

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution() - Constructor for class g0901_1000.s0902_numbers_at_most_n_given_digit_set.Solution

Solution() - Constructor for class g0901_1000.s0903_valid_permutations_for_di_sequence.Solution

Solution() - Constructor for class g0901_1000.s0904_fruit_into_baskets.Solution

Solution() - Constructor for class g0901_1000.s0905_sort_array_by_parity.Solution

Solution() - Constructor for class g0901_1000.s0906_super_palindromes.Solution

Solution() - Constructor for class g0901_1000.s0907_sum_of_subarray_minimums.Solution

Solution() - Constructor for class g0901_1000.s0908_smallest_range_i.Solution

Solution() - Constructor for class g0901_1000.s0909_snakes_and_ladders.Solution

Solution() - Constructor for class g0901_1000.s0910_smallest_range_ii.Solution

Solution() - Constructor for class g0901_1000.s0912_sort_an_array.Solution

Solution() - Constructor for class g0901_1000.s0913_cat_and_mouse.Solution

Solution() - Constructor for class g0901_1000.s0914_x_of_a_kind_in_a_deck_of_cards.Solution

Solution() - Constructor for class g0901_1000.s0915_partition_array_into_disjoint_intervals.Solution

Solution() - Constructor for class g0901_1000.s0916_word_subsets.Solution

Solution() - Constructor for class g0901_1000.s0917_reverse_only_letters.Solution

Solution() - Constructor for class g0901_1000.s0918_maximum_sum_circular_subarray.Solution

Solution() - Constructor for class g0901_1000.s0920_number_of_music_playlists.Solution

Solution() - Constructor for class g0901_1000.s0921_minimum_add_to_make_parentheses_valid.Solution

Solution() - Constructor for class g0901_1000.s0922_sort_array_by_parity_ii.Solution

Solution() - Constructor for class g0901_1000.s0923_3sum_with_multiplicity.Solution

Solution() - Constructor for class g0901_1000.s0924_minimize_malware_spread.Solution

Solution() - Constructor for class g0901_1000.s0925_long_pressed_name.Solution

Solution() - Constructor for class g0901_1000.s0926_flip_string_to_monotone_increasing.Solution

Solution() - Constructor for class g0901_1000.s0927_three_equal_parts.Solution

Solution() - Constructor for class g0901_1000.s0928_minimize_malware_spread_ii.Solution

Solution() - Constructor for class g0901_1000.s0929_unique_email_addresses.Solution

Solution() - Constructor for class g0901_1000.s0930_binary_subarrays_with_sum.Solution

Solution() - Constructor for class g0901_1000.s0931_minimum_falling_path_sum.Solution

Solution() - Constructor for class g0901_1000.s0932_beautiful_array.Solution

Solution() - Constructor for class g0901_1000.s0934_shortest_bridge.Solution

Solution() - Constructor for class g0901_1000.s0935_knight_dialer.Solution

Solution() - Constructor for class g0901_1000.s0936_stamping_the_sequence.Solution

Solution() - Constructor for class g0901_1000.s0937_reorder_data_in_log_files.Solution

Solution() - Constructor for class g0901_1000.s0938_range_sum_of_bst.Solution

Solution() - Constructor for class g0901_1000.s0939_minimum_area_rectangle.Solution

Solution() - Constructor for class g0901_1000.s0940_distinct_subsequences_ii.Solution

Solution() - Constructor for class g0901_1000.s0941_valid_mountain_array.Solution

Solution() - Constructor for class g0901_1000.s0942_di_string_match.Solution

Solution() - Constructor for class g0901_1000.s0943_find_the_shortest_superstring.Solution

Solution() - Constructor for class g0901_1000.s0944_delete_columns_to_make_sorted.Solution

Solution() - Constructor for class g0901_1000.s0945_minimum_increment_to_make_array_unique.Solution

Solution() - Constructor for class g0901_1000.s0946_validate_stack_sequences.Solution

Solution() - Constructor for class g0901_1000.s0947_most_stones_removed_with_same_row_or_column.Solution

Solution() - Constructor for class g0901_1000.s0948_bag_of_tokens.Solution

Solution() - Constructor for class g0901_1000.s0949_largest_time_for_given_digits.Solution

Solution() - Constructor for class g0901_1000.s0950_reveal_cards_in_increasing_order.Solution

Solution() - Constructor for class g0901_1000.s0951_flip_equivalent_binary_trees.Solution

Solution() - Constructor for class g0901_1000.s0952_largest_component_size_by_common_factor.Solution

Solution() - Constructor for class g0901_1000.s0953_verifying_an_alien_dictionary.Solution

Solution() - Constructor for class g0901_1000.s0954_array_of_doubled_pairs.Solution

Solution() - Constructor for class g0901_1000.s0955_delete_columns_to_make_sorted_ii.Solution

Solution() - Constructor for class g0901_1000.s0956_tallest_billboard.Solution

Solution() - Constructor for class g0901_1000.s0957_prison_cells_after_n_days.Solution

Solution() - Constructor for class g0901_1000.s0958_check_completeness_of_a_binary_tree.Solution

Solution() - Constructor for class g0901_1000.s0959_regions_cut_by_slashes.Solution

Solution() - Constructor for class g0901_1000.s0960_delete_columns_to_make_sorted_iii.Solution

Solution() - Constructor for class g0901_1000.s0961_n_repeated_element_in_size_2n_array.Solution

Solution() - Constructor for class g0901_1000.s0962_maximum_width_ramp.Solution

Solution() - Constructor for class g0901_1000.s0963_minimum_area_rectangle_ii.Solution

Solution() - Constructor for class g0901_1000.s0964_least_operators_to_express_number.Solution

Solution() - Constructor for class g0901_1000.s0965_univalued_binary_tree.Solution

Solution() - Constructor for class g0901_1000.s0966_vowel_spellchecker.Solution

Solution() - Constructor for class g0901_1000.s0967_numbers_with_same_consecutive_differences.Solution

Solution() - Constructor for class g0901_1000.s0968_binary_tree_cameras.Solution

Solution() - Constructor for class g0901_1000.s0969_pancake_sorting.Solution

Solution() - Constructor for class g0901_1000.s0970_powerful_integers.Solution

Solution() - Constructor for class g0901_1000.s0971_flip_binary_tree_to_match_preorder_traversal.Solution

Solution() - Constructor for class g0901_1000.s0972_equal_rational_numbers.Solution

Solution() - Constructor for class g0901_1000.s0973_k_closest_points_to_origin.Solution

Solution() - Constructor for class g0901_1000.s0974_subarray_sums_divisible_by_k.Solution

Solution() - Constructor for class g0901_1000.s0975_odd_even_jump.Solution

Solution() - Constructor for class g0901_1000.s0976_largest_perimeter_triangle.Solution

Solution() - Constructor for class g0901_1000.s0977_squares_of_a_sorted_array.Solution

Solution() - Constructor for class g0901_1000.s0978_longest_turbulent_subarray.Solution

Solution() - Constructor for class g0901_1000.s0979_distribute_coins_in_binary_tree.Solution

Solution() - Constructor for class g0901_1000.s0980_unique_paths_iii.Solution

Solution() - Constructor for class g0901_1000.s0982_triples_with_bitwise_and_equal_to_zero.Solution

Solution() - Constructor for class g0901_1000.s0983_minimum_cost_for_tickets.Solution

Solution() - Constructor for class g0901_1000.s0984_string_without_aaa_or_bbb.Solution

Solution() - Constructor for class g0901_1000.s0985_sum_of_even_numbers_after_queries.Solution

Solution() - Constructor for class g0901_1000.s0986_interval_list_intersections.Solution

Solution() - Constructor for class g0901_1000.s0987_vertical_order_traversal_of_a_binary_tree.Solution

Solution() - Constructor for class g0901_1000.s0988_smallest_string_starting_from_leaf.Solution

Solution() - Constructor for class g0901_1000.s0989_add_to_array_form_of_integer.Solution

Solution() - Constructor for class g0901_1000.s0990_satisfiability_of_equality_equations.Solution

Solution() - Constructor for class g0901_1000.s0991_broken_calculator.Solution

Solution() - Constructor for class g0901_1000.s0992_subarrays_with_k_different_integers.Solution

Solution() - Constructor for class g0901_1000.s0993_cousins_in_binary_tree.Solution

Solution() - Constructor for class g0901_1000.s0994_rotting_oranges.Solution

Solution() - Constructor for class g0901_1000.s0995_minimum_number_of_k_consecutive_bit_flips.Solution

Solution() - Constructor for class g0901_1000.s0996_number_of_squareful_arrays.Solution

Solution() - Constructor for class g0901_1000.s0997_find_the_town_judge.Solution

Solution() - Constructor for class g0901_1000.s0998_maximum_binary_tree_ii.Solution

Solution() - Constructor for class g0901_1000.s0999_available_captures_for_rook.Solution

Solution() - Constructor for class g0901_1000.s1000_minimum_cost_to_merge_stones.Solution

Solution() - Constructor for class g1001_1100.s1001_grid_illumination.Solution

Solution() - Constructor for class g1001_1100.s1002_find_common_characters.Solution

Solution() - Constructor for class g1001_1100.s1003_check_if_word_is_valid_after_substitutions.Solution

Solution() - Constructor for class g1001_1100.s1004_max_consecutive_ones_iii.Solution

Solution() - Constructor for class g1001_1100.s1005_maximize_sum_of_array_after_k_negations.Solution

Solution() - Constructor for class g1001_1100.s1006_clumsy_factorial.Solution

Solution() - Constructor for class g1001_1100.s1007_minimum_domino_rotations_for_equal_row.Solution

Solution() - Constructor for class g1001_1100.s1008_construct_binary_search_tree_from_preorder_traversal.Solution

Solution() - Constructor for class g1001_1100.s1009_complement_of_base_10_integer.Solution

Solution() - Constructor for class g1001_1100.s1010_pairs_of_songs_with_total_durations_divisible_by_60.Solution

Solution() - Constructor for class g1001_1100.s1011_capacity_to_ship_packages_within_d_days.Solution

Solution() - Constructor for class g1001_1100.s1012_numbers_with_repeated_digits.Solution

Solution() - Constructor for class g1001_1100.s1013_partition_array_into_three_parts_with_equal_sum.Solution

Solution() - Constructor for class g1001_1100.s1014_best_sightseeing_pair.Solution

Solution() - Constructor for class g1001_1100.s1015_smallest_integer_divisible_by_k.Solution

Solution() - Constructor for class g1001_1100.s1016_binary_string_with_substrings_representing_1_to_n.Solution

Solution() - Constructor for class g1001_1100.s1017_convert_to_base_2.Solution

Solution() - Constructor for class g1001_1100.s1018_binary_prefix_divisible_by_5.Solution

Solution() - Constructor for class g1001_1100.s1019_next_greater_node_in_linked_list.Solution

Solution() - Constructor for class g1001_1100.s1020_number_of_enclaves.Solution

Solution() - Constructor for class g1001_1100.s1021_remove_outermost_parentheses.Solution

Solution() - Constructor for class g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers.Solution

Solution() - Constructor for class g1001_1100.s1023_camelcase_matching.Solution

Solution() - Constructor for class g1001_1100.s1024_video_stitching.Solution

Solution() - Constructor for class g1001_1100.s1025_divisor_game.Solution

Solution() - Constructor for class g1001_1100.s1026_maximum_difference_between_node_and_ancestor.Solution

Solution() - Constructor for class g1001_1100.s1027_longest_arithmetic_subsequence.Solution

Solution() - Constructor for class g1001_1100.s1028_recover_a_tree_from_preorder_traversal.Solution

Solution() - Constructor for class g1001_1100.s1029_two_city_scheduling.Solution

Solution() - Constructor for class g1001_1100.s1030_matrix_cells_in_distance_order.Solution

Solution() - Constructor for class g1001_1100.s1031_maximum_sum_of_two_non_overlapping_subarrays.Solution

Solution() - Constructor for class g1001_1100.s1033_moving_stones_until_consecutive.Solution

Solution() - Constructor for class g1001_1100.s1034_coloring_a_border.Solution

Solution() - Constructor for class g1001_1100.s1035_uncrossed_lines.Solution

Solution() - Constructor for class g1001_1100.s1036_escape_a_large_maze.Solution

Solution() - Constructor for class g1001_1100.s1037_valid_boomerang.Solution

Solution() - Constructor for class g1001_1100.s1038_binary_search_tree_to_greater_sum_tree.Solution

Solution() - Constructor for class g1001_1100.s1039_minimum_score_triangulation_of_polygon.Solution

Solution() - Constructor for class g1001_1100.s1040_moving_stones_until_consecutive_ii.Solution

Solution() - Constructor for class g1001_1100.s1041_robot_bounded_in_circle.Solution

Solution() - Constructor for class g1001_1100.s1042_flower_planting_with_no_adjacent.Solution

Solution() - Constructor for class g1001_1100.s1043_partition_array_for_maximum_sum.Solution

Solution() - Constructor for class g1001_1100.s1044_longest_duplicate_substring.Solution

Solution() - Constructor for class g1001_1100.s1046_last_stone_weight.Solution

Solution() - Constructor for class g1001_1100.s1047_remove_all_adjacent_duplicates_in_string.Solution

Solution() - Constructor for class g1001_1100.s1048_longest_string_chain.Solution

Solution() - Constructor for class g1001_1100.s1049_last_stone_weight_ii.Solution

Solution() - Constructor for class g1001_1100.s1051_height_checker.Solution

Solution() - Constructor for class g1001_1100.s1052_grumpy_bookstore_owner.Solution

Solution() - Constructor for class g1001_1100.s1053_previous_permutation_with_one_swap.Solution

Solution() - Constructor for class g1001_1100.s1054_distant_barcodes.Solution

Solution() - Constructor for class g1001_1100.s1061_lexicographically_smallest_equivalent_string.Solution

Solution() - Constructor for class g1001_1100.s1071_greatest_common_divisor_of_strings.Solution

Solution() - Constructor for class g1001_1100.s1072_flip_columns_for_maximum_number_of_equal_rows.Solution

Solution() - Constructor for class g1001_1100.s1073_adding_two_negabinary_numbers.Solution

Solution() - Constructor for class g1001_1100.s1074_number_of_submatrices_that_sum_to_target.Solution

Solution() - Constructor for class g1001_1100.s1078_occurrences_after_bigram.Solution

Solution() - Constructor for class g1001_1100.s1079_letter_tile_possibilities.Solution

Solution() - Constructor for class g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths.Solution

Solution() - Constructor for class g1001_1100.s1081_smallest_subsequence_of_distinct_characters.Solution

Solution() - Constructor for class g1001_1100.s1089_duplicate_zeros.Solution

Solution() - Constructor for class g1001_1100.s1090_largest_values_from_labels.Solution

Solution() - Constructor for class g1001_1100.s1091_shortest_path_in_binary_matrix.Solution

Solution() - Constructor for class g1001_1100.s1092_shortest_common_supersequence.Solution

Solution() - Constructor for class g1001_1100.s1093_statistics_from_a_large_sample.Solution

Solution() - Constructor for class g1001_1100.s1094_car_pooling.Solution

Solution() - Constructor for class g1001_1100.s1095_find_in_mountain_array.Solution

Solution() - Constructor for class g1001_1100.s1096_brace_expansion_ii.Solution

Solution() - Constructor for class g1101_1200.s1103_distribute_candies_to_people.Solution

Solution() - Constructor for class g1101_1200.s1104_path_in_zigzag_labelled_binary_tree.Solution

Solution() - Constructor for class g1101_1200.s1105_filling_bookcase_shelves.Solution

Solution() - Constructor for class g1101_1200.s1106_parsing_a_boolean_expression.Solution

Solution() - Constructor for class g1101_1200.s1108_defanging_an_ip_address.Solution

Solution() - Constructor for class g1101_1200.s1109_corporate_flight_bookings.Solution

Solution() - Constructor for class g1101_1200.s1110_delete_nodes_and_return_forest.Solution

Solution() - Constructor for class g1101_1200.s1111_maximum_nesting_depth_of_two_valid_parentheses_strings.Solution

Solution() - Constructor for class g1101_1200.s1122_relative_sort_array.Solution

Solution() - Constructor for class g1101_1200.s1123_lowest_common_ancestor_of_deepest_leaves.Solution

Solution() - Constructor for class g1101_1200.s1124_longest_well_performing_interval.Solution

Solution() - Constructor for class g1101_1200.s1125_smallest_sufficient_team.Solution

Solution() - Constructor for class g1101_1200.s1128_number_of_equivalent_domino_pairs.Solution

Solution() - Constructor for class g1101_1200.s1129_shortest_path_with_alternating_colors.Solution

Solution() - Constructor for class g1101_1200.s1130_minimum_cost_tree_from_leaf_values.Solution

Solution() - Constructor for class g1101_1200.s1131_maximum_of_absolute_value_expression.Solution

Solution() - Constructor for class g1101_1200.s1137_n_th_tribonacci_number.Solution

Solution() - Constructor for class g1101_1200.s1138_alphabet_board_path.Solution

Solution() - Constructor for class g1101_1200.s1139_largest_1_bordered_square.Solution

Solution() - Constructor for class g1101_1200.s1140_stone_game_ii.Solution

Solution() - Constructor for class g1101_1200.s1143_longest_common_subsequence.Solution

Solution() - Constructor for class g1101_1200.s1144_decrease_elements_to_make_array_zigzag.Solution

Solution() - Constructor for class g1101_1200.s1145_binary_tree_coloring_game.Solution

Solution() - Constructor for class g1101_1200.s1147_longest_chunked_palindrome_decomposition.Solution

Solution() - Constructor for class g1101_1200.s1154_day_of_the_year.Solution

Solution() - Constructor for class g1101_1200.s1155_number_of_dice_rolls_with_target_sum.Solution

Solution() - Constructor for class g1101_1200.s1156_swap_for_longest_repeated_character_substring.Solution

Solution() - Constructor for class g1101_1200.s1160_find_words_that_can_be_formed_by_characters.Solution

Solution() - Constructor for class g1101_1200.s1161_maximum_level_sum_of_a_binary_tree.Solution

Solution() - Constructor for class g1101_1200.s1162_as_far_from_land_as_possible.Solution

Solution() - Constructor for class g1101_1200.s1163_last_substring_in_lexicographical_order.Solution

Solution() - Constructor for class g1101_1200.s1169_invalid_transactions.Solution

Solution() - Constructor for class g1101_1200.s1170_compare_strings_by_frequency_of_the_smallest_character.Solution

Solution() - Constructor for class g1101_1200.s1171_remove_zero_sum_consecutive_nodes_from_linked_list.Solution

Solution() - Constructor for class g1101_1200.s1175_prime_arrangements.Solution

Solution() - Constructor for class g1101_1200.s1177_can_make_palindrome_from_substring.Solution

Solution() - Constructor for class g1101_1200.s1178_number_of_valid_words_for_each_puzzle.Solution

Solution() - Constructor for class g1101_1200.s1184_distance_between_bus_stops.Solution

Solution() - Constructor for class g1101_1200.s1185_day_of_the_week.Solution

Solution() - Constructor for class g1101_1200.s1186_maximum_subarray_sum_with_one_deletion.Solution

Solution() - Constructor for class g1101_1200.s1187_make_array_strictly_increasing.Solution

Solution() - Constructor for class g1101_1200.s1189_maximum_number_of_balloons.Solution

Solution() - Constructor for class g1101_1200.s1190_reverse_substrings_between_each_pair_of_parentheses.Solution

Solution() - Constructor for class g1101_1200.s1191_k_concatenation_maximum_sum.Solution

Solution() - Constructor for class g1101_1200.s1192_critical_connections_in_a_network.Solution

Solution() - Constructor for class g1101_1200.s1200_minimum_absolute_difference.Solution

Solution() - Constructor for class g1201_1300.s1201_ugly_number_iii.Solution

Solution() - Constructor for class g1201_1300.s1202_smallest_string_with_swaps.Solution

Solution() - Constructor for class g1201_1300.s1203_sort_items_by_groups_respecting_dependencies.Solution

Solution() - Constructor for class g1201_1300.s1207_unique_number_of_occurrences.Solution

Solution() - Constructor for class g1201_1300.s1208_get_equal_substrings_within_budget.Solution

Solution() - Constructor for class g1201_1300.s1209_remove_all_adjacent_duplicates_in_string_ii.Solution

Solution() - Constructor for class g1201_1300.s1210_minimum_moves_to_reach_target_with_rotations.Solution

Solution() - Constructor for class g1201_1300.s1217_minimum_cost_to_move_chips_to_the_same_position.Solution

Solution() - Constructor for class g1201_1300.s1218_longest_arithmetic_subsequence_of_given_difference.Solution

Solution() - Constructor for class g1201_1300.s1219_path_with_maximum_gold.Solution

Solution() - Constructor for class g1201_1300.s1220_count_vowels_permutation.Solution

Solution() - Constructor for class g1201_1300.s1221_split_a_string_in_balanced_strings.Solution

Solution() - Constructor for class g1201_1300.s1222_queens_that_can_attack_the_king.Solution

Solution() - Constructor for class g1201_1300.s1223_dice_roll_simulation.Solution

Solution() - Constructor for class g1201_1300.s1224_maximum_equal_frequency.Solution

Solution() - Constructor for class g1201_1300.s1227_airplane_seat_assignment_probability.Solution

Solution() - Constructor for class g1201_1300.s1232_check_if_it_is_a_straight_line.Solution

Solution() - Constructor for class g1201_1300.s1233_remove_sub_folders_from_the_filesystem.Solution

Solution() - Constructor for class g1201_1300.s1234_replace_the_substring_for_balanced_string.Solution

Solution() - Constructor for class g1201_1300.s1235_maximum_profit_in_job_scheduling.Solution

Solution() - Constructor for class g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation.Solution

Solution() - Constructor for class g1201_1300.s1238_circular_permutation_in_binary_representation.Solution

Solution() - Constructor for class g1201_1300.s1239_maximum_length_of_a_concatenated_string_with_unique_characters.Solution

Solution() - Constructor for class g1201_1300.s1240_tiling_a_rectangle_with_the_fewest_squares.Solution

Solution() - Constructor for class g1201_1300.s1247_minimum_swaps_to_make_strings_equal.Solution

Solution() - Constructor for class g1201_1300.s1248_count_number_of_nice_subarrays.Solution

Solution() - Constructor for class g1201_1300.s1249_minimum_remove_to_make_valid_parentheses.Solution

Solution() - Constructor for class g1201_1300.s1250_check_if_it_is_a_good_array.Solution

Solution() - Constructor for class g1201_1300.s1252_cells_with_odd_values_in_a_matrix.Solution

Solution() - Constructor for class g1201_1300.s1253_reconstruct_a_2_row_binary_matrix.Solution

Solution() - Constructor for class g1201_1300.s1254_number_of_closed_islands.Solution

Solution() - Constructor for class g1201_1300.s1255_maximum_score_words_formed_by_letters.Solution

Solution() - Constructor for class g1201_1300.s1260_shift_2d_grid.Solution

Solution() - Constructor for class g1201_1300.s1262_greatest_sum_divisible_by_three.Solution

Solution() - Constructor for class g1201_1300.s1263_minimum_moves_to_move_a_box_to_their_target_location.Solution

Solution() - Constructor for class g1201_1300.s1266_minimum_time_visiting_all_points.Solution

Solution() - Constructor for class g1201_1300.s1267_count_servers_that_communicate.Solution

Solution() - Constructor for class g1201_1300.s1268_search_suggestions_system.Solution

Solution() - Constructor for class g1201_1300.s1269_number_of_ways_to_stay_in_the_same_place_after_some_steps.Solution

Solution() - Constructor for class g1201_1300.s1275_find_winner_on_a_tic_tac_toe_game.Solution

Solution() - Constructor for class g1201_1300.s1276_number_of_burgers_with_no_waste_of_ingredients.Solution

Solution() - Constructor for class g1201_1300.s1277_count_square_submatrices_with_all_ones.Solution

Solution() - Constructor for class g1201_1300.s1278_palindrome_partitioning_iii.Solution

Solution() - Constructor for class g1201_1300.s1281_subtract_the_product_and_sum_of_digits_of_an_integer.Solution

Solution() - Constructor for class g1201_1300.s1282_group_the_people_given_the_group_size_they_belong_to.Solution

Solution() - Constructor for class g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold.Solution

Solution() - Constructor for class g1201_1300.s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix.Solution

Solution() - Constructor for class g1201_1300.s1287_element_appearing_more_than_25_in_sorted_array.Solution

Solution() - Constructor for class g1201_1300.s1288_remove_covered_intervals.Solution

Solution() - Constructor for class g1201_1300.s1289_minimum_falling_path_sum_ii.Solution

Solution() - Constructor for class g1201_1300.s1290_convert_binary_number_in_a_linked_list_to_integer.Solution

Solution() - Constructor for class g1201_1300.s1291_sequential_digits.Solution

Solution() - Constructor for class g1201_1300.s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold.Solution

Solution() - Constructor for class g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination.Solution

Solution() - Constructor for class g1201_1300.s1295_find_numbers_with_even_number_of_digits.Solution

Solution() - Constructor for class g1201_1300.s1296_divide_array_in_sets_of_k_consecutive_numbers.Solution

Solution() - Constructor for class g1201_1300.s1297_maximum_number_of_occurrences_of_a_substring.Solution

Solution() - Constructor for class g1201_1300.s1298_maximum_candies_you_can_get_from_boxes.Solution

Solution() - Constructor for class g1201_1300.s1299_replace_elements_with_greatest_element_on_right_side.Solution

Solution() - Constructor for class g1201_1300.s1300_sum_of_mutated_array_closest_to_target.Solution

Solution() - Constructor for class g1301_1400.s1301_number_of_paths_with_max_score.Solution

Solution() - Constructor for class g1301_1400.s1302_deepest_leaves_sum.Solution

Solution() - Constructor for class g1301_1400.s1304_find_n_unique_integers_sum_up_to_zero.Solution

Solution() - Constructor for class g1301_1400.s1305_all_elements_in_two_binary_search_trees.Solution

Solution() - Constructor for class g1301_1400.s1306_jump_game_iii.Solution

Solution() - Constructor for class g1301_1400.s1307_verbal_arithmetic_puzzle.Solution

Solution() - Constructor for class g1301_1400.s1309_decrypt_string_from_alphabet_to_integer_mapping.Solution

Solution() - Constructor for class g1301_1400.s1310_xor_queries_of_a_subarray.Solution

Solution() - Constructor for class g1301_1400.s1311_get_watched_videos_by_your_friends.Solution

Solution() - Constructor for class g1301_1400.s1312_minimum_insertion_steps_to_make_a_string_palindrome.Solution

Solution() - Constructor for class g1301_1400.s1313_decompress_run_length_encoded_list.Solution

Solution() - Constructor for class g1301_1400.s1314_matrix_block_sum.Solution

Solution() - Constructor for class g1301_1400.s1315_sum_of_nodes_with_even_valued_grandparent.Solution

Solution() - Constructor for class g1301_1400.s1316_distinct_echo_substrings.Solution

Solution() - Constructor for class g1301_1400.s1317_convert_integer_to_the_sum_of_two_no_zero_integers.Solution

Solution() - Constructor for class g1301_1400.s1318_minimum_flips_to_make_a_or_b_equal_to_c.Solution

Solution() - Constructor for class g1301_1400.s1319_number_of_operations_to_make_network_connected.Solution

Solution() - Constructor for class g1301_1400.s1320_minimum_distance_to_type_a_word_using_two_fingers.Solution

Solution() - Constructor for class g1301_1400.s1323_maximum_69_number.Solution

Solution() - Constructor for class g1301_1400.s1324_print_words_vertically.Solution

Solution() - Constructor for class g1301_1400.s1325_delete_leaves_with_a_given_value.Solution

Solution() - Constructor for class g1301_1400.s1326_minimum_number_of_taps_to_open_to_water_a_garden.Solution

Solution() - Constructor for class g1301_1400.s1328_break_a_palindrome.Solution

Solution() - Constructor for class g1301_1400.s1329_sort_the_matrix_diagonally.Solution

Solution() - Constructor for class g1301_1400.s1330_reverse_subarray_to_maximize_array_value.Solution

Solution() - Constructor for class g1301_1400.s1331_rank_transform_of_an_array.Solution

Solution() - Constructor for class g1301_1400.s1332_remove_palindromic_subsequences.Solution

Solution() - Constructor for class g1301_1400.s1333_filter_restaurants_by_vegan_friendly_price_and_distance.Solution

Solution() - Constructor for class g1301_1400.s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance.Solution

Solution() - Constructor for class g1301_1400.s1335_minimum_difficulty_of_a_job_schedule.Solution

Solution() - Constructor for class g1301_1400.s1337_the_k_weakest_rows_in_a_matrix.Solution

Solution() - Constructor for class g1301_1400.s1338_reduce_array_size_to_the_half.Solution

Solution() - Constructor for class g1301_1400.s1339_maximum_product_of_splitted_binary_tree.Solution

Solution() - Constructor for class g1301_1400.s1340_jump_game_v.Solution

Solution() - Constructor for class g1301_1400.s1342_number_of_steps_to_reduce_a_number_to_zero.Solution

Solution() - Constructor for class g1301_1400.s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold.Solution

Solution() - Constructor for class g1301_1400.s1344_angle_between_hands_of_a_clock.Solution

Solution() - Constructor for class g1301_1400.s1345_jump_game_iv.Solution

Solution() - Constructor for class g1301_1400.s1346_check_if_n_and_its_double_exist.Solution

Solution() - Constructor for class g1301_1400.s1347_minimum_number_of_steps_to_make_two_strings_anagram.Solution

Solution() - Constructor for class g1301_1400.s1349_maximum_students_taking_exam.Solution

Solution() - Constructor for class g1301_1400.s1351_count_negative_numbers_in_a_sorted_matrix.Solution

Solution() - Constructor for class g1301_1400.s1353_maximum_number_of_events_that_can_be_attended.Solution

Solution() - Constructor for class g1301_1400.s1354_construct_target_array_with_multiple_sums.Solution

Solution() - Constructor for class g1301_1400.s1356_sort_integers_by_the_number_of_1_bits.Solution

Solution() - Constructor for class g1301_1400.s1358_number_of_substrings_containing_all_three_characters.Solution

Solution() - Constructor for class g1301_1400.s1359_count_all_valid_pickup_and_delivery_options.Solution

Solution() - Constructor for class g1301_1400.s1360_number_of_days_between_two_dates.Solution

Solution() - Constructor for class g1301_1400.s1361_validate_binary_tree_nodes.Solution

Solution() - Constructor for class g1301_1400.s1362_closest_divisors.Solution

Solution() - Constructor for class g1301_1400.s1363_largest_multiple_of_three.Solution

Solution() - Constructor for class g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number.Solution

Solution() - Constructor for class g1301_1400.s1366_rank_teams_by_votes.Solution

Solution() - Constructor for class g1301_1400.s1367_linked_list_in_binary_tree.Solution

Solution() - Constructor for class g1301_1400.s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid.Solution

Solution() - Constructor for class g1301_1400.s1370_increasing_decreasing_string.Solution

Solution() - Constructor for class g1301_1400.s1371_find_the_longest_substring_containing_vowels_in_even_counts.Solution

Solution() - Constructor for class g1301_1400.s1372_longest_zigzag_path_in_a_binary_tree.Solution

Solution() - Constructor for class g1301_1400.s1373_maximum_sum_bst_in_binary_tree.Solution

Solution() - Constructor for class g1301_1400.s1374_generate_a_string_with_characters_that_have_odd_counts.Solution

Solution() - Constructor for class g1301_1400.s1375_number_of_times_binary_string_is_prefix_aligned.Solution

Solution() - Constructor for class g1301_1400.s1376_time_needed_to_inform_all_employees.Solution

Solution() - Constructor for class g1301_1400.s1377_frog_position_after_t_seconds.Solution

Solution() - Constructor for class g1301_1400.s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree.Solution

Solution() - Constructor for class g1301_1400.s1380_lucky_numbers_in_a_matrix.Solution

Solution() - Constructor for class g1301_1400.s1382_balance_a_binary_search_tree.Solution

Solution() - Constructor for class g1301_1400.s1383_maximum_performance_of_a_team.Solution

Solution() - Constructor for class g1301_1400.s1385_find_the_distance_value_between_two_arrays.Solution

Solution() - Constructor for class g1301_1400.s1386_cinema_seat_allocation.Solution

Solution() - Constructor for class g1301_1400.s1387_sort_integers_by_the_power_value.Solution

Solution() - Constructor for class g1301_1400.s1388_pizza_with_3n_slices.Solution

Solution() - Constructor for class g1301_1400.s1389_create_target_array_in_the_given_order.Solution

Solution() - Constructor for class g1301_1400.s1390_four_divisors.Solution

Solution() - Constructor for class g1301_1400.s1391_check_if_there_is_a_valid_path_in_a_grid.Solution

Solution() - Constructor for class g1301_1400.s1392_longest_happy_prefix.Solution

Solution() - Constructor for class g1301_1400.s1394_find_lucky_integer_in_an_array.Solution

Solution() - Constructor for class g1301_1400.s1395_count_number_of_teams.Solution

Solution() - Constructor for class g1301_1400.s1397_find_all_good_strings.Solution

Solution() - Constructor for class g1301_1400.s1399_count_largest_group.Solution

Solution() - Constructor for class g1301_1400.s1400_construct_k_palindrome_strings.Solution

Solution() - Constructor for class g1401_1500.s1401_circle_and_rectangle_overlapping.Solution

Solution() - Constructor for class g1401_1500.s1402_reducing_dishes.Solution

Solution() - Constructor for class g1401_1500.s1403_minimum_subsequence_in_non_increasing_order.Solution

Solution() - Constructor for class g1401_1500.s1404_number_of_steps_to_reduce_a_number_in_binary_representation_to_one.Solution

Solution() - Constructor for class g1401_1500.s1405_longest_happy_string.Solution

Solution() - Constructor for class g1401_1500.s1406_stone_game_iii.Solution

Solution() - Constructor for class g1401_1500.s1408_string_matching_in_an_array.Solution

Solution() - Constructor for class g1401_1500.s1409_queries_on_a_permutation_with_key.Solution

Solution() - Constructor for class g1401_1500.s1410_html_entity_parser.Solution

Solution() - Constructor for class g1401_1500.s1411_number_of_ways_to_paint_n_3_grid.Solution

Solution() - Constructor for class g1401_1500.s1413_minimum_value_to_get_positive_step_by_step_sum.Solution

Solution() - Constructor for class g1401_1500.s1414_find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k.Solution

Solution() - Constructor for class g1401_1500.s1415_the_k_th_lexicographical_string_of_all_happy_strings_of_length_n.Solution

Solution() - Constructor for class g1401_1500.s1416_restore_the_array.Solution

Solution() - Constructor for class g1401_1500.s1417_reformat_the_string.Solution

Solution() - Constructor for class g1401_1500.s1418_display_table_of_food_orders_in_a_restaurant.Solution

Solution() - Constructor for class g1401_1500.s1419_minimum_number_of_frogs_croaking.Solution

Solution() - Constructor for class g1401_1500.s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons.Solution

Solution() - Constructor for class g1401_1500.s1422_maximum_score_after_splitting_a_string.Solution

Solution() - Constructor for class g1401_1500.s1423_maximum_points_you_can_obtain_from_cards.Solution

Solution() - Constructor for class g1401_1500.s1424_diagonal_traverse_ii.Solution

Solution() - Constructor for class g1401_1500.s1425_constrained_subsequence_sum.Solution

Solution() - Constructor for class g1401_1500.s1431_kids_with_the_greatest_number_of_candies.Solution

Solution() - Constructor for class g1401_1500.s1432_max_difference_you_can_get_from_changing_an_integer.Solution

Solution() - Constructor for class g1401_1500.s1433_check_if_a_string_can_break_another_string.Solution

Solution() - Constructor for class g1401_1500.s1434_number_of_ways_to_wear_different_hats_to_each_other.Solution

Solution() - Constructor for class g1401_1500.s1436_destination_city.Solution

Solution() - Constructor for class g1401_1500.s1437_check_if_all_1s_are_at_least_length_k_places_away.Solution

Solution() - Constructor for class g1401_1500.s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit.Solution

Solution() - Constructor for class g1401_1500.s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows.Solution

Solution() - Constructor for class g1401_1500.s1441_build_an_array_with_stack_operations.Solution

Solution() - Constructor for class g1401_1500.s1442_count_triplets_that_can_form_two_arrays_of_equal_xor.Solution

Solution() - Constructor for class g1401_1500.s1443_minimum_time_to_collect_all_apples_in_a_tree.Solution

Solution() - Constructor for class g1401_1500.s1444_number_of_ways_of_cutting_a_pizza.Solution

Solution() - Constructor for class g1401_1500.s1446_consecutive_characters.Solution

Solution() - Constructor for class g1401_1500.s1447_simplified_fractions.Solution

Solution() - Constructor for class g1401_1500.s1448_count_good_nodes_in_binary_tree.Solution

Solution() - Constructor for class g1401_1500.s1449_form_largest_integer_with_digits_that_add_up_to_target.Solution

Solution() - Constructor for class g1401_1500.s1450_number_of_students_doing_homework_at_a_given_time.Solution

Solution() - Constructor for class g1401_1500.s1451_rearrange_words_in_a_sentence.Solution

Solution() - Constructor for class g1401_1500.s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list.Solution

Solution() - Constructor for class g1401_1500.s1453_maximum_number_of_darts_inside_of_a_circular_dartboard.Solution

Solution() - Constructor for class g1401_1500.s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence.Solution

Solution() - Constructor for class g1401_1500.s1456_maximum_number_of_vowels_in_a_substring_of_given_length.Solution

Solution() - Constructor for class g1401_1500.s1457_pseudo_palindromic_paths_in_a_binary_tree.Solution

Solution() - Constructor for class g1401_1500.s1458_max_dot_product_of_two_subsequences.Solution

Solution() - Constructor for class g1401_1500.s1460_make_two_arrays_equal_by_reversing_sub_arrays.Solution

Solution() - Constructor for class g1401_1500.s1461_check_if_a_string_contains_all_binary_codes_of_size_k.Solution

Solution() - Constructor for class g1401_1500.s1462_course_schedule_iv.Solution

Solution() - Constructor for class g1401_1500.s1463_cherry_pickup_ii.Solution

Solution() - Constructor for class g1401_1500.s1464_maximum_product_of_two_elements_in_an_array.Solution

Solution() - Constructor for class g1401_1500.s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts.Solution

Solution() - Constructor for class g1401_1500.s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero.Solution

Solution() - Constructor for class g1401_1500.s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls.Solution

Solution() - Constructor for class g1401_1500.s1470_shuffle_the_array.Solution

Solution() - Constructor for class g1401_1500.s1471_the_k_strongest_values_in_an_array.Solution

Solution() - Constructor for class g1401_1500.s1473_paint_house_iii.Solution

Solution() - Constructor for class g1401_1500.s1475_final_prices_with_a_special_discount_in_a_shop.Solution

Solution() - Constructor for class g1401_1500.s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum.Solution

Solution() - Constructor for class g1401_1500.s1478_allocate_mailboxes.Solution

Solution() - Constructor for class g1401_1500.s1480_running_sum_of_1d_array.Solution

Solution() - Constructor for class g1401_1500.s1481_least_number_of_unique_integers_after_k_removals.Solution

Solution() - Constructor for class g1401_1500.s1482_minimum_number_of_days_to_make_m_bouquets.Solution

Solution() - Constructor for class g1401_1500.s1486_xor_operation_in_an_array.Solution

Solution() - Constructor for class g1401_1500.s1487_making_file_names_unique.Solution

Solution() - Constructor for class g1401_1500.s1488_avoid_flood_in_the_city.Solution

Solution() - Constructor for class g1401_1500.s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree.Solution

Solution() - Constructor for class g1401_1500.s1491_average_salary_excluding_the_minimum_and_maximum_salary.Solution

Solution() - Constructor for class g1401_1500.s1492_the_kth_factor_of_n.Solution

Solution() - Constructor for class g1401_1500.s1493_longest_subarray_of_1s_after_deleting_one_element.Solution

Solution() - Constructor for class g1401_1500.s1494_parallel_courses_ii.Solution

Solution() - Constructor for class g1401_1500.s1496_path_crossing.Solution

Solution() - Constructor for class g1401_1500.s1497_check_if_array_pairs_are_divisible_by_k.Solution

Solution() - Constructor for class g1401_1500.s1498_number_of_subsequences_that_satisfy_the_given_sum_condition.Solution

Solution() - Constructor for class g1401_1500.s1499_max_value_of_equation.Solution

Solution() - Constructor for class g1501_1600.s1502_can_make_arithmetic_progression_from_sequence.Solution

Solution() - Constructor for class g1501_1600.s1503_last_moment_before_all_ants_fall_out_of_a_plank.Solution

Solution() - Constructor for class g1501_1600.s1504_count_submatrices_with_all_ones.Solution

Solution() - Constructor for class g1501_1600.s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits.Solution

Solution() - Constructor for class g1501_1600.s1507_reformat_date.Solution

Solution() - Constructor for class g1501_1600.s1508_range_sum_of_sorted_subarray_sums.Solution

Solution() - Constructor for class g1501_1600.s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves.Solution

Solution() - Constructor for class g1501_1600.s1510_stone_game_iv.Solution

Solution() - Constructor for class g1501_1600.s1512_number_of_good_pairs.Solution

Solution() - Constructor for class g1501_1600.s1513_number_of_substrings_with_only_1s.Solution

Solution() - Constructor for class g1501_1600.s1514_path_with_maximum_probability.Solution

Solution() - Constructor for class g1501_1600.s1515_best_position_for_a_service_centre.Solution

Solution() - Constructor for class g1501_1600.s1518_water_bottles.Solution

Solution() - Constructor for class g1501_1600.s1519_number_of_nodes_in_the_sub_tree_with_the_same_label.Solution

Solution() - Constructor for class g1501_1600.s1520_maximum_number_of_non_overlapping_substrings.Solution

Solution() - Constructor for class g1501_1600.s1521_find_a_value_of_a_mysterious_function_closest_to_target.Solution

Solution() - Constructor for class g1501_1600.s1523_count_odd_numbers_in_an_interval_range.Solution

Solution() - Constructor for class g1501_1600.s1524_number_of_sub_arrays_with_odd_sum.Solution

Solution() - Constructor for class g1501_1600.s1525_number_of_good_ways_to_split_a_string.Solution

Solution() - Constructor for class g1501_1600.s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array.Solution

Solution() - Constructor for class g1501_1600.s1528_shuffle_string.Solution

Solution() - Constructor for class g1501_1600.s1529_bulb_switcher_iv.Solution

Solution() - Constructor for class g1501_1600.s1530_number_of_good_leaf_nodes_pairs.Solution

Solution() - Constructor for class g1501_1600.s1531_string_compression_ii.Solution

Solution() - Constructor for class g1501_1600.s1534_count_good_triplets.Solution

Solution() - Constructor for class g1501_1600.s1535_find_the_winner_of_an_array_game.Solution

Solution() - Constructor for class g1501_1600.s1536_minimum_swaps_to_arrange_a_binary_grid.Solution

Solution() - Constructor for class g1501_1600.s1537_get_the_maximum_score.Solution

Solution() - Constructor for class g1501_1600.s1539_kth_missing_positive_number.Solution

Solution() - Constructor for class g1501_1600.s1540_can_convert_string_in_k_moves.Solution

Solution() - Constructor for class g1501_1600.s1541_minimum_insertions_to_balance_a_parentheses_string.Solution

Solution() - Constructor for class g1501_1600.s1542_find_longest_awesome_substring.Solution

Solution() - Constructor for class g1501_1600.s1544_make_the_string_great.Solution

Solution() - Constructor for class g1501_1600.s1545_find_kth_bit_in_nth_binary_string.Solution

Solution() - Constructor for class g1501_1600.s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target.Solution

Solution() - Constructor for class g1501_1600.s1547_minimum_cost_to_cut_a_stick.Solution

Solution() - Constructor for class g1501_1600.s1550_three_consecutive_odds.Solution

Solution() - Constructor for class g1501_1600.s1551_minimum_operations_to_make_array_equal.Solution

Solution() - Constructor for class g1501_1600.s1552_magnetic_force_between_two_balls.Solution

Solution() - Constructor for class g1501_1600.s1553_minimum_number_of_days_to_eat_n_oranges.Solution

Solution() - Constructor for class g1501_1600.s1556_thousand_separator.Solution

Solution() - Constructor for class g1501_1600.s1557_minimum_number_of_vertices_to_reach_all_nodes.Solution

Solution() - Constructor for class g1501_1600.s1558_minimum_numbers_of_function_calls_to_make_target_array.Solution

Solution() - Constructor for class g1501_1600.s1559_detect_cycles_in_2d_grid.Solution

Solution() - Constructor for class g1501_1600.s1560_most_visited_sector_in_a_circular_track.Solution

Solution() - Constructor for class g1501_1600.s1561_maximum_number_of_coins_you_can_get.Solution

Solution() - Constructor for class g1501_1600.s1562_find_latest_group_of_size_m.Solution

Solution() - Constructor for class g1501_1600.s1563_stone_game_v.Solution

Solution() - Constructor for class g1501_1600.s1566_detect_pattern_of_length_m_repeated_k_or_more_times.Solution

Solution() - Constructor for class g1501_1600.s1567_maximum_length_of_subarray_with_positive_product.Solution

Solution() - Constructor for class g1501_1600.s1568_minimum_number_of_days_to_disconnect_island.Solution

Solution() - Constructor for class g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution

Solution() - Constructor for class g1501_1600.s1572_matrix_diagonal_sum.Solution

Solution() - Constructor for class g1501_1600.s1573_number_of_ways_to_split_a_string.Solution

Solution() - Constructor for class g1501_1600.s1574_shortest_subarray_to_be_removed_to_make_array_sorted.Solution

Solution() - Constructor for class g1501_1600.s1575_count_all_possible_routes.Solution

Solution() - Constructor for class g1501_1600.s1576_replace_all_s_to_avoid_consecutive_repeating_characters.Solution

Solution() - Constructor for class g1501_1600.s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers.Solution

Solution() - Constructor for class g1501_1600.s1578_minimum_time_to_make_rope_colorful.Solution

Solution() - Constructor for class g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable.Solution

Solution() - Constructor for class g1501_1600.s1582_special_positions_in_a_binary_matrix.Solution

Solution() - Constructor for class g1501_1600.s1583_count_unhappy_friends.Solution

Solution() - Constructor for class g1501_1600.s1584_min_cost_to_connect_all_points.Solution

Solution() - Constructor for class g1501_1600.s1585_check_if_string_is_transformable_with_substring_sort_operations.Solution

Solution() - Constructor for class g1501_1600.s1588_sum_of_all_odd_length_subarrays.Solution

Solution() - Constructor for class g1501_1600.s1589_maximum_sum_obtained_of_any_permutation.Solution

Solution() - Constructor for class g1501_1600.s1590_make_sum_divisible_by_p.Solution

Solution() - Constructor for class g1501_1600.s1591_strange_printer_ii.Solution

Solution() - Constructor for class g1501_1600.s1592_rearrange_spaces_between_words.Solution

Solution() - Constructor for class g1501_1600.s1593_split_a_string_into_the_max_number_of_unique_substrings.Solution

Solution() - Constructor for class g1501_1600.s1594_maximum_non_negative_product_in_a_matrix.Solution

Solution() - Constructor for class g1501_1600.s1595_minimum_cost_to_connect_two_groups_of_points.Solution

Solution() - Constructor for class g1501_1600.s1598_crawler_log_folder.Solution

Solution() - Constructor for class g1501_1600.s1599_maximum_profit_of_operating_a_centennial_wheel.Solution

Solution() - Constructor for class g1601_1700.s1601_maximum_number_of_achievable_transfer_requests.Solution

Solution() - Constructor for class g1601_1700.s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period.Solution

Solution() - Constructor for class g1601_1700.s1605_find_valid_matrix_given_row_and_column_sums.Solution

Solution() - Constructor for class g1601_1700.s1606_find_servers_that_handled_most_number_of_requests.Solution

Solution() - Constructor for class g1601_1700.s1608_special_array_with_x_elements_greater_than_or_equal_x.Solution

Solution() - Constructor for class g1601_1700.s1609_even_odd_tree.Solution

Solution() - Constructor for class g1601_1700.s1610_maximum_number_of_visible_points.Solution

Solution() - Constructor for class g1601_1700.s1611_minimum_one_bit_operations_to_make_integers_zero.Solution

Solution() - Constructor for class g1601_1700.s1614_maximum_nesting_depth_of_the_parentheses.Solution

Solution() - Constructor for class g1601_1700.s1615_maximal_network_rank.Solution

Solution() - Constructor for class g1601_1700.s1616_split_two_strings_to_make_palindrome.Solution

Solution() - Constructor for class g1601_1700.s1617_count_subtrees_with_max_distance_between_cities.Solution

Solution() - Constructor for class g1601_1700.s1619_mean_of_array_after_removing_some_elements.Solution

Solution() - Constructor for class g1601_1700.s1620_coordinate_with_maximum_network_quality.Solution

Solution() - Constructor for class g1601_1700.s1621_number_of_sets_of_k_non_overlapping_line_segments.Solution

Solution() - Constructor for class g1601_1700.s1624_largest_substring_between_two_equal_characters.Solution

Solution() - Constructor for class g1601_1700.s1625_lexicographically_smallest_string_after_applying_operations.Solution

Solution() - Constructor for class g1601_1700.s1626_best_team_with_no_conflicts.Solution

Solution() - Constructor for class g1601_1700.s1627_graph_connectivity_with_threshold.Solution

Solution() - Constructor for class g1601_1700.s1629_slowest_key.Solution

Solution() - Constructor for class g1601_1700.s1630_arithmetic_subarrays.Solution

Solution() - Constructor for class g1601_1700.s1631_path_with_minimum_effort.Solution

Solution() - Constructor for class g1601_1700.s1632_rank_transform_of_a_matrix.Solution

Solution() - Constructor for class g1601_1700.s1636_sort_array_by_increasing_frequency.Solution

Solution() - Constructor for class g1601_1700.s1637_widest_vertical_area_between_two_points_containing_no_points.Solution

Solution() - Constructor for class g1601_1700.s1638_count_substrings_that_differ_by_one_character.Solution

Solution() - Constructor for class g1601_1700.s1639_number_of_ways_to_form_a_target_string_given_a_dictionary.Solution

Solution() - Constructor for class g1601_1700.s1640_check_array_formation_through_concatenation.Solution

Solution() - Constructor for class g1601_1700.s1641_count_sorted_vowel_strings.Solution

Solution() - Constructor for class g1601_1700.s1642_furthest_building_you_can_reach.Solution

Solution() - Constructor for class g1601_1700.s1643_kth_smallest_instructions.Solution

Solution() - Constructor for class g1601_1700.s1646_get_maximum_in_generated_array.Solution

Solution() - Constructor for class g1601_1700.s1647_minimum_deletions_to_make_character_frequencies_unique.Solution

Solution() - Constructor for class g1601_1700.s1648_sell_diminishing_valued_colored_balls.Solution

Solution() - Constructor for class g1601_1700.s1649_create_sorted_array_through_instructions.Solution

Solution() - Constructor for class g1601_1700.s1652_defuse_the_bomb.Solution

Solution() - Constructor for class g1601_1700.s1653_minimum_deletions_to_make_string_balanced.Solution

Solution() - Constructor for class g1601_1700.s1654_minimum_jumps_to_reach_home.Solution

Solution() - Constructor for class g1601_1700.s1655_distribute_repeating_integers.Solution

Solution() - Constructor for class g1601_1700.s1657_determine_if_two_strings_are_close.Solution

Solution() - Constructor for class g1601_1700.s1658_minimum_operations_to_reduce_x_to_zero.Solution

Solution() - Constructor for class g1601_1700.s1659_maximize_grid_happiness.Solution

Solution() - Constructor for class g1601_1700.s1662_check_if_two_string_arrays_are_equivalent.Solution

Solution() - Constructor for class g1601_1700.s1663_smallest_string_with_a_given_numeric_value.Solution

Solution() - Constructor for class g1601_1700.s1664_ways_to_make_a_fair_array.Solution

Solution() - Constructor for class g1601_1700.s1665_minimum_initial_energy_to_finish_tasks.Solution

Solution() - Constructor for class g1601_1700.s1668_maximum_repeating_substring.Solution

Solution() - Constructor for class g1601_1700.s1669_merge_in_between_linked_lists.Solution

Solution() - Constructor for class g1601_1700.s1671_minimum_number_of_removals_to_make_mountain_array.Solution

Solution() - Constructor for class g1601_1700.s1672_richest_customer_wealth.Solution

Solution() - Constructor for class g1601_1700.s1673_find_the_most_competitive_subsequence.Solution

Solution() - Constructor for class g1601_1700.s1674_minimum_moves_to_make_array_complementary.Solution

Solution() - Constructor for class g1601_1700.s1675_minimize_deviation_in_array.Solution

Solution() - Constructor for class g1601_1700.s1678_goal_parser_interpretation.Solution

Solution() - Constructor for class g1601_1700.s1679_max_number_of_k_sum_pairs.Solution

Solution() - Constructor for class g1601_1700.s1680_concatenation_of_consecutive_binary_numbers.Solution

Solution() - Constructor for class g1601_1700.s1681_minimum_incompatibility.Solution

Solution() - Constructor for class g1601_1700.s1684_count_the_number_of_consistent_strings.Solution

Solution() - Constructor for class g1601_1700.s1685_sum_of_absolute_differences_in_a_sorted_array.Solution

Solution() - Constructor for class g1601_1700.s1686_stone_game_vi.Solution

Solution() - Constructor for class g1601_1700.s1687_delivering_boxes_from_storage_to_ports.Solution

Solution() - Constructor for class g1601_1700.s1688_count_of_matches_in_tournament.Solution

Solution() - Constructor for class g1601_1700.s1689_partitioning_into_minimum_number_of_deci_binary_numbers.Solution

Solution() - Constructor for class g1601_1700.s1690_stone_game_vii.Solution

Solution() - Constructor for class g1601_1700.s1691_maximum_height_by_stacking_cuboids.Solution

Solution() - Constructor for class g1601_1700.s1694_reformat_phone_number.Solution

Solution() - Constructor for class g1601_1700.s1695_maximum_erasure_value.Solution

Solution() - Constructor for class g1601_1700.s1696_jump_game_vi.Solution

Solution() - Constructor for class g1601_1700.s1697_checking_existence_of_edge_length_limited_paths.Solution

Solution() - Constructor for class g1601_1700.s1700_number_of_students_unable_to_eat_lunch.Solution

Solution() - Constructor for class g1701_1800.s1701_average_waiting_time.Solution

Solution() - Constructor for class g1701_1800.s1702_maximum_binary_string_after_change.Solution

Solution() - Constructor for class g1701_1800.s1703_minimum_adjacent_swaps_for_k_consecutive_ones.Solution

Solution() - Constructor for class g1701_1800.s1704_determine_if_string_halves_are_alike.Solution

Solution() - Constructor for class g1701_1800.s1705_maximum_number_of_eaten_apples.Solution

Solution() - Constructor for class g1701_1800.s1706_where_will_the_ball_fall.Solution

Solution() - Constructor for class g1701_1800.s1707_maximum_xor_with_an_element_from_array.Solution

Solution() - Constructor for class g1701_1800.s1710_maximum_units_on_a_truck.Solution

Solution() - Constructor for class g1701_1800.s1711_count_good_meals.Solution

Solution() - Constructor for class g1701_1800.s1712_ways_to_split_array_into_three_subarrays.Solution

Solution() - Constructor for class g1701_1800.s1713_minimum_operations_to_make_a_subsequence.Solution

Solution() - Constructor for class g1701_1800.s1716_calculate_money_in_leetcode_bank.Solution

Solution() - Constructor for class g1701_1800.s1717_maximum_score_from_removing_substrings.Solution

Solution() - Constructor for class g1701_1800.s1718_construct_the_lexicographically_largest_valid_sequence.Solution

Solution() - Constructor for class g1701_1800.s1719_number_of_ways_to_reconstruct_a_tree.Solution

Solution() - Constructor for class g1701_1800.s1720_decode_xored_array.Solution

Solution() - Constructor for class g1701_1800.s1721_swapping_nodes_in_a_linked_list.Solution

Solution() - Constructor for class g1701_1800.s1722_minimize_hamming_distance_after_swap_operations.Solution

Solution() - Constructor for class g1701_1800.s1723_find_minimum_time_to_finish_all_jobs.Solution

Solution() - Constructor for class g1701_1800.s1725_number_of_rectangles_that_can_form_the_largest_square.Solution

Solution() - Constructor for class g1701_1800.s1726_tuple_with_same_product.Solution

Solution() - Constructor for class g1701_1800.s1727_largest_submatrix_with_rearrangements.Solution

Solution() - Constructor for class g1701_1800.s1728_cat_and_mouse_ii.Solution

Solution() - Constructor for class g1701_1800.s1732_find_the_highest_altitude.Solution

Solution() - Constructor for class g1701_1800.s1733_minimum_number_of_people_to_teach.Solution

Solution() - Constructor for class g1701_1800.s1734_decode_xored_permutation.Solution

Solution() - Constructor for class g1701_1800.s1735_count_ways_to_make_array_with_product.Solution

Solution() - Constructor for class g1701_1800.s1736_latest_time_by_replacing_hidden_digits.Solution

Solution() - Constructor for class g1701_1800.s1737_change_minimum_characters_to_satisfy_one_of_three_conditions.Solution

Solution() - Constructor for class g1701_1800.s1738_find_kth_largest_xor_coordinate_value.Solution

Solution() - Constructor for class g1701_1800.s1739_building_boxes.Solution

Solution() - Constructor for class g1701_1800.s1742_maximum_number_of_balls_in_a_box.Solution

Solution() - Constructor for class g1701_1800.s1743_restore_the_array_from_adjacent_pairs.Solution

Solution() - Constructor for class g1701_1800.s1744_can_you_eat_your_favorite_candy_on_your_favorite_day.Solution

Solution() - Constructor for class g1701_1800.s1745_palindrome_partitioning_iv.Solution

Solution() - Constructor for class g1701_1800.s1748_sum_of_unique_elements.Solution

Solution() - Constructor for class g1701_1800.s1749_maximum_absolute_sum_of_any_subarray.Solution

Solution() - Constructor for class g1701_1800.s1750_minimum_length_of_string_after_deleting_similar_ends.Solution

Solution() - Constructor for class g1701_1800.s1751_maximum_number_of_events_that_can_be_attended_ii.Solution

Solution() - Constructor for class g1701_1800.s1752_check_if_array_is_sorted_and_rotated.Solution

Solution() - Constructor for class g1701_1800.s1753_maximum_score_from_removing_stones.Solution

Solution() - Constructor for class g1701_1800.s1754_largest_merge_of_two_strings.Solution

Solution() - Constructor for class g1701_1800.s1755_closest_subsequence_sum.Solution

Solution() - Constructor for class g1701_1800.s1758_minimum_changes_to_make_alternating_binary_string.Solution

Solution() - Constructor for class g1701_1800.s1759_count_number_of_homogenous_substrings.Solution

Solution() - Constructor for class g1701_1800.s1760_minimum_limit_of_balls_in_a_bag.Solution

Solution() - Constructor for class g1701_1800.s1761_minimum_degree_of_a_connected_trio_in_a_graph.Solution

Solution() - Constructor for class g1701_1800.s1763_longest_nice_substring.Solution

Solution() - Constructor for class g1701_1800.s1764_form_array_by_concatenating_subarrays_of_another_array.Solution

Solution() - Constructor for class g1701_1800.s1765_map_of_highest_peak.Solution

Solution() - Constructor for class g1701_1800.s1766_tree_of_coprimes.Solution

Solution() - Constructor for class g1701_1800.s1768_merge_strings_alternately.Solution

Solution() - Constructor for class g1701_1800.s1769_minimum_number_of_operations_to_move_all_balls_to_each_box.Solution

Solution() - Constructor for class g1701_1800.s1770_maximum_score_from_performing_multiplication_operations.Solution

Solution() - Constructor for class g1701_1800.s1771_maximize_palindrome_length_from_subsequences.Solution

Solution() - Constructor for class g1701_1800.s1773_count_items_matching_a_rule.Solution

Solution() - Constructor for class g1701_1800.s1774_closest_dessert_cost.Solution

Solution() - Constructor for class g1701_1800.s1775_equal_sum_arrays_with_minimum_number_of_operations.Solution

Solution() - Constructor for class g1701_1800.s1776_car_fleet_ii.Solution

Solution() - Constructor for class g1701_1800.s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate.Solution

Solution() - Constructor for class g1701_1800.s1780_check_if_number_is_a_sum_of_powers_of_three.Solution

Solution() - Constructor for class g1701_1800.s1781_sum_of_beauty_of_all_substrings.Solution

Solution() - Constructor for class g1701_1800.s1782_count_pairs_of_nodes.Solution

Solution() - Constructor for class g1701_1800.s1784_check_if_binary_string_has_at_most_one_segment_of_ones.Solution

Solution() - Constructor for class g1701_1800.s1785_minimum_elements_to_add_to_form_a_given_sum.Solution

Solution() - Constructor for class g1701_1800.s1786_number_of_restricted_paths_from_first_to_last_node.Solution

Solution() - Constructor for class g1701_1800.s1787_make_the_xor_of_all_segments_equal_to_zero.Solution

Solution() - Constructor for class g1701_1800.s1790_check_if_one_string_swap_can_make_strings_equal.Solution

Solution() - Constructor for class g1701_1800.s1791_find_center_of_star_graph.Solution

Solution() - Constructor for class g1701_1800.s1792_maximum_average_pass_ratio.Solution

Solution() - Constructor for class g1701_1800.s1793_maximum_score_of_a_good_subarray.Solution

Solution() - Constructor for class g1701_1800.s1796_second_largest_digit_in_a_string.Solution

Solution() - Constructor for class g1701_1800.s1798_maximum_number_of_consecutive_values_you_can_make.Solution

Solution() - Constructor for class g1701_1800.s1799_maximize_score_after_n_operations.Solution

Solution() - Constructor for class g1701_1800.s1800_maximum_ascending_subarray_sum.Solution

Solution() - Constructor for class g1801_1900.s1801_number_of_orders_in_the_backlog.Solution

Solution() - Constructor for class g1801_1900.s1802_maximum_value_at_a_given_index_in_a_bounded_array.Solution

Solution() - Constructor for class g1801_1900.s1803_count_pairs_with_xor_in_a_range.Solution

Solution() - Constructor for class g1801_1900.s1805_number_of_different_integers_in_a_string.Solution

Solution() - Constructor for class g1801_1900.s1806_minimum_number_of_operations_to_reinitialize_a_permutation.Solution

Solution() - Constructor for class g1801_1900.s1807_evaluate_the_bracket_pairs_of_a_string.Solution

Solution() - Constructor for class g1801_1900.s1808_maximize_number_of_nice_divisors.Solution

Solution() - Constructor for class g1801_1900.s1812_determine_color_of_a_chessboard_square.Solution

Solution() - Constructor for class g1801_1900.s1813_sentence_similarity_iii.Solution

Solution() - Constructor for class g1801_1900.s1814_count_nice_pairs_in_an_array.Solution

Solution() - Constructor for class g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts.Solution

Solution() - Constructor for class g1801_1900.s1816_truncate_sentence.Solution

Solution() - Constructor for class g1801_1900.s1817_finding_the_users_active_minutes.Solution

Solution() - Constructor for class g1801_1900.s1818_minimum_absolute_sum_difference.Solution

Solution() - Constructor for class g1801_1900.s1819_number_of_different_subsequences_gcds.Solution

Solution() - Constructor for class g1801_1900.s1822_sign_of_the_product_of_an_array.Solution

Solution() - Constructor for class g1801_1900.s1823_find_the_winner_of_the_circular_game.Solution

Solution() - Constructor for class g1801_1900.s1824_minimum_sideway_jumps.Solution

Solution() - Constructor for class g1801_1900.s1827_minimum_operations_to_make_the_array_increasing.Solution

Solution() - Constructor for class g1801_1900.s1828_queries_on_number_of_points_inside_a_circle.Solution

Solution() - Constructor for class g1801_1900.s1829_maximum_xor_for_each_query.Solution

Solution() - Constructor for class g1801_1900.s1830_minimum_number_of_operations_to_make_string_sorted.Solution

Solution() - Constructor for class g1801_1900.s1832_check_if_the_sentence_is_pangram.Solution

Solution() - Constructor for class g1801_1900.s1833_maximum_ice_cream_bars.Solution

Solution() - Constructor for class g1801_1900.s1834_single_threaded_cpu.Solution

Solution() - Constructor for class g1801_1900.s1835_find_xor_sum_of_all_pairs_bitwise_and.Solution

Solution() - Constructor for class g1801_1900.s1837_sum_of_digits_in_base_k.Solution

Solution() - Constructor for class g1801_1900.s1838_frequency_of_the_most_frequent_element.Solution

Solution() - Constructor for class g1801_1900.s1839_longest_substring_of_all_vowels_in_order.Solution

Solution() - Constructor for class g1801_1900.s1840_maximum_building_height.Solution

Solution() - Constructor for class g1801_1900.s1844_replace_all_digits_with_characters.Solution

Solution() - Constructor for class g1801_1900.s1846_maximum_element_after_decreasing_and_rearranging.Solution

Solution() - Constructor for class g1801_1900.s1847_closest_room.Solution

Solution() - Constructor for class g1801_1900.s1848_minimum_distance_to_the_target_element.Solution

Solution() - Constructor for class g1801_1900.s1849_splitting_a_string_into_descending_consecutive_values.Solution

Solution() - Constructor for class g1801_1900.s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number.Solution

Solution() - Constructor for class g1801_1900.s1851_minimum_interval_to_include_each_query.Solution

Solution() - Constructor for class g1801_1900.s1854_maximum_population_year.Solution

Solution() - Constructor for class g1801_1900.s1855_maximum_distance_between_a_pair_of_values.Solution

Solution() - Constructor for class g1801_1900.s1856_maximum_subarray_min_product.Solution

Solution() - Constructor for class g1801_1900.s1857_largest_color_value_in_a_directed_graph.Solution

Solution() - Constructor for class g1801_1900.s1859_sorting_the_sentence.Solution

Solution() - Constructor for class g1801_1900.s1860_incremental_memory_leak.Solution

Solution() - Constructor for class g1801_1900.s1861_rotating_the_box.Solution

Solution() - Constructor for class g1801_1900.s1862_sum_of_floored_pairs.Solution

Solution() - Constructor for class g1801_1900.s1863_sum_of_all_subset_xor_totals.Solution

Solution() - Constructor for class g1801_1900.s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating.Solution

Solution() - Constructor for class g1801_1900.s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible.Solution

Solution() - Constructor for class g1801_1900.s1869_longer_contiguous_segments_of_ones_than_zeros.Solution

Solution() - Constructor for class g1801_1900.s1870_minimum_speed_to_arrive_on_time.Solution

Solution() - Constructor for class g1801_1900.s1871_jump_game_vii.Solution

Solution() - Constructor for class g1801_1900.s1872_stone_game_viii.Solution

Solution() - Constructor for class g1801_1900.s1876_substrings_of_size_three_with_distinct_characters.Solution

Solution() - Constructor for class g1801_1900.s1877_minimize_maximum_pair_sum_in_array.Solution

Solution() - Constructor for class g1801_1900.s1878_get_biggest_three_rhombus_sums_in_a_grid.Solution

Solution() - Constructor for class g1801_1900.s1879_minimum_xor_sum_of_two_arrays.Solution

Solution() - Constructor for class g1801_1900.s1880_check_if_word_equals_summation_of_two_words.Solution

Solution() - Constructor for class g1801_1900.s1881_maximum_value_after_insertion.Solution

Solution() - Constructor for class g1801_1900.s1882_process_tasks_using_servers.Solution

Solution() - Constructor for class g1801_1900.s1883_minimum_skips_to_arrive_at_meeting_on_time.Solution

Solution() - Constructor for class g1801_1900.s1884_egg_drop_with_2_eggs_and_n_floors.Solution

Solution() - Constructor for class g1801_1900.s1886_determine_whether_matrix_can_be_obtained_by_rotation.Solution

Solution() - Constructor for class g1801_1900.s1887_reduction_operations_to_make_the_array_elements_equal.Solution

Solution() - Constructor for class g1801_1900.s1888_minimum_number_of_flips_to_make_the_binary_string_alternating.Solution

Solution() - Constructor for class g1801_1900.s1889_minimum_space_wasted_from_packaging.Solution

Solution() - Constructor for class g1801_1900.s1893_check_if_all_the_integers_in_a_range_are_covered.Solution

Solution() - Constructor for class g1801_1900.s1894_find_the_student_that_will_replace_the_chalk.Solution

Solution() - Constructor for class g1801_1900.s1895_largest_magic_square.Solution

Solution() - Constructor for class g1801_1900.s1896_minimum_cost_to_change_the_final_value_of_expression.Solution

Solution() - Constructor for class g1801_1900.s1897_redistribute_characters_to_make_all_strings_equal.Solution

Solution() - Constructor for class g1801_1900.s1898_maximum_number_of_removable_characters.Solution

Solution() - Constructor for class g1801_1900.s1899_merge_triplets_to_form_target_triplet.Solution

Solution() - Constructor for class g1801_1900.s1900_the_earliest_and_latest_rounds_where_players_compete.Solution

Solution() - Constructor for class g1901_2000.s1901_find_a_peak_element_ii.Solution

Solution() - Constructor for class g1901_2000.s1903_largest_odd_number_in_string.Solution

Solution() - Constructor for class g1901_2000.s1904_the_number_of_full_rounds_you_have_played.Solution

Solution() - Constructor for class g1901_2000.s1905_count_sub_islands.Solution

Solution() - Constructor for class g1901_2000.s1906_minimum_absolute_difference_queries.Solution

Solution() - Constructor for class g1901_2000.s1909_remove_one_element_to_make_the_array_strictly_increasing.Solution

Solution() - Constructor for class g1901_2000.s1910_remove_all_occurrences_of_a_substring.Solution

Solution() - Constructor for class g1901_2000.s1911_maximum_alternating_subsequence_sum.Solution

Solution() - Constructor for class g1901_2000.s1913_maximum_product_difference_between_two_pairs.Solution

Solution() - Constructor for class g1901_2000.s1914_cyclically_rotating_a_grid.Solution

Solution() - Constructor for class g1901_2000.s1915_number_of_wonderful_substrings.Solution

Solution() - Constructor for class g1901_2000.s1916_count_ways_to_build_rooms_in_an_ant_colony.Solution

Solution() - Constructor for class g1901_2000.s1920_build_array_from_permutation.Solution

Solution() - Constructor for class g1901_2000.s1921_eliminate_maximum_number_of_monsters.Solution

Solution() - Constructor for class g1901_2000.s1922_count_good_numbers.Solution

Solution() - Constructor for class g1901_2000.s1923_longest_common_subpath.Solution

Solution() - Constructor for class g1901_2000.s1925_count_square_sum_triples.Solution

Solution() - Constructor for class g1901_2000.s1926_nearest_exit_from_entrance_in_maze.Solution

Solution() - Constructor for class g1901_2000.s1927_sum_game.Solution

Solution() - Constructor for class g1901_2000.s1928_minimum_cost_to_reach_destination_in_time.Solution

Solution() - Constructor for class g1901_2000.s1929_concatenation_of_array.Solution

Solution() - Constructor for class g1901_2000.s1930_unique_length_3_palindromic_subsequences.Solution

Solution() - Constructor for class g1901_2000.s1931_painting_a_grid_with_three_different_colors.Solution

Solution() - Constructor for class g1901_2000.s1932_merge_bsts_to_create_single_bst.Solution

Solution() - Constructor for class g1901_2000.s1935_maximum_number_of_words_you_can_type.Solution

Solution() - Constructor for class g1901_2000.s1936_add_minimum_number_of_rungs.Solution

Solution() - Constructor for class g1901_2000.s1937_maximum_number_of_points_with_cost.Solution

Solution() - Constructor for class g1901_2000.s1938_maximum_genetic_difference_query.Solution

Solution() - Constructor for class g1901_2000.s1941_check_if_all_characters_have_equal_number_of_occurrences.Solution

Solution() - Constructor for class g1901_2000.s1942_the_number_of_the_smallest_unoccupied_chair.Solution

Solution() - Constructor for class g1901_2000.s1943_describe_the_painting.Solution

Solution() - Constructor for class g1901_2000.s1944_number_of_visible_people_in_a_queue.Solution

Solution() - Constructor for class g1901_2000.s1945_sum_of_digits_of_string_after_convert.Solution

Solution() - Constructor for class g1901_2000.s1946_largest_number_after_mutating_substring.Solution

Solution() - Constructor for class g1901_2000.s1947_maximum_compatibility_score_sum.Solution

Solution() - Constructor for class g1901_2000.s1948_delete_duplicate_folders_in_system.Solution

Solution() - Constructor for class g1901_2000.s1952_three_divisors.Solution

Solution() - Constructor for class g1901_2000.s1953_maximum_number_of_weeks_for_which_you_can_work.Solution

Solution() - Constructor for class g1901_2000.s1954_minimum_garden_perimeter_to_collect_enough_apples.Solution

Solution() - Constructor for class g1901_2000.s1955_count_number_of_special_subsequences.Solution

Solution() - Constructor for class g1901_2000.s1957_delete_characters_to_make_fancy_string.Solution

Solution() - Constructor for class g1901_2000.s1958_check_if_move_is_legal.Solution

Solution() - Constructor for class g1901_2000.s1959_minimum_total_space_wasted_with_k_resizing_operations.Solution

Solution() - Constructor for class g1901_2000.s1960_maximum_product_of_the_length_of_two_palindromic_substrings.Solution

Solution() - Constructor for class g1901_2000.s1961_check_if_string_is_a_prefix_of_array.Solution

Solution() - Constructor for class g1901_2000.s1962_remove_stones_to_minimize_the_total.Solution

Solution() - Constructor for class g1901_2000.s1963_minimum_number_of_swaps_to_make_the_string_balanced.Solution

Solution() - Constructor for class g1901_2000.s1964_find_the_longest_valid_obstacle_course_at_each_position.Solution

Solution() - Constructor for class g1901_2000.s1967_number_of_strings_that_appear_as_substrings_in_word.Solution

Solution() - Constructor for class g1901_2000.s1968_array_with_elements_not_equal_to_average_of_neighbors.Solution

Solution() - Constructor for class g1901_2000.s1969_minimum_non_zero_product_of_the_array_elements.Solution

Solution() - Constructor for class g1901_2000.s1970_last_day_where_you_can_still_cross.Solution

Solution() - Constructor for class g1901_2000.s1971_find_if_path_exists_in_graph.Solution

Solution() - Constructor for class g1901_2000.s1974_minimum_time_to_type_word_using_special_typewriter.Solution

Solution() - Constructor for class g1901_2000.s1975_maximum_matrix_sum.Solution

Solution() - Constructor for class g1901_2000.s1976_number_of_ways_to_arrive_at_destination.Solution

Solution() - Constructor for class g1901_2000.s1977_number_of_ways_to_separate_numbers.Solution

Solution() - Constructor for class g1901_2000.s1979_find_greatest_common_divisor_of_array.Solution

Solution() - Constructor for class g1901_2000.s1980_find_unique_binary_string.Solution

Solution() - Constructor for class g1901_2000.s1981_minimize_the_difference_between_target_and_chosen_elements.Solution

Solution() - Constructor for class g1901_2000.s1982_find_array_given_subset_sums.Solution

Solution() - Constructor for class g1901_2000.s1984_minimum_difference_between_highest_and_lowest_of_k_scores.Solution

Solution() - Constructor for class g1901_2000.s1985_find_the_kth_largest_integer_in_the_array.Solution

Solution() - Constructor for class g1901_2000.s1986_minimum_number_of_work_sessions_to_finish_the_tasks.Solution

Solution() - Constructor for class g1901_2000.s1987_number_of_unique_good_subsequences.Solution

Solution() - Constructor for class g1901_2000.s1991_find_the_middle_index_in_array.Solution

Solution() - Constructor for class g1901_2000.s1992_find_all_groups_of_farmland.Solution

Solution() - Constructor for class g1901_2000.s1994_the_number_of_good_subsets.Solution

Solution() - Constructor for class g1901_2000.s1995_count_special_quadruplets.Solution

Solution() - Constructor for class g1901_2000.s1996_the_number_of_weak_characters_in_the_game.Solution

Solution() - Constructor for class g1901_2000.s1997_first_day_where_you_have_been_in_all_the_rooms.Solution

Solution() - Constructor for class g1901_2000.s1998_gcd_sort_of_an_array.Solution

Solution() - Constructor for class g1901_2000.s2000_reverse_prefix_of_word.Solution

Solution() - Constructor for class g2001_2100.s2001_number_of_pairs_of_interchangeable_rectangles.Solution

Solution() - Constructor for class g2001_2100.s2002_maximum_product_of_the_length_of_two_palindromic_subsequences.Solution

Solution() - Constructor for class g2001_2100.s2003_smallest_missing_genetic_value_in_each_subtree.Solution

Solution() - Constructor for class g2001_2100.s2006_count_number_of_pairs_with_absolute_difference_k.Solution

Solution() - Constructor for class g2001_2100.s2007_find_original_array_from_doubled_array.Solution

Solution() - Constructor for class g2001_2100.s2008_maximum_earnings_from_taxi.Solution

Solution() - Constructor for class g2001_2100.s2009_minimum_number_of_operations_to_make_array_continuous.Solution

Solution() - Constructor for class g2001_2100.s2011_final_value_of_variable_after_performing_operations.Solution

Solution() - Constructor for class g2001_2100.s2012_sum_of_beauty_in_the_array.Solution

Solution() - Constructor for class g2001_2100.s2014_longest_subsequence_repeated_k_times.Solution

Solution() - Constructor for class g2001_2100.s2016_maximum_difference_between_increasing_elements.Solution

Solution() - Constructor for class g2001_2100.s2017_grid_game.Solution

Solution() - Constructor for class g2001_2100.s2018_check_if_word_can_be_placed_in_crossword.Solution

Solution() - Constructor for class g2001_2100.s2019_the_score_of_students_solving_math_expression.Solution

Solution() - Constructor for class g2001_2100.s2022_convert_1d_array_into_2d_array.Solution

Solution() - Constructor for class g2001_2100.s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target.Solution

Solution() - Constructor for class g2001_2100.s2024_maximize_the_confusion_of_an_exam.Solution

Solution() - Constructor for class g2001_2100.s2025_maximum_number_of_ways_to_partition_an_array.Solution

Solution() - Constructor for class g2001_2100.s2027_minimum_moves_to_convert_string.Solution

Solution() - Constructor for class g2001_2100.s2028_find_missing_observations.Solution

Solution() - Constructor for class g2001_2100.s2029_stone_game_ix.Solution

Solution() - Constructor for class g2001_2100.s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter.Solution

Solution() - Constructor for class g2001_2100.s2032_two_out_of_three.Solution

Solution() - Constructor for class g2001_2100.s2033_minimum_operations_to_make_a_uni_value_grid.Solution

Solution() - Constructor for class g2001_2100.s2035_partition_array_into_two_arrays_to_minimize_sum_difference.Solution

Solution() - Constructor for class g2001_2100.s2037_minimum_number_of_moves_to_seat_everyone.Solution

Solution() - Constructor for class g2001_2100.s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color.Solution

Solution() - Constructor for class g2001_2100.s2039_the_time_when_the_network_becomes_idle.Solution

Solution() - Constructor for class g2001_2100.s2040_kth_smallest_product_of_two_sorted_arrays.Solution

Solution() - Constructor for class g2001_2100.s2042_check_if_numbers_are_ascending_in_a_sentence.Solution

Solution() - Constructor for class g2001_2100.s2044_count_number_of_maximum_bitwise_or_subsets.Solution

Solution() - Constructor for class g2001_2100.s2045_second_minimum_time_to_reach_destination.Solution

Solution() - Constructor for class g2001_2100.s2047_number_of_valid_words_in_a_sentence.Solution

Solution() - Constructor for class g2001_2100.s2048_next_greater_numerically_balanced_number.Solution

Solution() - Constructor for class g2001_2100.s2049_count_nodes_with_the_highest_score.Solution

Solution() - Constructor for class g2001_2100.s2050_parallel_courses_iii.Solution

Solution() - Constructor for class g2001_2100.s2053_kth_distinct_string_in_an_array.Solution

Solution() - Constructor for class g2001_2100.s2054_two_best_non_overlapping_events.Solution

Solution() - Constructor for class g2001_2100.s2055_plates_between_candles.Solution

Solution() - Constructor for class g2001_2100.s2056_number_of_valid_move_combinations_on_chessboard.Solution

Solution() - Constructor for class g2001_2100.s2057_smallest_index_with_equal_value.Solution

Solution() - Constructor for class g2001_2100.s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points.Solution

Solution() - Constructor for class g2001_2100.s2059_minimum_operations_to_convert_number.Solution

Solution() - Constructor for class g2001_2100.s2060_check_if_an_original_string_exists_given_two_encoded_strings.Solution

Solution() - Constructor for class g2001_2100.s2062_count_vowel_substrings_of_a_string.Solution

Solution() - Constructor for class g2001_2100.s2063_vowels_of_all_substrings.Solution

Solution() - Constructor for class g2001_2100.s2064_minimized_maximum_of_products_distributed_to_any_store.Solution

Solution() - Constructor for class g2001_2100.s2065_maximum_path_quality_of_a_graph.Solution

Solution() - Constructor for class g2001_2100.s2068_check_whether_two_strings_are_almost_equivalent.Solution

Solution() - Constructor for class g2001_2100.s2070_most_beautiful_item_for_each_query.Solution

Solution() - Constructor for class g2001_2100.s2071_maximum_number_of_tasks_you_can_assign.Solution

Solution() - Constructor for class g2001_2100.s2073_time_needed_to_buy_tickets.Solution

Solution() - Constructor for class g2001_2100.s2074_reverse_nodes_in_even_length_groups.Solution

Solution() - Constructor for class g2001_2100.s2075_decode_the_slanted_ciphertext.Solution

Solution() - Constructor for class g2001_2100.s2076_process_restricted_friend_requests.Solution

Solution() - Constructor for class g2001_2100.s2078_two_furthest_houses_with_different_colors.Solution

Solution() - Constructor for class g2001_2100.s2079_watering_plants.Solution

Solution() - Constructor for class g2001_2100.s2081_sum_of_k_mirror_numbers.Solution

Solution() - Constructor for class g2001_2100.s2085_count_common_words_with_one_occurrence.Solution

Solution() - Constructor for class g2001_2100.s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses.Solution

Solution() - Constructor for class g2001_2100.s2087_minimum_cost_homecoming_of_a_robot_in_a_grid.Solution

Solution() - Constructor for class g2001_2100.s2088_count_fertile_pyramids_in_a_land.Solution

Solution() - Constructor for class g2001_2100.s2089_find_target_indices_after_sorting_array.Solution

Solution() - Constructor for class g2001_2100.s2090_k_radius_subarray_averages.Solution

Solution() - Constructor for class g2001_2100.s2091_removing_minimum_and_maximum_from_array.Solution

Solution() - Constructor for class g2001_2100.s2092_find_all_people_with_secret.Solution

Solution() - Constructor for class g2001_2100.s2094_finding_3_digit_even_numbers.Solution

Solution() - Constructor for class g2001_2100.s2095_delete_the_middle_node_of_a_linked_list.Solution

Solution() - Constructor for class g2001_2100.s2096_step_by_step_directions_from_a_binary_tree_node_to_another.Solution

Solution() - Constructor for class g2001_2100.s2097_valid_arrangement_of_pairs.Solution

Solution() - Constructor for class g2001_2100.s2099_find_subsequence_of_length_k_with_the_largest_sum.Solution

Solution() - Constructor for class g2001_2100.s2100_find_good_days_to_rob_the_bank.Solution

Solution() - Constructor for class g2101_2200.s2101_detonate_the_maximum_bombs.Solution

Solution() - Constructor for class g2101_2200.s2103_rings_and_rods.Solution

Solution() - Constructor for class g2101_2200.s2104_sum_of_subarray_ranges.Solution

Solution() - Constructor for class g2101_2200.s2105_watering_plants_ii.Solution

Solution() - Constructor for class g2101_2200.s2106_maximum_fruits_harvested_after_at_most_k_steps.Solution

Solution() - Constructor for class g2101_2200.s2108_find_first_palindromic_string_in_the_array.Solution

Solution() - Constructor for class g2101_2200.s2109_adding_spaces_to_a_string.Solution

Solution() - Constructor for class g2101_2200.s2110_number_of_smooth_descent_periods_of_a_stock.Solution

Solution() - Constructor for class g2101_2200.s2111_minimum_operations_to_make_the_array_k_increasing.Solution

Solution() - Constructor for class g2101_2200.s2114_maximum_number_of_words_found_in_sentences.Solution

Solution() - Constructor for class g2101_2200.s2115_find_all_possible_recipes_from_given_supplies.Solution

Solution() - Constructor for class g2101_2200.s2116_check_if_a_parentheses_string_can_be_valid.Solution

Solution() - Constructor for class g2101_2200.s2117_abbreviating_the_product_of_a_range.Solution

Solution() - Constructor for class g2101_2200.s2119_a_number_after_a_double_reversal.Solution

Solution() - Constructor for class g2101_2200.s2120_execution_of_all_suffix_instructions_staying_in_a_grid.Solution

Solution() - Constructor for class g2101_2200.s2121_intervals_between_identical_elements.Solution

Solution() - Constructor for class g2101_2200.s2122_recover_the_original_array.Solution

Solution() - Constructor for class g2101_2200.s2124_check_if_all_as_appears_before_all_bs.Solution

Solution() - Constructor for class g2101_2200.s2125_number_of_laser_beams_in_a_bank.Solution

Solution() - Constructor for class g2101_2200.s2126_destroying_asteroids.Solution

Solution() - Constructor for class g2101_2200.s2127_maximum_employees_to_be_invited_to_a_meeting.Solution

Solution() - Constructor for class g2101_2200.s2129_capitalize_the_title.Solution

Solution() - Constructor for class g2101_2200.s2130_maximum_twin_sum_of_a_linked_list.Solution

Solution() - Constructor for class g2101_2200.s2131_longest_palindrome_by_concatenating_two_letter_words.Solution

Solution() - Constructor for class g2101_2200.s2132_stamping_the_grid.Solution

Solution() - Constructor for class g2101_2200.s2133_check_if_every_row_and_column_contains_all_numbers.Solution

Solution() - Constructor for class g2101_2200.s2134_minimum_swaps_to_group_all_1s_together_ii.Solution

Solution() - Constructor for class g2101_2200.s2135_count_words_obtained_after_adding_a_letter.Solution

Solution() - Constructor for class g2101_2200.s2136_earliest_possible_day_of_full_bloom.Solution

Solution() - Constructor for class g2101_2200.s2138_divide_a_string_into_groups_of_size_k.Solution

Solution() - Constructor for class g2101_2200.s2139_minimum_moves_to_reach_target_score.Solution

Solution() - Constructor for class g2101_2200.s2140_solving_questions_with_brainpower.Solution

Solution() - Constructor for class g2101_2200.s2141_maximum_running_time_of_n_computers.Solution

Solution() - Constructor for class g2101_2200.s2144_minimum_cost_of_buying_candies_with_discount.Solution

Solution() - Constructor for class g2101_2200.s2145_count_the_hidden_sequences.Solution

Solution() - Constructor for class g2101_2200.s2146_k_highest_ranked_items_within_a_price_range.Solution

Solution() - Constructor for class g2101_2200.s2147_number_of_ways_to_divide_a_long_corridor.Solution

Solution() - Constructor for class g2101_2200.s2148_count_elements_with_strictly_smaller_and_greater_elements.Solution

Solution() - Constructor for class g2101_2200.s2149_rearrange_array_elements_by_sign.Solution

Solution() - Constructor for class g2101_2200.s2150_find_all_lonely_numbers_in_the_array.Solution

Solution() - Constructor for class g2101_2200.s2151_maximum_good_people_based_on_statements.Solution

Solution() - Constructor for class g2101_2200.s2154_keep_multiplying_found_values_by_two.Solution

Solution() - Constructor for class g2101_2200.s2155_all_divisions_with_the_highest_score_of_a_binary_array.Solution

Solution() - Constructor for class g2101_2200.s2156_find_substring_with_given_hash_value.Solution

Solution() - Constructor for class g2101_2200.s2157_groups_of_strings.Solution

Solution() - Constructor for class g2101_2200.s2160_minimum_sum_of_four_digit_number_after_splitting_digits.Solution

Solution() - Constructor for class g2101_2200.s2161_partition_array_according_to_given_pivot.Solution

Solution() - Constructor for class g2101_2200.s2162_minimum_cost_to_set_cooking_time.Solution

Solution() - Constructor for class g2101_2200.s2163_minimum_difference_in_sums_after_removal_of_elements.Solution

Solution() - Constructor for class g2101_2200.s2164_sort_even_and_odd_indices_independently.Solution

Solution() - Constructor for class g2101_2200.s2165_smallest_value_of_the_rearranged_number.Solution

Solution() - Constructor for class g2101_2200.s2167_minimum_time_to_remove_all_cars_containing_illegal_goods.Solution

Solution() - Constructor for class g2101_2200.s2169_count_operations_to_obtain_zero.Solution

Solution() - Constructor for class g2101_2200.s2170_minimum_operations_to_make_the_array_alternating.Solution

Solution() - Constructor for class g2101_2200.s2171_removing_minimum_number_of_magic_beans.Solution

Solution() - Constructor for class g2101_2200.s2172_maximum_and_sum_of_array.Solution

Solution() - Constructor for class g2101_2200.s2176_count_equal_and_divisible_pairs_in_an_array.Solution

Solution() - Constructor for class g2101_2200.s2177_find_three_consecutive_integers_that_sum_to_a_given_number.Solution

Solution() - Constructor for class g2101_2200.s2178_maximum_split_of_positive_even_integers.Solution

Solution() - Constructor for class g2101_2200.s2179_count_good_triplets_in_an_array.Solution

Solution() - Constructor for class g2101_2200.s2180_count_integers_with_even_digit_sum.Solution

Solution() - Constructor for class g2101_2200.s2181_merge_nodes_in_between_zeros.Solution

Solution() - Constructor for class g2101_2200.s2182_construct_string_with_repeat_limit.Solution

Solution() - Constructor for class g2101_2200.s2183_count_array_pairs_divisible_by_k.Solution

Solution() - Constructor for class g2101_2200.s2185_counting_words_with_a_given_prefix.Solution

Solution() - Constructor for class g2101_2200.s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii.Solution

Solution() - Constructor for class g2101_2200.s2187_minimum_time_to_complete_trips.Solution

Solution() - Constructor for class g2101_2200.s2188_minimum_time_to_finish_the_race.Solution

Solution() - Constructor for class g2101_2200.s2190_most_frequent_number_following_key_in_an_array.Solution

Solution() - Constructor for class g2101_2200.s2191_sort_the_jumbled_numbers.Solution

Solution() - Constructor for class g2101_2200.s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph.Solution

Solution() - Constructor for class g2101_2200.s2193_minimum_number_of_moves_to_make_palindrome.Solution

Solution() - Constructor for class g2101_2200.s2194_cells_in_a_range_on_an_excel_sheet.Solution

Solution() - Constructor for class g2101_2200.s2195_append_k_integers_with_minimal_sum.Solution

Solution() - Constructor for class g2101_2200.s2196_create_binary_tree_from_descriptions.Solution

Solution() - Constructor for class g2101_2200.s2197_replace_non_coprime_numbers_in_array.Solution

Solution() - Constructor for class g2101_2200.s2200_find_all_k_distant_indices_in_an_array.Solution

Solution() - Constructor for class g2201_2300.s2201_count_artifacts_that_can_be_extracted.Solution

Solution() - Constructor for class g2201_2300.s2202_maximize_the_topmost_element_after_k_moves.Solution

Solution() - Constructor for class g2201_2300.s2203_minimum_weighted_subgraph_with_the_required_paths.Solution

Solution() - Constructor for class g2201_2300.s2206_divide_array_into_equal_pairs.Solution

Solution() - Constructor for class g2201_2300.s2207_maximize_number_of_subsequences_in_a_string.Solution

Solution() - Constructor for class g2201_2300.s2208_minimum_operations_to_halve_array_sum.Solution

Solution() - Constructor for class g2201_2300.s2209_minimum_white_tiles_after_covering_with_carpets.Solution

Solution() - Constructor for class g2201_2300.s2210_count_hills_and_valleys_in_an_array.Solution

Solution() - Constructor for class g2201_2300.s2211_count_collisions_on_a_road.Solution

Solution() - Constructor for class g2201_2300.s2212_maximum_points_in_an_archery_competition.Solution

Solution() - Constructor for class g2201_2300.s2213_longest_substring_of_one_repeating_character.Solution

Solution() - Constructor for class g2201_2300.s2215_find_the_difference_of_two_arrays.Solution

Solution() - Constructor for class g2201_2300.s2216_minimum_deletions_to_make_array_beautiful.Solution

Solution() - Constructor for class g2201_2300.s2217_find_palindrome_with_fixed_length.Solution

Solution() - Constructor for class g2201_2300.s2218_maximum_value_of_k_coins_from_piles.Solution

Solution() - Constructor for class g2201_2300.s2220_minimum_bit_flips_to_convert_number.Solution

Solution() - Constructor for class g2201_2300.s2221_find_triangular_sum_of_an_array.Solution

Solution() - Constructor for class g2201_2300.s2222_number_of_ways_to_select_buildings.Solution

Solution() - Constructor for class g2201_2300.s2223_sum_of_scores_of_built_strings.Solution

Solution() - Constructor for class g2201_2300.s2224_minimum_number_of_operations_to_convert_time.Solution

Solution() - Constructor for class g2201_2300.s2225_find_players_with_zero_or_one_losses.Solution

Solution() - Constructor for class g2201_2300.s2226_maximum_candies_allocated_to_k_children.Solution

Solution() - Constructor for class g2201_2300.s2231_largest_number_after_digit_swaps_by_parity.Solution

Solution() - Constructor for class g2201_2300.s2232_minimize_result_by_adding_parentheses_to_expression.Solution

Solution() - Constructor for class g2201_2300.s2233_maximum_product_after_k_increments.Solution

Solution() - Constructor for class g2201_2300.s2234_maximum_total_beauty_of_the_gardens.Solution

Solution() - Constructor for class g2201_2300.s2235_add_two_integers.Solution

Solution() - Constructor for class g2201_2300.s2236_root_equals_sum_of_children.Solution

Solution() - Constructor for class g2201_2300.s2239_find_closest_number_to_zero.Solution

Solution() - Constructor for class g2201_2300.s2240_number_of_ways_to_buy_pens_and_pencils.Solution

Solution() - Constructor for class g2201_2300.s2242_maximum_score_of_a_node_sequence.Solution

Solution() - Constructor for class g2201_2300.s2243_calculate_digit_sum_of_a_string.Solution

Solution() - Constructor for class g2201_2300.s2244_minimum_rounds_to_complete_all_tasks.Solution

Solution() - Constructor for class g2201_2300.s2245_maximum_trailing_zeros_in_a_cornered_path.Solution

Solution() - Constructor for class g2201_2300.s2246_longest_path_with_different_adjacent_characters.Solution

Solution() - Constructor for class g2201_2300.s2248_intersection_of_multiple_arrays.Solution

Solution() - Constructor for class g2201_2300.s2249_count_lattice_points_inside_a_circle.Solution

Solution() - Constructor for class g2201_2300.s2250_count_number_of_rectangles_containing_each_point.Solution

Solution() - Constructor for class g2201_2300.s2251_number_of_flowers_in_full_bloom.Solution

Solution() - Constructor for class g2201_2300.s2255_count_prefixes_of_a_given_string.Solution

Solution() - Constructor for class g2201_2300.s2256_minimum_average_difference.Solution

Solution() - Constructor for class g2201_2300.s2257_count_unguarded_cells_in_the_grid.Solution

Solution() - Constructor for class g2201_2300.s2258_escape_the_spreading_fire.Solution

Solution() - Constructor for class g2201_2300.s2259_remove_digit_from_number_to_maximize_result.Solution

Solution() - Constructor for class g2201_2300.s2260_minimum_consecutive_cards_to_pick_up.Solution

Solution() - Constructor for class g2201_2300.s2261_k_divisible_elements_subarrays.Solution

Solution() - Constructor for class g2201_2300.s2262_total_appeal_of_a_string.Solution

Solution() - Constructor for class g2201_2300.s2264_largest_3_same_digit_number_in_string.Solution

Solution() - Constructor for class g2201_2300.s2265_count_nodes_equal_to_average_of_subtree.Solution

Solution() - Constructor for class g2201_2300.s2266_count_number_of_texts.Solution

Solution() - Constructor for class g2201_2300.s2267_check_if_there_is_a_valid_parentheses_string_path.Solution

Solution() - Constructor for class g2201_2300.s2269_find_the_k_beauty_of_a_number.Solution

Solution() - Constructor for class g2201_2300.s2270_number_of_ways_to_split_array.Solution

Solution() - Constructor for class g2201_2300.s2271_maximum_white_tiles_covered_by_a_carpet.Solution

Solution() - Constructor for class g2201_2300.s2272_substring_with_largest_variance.Solution

Solution() - Constructor for class g2201_2300.s2273_find_resultant_array_after_removing_anagrams.Solution

Solution() - Constructor for class g2201_2300.s2274_maximum_consecutive_floors_without_special_floors.Solution

Solution() - Constructor for class g2201_2300.s2275_largest_combination_with_bitwise_and_greater_than_zero.Solution

Solution() - Constructor for class g2201_2300.s2278_percentage_of_letter_in_string.Solution

Solution() - Constructor for class g2201_2300.s2279_maximum_bags_with_full_capacity_of_rocks.Solution

Solution() - Constructor for class g2201_2300.s2280_minimum_lines_to_represent_a_line_chart.Solution

Solution() - Constructor for class g2201_2300.s2281_sum_of_total_strength_of_wizards.Solution

Solution() - Constructor for class g2201_2300.s2283_check_if_number_has_equal_digit_count_and_digit_value.Solution

Solution() - Constructor for class g2201_2300.s2284_sender_with_largest_word_count.Solution

Solution() - Constructor for class g2201_2300.s2285_maximum_total_importance_of_roads.Solution

Solution() - Constructor for class g2201_2300.s2287_rearrange_characters_to_make_target_string.Solution

Solution() - Constructor for class g2201_2300.s2288_apply_discount_to_prices.Solution

Solution() - Constructor for class g2201_2300.s2289_steps_to_make_array_non_decreasing.Solution

Solution() - Constructor for class g2201_2300.s2290_minimum_obstacle_removal_to_reach_corner.Solution

Solution() - Constructor for class g2201_2300.s2293_min_max_game.Solution

Solution() - Constructor for class g2201_2300.s2294_partition_array_such_that_maximum_difference_is_k.Solution

Solution() - Constructor for class g2201_2300.s2295_replace_elements_in_an_array.Solution

Solution() - Constructor for class g2201_2300.s2299_strong_password_checker_ii.Solution

Solution() - Constructor for class g2201_2300.s2300_successful_pairs_of_spells_and_potions.Solution

Solution() - Constructor for class g2301_2400.s2301_match_substring_after_replacement.Solution

Solution() - Constructor for class g2301_2400.s2302_count_subarrays_with_score_less_than_k.Solution

Solution() - Constructor for class g2301_2400.s2303_calculate_amount_paid_in_taxes.Solution

Solution() - Constructor for class g2301_2400.s2304_minimum_path_cost_in_a_grid.Solution

Solution() - Constructor for class g2301_2400.s2305_fair_distribution_of_cookies.Solution

Solution() - Constructor for class g2301_2400.s2306_naming_a_company.Solution

Solution() - Constructor for class g2301_2400.s2309_greatest_english_letter_in_upper_and_lower_case.Solution

Solution() - Constructor for class g2301_2400.s2310_sum_of_numbers_with_units_digit_k.Solution

Solution() - Constructor for class g2301_2400.s2311_longest_binary_subsequence_less_than_or_equal_to_k.Solution

Solution() - Constructor for class g2301_2400.s2312_selling_pieces_of_wood.Solution

Solution() - Constructor for class g2301_2400.s2315_count_asterisks.Solution

Solution() - Constructor for class g2301_2400.s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph.Solution

Solution() - Constructor for class g2301_2400.s2317_maximum_xor_after_operations.Solution

Solution() - Constructor for class g2301_2400.s2318_number_of_distinct_roll_sequences.Solution

Solution() - Constructor for class g2301_2400.s2319_check_if_matrix_is_x_matrix.Solution

Solution() - Constructor for class g2301_2400.s2320_count_number_of_ways_to_place_houses.Solution

Solution() - Constructor for class g2301_2400.s2321_maximum_score_of_spliced_array.Solution

Solution() - Constructor for class g2301_2400.s2322_minimum_score_after_removals_on_a_tree.Solution

Solution() - Constructor for class g2301_2400.s2325_decode_the_message.Solution

Solution() - Constructor for class g2301_2400.s2326_spiral_matrix_iv.Solution

Solution() - Constructor for class g2301_2400.s2327_number_of_people_aware_of_a_secret.Solution

Solution() - Constructor for class g2301_2400.s2328_number_of_increasing_paths_in_a_grid.Solution

Solution() - Constructor for class g2301_2400.s2331_evaluate_boolean_binary_tree.Solution

Solution() - Constructor for class g2301_2400.s2332_the_latest_time_to_catch_a_bus.Solution

Solution() - Constructor for class g2301_2400.s2333_minimum_sum_of_squared_difference.Solution

Solution() - Constructor for class g2301_2400.s2334_subarray_with_elements_greater_than_varying_threshold.Solution

Solution() - Constructor for class g2301_2400.s2335_minimum_amount_of_time_to_fill_cups.Solution

Solution() - Constructor for class g2301_2400.s2337_move_pieces_to_obtain_a_string.Solution

Solution() - Constructor for class g2301_2400.s2338_count_the_number_of_ideal_arrays.Solution

Solution() - Constructor for class g2301_2400.s2341_maximum_number_of_pairs_in_array.Solution

Solution() - Constructor for class g2301_2400.s2342_max_sum_of_a_pair_with_equal_sum_of_digits.Solution

Solution() - Constructor for class g2301_2400.s2343_query_kth_smallest_trimmed_number.Solution

Solution() - Constructor for class g2301_2400.s2344_minimum_deletions_to_make_array_divisible.Solution

Solution() - Constructor for class g2301_2400.s2347_best_poker_hand.Solution

Solution() - Constructor for class g2301_2400.s2348_number_of_zero_filled_subarrays.Solution

Solution() - Constructor for class g2301_2400.s2350_shortest_impossible_sequence_of_rolls.Solution

Solution() - Constructor for class g2301_2400.s2351_first_letter_to_appear_twice.Solution

Solution() - Constructor for class g2301_2400.s2352_equal_row_and_column_pairs.Solution

Solution() - Constructor for class g2301_2400.s2354_number_of_excellent_pairs.Solution

Solution() - Constructor for class g2301_2400.s2357_make_array_zero_by_subtracting_equal_amounts.Solution

Solution() - Constructor for class g2301_2400.s2358_maximum_number_of_groups_entering_a_competition.Solution

Solution() - Constructor for class g2301_2400.s2359_find_closest_node_to_given_two_nodes.Solution

Solution() - Constructor for class g2301_2400.s2360_longest_cycle_in_a_graph.Solution

Solution() - Constructor for class g2301_2400.s2363_merge_similar_items.Solution

Solution() - Constructor for class g2301_2400.s2364_count_number_of_bad_pairs.Solution

Solution() - Constructor for class g2301_2400.s2365_task_scheduler_ii.Solution

Solution() - Constructor for class g2301_2400.s2366_minimum_replacements_to_sort_the_array.Solution

Solution() - Constructor for class g2301_2400.s2367_number_of_arithmetic_triplets.Solution

Solution() - Constructor for class g2301_2400.s2368_reachable_nodes_with_restrictions.Solution

Solution() - Constructor for class g2301_2400.s2369_check_if_there_is_a_valid_partition_for_the_array.Solution

Solution() - Constructor for class g2301_2400.s2370_longest_ideal_subsequence.Solution

Solution() - Constructor for class g2301_2400.s2373_largest_local_values_in_a_matrix.Solution

Solution() - Constructor for class g2301_2400.s2374_node_with_highest_edge_score.Solution

Solution() - Constructor for class g2301_2400.s2375_construct_smallest_number_from_di_string.Solution

Solution() - Constructor for class g2301_2400.s2376_count_special_integers.Solution

Solution() - Constructor for class g2301_2400.s2379_minimum_recolors_to_get_k_consecutive_black_blocks.Solution

Solution() - Constructor for class g2301_2400.s2380_time_needed_to_rearrange_a_binary_string.Solution

Solution() - Constructor for class g2301_2400.s2381_shifting_letters_ii.Solution

Solution() - Constructor for class g2301_2400.s2382_maximum_segment_sum_after_removals.Solution

Solution() - Constructor for class g2301_2400.s2383_minimum_hours_of_training_to_win_a_competition.Solution

Solution() - Constructor for class g2301_2400.s2384_largest_palindromic_number.Solution

Solution() - Constructor for class g2301_2400.s2385_amount_of_time_for_binary_tree_to_be_infected.Solution

Solution() - Constructor for class g2301_2400.s2386_find_the_k_sum_of_an_array.Solution

Solution() - Constructor for class g2301_2400.s2389_longest_subsequence_with_limited_sum.Solution

Solution() - Constructor for class g2301_2400.s2390_removing_stars_from_a_string.Solution

Solution() - Constructor for class g2301_2400.s2391_minimum_amount_of_time_to_collect_garbage.Solution

Solution() - Constructor for class g2301_2400.s2392_build_a_matrix_with_conditions.Solution

Solution() - Constructor for class g2301_2400.s2395_find_subarrays_with_equal_sum.Solution

Solution() - Constructor for class g2301_2400.s2396_strictly_palindromic_number.Solution

Solution() - Constructor for class g2301_2400.s2397_maximum_rows_covered_by_columns.Solution

Solution() - Constructor for class g2301_2400.s2398_maximum_number_of_robots_within_budget.Solution

Solution() - Constructor for class g2301_2400.s2399_check_distances_between_same_letters.Solution

Solution() - Constructor for class g2301_2400.s2400_number_of_ways_to_reach_a_position_after_exactly_k_steps.Solution

Solution() - Constructor for class g2401_2500.s2401_longest_nice_subarray.Solution

Solution() - Constructor for class g2401_2500.s2402_meeting_rooms_iii.Solution

Solution() - Constructor for class g2401_2500.s2404_most_frequent_even_element.Solution

Solution() - Constructor for class g2401_2500.s2405_optimal_partition_of_string.Solution

Solution() - Constructor for class g2401_2500.s2406_divide_intervals_into_minimum_number_of_groups.Solution

Solution() - Constructor for class g2401_2500.s2407_longest_increasing_subsequence_ii.Solution

Solution() - Constructor for class g2401_2500.s2409_count_days_spent_together.Solution

Solution() - Constructor for class g2401_2500.s2410_maximum_matching_of_players_with_trainers.Solution

Solution() - Constructor for class g2401_2500.s2411_smallest_subarrays_with_maximum_bitwise_or.Solution

Solution() - Constructor for class g2401_2500.s2412_minimum_money_required_before_transactions.Solution

Solution() - Constructor for class g2401_2500.s2413_smallest_even_multiple.Solution

Solution() - Constructor for class g2401_2500.s2414_length_of_the_longest_alphabetical_continuous_substring.Solution

Solution() - Constructor for class g2401_2500.s2415_reverse_odd_levels_of_binary_tree.Solution

Solution() - Constructor for class g2401_2500.s2416_sum_of_prefix_scores_of_strings.Solution

Solution() - Constructor for class g2401_2500.s2418_sort_the_people.Solution

Solution() - Constructor for class g2401_2500.s2419_longest_subarray_with_maximum_bitwise_and.Solution

Solution() - Constructor for class g2401_2500.s2420_find_all_good_indices.Solution

Solution() - Constructor for class g2401_2500.s2421_number_of_good_paths.Solution

Solution() - Constructor for class g2401_2500.s2423_remove_letter_to_equalize_frequency.Solution

Solution() - Constructor for class g2401_2500.s2425_bitwise_xor_of_all_pairings.Solution

Solution() - Constructor for class g2401_2500.s2426_number_of_pairs_satisfying_inequality.Solution

Solution() - Constructor for class g2401_2500.s2427_number_of_common_factors.Solution

Solution() - Constructor for class g2401_2500.s2428_maximum_sum_of_an_hourglass.Solution

Solution() - Constructor for class g2401_2500.s2429_minimize_xor.Solution

Solution() - Constructor for class g2401_2500.s2430_maximum_deletions_on_a_string.Solution

Solution() - Constructor for class g2401_2500.s2432_the_employee_that_worked_on_the_longest_task.Solution

Solution() - Constructor for class g2401_2500.s2433_find_the_original_array_of_prefix_xor.Solution

Solution() - Constructor for class g2401_2500.s2434_using_a_robot_to_print_the_lexicographically_smallest_string.Solution

Solution() - Constructor for class g2401_2500.s2435_paths_in_matrix_whose_sum_is_divisible_by_k.Solution

Solution() - Constructor for class g2401_2500.s2437_number_of_valid_clock_times.Solution

Solution() - Constructor for class g2401_2500.s2438_range_product_queries_of_powers.Solution

Solution() - Constructor for class g2401_2500.s2439_minimize_maximum_of_array.Solution

Solution() - Constructor for class g2401_2500.s2440_create_components_with_same_value.Solution

Solution() - Constructor for class g2401_2500.s2441_largest_positive_integer_that_exists_with_its_negative.Solution

Solution() - Constructor for class g2401_2500.s2442_count_number_of_distinct_integers_after_reverse_operations.Solution

Solution() - Constructor for class g2401_2500.s2443_sum_of_number_and_its_reverse.Solution

Solution() - Constructor for class g2401_2500.s2444_count_subarrays_with_fixed_bounds.Solution

Solution() - Constructor for class g2401_2500.s2446_determine_if_two_events_have_conflict.Solution

Solution() - Constructor for class g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k.Solution

Solution() - Constructor for class g2401_2500.s2448_minimum_cost_to_make_array_equal.Solution

Solution() - Constructor for class g2401_2500.s2449_minimum_number_of_operations_to_make_arrays_similar.Solution

Solution() - Constructor for class g2401_2500.s2451_odd_string_difference.Solution

Solution() - Constructor for class g2401_2500.s2452_words_within_two_edits_of_dictionary.Solution

Solution() - Constructor for class g2401_2500.s2453_destroy_sequential_targets.Solution

Solution() - Constructor for class g2401_2500.s2454_next_greater_element_iv.Solution

Solution() - Constructor for class g2401_2500.s2455_average_value_of_even_numbers_that_are_divisible_by_three.Solution

Solution() - Constructor for class g2401_2500.s2456_most_popular_video_creator.Solution

Solution() - Constructor for class g2401_2500.s2457_minimum_addition_to_make_integer_beautiful.Solution

Solution() - Constructor for class g2401_2500.s2458_height_of_binary_tree_after_subtree_removal_queries.Solution

Solution() - Constructor for class g2401_2500.s2460_apply_operations_to_an_array.Solution

Solution() - Constructor for class g2401_2500.s2461_maximum_sum_of_distinct_subarrays_with_length_k.Solution

Solution() - Constructor for class g2401_2500.s2462_total_cost_to_hire_k_workers.Solution

Solution() - Constructor for class g2401_2500.s2463_minimum_total_distance_traveled.Solution

Solution() - Constructor for class g2401_2500.s2465_number_of_distinct_averages.Solution

Solution() - Constructor for class g2401_2500.s2466_count_ways_to_build_good_strings.Solution

Solution() - Constructor for class g2401_2500.s2467_most_profitable_path_in_a_tree.Solution

Solution() - Constructor for class g2401_2500.s2468_split_message_based_on_limit.Solution

Solution() - Constructor for class g2401_2500.s2469_convert_the_temperature.Solution

Solution() - Constructor for class g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k.Solution

Solution() - Constructor for class g2401_2500.s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level.Solution

Solution() - Constructor for class g2401_2500.s2472_maximum_number_of_non_overlapping_palindrome_substrings.Solution

Solution() - Constructor for class g2401_2500.s2475_number_of_unequal_triplets_in_array.Solution

Solution() - Constructor for class g2401_2500.s2476_closest_nodes_queries_in_a_binary_search_tree.Solution

Solution() - Constructor for class g2401_2500.s2477_minimum_fuel_cost_to_report_to_the_capital.Solution

Solution() - Constructor for class g2401_2500.s2478_number_of_beautiful_partitions.Solution

Solution() - Constructor for class g2401_2500.s2481_minimum_cuts_to_divide_a_circle.Solution

Solution() - Constructor for class g2401_2500.s2482_difference_between_ones_and_zeros_in_row_and_column.Solution

Solution() - Constructor for class g2401_2500.s2483_minimum_penalty_for_a_shop.Solution

Solution() - Constructor for class g2401_2500.s2484_count_palindromic_subsequences.Solution

Solution() - Constructor for class g2401_2500.s2485_find_the_pivot_integer.Solution

Solution() - Constructor for class g2401_2500.s2486_append_characters_to_string_to_make_subsequence.Solution

Solution() - Constructor for class g2401_2500.s2487_remove_nodes_from_linked_list.Solution

Solution() - Constructor for class g2401_2500.s2488_count_subarrays_with_median_k.Solution

Solution() - Constructor for class g2401_2500.s2490_circular_sentence.Solution

Solution() - Constructor for class g2401_2500.s2491_divide_players_into_teams_of_equal_skill.Solution

Solution() - Constructor for class g2401_2500.s2492_minimum_score_of_a_path_between_two_cities.Solution

Solution() - Constructor for class g2401_2500.s2493_divide_nodes_into_the_maximum_number_of_groups.Solution

Solution() - Constructor for class g2401_2500.s2496_maximum_value_of_a_string_in_an_array.Solution

Solution() - Constructor for class g2401_2500.s2497_maximum_star_sum_of_a_graph.Solution

Solution() - Constructor for class g2401_2500.s2498_frog_jump_ii.Solution

Solution() - Constructor for class g2401_2500.s2499_minimum_total_cost_to_make_arrays_unequal.Solution

Solution() - Constructor for class g2401_2500.s2500_delete_greatest_value_in_each_row.Solution

Solution() - Constructor for class g2501_2600.s2501_longest_square_streak_in_an_array.Solution

Solution() - Constructor for class g2501_2600.s2503_maximum_number_of_points_from_grid_queries.Solution

Solution() - Constructor for class g2501_2600.s2506_count_pairs_of_similar_strings.Solution

Solution() - Constructor for class g2501_2600.s2507_smallest_value_after_replacing_with_sum_of_prime_factors.Solution

Solution() - Constructor for class g2501_2600.s2508_add_edges_to_make_degrees_of_all_nodes_even.Solution

Solution() - Constructor for class g2501_2600.s2509_cycle_length_queries_in_a_tree.Solution

Solution() - Constructor for class g2501_2600.s2511_maximum_enemy_forts_that_can_be_captured.Solution

Solution() - Constructor for class g2501_2600.s2512_reward_top_k_students.Solution

Solution() - Constructor for class g2501_2600.s2513_minimize_the_maximum_of_two_arrays.Solution

Solution() - Constructor for class g2501_2600.s2514_count_anagrams.Solution

Solution() - Constructor for class g2501_2600.s2515_shortest_distance_to_target_string_in_a_circular_array.Solution

Solution() - Constructor for class g2501_2600.s2516_take_k_of_each_character_from_left_and_right.Solution

Solution() - Constructor for class g2501_2600.s2517_maximum_tastiness_of_candy_basket.Solution

Solution() - Constructor for class g2501_2600.s2518_number_of_great_partitions.Solution

Solution() - Constructor for class g2501_2600.s2520_count_the_digits_that_divide_a_number.Solution

Solution() - Constructor for class g2501_2600.s2521_distinct_prime_factors_of_product_of_array.Solution

Solution() - Constructor for class g2501_2600.s2522_partition_string_into_substrings_with_values_at_most_k.Solution

Solution() - Constructor for class g2501_2600.s2523_closest_prime_numbers_in_range.Solution

Solution() - Constructor for class g2501_2600.s2525_categorize_box_according_to_criteria.Solution

Solution() - Constructor for class g2501_2600.s2527_find_xor_beauty_of_array.Solution

Solution() - Constructor for class g2501_2600.s2528_maximize_the_minimum_powered_city.Solution

Solution() - Constructor for class g2501_2600.s2529_maximum_count_of_positive_integer_and_negative_integer.Solution

Solution() - Constructor for class g2501_2600.s2530_maximal_score_after_applying_k_operations.Solution

Solution() - Constructor for class g2501_2600.s2531_make_number_of_distinct_characters_equal.Solution

Solution() - Constructor for class g2501_2600.s2532_time_to_cross_a_bridge.Solution

Solution() - Constructor for class g2501_2600.s2535_difference_between_element_sum_and_digit_sum_of_an_array.Solution

Solution() - Constructor for class g2501_2600.s2536_increment_submatrices_by_one.Solution

Solution() - Constructor for class g2501_2600.s2537_count_the_number_of_good_subarrays.Solution

Solution() - Constructor for class g2501_2600.s2538_difference_between_maximum_and_minimum_price_sum.Solution

Solution() - Constructor for class g2501_2600.s2540_minimum_common_value.Solution

Solution() - Constructor for class g2501_2600.s2541_minimum_operations_to_make_array_equal_ii.Solution

Solution() - Constructor for class g2501_2600.s2542_maximum_subsequence_score.Solution

Solution() - Constructor for class g2501_2600.s2543_check_if_point_is_reachable.Solution

Solution() - Constructor for class g2501_2600.s2544_alternating_digit_sum.Solution

Solution() - Constructor for class g2501_2600.s2545_sort_the_students_by_their_kth_score.Solution

Solution() - Constructor for class g2501_2600.s2546_apply_bitwise_operations_to_make_strings_equal.Solution

Solution() - Constructor for class g2501_2600.s2547_minimum_cost_to_split_an_array.Solution

Solution() - Constructor for class g2501_2600.s2549_count_distinct_numbers_on_board.Solution

Solution() - Constructor for class g2501_2600.s2550_count_collisions_of_monkeys_on_a_polygon.Solution

Solution() - Constructor for class g2501_2600.s2551_put_marbles_in_bags.Solution

Solution() - Constructor for class g2501_2600.s2552_count_increasing_quadruplets.Solution

Solution() - Constructor for class g2501_2600.s2553_separate_the_digits_in_an_array.Solution

Solution() - Constructor for class g2501_2600.s2554_maximum_number_of_integers_to_choose_from_a_range_i.Solution

Solution() - Constructor for class g2501_2600.s2555_maximize_win_from_two_segments.Solution

Solution() - Constructor for class g2501_2600.s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip.Solution

Solution() - Constructor for class g2501_2600.s2558_take_gifts_from_the_richest_pile.Solution

Solution() - Constructor for class g2501_2600.s2559_count_vowel_strings_in_ranges.Solution

Solution() - Constructor for class g2501_2600.s2560_house_robber_iv.Solution

Solution() - Constructor for class g2501_2600.s2561_rearranging_fruits.Solution

Solution() - Constructor for class g2501_2600.s2562_find_the_array_concatenation_value.Solution

Solution() - Constructor for class g2501_2600.s2563_count_the_number_of_fair_pairs.Solution

Solution() - Constructor for class g2501_2600.s2564_substring_xor_queries.Solution

Solution() - Constructor for class g2501_2600.s2565_subsequence_with_the_minimum_score.Solution

Solution() - Constructor for class g2501_2600.s2566_maximum_difference_by_remapping_a_digit.Solution

Solution() - Constructor for class g2501_2600.s2567_minimum_score_by_changing_two_elements.Solution

Solution() - Constructor for class g2501_2600.s2568_minimum_impossible_or.Solution

Solution() - Constructor for class g2501_2600.s2569_handling_sum_queries_after_update.Solution

Solution() - Constructor for class g2501_2600.s2570_merge_two_2d_arrays_by_summing_values.Solution

Solution() - Constructor for class g2501_2600.s2571_minimum_operations_to_reduce_an_integer_to_0.Solution

Solution() - Constructor for class g2501_2600.s2572_count_the_number_of_square_free_subsets.Solution

Solution() - Constructor for class g2501_2600.s2573_find_the_string_with_lcp.Solution

Solution() - Constructor for class g2501_2600.s2574_left_and_right_sum_differences.Solution

Solution() - Constructor for class g2501_2600.s2575_find_the_divisibility_array_of_a_string.Solution

Solution() - Constructor for class g2501_2600.s2576_find_the_maximum_number_of_marked_indices.Solution

Solution() - Constructor for class g2501_2600.s2577_minimum_time_to_visit_a_cell_in_a_grid.Solution

Solution() - Constructor for class g2501_2600.s2578_split_with_minimum_sum.Solution

Solution() - Constructor for class g2501_2600.s2579_count_total_number_of_colored_cells.Solution

Solution() - Constructor for class g2501_2600.s2580_count_ways_to_group_overlapping_ranges.Solution

Solution() - Constructor for class g2501_2600.s2581_count_number_of_possible_root_nodes.Solution

Solution() - Constructor for class g2501_2600.s2582_pass_the_pillow.Solution

Solution() - Constructor for class g2501_2600.s2583_kth_largest_sum_in_a_binary_tree.Solution

Solution() - Constructor for class g2501_2600.s2584_split_the_array_to_make_coprime_products.Solution

Solution() - Constructor for class g2501_2600.s2585_number_of_ways_to_earn_points.Solution

Solution() - Constructor for class g2501_2600.s2586_count_the_number_of_vowel_strings_in_range.Solution

Solution() - Constructor for class g2501_2600.s2587_rearrange_array_to_maximize_prefix_score.Solution

Solution() - Constructor for class g2501_2600.s2588_count_the_number_of_beautiful_subarrays.Solution

Solution() - Constructor for class g2501_2600.s2589_minimum_time_to_complete_all_tasks.Solution

Solution() - Constructor for class g2501_2600.s2591_distribute_money_to_maximum_children.Solution

Solution() - Constructor for class g2501_2600.s2592_maximize_greatness_of_an_array.Solution

Solution() - Constructor for class g2501_2600.s2593_find_score_of_an_array_after_marking_all_elements.Solution

Solution() - Constructor for class g2501_2600.s2594_minimum_time_to_repair_cars.Solution

Solution() - Constructor for class g2501_2600.s2595_number_of_even_and_odd_bits.Solution

Solution() - Constructor for class g2501_2600.s2596_check_knight_tour_configuration.Solution

Solution() - Constructor for class g2501_2600.s2597_the_number_of_beautiful_subsets.Solution

Solution() - Constructor for class g2501_2600.s2598_smallest_missing_non_negative_integer_after_operations.Solution

Solution() - Constructor for class g2501_2600.s2600_k_items_with_the_maximum_sum.Solution

Solution() - Constructor for class g2601_2700.s2601_prime_subtraction_operation.Solution

Solution() - Constructor for class g2601_2700.s2602_minimum_operations_to_make_all_array_elements_equal.Solution

Solution() - Constructor for class g2601_2700.s2603_collect_coins_in_a_tree.Solution

Solution() - Constructor for class g2601_2700.s2605_form_smallest_number_from_two_digit_arrays.Solution

Solution() - Constructor for class g2601_2700.s2606_find_the_substring_with_maximum_cost.Solution

Solution() - Constructor for class g2601_2700.s2607_make_k_subarray_sums_equal.Solution

Solution() - Constructor for class g2601_2700.s2608_shortest_cycle_in_a_graph.Solution

Solution() - Constructor for class g2601_2700.s2609_find_the_longest_balanced_substring_of_a_binary_string.Solution

Solution() - Constructor for class g2601_2700.s2610_convert_an_array_into_a_2d_array_with_conditions.Solution

Solution() - Constructor for class g2601_2700.s2611_mice_and_cheese.Solution

Solution() - Constructor for class g2601_2700.s2612_minimum_reverse_operations.Solution

Solution() - Constructor for class g2601_2700.s2614_prime_in_diagonal.Solution

Solution() - Constructor for class g2601_2700.s2615_sum_of_distances.Solution

Solution() - Constructor for class g2601_2700.s2616_minimize_the_maximum_difference_of_pairs.Solution

Solution() - Constructor for class g2601_2700.s2617_minimum_number_of_visited_cells_in_a_grid.Solution

Solution() - Constructor for class g2601_2700.s2639_find_the_width_of_columns_of_a_grid.Solution

Solution() - Constructor for class g2601_2700.s2640_find_the_score_of_all_prefixes_of_an_array.Solution

Solution() - Constructor for class g2601_2700.s2641_cousins_in_binary_tree_ii.Solution

Solution() - Constructor for class g2601_2700.s2643_row_with_maximum_ones.Solution

Solution() - Constructor for class g2601_2700.s2644_find_the_maximum_divisibility_score.Solution

Solution() - Constructor for class g2601_2700.s2645_minimum_additions_to_make_valid_string.Solution

Solution() - Constructor for class g2601_2700.s2646_minimize_the_total_price_of_the_trips.Solution

Solution() - Constructor for class g2601_2700.s2651_calculate_delayed_arrival_time.Solution

Solution() - Constructor for class g2601_2700.s2652_sum_multiples.Solution

Solution() - Constructor for class g2601_2700.s2653_sliding_subarray_beauty.Solution

Solution() - Constructor for class g2601_2700.s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1.Solution

Solution() - Constructor for class g2601_2700.s2656_maximum_sum_with_exactly_k_elements.Solution

Solution() - Constructor for class g2601_2700.s2657_find_the_prefix_common_array_of_two_arrays.Solution

Solution() - Constructor for class g2601_2700.s2658_maximum_number_of_fish_in_a_grid.Solution

Solution() - Constructor for class g2601_2700.s2659_make_array_empty.Solution

Solution() - Constructor for class g2601_2700.s2660_determine_the_winner_of_a_bowling_game.Solution

Solution() - Constructor for class g2601_2700.s2661_first_completely_painted_row_or_column.Solution

Solution() - Constructor for class g2601_2700.s2662_minimum_cost_of_a_path_with_special_roads.Solution

Solution() - Constructor for class g2601_2700.s2663_lexicographically_smallest_beautiful_string.Solution

Solution() - Constructor for class g2601_2700.s2670_find_the_distinct_difference_array.Solution

Solution() - Constructor for class g2601_2700.s2672_number_of_adjacent_elements_with_the_same_color.Solution

Solution() - Constructor for class g2601_2700.s2673_make_costs_of_paths_equal_in_a_binary_tree.Solution

Solution() - Constructor for class g2601_2700.s2678_number_of_senior_citizens.Solution

Solution() - Constructor for class g2601_2700.s2679_sum_in_a_matrix.Solution

Solution() - Constructor for class g2601_2700.s2680_maximum_or.Solution

Solution() - Constructor for class g2601_2700.s2681_power_of_heroes.Solution

Solution() - Constructor for class g2601_2700.s2682_find_the_losers_of_the_circular_game.Solution

Solution() - Constructor for class g2601_2700.s2683_neighboring_bitwise_xor.Solution

Solution() - Constructor for class g2601_2700.s2684_maximum_number_of_moves_in_a_grid.Solution

Solution() - Constructor for class g2601_2700.s2685_count_the_number_of_complete_components.Solution

Solution() - Constructor for class g2601_2700.s2696_minimum_string_length_after_removing_substrings.Solution

Solution() - Constructor for class g2601_2700.s2697_lexicographically_smallest_palindrome.Solution

Solution() - Constructor for class g2601_2700.s2698_find_the_punishment_number_of_an_integer.Solution

Solution() - Constructor for class g2601_2700.s2699_modify_graph_edge_weights.Solution

Solution() - Constructor for class g2701_2800.s2706_buy_two_chocolates.Solution

Solution() - Constructor for class g2701_2800.s2707_extra_characters_in_a_string.Solution

Solution() - Constructor for class g2701_2800.s2708_maximum_strength_of_a_group.Solution

Solution() - Constructor for class g2701_2800.s2709_greatest_common_divisor_traversal.Solution

Solution() - Constructor for class g2701_2800.s2710_remove_trailing_zeros_from_a_string.Solution

Solution() - Constructor for class g2701_2800.s2711_difference_of_number_of_distinct_values_on_diagonals.Solution

Solution() - Constructor for class g2701_2800.s2712_minimum_cost_to_make_all_characters_equal.Solution

Solution() - Constructor for class g2701_2800.s2713_maximum_strictly_increasing_cells_in_a_matrix.Solution

Solution() - Constructor for class g2701_2800.s2716_minimize_string_length.Solution

Solution() - Constructor for class g2701_2800.s2717_semi_ordered_permutation.Solution

Solution() - Constructor for class g2701_2800.s2718_sum_of_matrix_after_queries.Solution

Solution() - Constructor for class g2701_2800.s2719_count_of_integers.Solution

Solution() - Constructor for class g2701_2800.s2729_check_if_the_number_is_fascinating.Solution

Solution() - Constructor for class g2701_2800.s2730_find_the_longest_semi_repetitive_substring.Solution

Solution() - Constructor for class g2701_2800.s2731_movement_of_robots.Solution

Solution() - Constructor for class g2701_2800.s2732_find_a_good_subset_of_the_matrix.Solution

Solution() - Constructor for class g2701_2800.s2733_neither_minimum_nor_maximum.Solution

Solution() - Constructor for class g2701_2800.s2734_lexicographically_smallest_string_after_substring_operation.Solution

Solution() - Constructor for class g2701_2800.s2735_collecting_chocolates.Solution

Solution() - Constructor for class g2701_2800.s2736_maximum_sum_queries.Solution

Solution() - Constructor for class g2701_2800.s2739_total_distance_traveled.Solution

Solution() - Constructor for class g2701_2800.s2740_find_the_value_of_the_partition.Solution

Solution() - Constructor for class g2701_2800.s2741_special_permutations.Solution

Solution() - Constructor for class g2701_2800.s2742_painting_the_walls.Solution

Solution() - Constructor for class g2701_2800.s2744_find_maximum_number_of_string_pairs.Solution

Solution() - Constructor for class g2701_2800.s2745_construct_the_longest_new_string.Solution

Solution() - Constructor for class g2701_2800.s2746_decremental_string_concatenation.Solution

Solution() - Constructor for class g2701_2800.s2747_count_zero_request_servers.Solution

Solution() - Constructor for class g2701_2800.s2748_number_of_beautiful_pairs.Solution

Solution() - Constructor for class g2701_2800.s2749_minimum_operations_to_make_the_integer_zero.Solution

Solution() - Constructor for class g2701_2800.s2750_ways_to_split_array_into_good_subarrays.Solution

Solution() - Constructor for class g2701_2800.s2751_robot_collisions.Solution

Solution() - Constructor for class g2701_2800.s2760_longest_even_odd_subarray_with_threshold.Solution

Solution() - Constructor for class g2701_2800.s2761_prime_pairs_with_target_sum.Solution

Solution() - Constructor for class g2701_2800.s2762_continuous_subarrays.Solution

Solution() - Constructor for class g2701_2800.s2763_sum_of_imbalance_numbers_of_all_subarrays.Solution

Solution() - Constructor for class g2701_2800.s2765_longest_alternating_subarray.Solution

Solution() - Constructor for class g2701_2800.s2766_relocate_marbles.Solution

Solution() - Constructor for class g2701_2800.s2767_partition_string_into_minimum_beautiful_substrings.Solution

Solution() - Constructor for class g2701_2800.s2768_number_of_black_blocks.Solution

Solution() - Constructor for class g2701_2800.s2769_find_the_maximum_achievable_number.Solution

Solution() - Constructor for class g2701_2800.s2770_maximum_number_of_jumps_to_reach_the_last_index.Solution

Solution() - Constructor for class g2701_2800.s2771_longest_non_decreasing_subarray_from_two_arrays.Solution

Solution() - Constructor for class g2701_2800.s2772_apply_operations_to_make_all_array_elements_equal_to_zero.Solution

Solution() - Constructor for class g2701_2800.s2778_sum_of_squares_of_special_elements.Solution

Solution() - Constructor for class g2701_2800.s2779_maximum_beauty_of_an_array_after_applying_operation.Solution

Solution() - Constructor for class g2701_2800.s2780_minimum_index_of_a_valid_split.Solution

Solution() - Constructor for class g2701_2800.s2781_length_of_the_longest_valid_substring.Solution

Solution() - Constructor for class g2701_2800.s2784_check_if_array_is_good.Solution

Solution() - Constructor for class g2701_2800.s2785_sort_vowels_in_a_string.Solution

Solution() - Constructor for class g2701_2800.s2786_visit_array_positions_to_maximize_score.Solution

Solution() - Constructor for class g2701_2800.s2787_ways_to_express_an_integer_as_sum_of_powers.Solution

Solution() - Constructor for class g2701_2800.s2788_split_strings_by_separator.Solution

Solution() - Constructor for class g2701_2800.s2789_largest_element_in_an_array_after_merge_operations.Solution

Solution() - Constructor for class g2701_2800.s2790_maximum_number_of_groups_with_increasing_length.Solution

Solution() - Constructor for class g2701_2800.s2791_count_paths_that_can_form_a_palindrome_in_a_tree.Solution

Solution() - Constructor for class g2701_2800.s2798_number_of_employees_who_met_the_target.Solution

Solution() - Constructor for class g2701_2800.s2799_count_complete_subarrays_in_an_array.Solution

Solution() - Constructor for class g2701_2800.s2800_shortest_string_that_contains_three_strings.Solution

Solution() - Constructor for class g2801_2900.s2801_count_stepping_numbers_in_range.Solution

Solution() - Constructor for class g2801_2900.s2806_account_balance_after_rounded_purchase.Solution

Solution() - Constructor for class g2801_2900.s2807_insert_greatest_common_divisors_in_linked_list.Solution

Solution() - Constructor for class g2801_2900.s2808_minimum_seconds_to_equalize_a_circular_array.Solution

Solution() - Constructor for class g2801_2900.s2809_minimum_time_to_make_array_sum_at_most_x.Solution

Solution() - Constructor for class g2801_2900.s2810_faulty_keyboard.Solution

Solution() - Constructor for class g2801_2900.s2811_check_if_it_is_possible_to_split_array.Solution

Solution() - Constructor for class g2801_2900.s2812_find_the_safest_path_in_a_grid.Solution

Solution() - Constructor for class g2801_2900.s2813_maximum_elegance_of_a_k_length_subsequence.Solution

Solution() - Constructor for class g2801_2900.s2815_max_pair_sum_in_an_array.Solution

Solution() - Constructor for class g2801_2900.s2816_double_a_number_represented_as_a_linked_list.Solution

Solution() - Constructor for class g2801_2900.s2817_minimum_absolute_difference_between_elements_with_constraint.Solution

Solution() - Constructor for class g2801_2900.s2818_apply_operations_to_maximize_score.Solution

Solution() - Constructor for class g2801_2900.s2824_count_pairs_whose_sum_is_less_than_target.Solution

Solution() - Constructor for class g2801_2900.s2825_make_string_a_subsequence_using_cyclic_increments.Solution

Solution() - Constructor for class g2801_2900.s2826_sorting_three_groups.Solution

Solution() - Constructor for class g2801_2900.s2827_number_of_beautiful_integers_in_the_range.Solution

Solution() - Constructor for class g2801_2900.s2828_check_if_a_string_is_an_acronym_of_words.Solution

Solution() - Constructor for class g2801_2900.s2829_determine_the_minimum_sum_of_a_k_avoiding_array.Solution

Solution() - Constructor for class g2801_2900.s2830_maximize_the_profit_as_the_salesman.Solution

Solution() - Constructor for class g2801_2900.s2831_find_the_longest_equal_subarray.Solution

Solution() - Constructor for class g2801_2900.s2833_furthest_point_from_origin.Solution

Solution() - Constructor for class g2801_2900.s2834_find_the_minimum_possible_sum_of_a_beautiful_array.Solution

Solution() - Constructor for class g2801_2900.s2835_minimum_operations_to_form_subsequence_with_target_sum.Solution

Solution() - Constructor for class g2801_2900.s2836_maximize_value_of_function_in_a_ball_passing_game.Solution

Solution() - Constructor for class g2801_2900.s2839_check_if_strings_can_be_made_equal_with_operations_i.Solution

Solution() - Constructor for class g2801_2900.s2840_check_if_strings_can_be_made_equal_with_operations_ii.Solution

Solution() - Constructor for class g2801_2900.s2841_maximum_sum_of_almost_unique_subarray.Solution

Solution() - Constructor for class g2801_2900.s2842_count_k_subsequences_of_a_string_with_maximum_beauty.Solution

Solution() - Constructor for class g2801_2900.s2843_count_symmetric_integers.Solution

Solution() - Constructor for class g2801_2900.s2844_minimum_operations_to_make_a_special_number.Solution

Solution() - Constructor for class g2801_2900.s2845_count_of_interesting_subarrays.Solution

Solution() - Constructor for class g2801_2900.s2846_minimum_edge_weight_equilibrium_queries_in_a_tree.Solution

Solution() - Constructor for class g2801_2900.s2848_points_that_intersect_with_cars.Solution

Solution() - Constructor for class g2801_2900.s2849_determine_if_a_cell_is_reachable_at_a_given_time.Solution

Solution() - Constructor for class g2801_2900.s2850_minimum_moves_to_spread_stones_over_grid.Solution

Solution() - Constructor for class g2801_2900.s2851_string_transformation.Solution

Solution() - Constructor for class g2801_2900.s2855_minimum_right_shifts_to_sort_the_array.Solution

Solution() - Constructor for class g2801_2900.s2856_minimum_array_length_after_pair_removals.Solution

Solution() - Constructor for class g2801_2900.s2857_count_pairs_of_points_with_distance_k.Solution

Solution() - Constructor for class g2801_2900.s2858_minimum_edge_reversals_so_every_node_is_reachable.Solution

Solution() - Constructor for class g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits.Solution

Solution() - Constructor for class g2801_2900.s2860_happy_students.Solution

Solution() - Constructor for class g2801_2900.s2861_maximum_number_of_alloys.Solution

Solution() - Constructor for class g2801_2900.s2862_maximum_element_sum_of_a_complete_subset_of_indices.Solution

Solution() - Constructor for class g2801_2900.s2864_maximum_odd_binary_number.Solution

Solution() - Constructor for class g2801_2900.s2865_beautiful_towers_i.Solution

Solution() - Constructor for class g2801_2900.s2866_beautiful_towers_ii.Solution

Solution() - Constructor for class g2801_2900.s2867_count_valid_paths_in_a_tree.Solution

Solution() - Constructor for class g2801_2900.s2869_minimum_operations_to_collect_elements.Solution

Solution() - Constructor for class g2801_2900.s2870_minimum_number_of_operations_to_make_array_empty.Solution

Solution() - Constructor for class g2801_2900.s2871_split_array_into_maximum_number_of_subarrays.Solution

Solution() - Constructor for class g2801_2900.s2872_maximum_number_of_k_divisible_components.Solution

Solution() - Constructor for class g2801_2900.s2873_maximum_value_of_an_ordered_triplet_i.Solution

Solution() - Constructor for class g2801_2900.s2874_maximum_value_of_an_ordered_triplet_ii.Solution

Solution() - Constructor for class g2801_2900.s2875_minimum_size_subarray_in_infinite_array.Solution

Solution() - Constructor for class g2801_2900.s2876_count_visited_nodes_in_a_directed_graph.Solution

Solution() - Constructor for class g2801_2900.s2894_divisible_and_non_divisible_sums_difference.Solution

Solution() - Constructor for class g2801_2900.s2895_minimum_processing_time.Solution

Solution() - Constructor for class g2801_2900.s2896_apply_operations_to_make_two_strings_equal.Solution

Solution() - Constructor for class g2801_2900.s2897_apply_operations_on_array_to_maximize_sum_of_squares.Solution

Solution() - Constructor for class g2801_2900.s2899_last_visited_integers.Solution

Solution() - Constructor for class g2801_2900.s2900_longest_unequal_adjacent_groups_subsequence_i.Solution

Solution() - Constructor for class g2901_3000.s2901_longest_unequal_adjacent_groups_subsequence_ii.Solution

Solution() - Constructor for class g2901_3000.s2902_count_of_sub_multisets_with_bounded_sum.Solution

Solution() - Constructor for class g2901_3000.s2903_find_indices_with_index_and_value_difference_i.Solution

Solution() - Constructor for class g2901_3000.s2904_shortest_and_lexicographically_smallest_beautiful_string.Solution

Solution() - Constructor for class g2901_3000.s2905_find_indices_with_index_and_value_difference_ii.Solution

Solution() - Constructor for class g2901_3000.s2906_construct_product_matrix.Solution

Solution() - Constructor for class g2901_3000.s2908_minimum_sum_of_mountain_triplets_i.Solution

Solution() - Constructor for class g2901_3000.s2909_minimum_sum_of_mountain_triplets_ii.Solution

Solution() - Constructor for class g2901_3000.s2910_minimum_number_of_groups_to_create_a_valid_assignment.Solution

Solution() - Constructor for class g2901_3000.s2911_minimum_changes_to_make_k_semi_palindromes.Solution

Solution() - Constructor for class g2901_3000.s2913_subarrays_distinct_element_sum_of_squares_i.Solution

Solution() - Constructor for class g2901_3000.s2914_minimum_number_of_changes_to_make_binary_string_beautiful.Solution

Solution() - Constructor for class g2901_3000.s2915_length_of_the_longest_subsequence_that_sums_to_target.Solution

Solution() - Constructor for class g2901_3000.s2916_subarrays_distinct_element_sum_of_squares_ii.Solution

Solution() - Constructor for class g2901_3000.s2917_find_the_k_or_of_an_array.Solution

Solution() - Constructor for class g2901_3000.s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros.Solution

Solution() - Constructor for class g2901_3000.s2919_minimum_increment_operations_to_make_array_beautiful.Solution

Solution() - Constructor for class g2901_3000.s2920_maximum_points_after_collecting_coins_from_all_nodes.Solution

Solution() - Constructor for class g2901_3000.s2923_find_champion_i.Solution

Solution() - Constructor for class g2901_3000.s2924_find_champion_ii.Solution

Solution() - Constructor for class g2901_3000.s2925_maximum_score_after_applying_operations_on_a_tree.Solution

Solution() - Constructor for class g2901_3000.s2926_maximum_balanced_subsequence_sum.Solution

Solution() - Constructor for class g2901_3000.s2928_distribute_candies_among_children_i.Solution

Solution() - Constructor for class g2901_3000.s2929_distribute_candies_among_children_ii.Solution

Solution() - Constructor for class g2901_3000.s2930_number_of_strings_which_can_be_rearranged_to_contain_substring.Solution

Solution() - Constructor for class g2901_3000.s2931_maximum_spending_after_buying_items.Solution

Solution() - Constructor for class g2901_3000.s2932_maximum_strong_pair_xor_i.Solution

Solution() - Constructor for class g2901_3000.s2933_high_access_employees.Solution

Solution() - Constructor for class g2901_3000.s2934_minimum_operations_to_maximize_last_elements_in_arrays.Solution

Solution() - Constructor for class g2901_3000.s2935_maximum_strong_pair_xor_ii.Solution

Solution() - Constructor for class g2901_3000.s2937_make_three_strings_equal.Solution

Solution() - Constructor for class g2901_3000.s2938_separate_black_and_white_balls.Solution

Solution() - Constructor for class g2901_3000.s2939_maximum_xor_product.Solution

Solution() - Constructor for class g2901_3000.s2940_find_building_where_alice_and_bob_can_meet.Solution

Solution() - Constructor for class g2901_3000.s2942_find_words_containing_character.Solution

Solution() - Constructor for class g2901_3000.s2943_maximize_area_of_square_hole_in_grid.Solution

Solution() - Constructor for class g2901_3000.s2944_minimum_number_of_coins_for_fruits.Solution

Solution() - Constructor for class g2901_3000.s2945_find_maximum_non_decreasing_array_length.Solution

Solution() - Constructor for class g2901_3000.s2946_matrix_similarity_after_cyclic_shifts.Solution

Solution() - Constructor for class g2901_3000.s2947_count_beautiful_substrings_i.Solution

Solution() - Constructor for class g2901_3000.s2948_make_lexicographically_smallest_array_by_swapping_elements.Solution

Solution() - Constructor for class g2901_3000.s2949_count_beautiful_substrings_ii.Solution

Solution() - Constructor for class g2901_3000.s2951_find_the_peaks.Solution

Solution() - Constructor for class g2901_3000.s2952_minimum_number_of_coins_to_be_added.Solution

Solution() - Constructor for class g2901_3000.s2953_count_complete_substrings.Solution

Solution() - Constructor for class g2901_3000.s2954_count_the_number_of_infection_sequences.Solution

Solution() - Constructor for class g2901_3000.s2956_find_common_elements_between_two_arrays.Solution

Solution() - Constructor for class g2901_3000.s2957_remove_adjacent_almost_equal_characters.Solution

Solution() - Constructor for class g2901_3000.s2958_length_of_longest_subarray_with_at_most_k_frequency.Solution

Solution() - Constructor for class g2901_3000.s2959_number_of_possible_sets_of_closing_branches.Solution

Solution() - Constructor for class g2901_3000.s2960_count_tested_devices_after_test_operations.Solution

Solution() - Constructor for class g2901_3000.s2961_double_modular_exponentiation.Solution

Solution() - Constructor for class g2901_3000.s2962_count_subarrays_where_max_element_appears_at_least_k_times.Solution

Solution() - Constructor for class g2901_3000.s2963_count_the_number_of_good_partitions.Solution

Solution() - Constructor for class g2901_3000.s2965_find_missing_and_repeated_values.Solution

Solution() - Constructor for class g2901_3000.s2966_divide_array_into_arrays_with_max_difference.Solution

Solution() - Constructor for class g2901_3000.s2967_minimum_cost_to_make_array_equalindromic.Solution

Solution() - Constructor for class g2901_3000.s2968_apply_operations_to_maximize_frequency_score.Solution

Solution() - Constructor for class g2901_3000.s2970_count_the_number_of_incremovable_subarrays_i.Solution

Solution() - Constructor for class g2901_3000.s2971_find_polygon_with_the_largest_perimeter.Solution

Solution() - Constructor for class g2901_3000.s2972_count_the_number_of_incremovable_subarrays_ii.Solution

Solution() - Constructor for class g2901_3000.s2973_find_number_of_coins_to_place_in_tree_nodes.Solution

Solution() - Constructor for class g2901_3000.s2974_minimum_number_game.Solution

Solution() - Constructor for class g2901_3000.s2975_maximum_square_area_by_removing_fences_from_a_field.Solution

Solution() - Constructor for class g2901_3000.s2976_minimum_cost_to_convert_string_i.Solution

Solution() - Constructor for class g2901_3000.s2977_minimum_cost_to_convert_string_ii.Solution

Solution() - Constructor for class g2901_3000.s2980_check_if_bitwise_or_has_trailing_zeros.Solution

Solution() - Constructor for class g2901_3000.s2981_find_longest_special_substring_that_occurs_thrice_i.Solution

Solution() - Constructor for class g2901_3000.s2982_find_longest_special_substring_that_occurs_thrice_ii.Solution

Solution() - Constructor for class g2901_3000.s2983_palindrome_rearrangement_queries.Solution

Solution() - Constructor for class g2901_3000.s2996_smallest_missing_integer_greater_than_sequential_prefix_sum.Solution

Solution() - Constructor for class g2901_3000.s2997_minimum_number_of_operations_to_make_array_xor_equal_to_k.Solution

Solution() - Constructor for class g2901_3000.s2998_minimum_number_of_operations_to_make_x_and_y_equal.Solution

Solution() - Constructor for class g2901_3000.s2999_count_the_number_of_powerful_integers.Solution

Solution() - Constructor for class g2901_3000.s3000_maximum_area_of_longest_diagonal_rectangle.Solution

Solution() - Constructor for class g3001_3100.s3001_minimum_moves_to_capture_the_queen.Solution

Solution() - Constructor for class g3001_3100.s3002_maximum_size_of_a_set_after_removals.Solution

Solution() - Constructor for class g3001_3100.s3003_maximize_the_number_of_partitions_after_operations.Solution

Solution() - Constructor for class g3001_3100.s3005_count_elements_with_maximum_frequency.Solution

Solution() - Constructor for class g3001_3100.s3006_find_beautiful_indices_in_the_given_array_i.Solution

Solution() - Constructor for class g3001_3100.s3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k.Solution

Solution() - Constructor for class g3001_3100.s3008_find_beautiful_indices_in_the_given_array_ii.Solution

Solution() - Constructor for class g3001_3100.s3010_divide_an_array_into_subarrays_with_minimum_cost_i.Solution

Solution() - Constructor for class g3001_3100.s3011_find_if_array_can_be_sorted.Solution

Solution() - Constructor for class g3001_3100.s3012_minimize_length_of_array_using_operations.Solution

Solution() - Constructor for class g3001_3100.s3013_divide_an_array_into_subarrays_with_minimum_cost_ii.Solution

Solution() - Constructor for class g3001_3100.s3014_minimum_number_of_pushes_to_type_word_i.Solution

Solution() - Constructor for class g3001_3100.s3015_count_the_number_of_houses_at_a_certain_distance_i.Solution

Solution() - Constructor for class g3001_3100.s3016_minimum_number_of_pushes_to_type_word_ii.Solution

Solution() - Constructor for class g3001_3100.s3017_count_the_number_of_houses_at_a_certain_distance_ii.Solution

Solution() - Constructor for class g3001_3100.s3019_number_of_changing_keys.Solution

Solution() - Constructor for class g3001_3100.s3020_find_the_maximum_number_of_elements_in_subset.Solution

Solution() - Constructor for class g3001_3100.s3021_alice_and_bob_playing_flower_game.Solution

Solution() - Constructor for class g3001_3100.s3022_minimize_or_of_remaining_elements_using_operations.Solution

Solution() - Constructor for class g3001_3100.s3024_type_of_triangle.Solution

Solution() - Constructor for class g3001_3100.s3025_find_the_number_of_ways_to_place_people_i.Solution

Solution() - Constructor for class g3001_3100.s3026_maximum_good_subarray_sum.Solution

Solution() - Constructor for class g3001_3100.s3027_find_the_number_of_ways_to_place_people_ii.Solution

Solution() - Constructor for class g3001_3100.s3028_ant_on_the_boundary.Solution

Solution() - Constructor for class g3001_3100.s3029_minimum_time_to_revert_word_to_initial_state_i.Solution

Solution() - Constructor for class g3001_3100.s3030_find_the_grid_of_region_average.Solution

Solution() - Constructor for class g3001_3100.s3031_minimum_time_to_revert_word_to_initial_state_ii.Solution

Solution() - Constructor for class g3001_3100.s3033_modify_the_matrix.Solution

Solution() - Constructor for class g3001_3100.s3034_number_of_subarrays_that_match_a_pattern_i.Solution

Solution() - Constructor for class g3001_3100.s3035_maximum_palindromes_after_operations.Solution

Solution() - Constructor for class g3001_3100.s3036_number_of_subarrays_that_match_a_pattern_ii.Solution

Solution() - Constructor for class g3001_3100.s3038_maximum_number_of_operations_with_the_same_score_i.Solution

Solution() - Constructor for class g3001_3100.s3039_apply_operations_to_make_string_empty.Solution

Solution() - Constructor for class g3001_3100.s3040_maximum_number_of_operations_with_the_same_score_ii.Solution

Solution() - Constructor for class g3001_3100.s3041_maximize_consecutive_elements_in_an_array_after_modification.Solution

Solution() - Constructor for class g3001_3100.s3042_count_prefix_and_suffix_pairs_i.Solution

Solution() - Constructor for class g3001_3100.s3043_find_the_length_of_the_longest_common_prefix.Solution

Solution() - Constructor for class g3001_3100.s3044_most_frequent_prime.Solution

Solution() - Constructor for class g3001_3100.s3045_count_prefix_and_suffix_pairs_ii.Solution

Solution() - Constructor for class g3001_3100.s3046_split_the_array.Solution

Solution() - Constructor for class g3001_3100.s3047_find_the_largest_area_of_square_inside_two_rectangles.Solution

Solution() - Constructor for class g3001_3100.s3048_earliest_second_to_mark_indices_i.Solution

Solution() - Constructor for class g3001_3100.s3049_earliest_second_to_mark_indices_ii.Solution

Solution() - Constructor for class g3001_3100.s3065_minimum_operations_to_exceed_threshold_value_i.Solution

Solution() - Constructor for class g3001_3100.s3066_minimum_operations_to_exceed_threshold_value_ii.Solution

Solution() - Constructor for class g3001_3100.s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network.Solution

Solution() - Constructor for class g3001_3100.s3068_find_the_maximum_sum_of_node_values.Solution

Solution() - Constructor for class g3001_3100.s3069_distribute_elements_into_two_arrays_i.Solution

Solution(double, double, double) - Constructor for class g0401_0500.s0478_generate_random_point_in_a_circle.Solution

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

Solution(int[]) - Constructor for class g0301_0400.s0384_shuffle_an_array.Solution

Solution(int[]) - Constructor for class g0301_0400.s0398_random_pick_index.Solution

Solution(int[]) - Constructor for class g0501_0600.s0528_random_pick_with_weight.Solution

Solution(int[][]) - Constructor for class g0401_0500.s0497_random_point_in_non_overlapping_rectangles.Solution

Solution(int, int) - Constructor for class g0501_0600.s0519_random_flip_matrix.Solution

Solution(int, int[]) - Constructor for class g0701_0800.s0710_random_pick_with_blacklist.Solution

Solution(ListNode) - Constructor for class g0301_0400.s0382_linked_list_random_node.Solution

Solution.CustomFunction - Interface in g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation

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

solveEquation(String) - Method in class g0601_0700.s0640_solve_the_equation.Solution

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

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

sortArray(int[]) - Method in class g0901_1000.s0912_sort_an_array.Solution

sortArrayByParity(int[]) - Method in class g0901_1000.s0905_sort_array_by_parity.Solution

sortArrayByParityII(int[]) - Method in class g0901_1000.s0922_sort_array_by_parity_ii.Solution

sortByBits(int[]) - Method in class g1301_1400.s1356_sort_integers_by_the_number_of_1_bits.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

sortedSquares(int[]) - Method in class g0901_1000.s0977_squares_of_a_sorted_array.Solution

sortEvenOdd(int[]) - Method in class g2101_2200.s2164_sort_even_and_odd_indices_independently.Solution

sortItems(int, int, int[], List<List<Integer>>) - Method in class g1201_1300.s1203_sort_items_by_groups_respecting_dependencies.Solution

sortJumbled(int[], int[]) - Method in class g2101_2200.s2191_sort_the_jumbled_numbers.Solution

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

sortPeople(String[], int[]) - Method in class g2401_2500.s2418_sort_the_people.Solution

SORTracker - Class in g2101_2200.s2102_sequentially_ordinal_rank_tracker

2102 - Sequentially Ordinal Rank Tracker.

SORTracker() - Constructor for class g2101_2200.s2102_sequentially_ordinal_rank_tracker.SORTracker

sortSentence(String) - Method in class g1801_1900.s1859_sorting_the_sentence.Solution

sortString(String) - Method in class g1301_1400.s1370_increasing_decreasing_string.Solution

sortTheStudents(int[][], int) - Method in class g2501_2600.s2545_sort_the_students_by_their_kth_score.Solution

sortVowels(String) - Method in class g2701_2800.s2785_sort_vowels_in_a_string.Solution

soupServings(int) - Method in class g0801_0900.s0808_soup_servings.Solution

specialArray(int[]) - Method in class g1601_1700.s1608_special_array_with_x_elements_greater_than_or_equal_x.Solution

specialPerm(int[]) - Method in class g2701_2800.s2741_special_permutations.Solution

spellchecker(String[], String[]) - Method in class g0901_1000.s0966_vowel_spellchecker.Solution

spiralMatrix(int, int, ListNode) - Method in class g2301_2400.s2326_spiral_matrix_iv.Solution

spiralMatrixIII(int, int, int, int) - Method in class g0801_0900.s0885_spiral_matrix_iii.Solution

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

splitArray(int[], int) - Method in class g0401_0500.s0410_split_array_largest_sum.Solution

splitArraySameAverage(int[]) - Method in class g0801_0900.s0805_split_array_with_same_average.Solution

splitIntoFibonacci(String) - Method in class g0801_0900.s0842_split_array_into_fibonacci_sequence.Solution

splitListToParts(ListNode, int) - Method in class g0701_0800.s0725_split_linked_list_in_parts.Solution

splitMessage(String, int) - Method in class g2401_2500.s2468_split_message_based_on_limit.Solution

splitNum(int) - Method in class g2501_2600.s2578_split_with_minimum_sum.Solution

splitPainting(int[][]) - Method in class g1901_2000.s1943_describe_the_painting.Solution

splitString(String) - Method in class g1801_1900.s1849_splitting_a_string_into_descending_consecutive_values.Solution

splitWordsBySeparator(List<String>, char) - Method in class g2701_2800.s2788_split_strings_by_separator.Solution

squareFreeSubsets(int[]) - Method in class g2501_2600.s2572_count_the_number_of_square_free_subsets.Solution

squareIsWhite(String) - Method in class g1801_1900.s1812_determine_color_of_a_chessboard_square.Solution

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

startsWith(String) - Method in class g0701_0800.s0745_prefix_and_suffix_search.WordFilter

step(int) - Method in class g2001_2100.s2069_walking_robot_simulation_ii.Robot

StockPrice - Class in g2001_2100.s2034_stock_price_fluctuation

2034 - Stock Price Fluctuation.

StockPrice() - Constructor for class g2001_2100.s2034_stock_price_fluctuation.StockPrice

StockSpanner - Class in g0901_1000.s0901_online_stock_span

901 - Online Stock Span.

StockSpanner() - Constructor for class g0901_1000.s0901_online_stock_span.StockSpanner

stoneGame(int[]) - Method in class g0801_0900.s0877_stone_game.Solution

stoneGameII(int[]) - Method in class g1101_1200.s1140_stone_game_ii.Solution

stoneGameIII(int[]) - Method in class g1401_1500.s1406_stone_game_iii.Solution

stoneGameIX(int[]) - Method in class g2001_2100.s2029_stone_game_ix.Solution

stoneGameV(int[]) - Method in class g1501_1600.s1563_stone_game_v.Solution

stoneGameVI(int[], int[]) - Method in class g1601_1700.s1686_stone_game_vi.Solution

stoneGameVII(int[]) - Method in class g1601_1700.s1690_stone_game_vii.Solution

stoneGameVIII(int[]) - Method in class g1801_1900.s1872_stone_game_viii.Solution

strangePrinter(String) - Method in class g0601_0700.s0664_strange_printer.Solution

StreamChecker - Class in g1001_1100.s1032_stream_of_characters

1032 - Stream of Characters.

StreamChecker(String[]) - Constructor for class g1001_1100.s1032_stream_of_characters.StreamChecker

stringCount(int) - Method in class g2901_3000.s2930_number_of_strings_which_can_be_rearranged_to_contain_substring.Solution

stringMatching(String[]) - Method in class g1401_1500.s1408_string_matching_in_an_array.Solution

strongPasswordChecker(String) - Method in class g0401_0500.s0420_strong_password_checker.Solution

strongPasswordCheckerII(String) - Method in class g2201_2300.s2299_strong_password_checker_ii.Solution

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

strWithout3a3b(int, int) - Method in class g0901_1000.s0984_string_without_aaa_or_bbb.Solution

subarrayBitwiseORs(int[]) - Method in class g0801_0900.s0898_bitwise_ors_of_subarrays.Solution

subarrayGCD(int[], int) - Method in class g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k.Solution

subarrayLCM(int[], int) - Method in class g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k.Solution

subArrayRanges(int[]) - Method in class g2101_2200.s2104_sum_of_subarray_ranges.Solution

subarraysDivByK(int[], int) - Method in class g0901_1000.s0974_subarray_sums_divisible_by_k.Solution

subarraySum(int[], int) - Method in class g0501_0600.s0560_subarray_sum_equals_k.Solution

subarraysWithKDistinct(int[], int) - Method in class g0901_1000.s0992_subarrays_with_k_different_integers.Solution

subdomainVisits(String[]) - Method in class g0801_0900.s0811_subdomain_visit_count.Solution

subordinates - Variable in class com_github_leetcode.Employee

the id of direct subordinates

SubrectangleQueries - Class in g1401_1500.s1476_subrectangle_queries

1476 - Subrectangle Queries.

SubrectangleQueries(int[][]) - Constructor for class g1401_1500.s1476_subrectangle_queries.SubrectangleQueries

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

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

subsetXORSum(int[]) - Method in class g1801_1900.s1863_sum_of_all_subset_xor_totals.Solution

subStrHash(String, int, int, int, int) - Method in class g2101_2200.s2156_find_substring_with_given_hash_value.Solution

substringXorQueries(String, int[][]) - Method in class g2501_2600.s2564_substring_xor_queries.Solution

subtractProductAndSum(int) - Method in class g1201_1300.s1281_subtract_the_product_and_sum_of_digits_of_an_integer.Solution

subtreeWithAllDeepest(TreeNode) - Method in class g0801_0900.s0865_smallest_subtree_with_all_the_deepest_nodes.Solution

successfulPairs(int[], int[], long) - Method in class g2201_2300.s2300_successful_pairs_of_spells_and_potions.Solution

sufficientSubset(TreeNode, int) - Method in class g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths.Solution

sufficientSubset(TreeNode, int, int, boolean) - Method in class g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths.Solution

suggestedProducts(String[], String) - Method in class g1201_1300.s1268_search_suggestions_system.Solution

sum(int, int) - Method in class g2201_2300.s2235_add_two_integers.Solution

sum(String) - Method in class g0601_0700.s0677_map_sum_pairs.MapSum

sumBase(int, int) - Method in class g1801_1900.s1837_sum_of_digits_in_base_k.Solution

sumCounts(int[]) - Method in class g2901_3000.s2916_subarrays_distinct_element_sum_of_squares_ii.Solution

sumCounts(List<Integer>) - Method in class g2901_3000.s2913_subarrays_distinct_element_sum_of_squares_i.Solution

sumDistance(int[], String, int) - Method in class g2701_2800.s2731_movement_of_robots.Solution

sumEvenAfterQueries(int[], int[][]) - Method in class g0901_1000.s0985_sum_of_even_numbers_after_queries.Solution

sumEvenGrandparent(TreeNode) - Method in class g1301_1400.s1315_sum_of_nodes_with_even_valued_grandparent.Solution

sumFourDivisors(int[]) - Method in class g1301_1400.s1390_four_divisors.Solution

sumGame(String) - Method in class g1901_2000.s1927_sum_game.Solution

sumImbalanceNumbers(int[]) - Method in class g2701_2800.s2763_sum_of_imbalance_numbers_of_all_subarrays.Solution

sumIndicesWithKSetBits(List<Integer>, int) - Method in class g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits.Solution

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

SummaryRanges - Class in g0301_0400.s0352_data_stream_as_disjoint_intervals

352 - Data Stream as Disjoint Intervals.

SummaryRanges() - Constructor for class g0301_0400.s0352_data_stream_as_disjoint_intervals.SummaryRanges

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

sumOddLengthSubarrays(int[]) - Method in class g1501_1600.s1588_sum_of_all_odd_length_subarrays.Solution

sumOfBeauties(int[]) - Method in class g2001_2100.s2012_sum_of_beauty_in_the_array.Solution

sumOfDigits(long) - Method in class g2401_2500.s2457_minimum_addition_to_make_integer_beautiful.Solution

sumOfDistancesInTree(int, int[][]) - Method in class g0801_0900.s0834_sum_of_distances_in_tree.Solution

sumOfFlooredPairs(int[]) - Method in class g1801_1900.s1862_sum_of_floored_pairs.Solution

sumOfLeftLeaves(TreeNode) - Method in class g0401_0500.s0404_sum_of_left_leaves.Solution

sumOfMultiples(int) - Method in class g2601_2700.s2652_sum_multiples.Solution

sumOfNumberAndReverse(int) - Method in class g2401_2500.s2443_sum_of_number_and_its_reverse.Solution

sumOfPower(int[]) - Method in class g2601_2700.s2681_power_of_heroes.Solution

sumOfSquares(int[]) - Method in class g2701_2800.s2778_sum_of_squares_of_special_elements.Solution

sumOfThree(long) - Method in class g2101_2200.s2177_find_three_consecutive_integers_that_sum_to_a_given_number.Solution

sumOfUnique(int[]) - Method in class g1701_1800.s1748_sum_of_unique_elements.Solution

sumPrefixScores(String[]) - Method in class g2401_2500.s2416_sum_of_prefix_scores_of_strings.Solution

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

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

sumRegion(int, int, int, int) - Method in class g0301_0400.s0304_range_sum_query_2d_immutable.NumMatrix

sumRootToLeaf(TreeNode) - Method in class g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers.Solution

sumScores(String) - Method in class g2201_2300.s2223_sum_of_scores_of_built_strings.Solution

sumSubarrayMins(int[]) - Method in class g0901_1000.s0907_sum_of_subarray_minimums.Solution

sumSubseqWidths(int[]) - Method in class g0801_0900.s0891_sum_of_subsequence_widths.Solution

sumTree(TreeNode) - Method in class g1301_1400.s1339_maximum_product_of_splitted_binary_tree.Solution

sumZero(int) - Method in class g1301_1400.s1304_find_n_unique_integers_sum_up_to_zero.Solution

superEggDrop(int, int) - Method in class g0801_0900.s0887_super_egg_drop.Solution

superpalindromesInRange(String, String) - Method in class g0901_1000.s0906_super_palindromes.Solution

superPow(int, int[]) - Method in class g0301_0400.s0372_super_pow.Solution

surfaceArea(int[][]) - Method in class g0801_0900.s0892_surface_area_of_3d_shapes.Solution

survivedRobotsHealths(int[], int[], String) - Method in class g2701_2800.s2751_robot_collisions.Solution

swap(String, int, int, int, int) - Method in class g0701_0800.s0773_sliding_puzzle.Solution

swapNodes(ListNode, int) - Method in class g1701_1800.s1721_swapping_nodes_in_a_linked_list.Solution

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

swimInWater(int[][]) - Method in class g0701_0800.s0778_swim_in_rising_water.Solution

T

takeCharacters(String, int) - Method in class g2501_2600.s2516_take_k_of_each_character_from_left_and_right.Solution

tallestBillboard(int[]) - Method in class g0901_1000.s0956_tallest_billboard.Solution

targetIndices(int[], int) - Method in class g2001_2100.s2089_find_target_indices_after_sorting_array.Solution

taskSchedulerII(int[], int) - Method in class g2301_2400.s2365_task_scheduler_ii.Solution

TextEditor - Class in g2201_2300.s2296_design_a_text_editor

2296 - Design a Text Editor.

TextEditor() - Constructor for class g2201_2300.s2296_design_a_text_editor.TextEditor

theMaximumAchievableX(int, int) - Method in class g2701_2800.s2769_find_the_maximum_achievable_number.Solution

third(Runnable) - Method in class g1101_1200.s1114_print_in_order.Foo

thirdMax(int[]) - Method in class g0401_0500.s0414_third_maximum_number.Solution

thousandSeparator(int) - Method in class g1501_1600.s1556_thousand_separator.Solution

threeConsecutiveOdds(int[]) - Method in class g1501_1600.s1550_three_consecutive_odds.Solution

threeEqualParts(int[]) - Method in class g0901_1000.s0927_three_equal_parts.Solution

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

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

threeSumMulti(int[], int) - Method in class g0901_1000.s0923_3sum_with_multiplicity.Solution

ThroneInheritance - Class in g1501_1600.s1600_throne_inheritance

1600 - Throne Inheritance.

ThroneInheritance(String) - Constructor for class g1501_1600.s1600_throne_inheritance.ThroneInheritance

tictactoe(int[][]) - Method in class g1201_1300.s1275_find_winner_on_a_tic_tac_toe_game.Solution

tilingRectangle(int, int) - Method in class g1201_1300.s1240_tiling_a_rectangle_with_the_fewest_squares.Solution

TimeMap - Class in g0901_1000.s0981_time_based_key_value_store

981 - Time Based Key-Value Store.

TimeMap() - Constructor for class g0901_1000.s0981_time_based_key_value_store.TimeMap

timeRequiredToBuy(int[], int) - Method in class g2001_2100.s2073_time_needed_to_buy_tickets.Solution

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

toGoatLatin(String) - Method in class g0801_0900.s0824_goat_latin.Solution

toHex(int) - Method in class g0401_0500.s0405_convert_a_number_to_hexadecimal.Solution

toLowerCase(String) - Method in class g0701_0800.s0709_to_lower_case.Solution

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

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

topKFrequent(int[], int) - Method in class g0301_0400.s0347_top_k_frequent_elements.Solution

topKFrequent(String[], int) - Method in class g0601_0700.s0692_top_k_frequent_words.Solution

topLeft - Variable in class g0401_0500.s0427_construct_quad_tree.Node

topLeft - Variable in class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

topRight - Variable in class g0401_0500.s0427_construct_quad_tree.Node

topRight - Variable in class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

topStudents(String[], String[], String[], int[], int) - Method in class g2501_2600.s2512_reward_top_k_students.Solution

TopVotedCandidate - Class in g0901_1000.s0911_online_election

911 - Online Election.

TopVotedCandidate(int[], int[]) - Constructor for class g0901_1000.s0911_online_election.TopVotedCandidate

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

toString() - Method in class g0401_0500.s0427_construct_quad_tree.Node

toString() - Method in class g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node

toString() - Method in class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

toString() - Method in class g2101_2200.s2166_design_bitset.Bitset

totalCost(int[], int, int) - Method in class g2401_2500.s2462_total_cost_to_hire_k_workers.Solution

totalFruit(int[]) - Method in class g0901_1000.s0904_fruit_into_baskets.Solution

totalHammingDistance(int[]) - Method in class g0401_0500.s0477_total_hamming_distance.Solution

totalMoney(int) - Method in class g1701_1800.s1716_calculate_money_in_leetcode_bank.Solution

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

totalSteps(int[]) - Method in class g2201_2300.s2289_steps_to_make_array_non_decreasing.Solution

totalStrength(int[]) - Method in class g2201_2300.s2281_sum_of_total_strength_of_wizards.Solution

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

transfer(int, int, long) - Method in class g2001_2100.s2043_simple_bank_system.Bank

transpose(int[][]) - Method in class g0801_0900.s0867_transpose_matrix.Solution

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

trapRainWater(int[][]) - Method in class g0401_0500.s0407_trapping_rain_water_ii.Solution

Tree - Class in g0201_0300.s0212_word_search_ii

212 - Word Search II.

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

tree2str(TreeNode) - Method in class g0601_0700.s0606_construct_string_from_binary_tree.Solution

TreeAncestor - Class in g1401_1500.s1483_kth_ancestor_of_a_tree_node

1483 - Kth Ancestor of a Tree Node.

TreeAncestor(int, int[]) - Constructor for class g1401_1500.s1483_kth_ancestor_of_a_tree_node.TreeAncestor

TreeNode - Class in com_github_leetcode

TreeNode(int) - Constructor for class com_github_leetcode.TreeNode

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

treeQueries(TreeNode, int[]) - Method in class g2401_2500.s2458_height_of_binary_tree_after_subtree_removal_queries.Solution

triangleNumber(int[]) - Method in class g0601_0700.s0611_valid_triangle_number.Solution

triangleType(int[]) - Method in class g3001_3100.s3024_type_of_triangle.Solution

triangularSum(int[]) - Method in class g2201_2300.s2221_find_triangular_sum_of_an_array.Solution

tribonacci(int) - Method in class g1101_1200.s1137_n_th_tribonacci_number.Solution

Trie - Class in g0201_0300.s0208_implement_trie_prefix_tree

208 - Implement Trie (Prefix Tree).

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

trimBST(TreeNode, int, int) - Method in class g0601_0700.s0669_trim_a_binary_search_tree.Solution

trimMean(int[]) - Method in class g1601_1700.s1619_mean_of_array_after_removing_some_elements.Solution

truncateSentence(String, int) - Method in class g1801_1900.s1816_truncate_sentence.Solution

tupleSameProduct(int[]) - Method in class g1701_1800.s1726_tuple_with_same_product.Solution

TweetCounts - Class in g1301_1400.s1348_tweet_counts_per_frequency

1348 - Tweet Counts Per Frequency.

TweetCounts() - Constructor for class g1301_1400.s1348_tweet_counts_per_frequency.TweetCounts

Twitter - Class in g0301_0400.s0355_design_twitter

355 - Design Twitter.

Twitter() - Constructor for class g0301_0400.s0355_design_twitter.Twitter

twoCitySchedCost(int[][]) - Method in class g1001_1100.s1029_two_city_scheduling.Solution

twoEditWords(String[], String[]) - Method in class g2401_2500.s2452_words_within_two_edits_of_dictionary.Solution

twoEggDrop(int) - Method in class g1801_1900.s1884_egg_drop_with_2_eggs_and_n_floors.Solution

twoOutOfThree(int[], int[], int[]) - Method in class g2001_2100.s2032_two_out_of_three.Solution

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

uncommonFromSentences(String, String) - Method in class g0801_0900.s0884_uncommon_words_from_two_sentences.Solution

UndergroundSystem - Class in g1301_1400.s1396_design_underground_system

1396 - Design Underground System.

UndergroundSystem() - Constructor for class g1301_1400.s1396_design_underground_system.UndergroundSystem

unequalTriplets(int[]) - Method in class g2401_2500.s2475_number_of_unequal_triplets_in_array.Solution

unfix(int) - Method in class g2101_2200.s2166_design_bitset.Bitset

unfollow(int, int) - Method in class g0301_0400.s0355_design_twitter.Twitter

unhappyFriends(int, int[][], int[][]) - Method in class g1501_1600.s1583_count_unhappy_friends.Solution

union(int, int, int[], int[]) - Method in class g1501_1600.s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable.Solution

uniqueLetterString(String) - Method in class g0801_0900.s0828_count_unique_characters_of_all_substrings_of_a_given_string.Solution

uniqueMorseRepresentations(String[]) - Method in class g0801_0900.s0804_unique_morse_code_words.Solution

uniqueOccurrences(int[]) - Method in class g1201_1300.s1207_unique_number_of_occurrences.Solution

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

uniquePathsIII(int[][]) - Method in class g0901_1000.s0980_unique_paths_iii.Solution

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

unlock(int, int) - Method in class g1901_2000.s1993_operations_on_tree.LockingTree

unreserve(int) - Method in class g1801_1900.s1845_seat_reservation_manager.SeatManager

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

update(int, int) - Method in class g2001_2100.s2034_stock_price_fluctuation.StockPrice

updateBoard(char[][], int[]) - Method in class g0501_0600.s0529_minesweeper.Solution

updateMatrix(int[][]) - Method in class g0501_0600.s0542_01_matrix.Solution

updateSubrectangle(int, int, int, int, int) - Method in class g1401_1500.s1476_subrectangle_queries.SubrectangleQueries

upgrade(int, int) - Method in class g1901_2000.s1993_operations_on_tree.LockingTree

upload(int) - Method in class g2401_2500.s2424_longest_uploaded_prefix.LUPrefix

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

val - Variable in class g0401_0500.s0427_construct_quad_tree.Node

val - Variable in class g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node

val - Variable in class g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node

validArrangement(int[][]) - Method in class g2001_2100.s2097_valid_arrangement_of_pairs.Solution

validateBinaryTreeNodes(int, int[], int[]) - Method in class g1301_1400.s1361_validate_binary_tree_nodes.Solution

validateStackSequences(int[], int[]) - Method in class g0901_1000.s0946_validate_stack_sequences.Solution

validIPAddress(String) - Method in class g0401_0500.s0468_validate_ip_address.Solution

validMountainArray(int[]) - Method in class g0901_1000.s0941_valid_mountain_array.Solution

validPalindrome(String) - Method in class g0601_0700.s0680_valid_palindrome_ii.Solution

validPartition(int[]) - Method in class g2301_2400.s2369_check_if_there_is_a_valid_partition_for_the_array.Solution

validPath(int, int[][], int, int) - Method in class g1901_2000.s1971_find_if_path_exists_in_graph.Solution

validSquare(int[], int[], int[], int[]) - Method in class g0501_0600.s0593_valid_square.Solution

validSubarraySize(int[], int) - Method in class g2301_2400.s2334_subarray_with_elements_greater_than_varying_threshold.Solution

validTicTacToe(String[]) - Method in class g0701_0800.s0794_valid_tic_tac_toe_state.Solution

validUtf8(int[]) - Method in class g0301_0400.s0393_utf_8_validation.Solution

VersionControl - Class in g0201_0300.s0278_first_bad_version

278 - First Bad Version.

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

verticalTraversal(TreeNode) - Method in class g0901_1000.s0987_vertical_order_traversal_of_a_binary_tree.Solution

videoStitching(int[][], int) - Method in class g1001_1100.s1024_video_stitching.Solution

visiblePoints(List<List<Integer>>, int, List<Integer>) - Method in class g1601_1700.s1610_maximum_number_of_visible_points.Solution

visit(String) - Method in class g1401_1500.s1472_design_browser_history.BrowserHistory

vowelStrings(String[], int[][]) - Method in class g2501_2600.s2559_count_vowel_strings_in_ranges.Solution

vowelStrings(String[], int, int) - Method in class g2501_2600.s2586_count_the_number_of_vowel_strings_in_range.Solution

W

wantsToEat(int, Runnable, Runnable, Runnable, Runnable, Runnable) - Method in class g1201_1300.s1226_the_dining_philosophers.DiningPhilosophers

watchedVideosByFriends(List<List<String>>, int[][], int, int) - Method in class g1301_1400.s1311_get_watched_videos_by_your_friends.Solution

wateringPlants(int[], int) - Method in class g2001_2100.s2079_watering_plants.Solution

ways(String[], int) - Method in class g1401_1500.s1444_number_of_ways_of_cutting_a_pizza.Solution

waysToBuildRooms(int[]) - Method in class g1901_2000.s1916_count_ways_to_build_rooms_in_an_ant_colony.Solution

waysToBuyPensPencils(int, int, int) - Method in class g2201_2300.s2240_number_of_ways_to_buy_pens_and_pencils.Solution

waysToFillArray(int[][]) - Method in class g1701_1800.s1735_count_ways_to_make_array_with_product.Solution

waysToMakeFair(int[]) - Method in class g1601_1700.s1664_ways_to_make_a_fair_array.Solution

waysToPartition(int[], int) - Method in class g2001_2100.s2025_maximum_number_of_ways_to_partition_an_array.Solution

waysToReachTarget(int, int[][]) - Method in class g2501_2600.s2585_number_of_ways_to_earn_points.Solution

waysToSplit(int[]) - Method in class g1701_1800.s1712_ways_to_split_array_into_three_subarrays.Solution

waysToSplitArray(int[]) - Method in class g2201_2300.s2270_number_of_ways_to_split_array.Solution

widthOfBinaryTree(TreeNode) - Method in class g0601_0700.s0662_maximum_width_of_binary_tree.Solution

wiggleMaxLength(int[]) - Method in class g0301_0400.s0376_wiggle_subsequence.Solution

wiggleSort(int[]) - Method in class g0301_0400.s0324_wiggle_sort_ii.Solution

winnerOfGame(String) - Method in class g2001_2100.s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color.Solution

winnerSquareGame(int) - Method in class g1501_1600.s1510_stone_game_iv.Solution

withdraw(int) - Method in class g2201_2300.s2241_design_an_atm_machine.ATM

withdraw(int, long) - Method in class g2001_2100.s2043_simple_bank_system.Bank

wonderfulSubstrings(String) - Method in class g1901_2000.s1915_number_of_wonderful_substrings.Solution

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

wordCount(String[], String[]) - Method in class g2101_2200.s2135_count_words_obtained_after_adding_a_letter.Solution

WordDictionary - Class in g0201_0300.s0211_design_add_and_search_words_data_structure

211 - Design Add and Search Words Data Structure.

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

WordFilter - Class in g0701_0800.s0745_prefix_and_suffix_search

745 - Prefix and Suffix Search.

WordFilter(String[]) - Constructor for class g0701_0800.s0745_prefix_and_suffix_search.WordFilter

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

wordSubsets(String[], String[]) - Method in class g0901_1000.s0916_word_subsets.Solution

X

xorAllNums(int[], int[]) - Method in class g2401_2500.s2425_bitwise_xor_of_all_pairings.Solution

xorBeauty(int[]) - Method in class g2501_2600.s2527_find_xor_beauty_of_array.Solution

xorGame(int[]) - Method in class g0801_0900.s0810_chalkboard_xor_game.Solution

xorOperation(int, int) - Method in class g1401_1500.s1486_xor_operation_in_an_array.Solution

xorQueries(int[], int[][]) - Method in class g1301_1400.s1310_xor_queries_of_a_subarray.Solution

Z

zero(IntConsumer) - Method in class g1101_1200.s1116_print_zero_even_odd.ZeroEvenOdd

ZeroEvenOdd - Class in g1101_1200.s1116_print_zero_even_odd

1116 - Print Zero Even Odd.

ZeroEvenOdd(int) - Constructor for class g1101_1200.s1116_print_zero_even_odd.ZeroEvenOdd

zeroFilledSubarray(int[]) - Method in class g2301_2400.s2348_number_of_zero_filled_subarrays.Solution

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 O P Q R S T U V W X Z
All Classes and Interfaces|All Packages|Constant Field Values