S-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

S

sampleStats(kotlin.IntArray) - function in g1001_1100.s1093_statistics_from_a_large_sample.Solution
satisfiesConditions(kotlin.Array) - function in g3101_3200.s3142_check_if_grid_satisfies_conditions.Solution
scatter(java.lang.Integer,java.lang.Integer) - function in g2201_2300.s2286_booking_concert_tickets_in_groups.BookMyShow
scheduleCourse(kotlin.Array) - function in g0601_0700.s0630_course_schedule_iii.Solution
scoreOfParentheses(java.lang.String) - function in g0801_0900.s0856_score_of_parentheses.Solution
scoreOfString(java.lang.String) - function in g3101_3200.s3110_score_of_a_string.Solution
scoreOfStudents(java.lang.String,kotlin.IntArray) - function in g2001_2100.s2019_the_score_of_students_solving_math_expression.Solution
search(kotlin.IntArray,java.lang.Integer) - function in g0001_0100.s0033_search_in_rotated_sorted_array.Solution
search(kotlin.IntArray,java.lang.Integer) - function in g0001_0100.s0081_search_in_rotated_sorted_array_ii.Solution
search(java.lang.String,g0201_0300.s0208_implement_trie_prefix_tree.Trie.TrieNode,java.lang.Integer) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie
search(java.lang.String,g0201_0300.s0208_implement_trie_prefix_tree.Trie.TrieNode) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie
search(java.lang.String) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie
search(java.lang.String) - function in g0201_0300.s0211_design_add_and_search_words_data_structure.WordDictionary
search(java.lang.String) - function in g0601_0700.s0676_implement_magic_dictionary.MagicDictionary
search(kotlin.IntArray,java.lang.Integer) - function in g0701_0800.s0704_binary_search.Solution
search(java.lang.Integer) - function in g1201_1300.s1206_design_skiplist.Skiplist
search(java.lang.Integer) - function in g1901_2000.s1912_design_movie_rental_system.MovieRentingSystem
searchBST(com_github_leetcode.TreeNode,java.lang.Integer) - function in g0601_0700.s0700_search_in_a_binary_search_tree.Solution
searchInsert(kotlin.IntArray,java.lang.Integer) - function in g0001_0100.s0035_search_insert_position.Solution
searchMatrix(kotlin.Array,java.lang.Integer) - function in g0001_0100.s0074_search_a_2d_matrix.Solution
searchMatrix(kotlin.Array,java.lang.Integer) - function in g0201_0300.s0240_search_a_2d_matrix_ii.Solution
searchRange(kotlin.IntArray,java.lang.Integer) - function in g0001_0100.s0034_find_first_and_last_position_of_element_in_sorted_array.Solution
seat() - function in g0801_0900.s0855_exam_room.ExamRoom
SeatManager - class in g1801_1900.s1845_seat_reservation_manager: 1845 - Seat Reservation Manager\.
second(java.lang.Runnable) - function in g1101_1200.s1114_print_in_order.Foo
secondGreaterElement(kotlin.IntArray) - function in g2401_2500.s2454_next_greater_element_iv.Solution
secondHighest(java.lang.String) - function in g1701_1800.s1796_second_largest_digit_in_a_string.Solution
secondMinimum(java.lang.Integer,kotlin.Array,java.lang.Integer,java.lang.Integer) - function in g2001_2100.s2045_second_minimum_time_to_reach_destination.Solution
secondsToRemoveOccurrences(java.lang.String) - function in g2301_2400.s2380_time_needed_to_rearrange_a_binary_string.Solution
selfDividingNumbers(java.lang.Integer,java.lang.Integer) - function in g0701_0800.s0728_self_dividing_numbers.Solution
sellingWood(java.lang.Integer,java.lang.Integer,kotlin.Array) - function in g2301_2400.s2312_selling_pieces_of_wood.Solution
semiOrderedPermutation(kotlin.IntArray) - function in g2701_2800.s2717_semi_ordered_permutation.Solution
separateDigits(kotlin.IntArray) - function in g2501_2600.s2553_separate_the_digits_in_an_array.Solution
sequentialDigits(java.lang.Integer,java.lang.Integer) - function in g1201_1300.s1291_sequential_digits.Solution
serialize(com_github_leetcode.TreeNode) - function in g0201_0300.s0297_serialize_and_deserialize_binary_tree.Codec
serialize(com_github_leetcode.TreeNode,kotlin.text.StringBuilder) - function in g0201_0300.s0297_serialize_and_deserialize_binary_tree.Codec
serialize(com_github_leetcode.TreeNode) - function in g0401_0500.s0449_serialize_and_deserialize_bst.Codec
set(java.lang.String,java.lang.String,java.lang.Integer) - function in g0901_1000.s0981_time_based_key_value_store.TimeMap
set(java.lang.Integer,java.lang.Integer) - function in g1101_1200.s1146_snapshot_array.SnapshotArray
setArray(kotlin.Array) - function in g0301_0400.s0304_range_sum_query_2d_immutable.NumMatrix
setArrHash(java.lang.Integer) - function in g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts.Solution.Data
setBottomLeft(g0401_0500.s0427_construct_quad_tree.Node) - function in g0401_0500.s0427_construct_quad_tree.Node
setBottomLeft(g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node) - function in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node
setBottomRight(g0401_0500.s0427_construct_quad_tree.Node) - function in g0401_0500.s0427_construct_quad_tree.Node
setBottomRight(g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node) - function in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node
setCapital(java.lang.Integer) - function in g0501_0600.s0502_ipo.Solution.Data
setCapitalMinHeap(java.util.PriorityQueue) - function in g0501_0600.s0502_ipo.Solution
setChild(g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node) - function in g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node
setChildren(kotlin.Array) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie.TrieNode
setCount(java.lang.Integer) - function in g0701_0800.s0726_number_of_atoms.Solution.Item
setCount(java.lang.Integer) - function in g0901_1000.s0996_number_of_squareful_arrays.Solution
setDiff(java.lang.Integer) - function in g0601_0700.s0671_second_minimum_node_in_a_binary_tree.Solution
setDim(kotlin.Array) - function in g0201_0300.s0289_game_of_life.Solution.Companion
setDis(java.lang.Integer) - function in g1501_1600.s1584_min_cost_to_connect_all_points.Solution.Pair
setDivideTo(kotlin.IntArray) - function in g2501_2600.s2584_split_the_array_to_make_coprime_products.Solution.Companion
setDp(kotlin.Array) - function in g0501_0600.s0546_remove_boxes.Solution
setEnd(java.lang.String) - function in g0201_0300.s0212_word_search_ii.Tree
setGrid(kotlin.Array) - function in g1401_1500.s1476_subrectangle_queries.SubrectangleQueries
setId(java.lang.Integer) - function in com_github_leetcode.Employee: It's the unique id of each node; unique id of this employee
setId(java.lang.Integer) - function in g2501_2600.s2502_design_memory_allocator.Allocator.Node
setIdx(java.lang.Integer) - function in g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts.Solution.Data
setImportance(java.lang.Integer) - function in com_github_leetcode.Employee: the importance value of this employee
setInd(java.lang.Integer) - function in g2501_2600.s2502_design_memory_allocator.Allocator.Node
setInf(java.lang.Long) - function in g2001_2100.s2040_kth_smallest_product_of_two_sorted_arrays.Solution.Companion
setKey(java.lang.Integer) - function in g0101_0200.s0146_lru_cache.LRUCache.Node
setLeaf(java.lang.Boolean) - function in g0401_0500.s0427_construct_quad_tree.Node
setLeaf(java.lang.Boolean) - function in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node
setLeft(com_github_leetcode.TreeNode) - function in com_github_leetcode.TreeNode
setLeft(com_github_leetcode.left_right.Node) - function in com_github_leetcode.left_right.Node
setLeft(g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.TreeNode) - function in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.TreeNode
setMatrix(kotlin.Array) - function in g0301_0400.s0375_guess_number_higher_or_lower_ii.Solution
setMin(java.lang.Integer) - function in g0601_0700.s0671_second_minimum_node_in_a_binary_tree.Solution
setMOD(java.lang.Integer) - function in g1501_1600.s1575_count_all_possible_routes.Solution.Companion
setMod(java.lang.Integer) - function in g1901_2000.s1977_number_of_ways_to_separate_numbers.Solution.Companion
setMOD(java.lang.Integer) - function in g2501_2600.s2580_count_ways_to_group_overlapping_ranges.Solution.Companion
setName(java.lang.String) - function in g2101_2200.s2102_sequentially_ordinal_rank_tracker.SORTracker.Location
setNeighbors(java.util.List) - function in com_github_leetcode.Node
setNeighbors(kotlin.collections.ArrayList) - function in com_github_leetcode.neighbors.Node
setNext(com_github_leetcode.ListNode) - function in com_github_leetcode.ListNode
setNext(com_github_leetcode.left_right.Node) - function in com_github_leetcode.left_right.Node
setNext(com_github_leetcode.random.Node) - function in com_github_leetcode.random.Node
setNext(g0101_0200.s0146_lru_cache.LRUCache.Node) - function in g0101_0200.s0146_lru_cache.LRUCache.Node
setNext(g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node) - function in g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node
setNext(kotlin.Array) - function in g1201_1300.s1206_design_skiplist.Skiplist.Node
setNext(g2501_2600.s2502_design_memory_allocator.Allocator.Node) - function in g2501_2600.s2502_design_memory_allocator.Allocator.Node
setNumOfNodes(java.lang.Long) - function in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.TreeInfo
setParent(kotlin.IntArray) - function in g1001_1100.s1061_lexicographically_smallest_equivalent_string.Solution
setPeekedValue(java.lang.Integer) - function in g0201_0300.s0284_peeking_iterator.PeekingIterator
setPerm(java.lang.Long) - function in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.TreeInfo
setPrev(g0101_0200.s0146_lru_cache.LRUCache.Node) - function in g0101_0200.s0146_lru_cache.LRUCache.Node
setPrev(g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node) - function in g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node
setProfit(java.lang.Integer) - function in g0501_0600.s0502_ipo.Solution.Data
setProfitMaxHeap(java.util.PriorityQueue) - function in g0501_0600.s0502_ipo.Solution
setRandom(com_github_leetcode.random.Node) - function in com_github_leetcode.random.Node
setRight(com_github_leetcode.TreeNode) - function in com_github_leetcode.TreeNode
setRight(com_github_leetcode.left_right.Node) - function in com_github_leetcode.left_right.Node
setRight(g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.TreeNode) - function in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.TreeNode
setRoot(g2501_2600.s2502_design_memory_allocator.Allocator.Node) - function in g2501_2600.s2502_design_memory_allocator.Allocator
setScore(java.lang.Integer) - function in g2101_2200.s2102_sequentially_ordinal_rank_tracker.SORTracker.Location
setSecMin(java.lang.Integer) - function in g0601_0700.s0671_second_minimum_node_in_a_binary_tree.Solution
setSize(java.lang.Integer) - function in g2501_2600.s2502_design_memory_allocator.Allocator.Node
setSubordinates(java.util.List) - function in com_github_leetcode.Employee: the id of direct subordinates
setSum(java.lang.Integer) - function in g0501_0600.s0528_random_pick_with_weight.Solution
setTimeToLive(java.lang.Integer) - function in g1701_1800.s1797_design_authentication_manager.AuthenticationManager
setTitle(java.lang.String) - function in g0701_0800.s0726_number_of_atoms.Solution.Item
setTopLeft(g0401_0500.s0427_construct_quad_tree.Node) - function in g0401_0500.s0427_construct_quad_tree.Node
setTopLeft(g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node) - function in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node
setTopRight(g0401_0500.s0427_construct_quad_tree.Node) - function in g0401_0500.s0427_construct_quad_tree.Node
setTopRight(g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node) - function in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node
setTotal(java.lang.String) - function in g0701_0800.s0726_number_of_atoms.Solution.Item
setV(java.lang.Integer) - function in g1501_1600.s1584_min_cost_to_connect_all_points.Solution.Pair
setVal(java.lang.Integer) - function in com_github_leetcode.ListNode
setVal(java.lang.Integer) - function in com_github_leetcode.Node
setVal(java.lang.Integer) - function in com_github_leetcode.TreeNode
setVal(java.lang.Integer) - function in com_github_leetcode.left_right.Node
setVal(java.lang.Integer) - function in com_github_leetcode.neighbors.Node
setVal(java.lang.Integer) - function in com_github_leetcode.random.Node
setVal(java.lang.Boolean) - function in g0401_0500.s0427_construct_quad_tree.Node
setVal(java.lang.Integer) - function in g0401_0500.s0430_flatten_a_multilevel_doubly_linked_list.Node
setVal(java.lang.Boolean) - function in g0501_0600.s0558_logical_or_of_two_binary_grids_represented_as_quad_trees.Node
setVal(java.lang.Integer) - function in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.TreeNode
setValue(java.lang.Integer) - function in g0101_0200.s0146_lru_cache.LRUCache.Node
setWord(java.lang.Boolean) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie.TrieNode
setWord(java.lang.Boolean) - function in g0201_0300.s0211_design_add_and_search_words_data_structure.WordDictionary.TrieNode
setX(kotlin.IntArray) - function in g0501_0600.s0528_random_pick_with_weight.Solution
setX(java.lang.Long) - function in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.Inverse
setY(java.lang.Long) - function in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution.Inverse
setZeroes(kotlin.Array) - function in g0001_0100.s0073_set_matrix_zeroes.Solution
shiftGrid(kotlin.Array,java.lang.Integer) - function in g1201_1300.s1260_shift_2d_grid.Solution
shiftingLetters(java.lang.String,kotlin.IntArray) - function in g0801_0900.s0848_shifting_letters.Solution
shiftingLetters(java.lang.String,kotlin.Array) - function in g2301_2400.s2381_shifting_letters_ii.Solution
shipWithinDays(kotlin.IntArray,java.lang.Integer) - function in g1001_1100.s1011_capacity_to_ship_packages_within_d_days.Solution
shoppingOffers(java.util.List,java.util.List,java.util.List) - function in g0601_0700.s0638_shopping_offers.Solution
shortestAlternatingPaths(java.lang.Integer,kotlin.Array,kotlin.Array) - function in g1101_1200.s1129_shortest_path_with_alternating_colors.Solution
shortestBeautifulSubstring(java.lang.String,java.lang.Integer) - function in g2901_3000.s2904_shortest_and_lexicographically_smallest_beautiful_string.Solution
shortestBridge(kotlin.Array) - function in g0901_1000.s0934_shortest_bridge.Solution
shortestCommonSupersequence(java.lang.String,java.lang.String) - function in g1001_1100.s1092_shortest_common_supersequence.Solution
shortestCompletingWord(java.lang.String,kotlin.Array) - function in g0701_0800.s0748_shortest_completing_word.Solution
shortestDistanceAfterQueries(java.lang.Integer,kotlin.Array) - function in g3201_3300.s3243_shortest_distance_after_road_addition_queries_i.Solution
shortestDistanceAfterQueries(java.lang.Integer,kotlin.Array) - function in g3201_3300.s3244_shortest_distance_after_road_addition_queries_ii.Solution
shortestPalindrome(java.lang.String) - function in g0201_0300.s0214_shortest_palindrome.Solution
shortestPath(kotlin.Array,java.lang.Integer) - function in g1201_1300.s1293_shortest_path_in_a_grid_with_obstacles_elimination.Solution
shortestPath(java.lang.Integer,java.lang.Integer) - function in g2601_2700.s2642_design_graph_with_shortest_path_calculator.Graph
shortestPathAllKeys(kotlin.Array) - function in g0801_0900.s0864_shortest_path_to_get_all_keys.Solution
shortestPathBinaryMatrix(kotlin.Array) - function in g1001_1100.s1091_shortest_path_in_binary_matrix.Solution
shortestPathLength(kotlin.Array) - function in g0801_0900.s0847_shortest_path_visiting_all_nodes.Solution
shortestSequence(kotlin.IntArray,java.lang.Integer) - function in g2301_2400.s2350_shortest_impossible_sequence_of_rolls.Solution
shortestSubarray(kotlin.IntArray,java.lang.Integer) - function in g0801_0900.s0862_shortest_subarray_with_sum_at_least_k.Solution
shortestSubstrings(kotlin.Array) - function in g3001_3100.s3076_shortest_uncommon_substring_in_an_array.Solution
shortestSuperstring(kotlin.Array) - function in g0901_1000.s0943_find_the_shortest_superstring.Solution
shortestToChar(java.lang.String,java.lang.Character) - function in g0801_0900.s0821_shortest_distance_to_a_character.Solution
shuffle() - function in g0301_0400.s0384_shuffle_an_array.Solution
shuffle(kotlin.IntArray,java.lang.Integer) - function in g1401_1500.s1470_shuffle_the_array.Solution
similarPairs(kotlin.Array) - function in g2501_2600.s2506_count_pairs_of_similar_strings.Solution
simplifiedFractions(java.lang.Integer) - function in g1401_1500.s1447_simplified_fractions.Solution
simplifyPath(java.lang.String) - function in g0001_0100.s0071_simplify_path.Solution
singleNonDuplicate(kotlin.IntArray) - function in g0501_0600.s0540_single_element_in_a_sorted_array.Solution
singleNumber(kotlin.IntArray) - function in g0101_0200.s0136_single_number.Solution
singleNumber(kotlin.IntArray) - function in g0101_0200.s0137_single_number_ii.Solution
singleNumber(kotlin.IntArray) - function in g0201_0300.s0260_single_number_iii.Solution
size() - function in g0701_0800.s0721_accounts_merge.Solution.UnionFind
Skiplist - class in g1201_1300.s1206_design_skiplist: 1206 - Design Skiplist\.
Skiplist.Node - class in g1201_1300.s1206_design_skiplist.Skiplist
slidingPuzzle(kotlin.Array) - function in g0701_0800.s0773_sliding_puzzle.Solution
slowestKey(kotlin.IntArray,java.lang.String) - function in g1601_1700.s1629_slowest_key.Solution
smallerNumbersThanCurrent(kotlin.IntArray) - function in g1301_1400.s1365_how_many_numbers_are_smaller_than_the_current_number.Solution
smallestBeautifulString(java.lang.String,java.lang.Integer) - function in g2601_2700.s2663_lexicographically_smallest_beautiful_string.Solution
smallestChair(kotlin.Array,java.lang.Integer) - function in g1901_2000.s1942_the_number_of_the_smallest_unoccupied_chair.Solution
smallestDistancePair(kotlin.IntArray,java.lang.Integer) - function in g0701_0800.s0719_find_k_th_smallest_pair_distance.Solution
smallestDivisor(kotlin.IntArray,java.lang.Integer) - function in g1201_1300.s1283_find_the_smallest_divisor_given_a_threshold.Solution
smallestEqual(kotlin.IntArray) - function in g2001_2100.s2057_smallest_index_with_equal_value.Solution
smallestEquivalentString(java.lang.String,java.lang.String,java.lang.String) - function in g1001_1100.s1061_lexicographically_smallest_equivalent_string.Solution
smallestEvenMultiple(java.lang.Integer) - function in g2401_2500.s2413_smallest_even_multiple.Solution
smallestFromLeaf(com_github_leetcode.TreeNode) - function in g0901_1000.s0988_smallest_string_starting_from_leaf.Solution
smallestGoodBase(java.lang.String) - function in g0401_0500.s0483_smallest_good_base.Solution
SmallestInfiniteSet - class in g2301_2400.s2336_smallest_number_in_infinite_set: 2336 - Smallest Number in Infinite Set\.
smallestMissingValueSubtree(kotlin.IntArray,kotlin.IntArray) - function in g2001_2100.s2003_smallest_missing_genetic_value_in_each_subtree.Solution
smallestNumber(java.lang.Long) - function in g2101_2200.s2165_smallest_value_of_the_rearranged_number.Solution
smallestNumber(java.lang.String) - function in g2301_2400.s2375_construct_smallest_number_from_di_string.Solution
smallestRange(java.util.List) - function in g0601_0700.s0632_smallest_range_covering_elements_from_k_lists.Solution
smallestRangeI(kotlin.IntArray,java.lang.Integer) - function in g0901_1000.s0908_smallest_range_i.Solution
smallestRangeII(kotlin.IntArray,java.lang.Integer) - function in g0901_1000.s0910_smallest_range_ii.Solution
smallestRepunitDivByK(java.lang.Integer) - function in g1001_1100.s1015_smallest_integer_divisible_by_k.Solution
smallestString(java.lang.String) - function in g2701_2800.s2734_lexicographically_smallest_string_after_substring_operation.Solution
smallestStringWithSwaps(java.lang.String,java.util.List) - function in g1201_1300.s1202_smallest_string_with_swaps.Solution
smallestSubarrays(kotlin.IntArray) - function in g2401_2500.s2411_smallest_subarrays_with_maximum_bitwise_or.Solution
smallestSubsequence(java.lang.String) - function in g1001_1100.s1081_smallest_subsequence_of_distinct_characters.Solution
smallestSubsequence(java.lang.String,java.lang.Integer,java.lang.Character,java.lang.Integer) - function in g2001_2100.s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter.Solution
smallestSufficientTeam(kotlin.Array,java.util.List) - function in g1101_1200.s1125_smallest_sufficient_team.Solution
smallestTrimmedNumbers(kotlin.Array,kotlin.Array) - function in g2301_2400.s2343_query_kth_smallest_trimmed_number.Solution
smallestValue(java.lang.Integer) - function in g2501_2600.s2507_smallest_value_after_replacing_with_sum_of_prime_factors.Solution
snakesAndLadders(kotlin.Array) - function in g0901_1000.s0909_snakes_and_ladders.Solution
snap() - function in g1101_1200.s1146_snapshot_array.SnapshotArray
SnapshotArray - class in g1101_1200.s1146_snapshot_array: 1146 - Snapshot Array\.
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 - Find the Index of the First Occurrence in a String\.
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 - Non-decreasing 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 II\.
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\.
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: 632 - 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.s0894_all_possible_full_binary_trees: 894 - All Possible Full Binary Trees\.
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
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_subarrays: 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_minimum_suffix_flips: 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 ?'s to Avoid Consecutive Repeating Characters\.
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_food_buckets_to_feed_the_hamsters: 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.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 - class in g3001_3100.s3070_count_submatrices_with_top_left_element_and_sum_less_than_k: 3070 - Count Submatrices with Top-Left Element and Sum Less Than k\.
Solution - class in g3001_3100.s3071_minimum_operations_to_write_the_letter_y_on_a_grid: 3071 - Minimum Operations to Write the Letter Y on a Grid\.
Solution - class in g3001_3100.s3072_distribute_elements_into_two_arrays_ii: 3072 - Distribute Elements Into Two Arrays II\.
Solution - class in g3001_3100.s3074_apple_redistribution_into_boxes: 3074 - Apple Redistribution into Boxes\.
Solution - class in g3001_3100.s3075_maximize_happiness_of_selected_children: 3075 - Maximize Happiness of Selected Children\.
Solution - class in g3001_3100.s3076_shortest_uncommon_substring_in_an_array: 3076 - Shortest Uncommon Substring in an Array\.
Solution - class in g3001_3100.s3077_maximum_strength_of_k_disjoint_subarrays: 3077 - Maximum Strength of K Disjoint Subarrays\.
Solution - class in g3001_3100.s3079_find_the_sum_of_encrypted_integers: 3079 - Find the Sum of Encrypted Integers\.
Solution - class in g3001_3100.s3080_mark_elements_on_array_by_performing_queries: 3080 - Mark Elements on Array by Performing Queries\.
Solution - class in g3001_3100.s3081_replace_question_marks_in_string_to_minimize_its_value: 3081 - Replace Question Marks in String to Minimize Its Value\.
Solution - class in g3001_3100.s3082_find_the_sum_of_the_power_of_all_subsequences: 3082 - Find the Sum of the Power of All Subsequences\.
Solution - class in g3001_3100.s3083_existence_of_a_substring_in_a_string_and_its_reverse: 3083 - Existence of a Substring in a String and Its Reverse\.
Solution - class in g3001_3100.s3084_count_substrings_starting_and_ending_with_given_character: 3084 - Count Substrings Starting and Ending with Given Character\.
Solution - class in g3001_3100.s3085_minimum_deletions_to_make_string_k_special: 3085 - Minimum Deletions to Make String K-Special\.
Solution - class in g3001_3100.s3086_minimum_moves_to_pick_k_ones: 3086 - Minimum Moves to Pick K Ones\.
Solution - class in g3001_3100.s3090_maximum_length_substring_with_two_occurrences: 3090 - Maximum Length Substring With Two Occurrences\.
Solution - class in g3001_3100.s3091_apply_operations_to_make_sum_of_array_greater_than_or_equal_to_k: 3091 - Apply Operations to Make Sum of Array Greater Than or Equal to k\.
Solution - class in g3001_3100.s3092_most_frequent_ids: 3092 - Most Frequent IDs\.
Solution - class in g3001_3100.s3093_longest_common_suffix_queries: 3093 - Longest Common Suffix Queries\.
Solution - class in g3001_3100.s3095_shortest_subarray_with_or_at_least_k_i: 3095 - Shortest Subarray With OR at Least K I\.
Solution - class in g3001_3100.s3096_minimum_levels_to_gain_more_points: 3096 - Minimum Levels to Gain More Points\.
Solution - class in g3001_3100.s3097_shortest_subarray_with_or_at_least_k_ii: 3097 - Shortest Subarray With OR at Least K II\.
Solution - class in g3001_3100.s3098_find_the_sum_of_subsequence_powers: 3098 - Find the Sum of Subsequence Powers\.
Solution - class in g3001_3100.s3099_harshad_number: 3099 - Harshad Number\.
Solution - class in g3001_3100.s3100_water_bottles_ii: 3100 - Water Bottles II\.
Solution - class in g3101_3200.s3101_count_alternating_subarrays: 3101 - Count Alternating Subarrays\.
Solution - class in g3101_3200.s3102_minimize_manhattan_distances: 3102 - Minimize Manhattan Distances\.
Solution - class in g3101_3200.s3105_longest_strictly_increasing_or_strictly_decreasing_subarray: 3105 - Longest Strictly Increasing or Strictly Decreasing Subarray\.
Solution - class in g3101_3200.s3106_lexicographically_smallest_string_after_operations_with_constraint: 3106 - Lexicographically Smallest String After Operations With Constraint\.
Solution - class in g3101_3200.s3107_minimum_operations_to_make_median_of_array_equal_to_k: 3107 - Minimum Operations to Make Median of Array Equal to K\.
Solution - class in g3101_3200.s3108_minimum_cost_walk_in_weighted_graph: 3108 - Minimum Cost Walk in Weighted Graph\.
Solution - class in g3101_3200.s3110_score_of_a_string: 3110 - Score of a String\.
Solution - class in g3101_3200.s3111_minimum_rectangles_to_cover_points: 3111 - Minimum Rectangles to Cover Points\.
Solution - class in g3101_3200.s3112_minimum_time_to_visit_disappearing_nodes: 3112 - Minimum Time to Visit Disappearing Nodes\.
Solution - class in g3101_3200.s3113_find_the_number_of_subarrays_where_boundary_elements_are_maximum: 3113 - Find the Number of Subarrays Where Boundary Elements Are Maximum\.
Solution - class in g3101_3200.s3114_latest_time_you_can_obtain_after_replacing_characters: 3114 - Latest Time You Can Obtain After Replacing Characters\.
Solution - class in g3101_3200.s3115_maximum_prime_difference: 3115 - Maximum Prime Difference\.
Solution - class in g3101_3200.s3116_kth_smallest_amount_with_single_denomination_combination: 3116 - Kth Smallest Amount With Single Denomination Combination\.
Solution - class in g3101_3200.s3117_minimum_sum_of_values_by_dividing_array: 3117 - Minimum Sum of Values by Dividing Array\.
Solution - class in g3101_3200.s3120_count_the_number_of_special_characters_i: 3120 - Count the Number of Special Characters I\.
Solution - class in g3101_3200.s3121_count_the_number_of_special_characters_ii: 3121 - Count the Number of Special Characters II\.
Solution - class in g3101_3200.s3122_minimum_number_of_operations_to_satisfy_conditions: 3122 - Minimum Number of Operations to Satisfy Conditions\.
Solution - class in g3101_3200.s3123_find_edges_in_shortest_paths: 3123 - Find Edges in Shortest Paths\.
Solution - class in g3101_3200.s3127_make_a_square_with_the_same_color: 3127 - Make a Square with the Same Color\.
Solution - class in g3101_3200.s3128_right_triangles: 3128 - Right Triangles\.
Solution - class in g3101_3200.s3129_find_all_possible_stable_binary_arrays_i: 3129 - Find All Possible Stable Binary Arrays I\.
Solution - class in g3101_3200.s3130_find_all_possible_stable_binary_arrays_ii: 3130 - Find All Possible Stable Binary Arrays II\.
Solution - class in g3101_3200.s3131_find_the_integer_added_to_array_i: 3131 - Find the Integer Added to Array I\.
Solution - class in g3101_3200.s3132_find_the_integer_added_to_array_ii: 3132 - Find the Integer Added to Array II\.
Solution - class in g3101_3200.s3133_minimum_array_end: 3133 - Minimum Array End\.
Solution - class in g3101_3200.s3134_find_the_median_of_the_uniqueness_array: 3134 - Find the Median of the Uniqueness Array\.
Solution - class in g3101_3200.s3136_valid_word: 3136 - Valid Word\.
Solution - class in g3101_3200.s3137_minimum_number_of_operations_to_make_word_k_periodic: 3137 - Minimum Number of Operations to Make Word K-Periodic\.
Solution - class in g3101_3200.s3138_minimum_length_of_anagram_concatenation: 3138 - Minimum Length of Anagram Concatenation\.
Solution - class in g3101_3200.s3139_minimum_cost_to_equalize_array: 3139 - Minimum Cost to Equalize Array\.
Solution - class in g3101_3200.s3142_check_if_grid_satisfies_conditions: 3142 - Check if Grid Satisfies Conditions\.
Solution - class in g3101_3200.s3143_maximum_points_inside_the_square: 3143 - Maximum Points Inside the Square\.
Solution - class in g3101_3200.s3144_minimum_substring_partition_of_equal_character_frequency: 3144 - Minimum Substring Partition of Equal Character Frequency\.
Solution - class in g3101_3200.s3145_find_products_of_elements_of_big_array: 3145 - Find Products of Elements of Big Array\.
Solution - class in g3101_3200.s3146_permutation_difference_between_two_strings: 3146 - Permutation Difference between Two Strings\.
Solution - class in g3101_3200.s3147_taking_maximum_energy_from_the_mystic_dungeon: 3147 - Taking Maximum Energy From the Mystic Dungeon\.
Solution - class in g3101_3200.s3148_maximum_difference_score_in_a_grid: 3148 - Maximum Difference Score in a Grid\.
Solution - class in g3101_3200.s3149_find_the_minimum_cost_array_permutation: 3149 - Find the Minimum Cost Array Permutation\.
Solution - class in g3101_3200.s3151_special_array_i: 3151 - Special Array I\.
Solution - class in g3101_3200.s3152_special_array_ii: 3152 - Special Array II\.
Solution - class in g3101_3200.s3153_sum_of_digit_differences_of_all_pairs: 3153 - Sum of Digit Differences of All Pairs\.
Solution - class in g3101_3200.s3154_find_number_of_ways_to_reach_the_k_th_stair: 3154 - Find Number of Ways to Reach the K-th Stair\.
Solution - class in g3101_3200.s3158_find_the_xor_of_numbers_which_appear_twice: 3158 - Find the XOR of Numbers Which Appear Twice\.
Solution - class in g3101_3200.s3159_find_occurrences_of_an_element_in_an_array: 3159 - Find Occurrences of an Element in an Array\.
Solution - class in g3101_3200.s3160_find_the_number_of_distinct_colors_among_the_balls: 3160 - Find the Number of Distinct Colors Among the Balls\.
Solution - class in g3101_3200.s3161_block_placement_queries: 3161 - Block Placement Queries\.
Solution - class in g3101_3200.s3162_find_the_number_of_good_pairs_i: 3162 - Find the Number of Good Pairs I\.
Solution - class in g3101_3200.s3163_string_compression_iii: 3163 - String Compression III\.
Solution - class in g3101_3200.s3164_find_the_number_of_good_pairs_ii: 3164 - Find the Number of Good Pairs II\.
Solution - class in g3101_3200.s3165_maximum_sum_of_subsequence_with_non_adjacent_elements: 3165 - Maximum Sum of Subsequence With Non-adjacent Elements\.
Solution - class in g3101_3200.s3168_minimum_number_of_chairs_in_a_waiting_room: 3168 - Minimum Number of Chairs in a Waiting Room\.
Solution - class in g3101_3200.s3169_count_days_without_meetings: 3169 - Count Days Without Meetings\.
Solution - class in g3101_3200.s3170_lexicographically_minimum_string_after_removing_stars: 3170 - Lexicographically Minimum String After Removing Stars\.
Solution - class in g3101_3200.s3171_find_subarray_with_bitwise_and_closest_to_k: 3171 - Find Subarray With Bitwise AND Closest to K\.
Solution - class in g3101_3200.s3174_clear_digits: 3174 - Clear Digits\.
Solution - class in g3101_3200.s3175_find_the_first_player_to_win_k_games_in_a_row: 3175 - Find The First Player to win K Games in a Row\.
Solution - class in g3101_3200.s3176_find_the_maximum_length_of_a_good_subsequence_i: 3176 - Find the Maximum Length of a Good Subsequence I\.
Solution - class in g3101_3200.s3177_find_the_maximum_length_of_a_good_subsequence_ii: 3177 - Find the Maximum Length of a Good Subsequence II\.
Solution - class in g3101_3200.s3178_find_the_child_who_has_the_ball_after_k_seconds: 3178 - Find the Child Who Has the Ball After K Seconds\.
Solution - class in g3101_3200.s3179_find_the_n_th_value_after_k_seconds: 3179 - Find the N-th Value After K Seconds\.
Solution - class in g3101_3200.s3180_maximum_total_reward_using_operations_i: 3180 - Maximum Total Reward Using Operations I\.
Solution - class in g3101_3200.s3181_maximum_total_reward_using_operations_ii: 3181 - Maximum Total Reward Using Operations II\.
Solution - class in g3101_3200.s3184_count_pairs_that_form_a_complete_day_i: 3184 - Count Pairs That Form a Complete Day I\.
Solution - class in g3101_3200.s3185_count_pairs_that_form_a_complete_day_ii: 3185 - Count Pairs That Form a Complete Day II\.
Solution - class in g3101_3200.s3186_maximum_total_damage_with_spell_casting: 3186 - Maximum Total Damage With Spell Casting\.
Solution - class in g3101_3200.s3187_peaks_in_array: 3187 - Peaks in Array\.
Solution - class in g3101_3200.s3190_find_minimum_operations_to_make_all_elements_divisible_by_three: 3190 - Find Minimum Operations to Make All Elements Divisible by Three\.
Solution - class in g3101_3200.s3191_minimum_operations_to_make_binary_array_elements_equal_to_one_i: 3191 - Minimum Operations to Make Binary Array Elements Equal to One I\.
Solution - class in g3101_3200.s3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii: 3192 - Minimum Operations to Make Binary Array Elements Equal to One II\.
Solution - class in g3101_3200.s3193_count_the_number_of_inversions: 3193 - Count the Number of Inversions\.
Solution - class in g3101_3200.s3194_minimum_average_of_smallest_and_largest_elements: 3194 - Minimum Average of Smallest and Largest Elements\.
Solution - class in g3101_3200.s3195_find_the_minimum_area_to_cover_all_ones_i: 3195 - Find the Minimum Area to Cover All Ones I\.
Solution - class in g3101_3200.s3196_maximize_total_cost_of_alternating_subarrays: 3196 - Maximize Total Cost of Alternating Subarrays\.
Solution - class in g3101_3200.s3197_find_the_minimum_area_to_cover_all_ones_ii: 3197 - Find the Minimum Area to Cover All Ones II\.
Solution - class in g3101_3200.s3200_maximum_height_of_a_triangle: 3200 - Maximum Height of a Triangle\.
Solution - class in g3201_3300.s3201_find_the_maximum_length_of_valid_subsequence_i: 3201 - Find the Maximum Length of Valid Subsequence I\.
Solution - class in g3201_3300.s3202_find_the_maximum_length_of_valid_subsequence_ii: 3202 - Find the Maximum Length of Valid Subsequence II\.
Solution - class in g3201_3300.s3203_find_minimum_diameter_after_merging_two_trees: 3203 - Find Minimum Diameter After Merging Two Trees\.
Solution - class in g3201_3300.s3206_alternating_groups_i: 3206 - Alternating Groups I\.
Solution - class in g3201_3300.s3207_maximum_points_after_enemy_battles: 3207 - Maximum Points After Enemy Battles\.
Solution - class in g3201_3300.s3208_alternating_groups_ii: 3208 - Alternating Groups II\.
Solution - class in g3201_3300.s3209_number_of_subarrays_with_and_value_of_k: 3209 - Number of Subarrays With AND Value of K\.
Solution - class in g3201_3300.s3210_find_the_encrypted_string: 3210 - Find the Encrypted String\.
Solution - class in g3201_3300.s3211_generate_binary_strings_without_adjacent_zeros: 3211 - Generate Binary Strings Without Adjacent Zeros\.
Solution - class in g3201_3300.s3212_count_submatrices_with_equal_frequency_of_x_and_y: 3212 - Count Submatrices With Equal Frequency of X and Y\.
Solution - class in g3201_3300.s3213_construct_string_with_minimum_cost: 3213 - Construct String with Minimum Cost\.
Solution - class in g3201_3300.s3216_lexicographically_smallest_string_after_a_swap: 3216 - Lexicographically Smallest String After a Swap\.
Solution - class in g3201_3300.s3217_delete_nodes_from_linked_list_present_in_array: 3217 - Delete Nodes From Linked List Present in Array\.
Solution - class in g3201_3300.s3218_minimum_cost_for_cutting_cake_i: 3218 - Minimum Cost for Cutting Cake I\.
Solution - class in g3201_3300.s3219_minimum_cost_for_cutting_cake_ii: 3219 - Minimum Cost for Cutting Cake II\.
Solution - class in g3201_3300.s3222_find_the_winning_player_in_coin_game: 3222 - Find the Winning Player in Coin Game\.
Solution - class in g3201_3300.s3223_minimum_length_of_string_after_operations: 3223 - Minimum Length of String After Operations\.
Solution - class in g3201_3300.s3224_minimum_array_changes_to_make_differences_equal: 3224 - Minimum Array Changes to Make Differences Equal\.
Solution - class in g3201_3300.s3225_maximum_score_from_grid_operations: 3225 - Maximum Score From Grid Operations\.
Solution - class in g3201_3300.s3226_number_of_bit_changes_to_make_two_integers_equal: 3226 - Number of Bit Changes to Make Two Integers Equal\.
Solution - class in g3201_3300.s3227_vowels_game_in_a_string: 3227 - Vowels Game in a String\.
Solution - class in g3201_3300.s3228_maximum_number_of_operations_to_move_ones_to_the_end: 3228 - Maximum Number of Operations to Move Ones to the End\.
Solution - class in g3201_3300.s3229_minimum_operations_to_make_array_equal_to_target: 3229 - Minimum Operations to Make Array Equal to Target\.
Solution - class in g3201_3300.s3232_find_if_digit_game_can_be_won: 3232 - Find if Digit Game Can Be Won\.
Solution - class in g3201_3300.s3233_find_the_count_of_numbers_which_are_not_special: 3233 - Find the Count of Numbers Which Are Not Special\.
Solution - class in g3201_3300.s3234_count_the_number_of_substrings_with_dominant_ones: 3234 - Count the Number of Substrings With Dominant Ones\.
Solution - class in g3201_3300.s3235_check_if_the_rectangle_corner_is_reachable: 3235 - Check if the Rectangle Corner Is Reachable\.
Solution - class in g3201_3300.s3238_find_the_number_of_winning_players: 3238 - Find the Number of Winning Players\.
Solution - class in g3201_3300.s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i: 3239 - Minimum Number of Flips to Make Binary Grid Palindromic I\.
Solution - class in g3201_3300.s3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii: 3240 - Minimum Number of Flips to Make Binary Grid Palindromic II\.
Solution - class in g3201_3300.s3241_time_taken_to_mark_all_nodes: 3241 - Time Taken to Mark All Nodes\.
Solution - class in g3201_3300.s3243_shortest_distance_after_road_addition_queries_i: 3243 - Shortest Distance After Road Addition Queries I\.
Solution - class in g3201_3300.s3244_shortest_distance_after_road_addition_queries_ii: 3244 - Shortest Distance After Road Addition Queries II\.
Solution - class in g3201_3300.s3245_alternating_groups_iii: 3245 - Alternating Groups III\.
Solution - class in g3201_3300.s3248_snake_in_matrix: 3248 - Snake in Matrix\.
Solution - class in g3201_3300.s3249_count_the_number_of_good_nodes: 3249 - Count the Number of Good Nodes\.
Solution - class in g3201_3300.s3250_find_the_count_of_monotonic_pairs_i: 3250 - Find the Count of Monotonic Pairs I\.
Solution - class in g3201_3300.s3251_find_the_count_of_monotonic_pairs_ii: 3251 - Find the Count of Monotonic Pairs II\.
Solution - class in g3201_3300.s3254_find_the_power_of_k_size_subarrays_i: 3254 - Find the Power of K-Size Subarrays I\.
Solution - class in g3201_3300.s3255_find_the_power_of_k_size_subarrays_ii: 3255 - Find the Power of K-Size Subarrays II\.
Solution - class in g3201_3300.s3256_maximum_value_sum_by_placing_three_rooks_i: 3256 - Maximum Value Sum by Placing Three Rooks I\.
Solution - class in g3201_3300.s3257_maximum_value_sum_by_placing_three_rooks_ii: 3257 - Maximum Value Sum by Placing Three Rooks II\.
Solution - class in g3201_3300.s3258_count_substrings_that_satisfy_k_constraint_i: 3258 - Count Substrings That Satisfy K-Constraint I\.
Solution - class in g3201_3300.s3259_maximum_energy_boost_from_two_drinks: 3259 - Maximum Energy Boost From Two Drinks\.
Solution - class in g3201_3300.s3260_find_the_largest_palindrome_divisible_by_k: 3260 - Find the Largest Palindrome Divisible by K\.
Solution - class in g3201_3300.s3261_count_substrings_that_satisfy_k_constraint_ii: 3261 - Count Substrings That Satisfy K-Constraint II\.
Solution - class in g3201_3300.s3264_final_array_state_after_k_multiplication_operations_i: 3264 - Final Array State After K Multiplication Operations I\.
Solution - class in g3201_3300.s3265_count_almost_equal_pairs_i: 3265 - Count Almost Equal Pairs I\.
Solution - class in g3201_3300.s3266_final_array_state_after_k_multiplication_operations_ii: 3266 - Final Array State After K Multiplication Operations II\.
Solution - class in g3201_3300.s3267_count_almost_equal_pairs_ii: 3267 - Count Almost Equal Pairs II\.
Solution - class in g3201_3300.s3270_find_the_key_of_the_numbers: 3270 - Find the Key of the Numbers\.
Solution - class in g3201_3300.s3271_hash_divided_string: 3271 - Hash Divided String\.
Solution - class in g3201_3300.s3272_find_the_count_of_good_integers: 3272 - Find the Count of Good Integers\.
Solution - class in g3201_3300.s3273_minimum_amount_of_damage_dealt_to_bob: 3273 - Minimum Amount of Damage Dealt to Bob\.
Solution - class in g3201_3300.s3274_check_if_two_chessboard_squares_have_the_same_color: 3274 - Check if Two Chessboard Squares Have the Same Color\.
Solution - class in g3201_3300.s3275_k_th_nearest_obstacle_queries: 3275 - K-th Nearest Obstacle Queries\.
Solution - class in g3201_3300.s3276_select_cells_in_grid_with_maximum_score: 3276 - Select Cells in Grid With Maximum Score\.
Solution - class in g3201_3300.s3277_maximum_xor_score_subarray_queries: 3277 - Maximum XOR Score Subarray Queries\.
Solution - class in g3201_3300.s3280_convert_date_to_binary: 3280 - Convert Date to Binary\.
Solution - class in g3201_3300.s3281_maximize_score_of_numbers_in_ranges: 3281 - Maximize Score of Numbers in Ranges\.
Solution - class in g3201_3300.s3282_reach_end_of_array_with_max_score: 3282 - Reach End of Array With Max Score\.
Solution - class in g3201_3300.s3283_maximum_number_of_moves_to_kill_all_pawns: 3283 - Maximum Number of Moves to Kill All Pawns\.
Solution - class in g3201_3300.s3285_find_indices_of_stable_mountains: 3285 - Find Indices of Stable Mountains\.
Solution - class in g3201_3300.s3286_find_a_safe_walk_through_a_grid: 3286 - Find a Safe Walk Through a Grid\.
Solution - class in g3201_3300.s3287_find_the_maximum_sequence_value_of_array: 3287 - Find the Maximum Sequence Value of Array\.
Solution - class in g3201_3300.s3288_length_of_the_longest_increasing_path: 3288 - Length of the Longest Increasing Path\.
Solution - class in g3201_3300.s3289_the_two_sneaky_numbers_of_digitville: 3289 - The Two Sneaky Numbers of Digitville\.
Solution - class in g3201_3300.s3290_maximum_multiplication_score: 3290 - Maximum Multiplication Score\.
Solution - class in g3201_3300.s3291_minimum_number_of_valid_strings_to_form_target_i: 3291 - Minimum Number of Valid Strings to Form Target I\.
Solution - class in g3201_3300.s3292_minimum_number_of_valid_strings_to_form_target_ii: 3292 - Minimum Number of Valid Strings to Form Target II\.
Solution - class in g3201_3300.s3295_report_spam_message: 3295 - Report Spam Message\.
Solution - class in g3201_3300.s3296_minimum_number_of_seconds_to_make_mountain_height_zero: 3296 - Minimum Number of Seconds to Make Mountain Height Zero\.
Solution - class in g3201_3300.s3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i: 3297 - Count Substrings That Can Be Rearranged to Contain a String I\.
Solution - class in g3201_3300.s3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii: 3298 - Count Substrings That Can Be Rearranged to Contain a String II\.
Solution.Companion - class in g0201_0300.s0289_game_of_life.Solution
Solution.Companion - class in g0901_1000.s0983_minimum_cost_for_tickets.Solution
Solution.Companion - class in g1501_1600.s1575_count_all_possible_routes.Solution
Solution.Companion - class in g1701_1800.s1739_building_boxes.Solution
Solution.Companion - class in g1901_2000.s1977_number_of_ways_to_separate_numbers.Solution
Solution.Companion - class in g2001_2100.s2040_kth_smallest_product_of_two_sorted_arrays.Solution
Solution.Companion - class in g2101_2200.s2108_find_first_palindromic_string_in_the_array.Solution
Solution.Companion - class in g2501_2600.s2521_distinct_prime_factors_of_product_of_array.Solution
Solution.Companion - class in g2501_2600.s2580_count_ways_to_group_overlapping_ranges.Solution
Solution.Companion - class in g2501_2600.s2584_split_the_array_to_make_coprime_products.Solution
Solution.Companion - class in g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits.Solution
Solution.CustomFunction - class in g1201_1300.s1237_find_positive_integer_solution_for_a_given_equation.Solution
Solution.Data - class in g0501_0600.s0502_ipo.Solution
Solution.Data - class in g1801_1900.s1815_maximum_number_of_groups_getting_fresh_donuts.Solution
Solution.Inverse - class in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution
Solution.Item - class in g0701_0800.s0726_number_of_atoms.Solution
Solution.Master - class in g0801_0900.s0843_guess_the_word.Solution
Solution.Pair - class in g1501_1600.s1584_min_cost_to_connect_all_points.Solution
Solution.TreeInfo - class in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution
Solution.TreeNode - class in g1501_1600.s1569_number_of_ways_to_reorder_array_to_get_same_bst.Solution
Solution.UnionFind - class in g0701_0800.s0721_accounts_merge.Solution
solve(kotlin.Array) - function in g0101_0200.s0130_surrounded_regions.Solution
solveEquation(java.lang.String) - function in g0601_0700.s0640_solve_the_equation.Solution
solveNQueens(java.lang.Integer) - function in g0001_0100.s0051_n_queens.Solution
solveSudoku(kotlin.Array) - function in g0001_0100.s0037_sudoku_solver.Solution
sortArray(kotlin.IntArray) - function in g0901_1000.s0912_sort_an_array.Solution
sortArrayByParity(kotlin.IntArray) - function in g0901_1000.s0905_sort_array_by_parity.Solution
sortArrayByParityII(kotlin.IntArray) - function in g0901_1000.s0922_sort_array_by_parity_ii.Solution
sortByBits(kotlin.IntArray) - function in g1301_1400.s1356_sort_integers_by_the_number_of_1_bits.Solution
sortColors(kotlin.IntArray) - function in g0001_0100.s0075_sort_colors.Solution
sortedArrayToBST(kotlin.IntArray) - function in g0101_0200.s0108_convert_sorted_array_to_binary_search_tree.Solution
sortedListToBST(com_github_leetcode.ListNode) - function in g0101_0200.s0109_convert_sorted_list_to_binary_search_tree.Solution
sortedSquares(kotlin.IntArray) - function in g0901_1000.s0977_squares_of_a_sorted_array.Solution
sortEvenOdd(kotlin.IntArray) - function in g2101_2200.s2164_sort_even_and_odd_indices_independently.Solution
sortItems(java.lang.Integer,java.lang.Integer,kotlin.IntArray,java.util.List) - function in g1201_1300.s1203_sort_items_by_groups_respecting_dependencies.Solution
sortJumbled(kotlin.IntArray,kotlin.IntArray) - function in g2101_2200.s2191_sort_the_jumbled_numbers.Solution
sortList(com_github_leetcode.ListNode) - function in g0101_0200.s0148_sort_list.Solution
sortPeople(kotlin.Array,kotlin.IntArray) - function in g2401_2500.s2418_sort_the_people.Solution
SORTracker - class in g2101_2200.s2102_sequentially_ordinal_rank_tracker: 2102 - Sequentially Ordinal Rank Tracker\.
SORTracker.Location - class in g2101_2200.s2102_sequentially_ordinal_rank_tracker.SORTracker
sortSentence(java.lang.String) - function in g1801_1900.s1859_sorting_the_sentence.Solution
sortString(java.lang.String) - function in g1301_1400.s1370_increasing_decreasing_string.Solution
sortTheStudents(kotlin.Array,java.lang.Integer) - function in g2501_2600.s2545_sort_the_students_by_their_kth_score.Solution
sortVowels(java.lang.String) - function in g2701_2800.s2785_sort_vowels_in_a_string.Solution
soupServings(java.lang.Integer) - function in g0801_0900.s0808_soup_servings.Solution
specialArray(kotlin.IntArray) - function in g1601_1700.s1608_special_array_with_x_elements_greater_than_or_equal_x.Solution
specialPerm(kotlin.IntArray) - function in g2701_2800.s2741_special_permutations.Solution
spellchecker(kotlin.Array,kotlin.Array) - function in g0901_1000.s0966_vowel_spellchecker.Solution
spiralMatrix(java.lang.Integer,java.lang.Integer,com_github_leetcode.ListNode) - function in g2301_2400.s2326_spiral_matrix_iv.Solution
spiralMatrixIII(java.lang.Integer,java.lang.Integer,java.lang.Integer,java.lang.Integer) - function in g0801_0900.s0885_spiral_matrix_iii.Solution
spiralOrder(kotlin.Array) - function in g0001_0100.s0054_spiral_matrix.Solution
splitArray(kotlin.IntArray,java.lang.Integer) - function in g0401_0500.s0410_split_array_largest_sum.Solution
splitArraySameAverage(kotlin.IntArray) - function in g0801_0900.s0805_split_array_with_same_average.Solution
splitIntoFibonacci(java.lang.String) - function in g0801_0900.s0842_split_array_into_fibonacci_sequence.Solution
splitListToParts(com_github_leetcode.ListNode,java.lang.Integer) - function in g0701_0800.s0725_split_linked_list_in_parts.Solution
splitMessage(java.lang.String,java.lang.Integer) - function in g2401_2500.s2468_split_message_based_on_limit.Solution
splitNum(java.lang.Integer) - function in g2501_2600.s2578_split_with_minimum_sum.Solution
splitPainting(kotlin.Array) - function in g1901_2000.s1943_describe_the_painting.Solution
splitString(java.lang.String) - function in g1801_1900.s1849_splitting_a_string_into_descending_consecutive_values.Solution
splitWordsBySeparator(java.util.List,java.lang.Character) - function in g2701_2800.s2788_split_strings_by_separator.Solution
squareFreeSubsets(kotlin.IntArray) - function in g2501_2600.s2572_count_the_number_of_square_free_subsets.Solution
squareIsWhite(java.lang.String) - function in g1801_1900.s1812_determine_color_of_a_chessboard_square.Solution
stableMountains(kotlin.IntArray,java.lang.Integer) - function in g3201_3300.s3285_find_indices_of_stable_mountains.Solution
startsWith(java.lang.String) - function in g0201_0300.s0208_implement_trie_prefix_tree.Trie
step(java.lang.String,java.lang.Integer,kotlin.IntArray,java.lang.Integer,java.util.List) - function in g0001_0100.s0093_restore_ip_addresses.Solution
step(java.lang.Integer) - function in g2001_2100.s2069_walking_robot_simulation_ii.Robot
StockPrice - class in g2001_2100.s2034_stock_price_fluctuation: 2034 - Stock Price Fluctuation\.
StockSpanner - class in g0901_1000.s0901_online_stock_span: 901 - Online Stock Span\.
stoneGame(kotlin.IntArray) - function in g0801_0900.s0877_stone_game.Solution
stoneGameII(kotlin.IntArray) - function in g1101_1200.s1140_stone_game_ii.Solution
stoneGameIII(kotlin.IntArray) - function in g1401_1500.s1406_stone_game_iii.Solution
stoneGameIX(kotlin.IntArray) - function in g2001_2100.s2029_stone_game_ix.Solution
stoneGameV(kotlin.IntArray) - function in g1501_1600.s1563_stone_game_v.Solution
stoneGameVI(kotlin.IntArray,kotlin.IntArray) - function in g1601_1700.s1686_stone_game_vi.Solution
stoneGameVII(kotlin.IntArray) - function in g1601_1700.s1690_stone_game_vii.Solution
stoneGameVIII(kotlin.IntArray) - function in g1801_1900.s1872_stone_game_viii.Solution
strangePrinter(java.lang.String) - function in g0601_0700.s0664_strange_printer.Solution
StreamChecker - class in g1001_1100.s1032_stream_of_characters: 1032 - Stream of Characters\.
stringCount(java.lang.Integer) - function in g2901_3000.s2930_number_of_strings_which_can_be_rearranged_to_contain_substring.Solution
stringHash(java.lang.String,java.lang.Integer) - function in g3201_3300.s3271_hash_divided_string.Solution
stringIndices(kotlin.Array,kotlin.Array) - function in g3001_3100.s3093_longest_common_suffix_queries.Solution
stringMatching(kotlin.Array) - function in g1401_1500.s1408_string_matching_in_an_array.Solution
strongPasswordChecker(java.lang.String) - function in g0401_0500.s0420_strong_password_checker.Solution
strongPasswordCheckerII(java.lang.String) - function in g2201_2300.s2299_strong_password_checker_ii.Solution
strStr(java.lang.String,java.lang.String) - function in g0001_0100.s0028_find_the_index_of_the_first_occurrence_in_a_string.Solution
strWithout3a3b(java.lang.Integer,java.lang.Integer) - function in g0901_1000.s0984_string_without_aaa_or_bbb.Solution
subarrayBitwiseORs(kotlin.IntArray) - function in g0801_0900.s0898_bitwise_ors_of_subarrays.Solution
subarrayGCD(kotlin.IntArray,java.lang.Integer) - function in g2401_2500.s2447_number_of_subarrays_with_gcd_equal_to_k.Solution
subarrayLCM(kotlin.IntArray,java.lang.Integer) - function in g2401_2500.s2470_number_of_subarrays_with_lcm_equal_to_k.Solution
subArrayRanges(kotlin.IntArray) - function in g2101_2200.s2104_sum_of_subarray_ranges.Solution
subarraysDivByK(kotlin.IntArray,java.lang.Integer) - function in g0901_1000.s0974_subarray_sums_divisible_by_k.Solution
subarraySum(kotlin.IntArray,java.lang.Integer) - function in g0501_0600.s0560_subarray_sum_equals_k.Solution
subarraysWithKDistinct(kotlin.IntArray,java.lang.Integer) - function in g0901_1000.s0992_subarrays_with_k_different_integers.Solution
subdomainVisits(kotlin.Array) - function in g0801_0900.s0811_subdomain_visit_count.Solution
SubrectangleQueries - class in g1401_1500.s1476_subrectangle_queries: 1476 - Subrectangle Queries\.
subsets(kotlin.IntArray) - function in g0001_0100.s0078_subsets.Solution
subsetsWithDup(kotlin.IntArray) - function in g0001_0100.s0090_subsets_ii.Solution
subsetXORSum(kotlin.IntArray) - function in g1801_1900.s1863_sum_of_all_subset_xor_totals.Solution
subStrHash(java.lang.String,java.lang.Integer,java.lang.Integer,java.lang.Integer,java.lang.Integer) - function in g2101_2200.s2156_find_substring_with_given_hash_value.Solution
substringXorQueries(java.lang.String,kotlin.Array) - function in g2501_2600.s2564_substring_xor_queries.Solution
subtractProductAndSum(java.lang.Integer) - function in g1201_1300.s1281_subtract_the_product_and_sum_of_digits_of_an_integer.Solution
subtreeWithAllDeepest(com_github_leetcode.TreeNode) - function in g0801_0900.s0865_smallest_subtree_with_all_the_deepest_nodes.Solution
successfulPairs(kotlin.IntArray,kotlin.IntArray,java.lang.Long) - function in g2201_2300.s2300_successful_pairs_of_spells_and_potions.Solution
sufficientSubset(com_github_leetcode.TreeNode,java.lang.Integer) - function in g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths.Solution
sufficientSubset(com_github_leetcode.TreeNode,java.lang.Integer,java.lang.Integer,java.lang.Boolean) - function in g1001_1100.s1080_insufficient_nodes_in_root_to_leaf_paths.Solution
suggestedProducts(kotlin.Array,java.lang.String) - function in g1201_1300.s1268_search_suggestions_system.Solution
sum(java.lang.String) - function in g0601_0700.s0677_map_sum_pairs.MapSum
sum(java.lang.Integer,java.lang.Integer) - function in g2201_2300.s2235_add_two_integers.Solution
sumBase(java.lang.Integer,java.lang.Integer) - function in g1801_1900.s1837_sum_of_digits_in_base_k.Solution
sumCounts(java.util.List) - function in g2901_3000.s2913_subarrays_distinct_element_sum_of_squares_i.Solution
sumCounts(kotlin.IntArray) - function in g2901_3000.s2916_subarrays_distinct_element_sum_of_squares_ii.Solution
sumDigitDifferences(kotlin.IntArray) - function in g3101_3200.s3153_sum_of_digit_differences_of_all_pairs.Solution
sumDistance(kotlin.IntArray,java.lang.String,java.lang.Integer) - function in g2701_2800.s2731_movement_of_robots.Solution
sumEvenAfterQueries(kotlin.IntArray,kotlin.Array) - function in g0901_1000.s0985_sum_of_even_numbers_after_queries.Solution
sumEvenGrandparent(com_github_leetcode.TreeNode) - function in g1301_1400.s1315_sum_of_nodes_with_even_valued_grandparent.Solution
sumFourDivisors(kotlin.IntArray) - function in g1301_1400.s1390_four_divisors.Solution
sumGame(java.lang.String) - function in g1901_2000.s1927_sum_game.Solution
sumImbalanceNumbers(kotlin.IntArray) - function in g2701_2800.s2763_sum_of_imbalance_numbers_of_all_subarrays.Solution
sumIndicesWithKSetBits(java.util.List,java.lang.Integer) - function in g2801_2900.s2859_sum_of_values_at_indices_with_k_set_bits.Solution
summaryRanges(kotlin.IntArray) - function in g0201_0300.s0228_summary_ranges.Solution
SummaryRanges - class in g0301_0400.s0352_data_stream_as_disjoint_intervals: 352 - Data Stream as Disjoint Intervals\.
sumNumbers(com_github_leetcode.TreeNode) - function in g0101_0200.s0129_sum_root_to_leaf_numbers.Solution
sumOddLengthSubarrays(kotlin.IntArray) - function in g1501_1600.s1588_sum_of_all_odd_length_subarrays.Solution
sumOfBeauties(kotlin.IntArray) - function in g2001_2100.s2012_sum_of_beauty_in_the_array.Solution
sumOfDigits(java.lang.Long) - function in g2401_2500.s2457_minimum_addition_to_make_integer_beautiful.Solution
sumOfDistancesInTree(java.lang.Integer,kotlin.Array) - function in g0801_0900.s0834_sum_of_distances_in_tree.Solution
sumOfEncryptedInt(kotlin.IntArray) - function in g3001_3100.s3079_find_the_sum_of_encrypted_integers.Solution
sumOfFlooredPairs(kotlin.IntArray) - function in g1801_1900.s1862_sum_of_floored_pairs.Solution
sumOfLeftLeaves(com_github_leetcode.TreeNode) - function in g0401_0500.s0404_sum_of_left_leaves.Solution
sumOfMultiples(java.lang.Integer) - function in g2601_2700.s2652_sum_multiples.Solution
sumOfNumberAndReverse(java.lang.Integer) - function in g2401_2500.s2443_sum_of_number_and_its_reverse.Solution
sumOfPower(kotlin.IntArray) - function in g2601_2700.s2681_power_of_heroes.Solution
sumOfPower(kotlin.IntArray,java.lang.Integer) - function in g3001_3100.s3082_find_the_sum_of_the_power_of_all_subsequences.Solution
sumOfPowers(kotlin.IntArray,java.lang.Integer) - function in g3001_3100.s3098_find_the_sum_of_subsequence_powers.Solution
sumOfSquares(kotlin.IntArray) - function in g2701_2800.s2778_sum_of_squares_of_special_elements.Solution
sumOfTheDigitsOfHarshadNumber(java.lang.Integer) - function in g3001_3100.s3099_harshad_number.Solution
sumOfThree(java.lang.Long) - function in g2101_2200.s2177_find_three_consecutive_integers_that_sum_to_a_given_number.Solution
sumOfUnique(kotlin.IntArray) - function in g1701_1800.s1748_sum_of_unique_elements.Solution
sumPrefixScores(kotlin.Array) - function in g2401_2500.s2416_sum_of_prefix_scores_of_strings.Solution
sumRange(java.lang.Integer,java.lang.Integer) - function in g0301_0400.s0303_range_sum_query_immutable.NumArray
sumRange(java.lang.Integer,java.lang.Integer) - function in g0301_0400.s0307_range_sum_query_mutable.NumArray
sumRegion(java.lang.Integer,java.lang.Integer,java.lang.Integer,java.lang.Integer) - function in g0301_0400.s0304_range_sum_query_2d_immutable.NumMatrix
sumRootToLeaf(com_github_leetcode.TreeNode) - function in g1001_1100.s1022_sum_of_root_to_leaf_binary_numbers.Solution
sumScores(java.lang.String) - function in g2201_2300.s2223_sum_of_scores_of_built_strings.Solution
sumSubarrayMins(kotlin.IntArray) - function in g0901_1000.s0907_sum_of_subarray_minimums.Solution
sumSubseqWidths(kotlin.IntArray) - function in g0801_0900.s0891_sum_of_subsequence_widths.Solution
sumTree(com_github_leetcode.TreeNode) - function in g1301_1400.s1339_maximum_product_of_splitted_binary_tree.Solution
sumZero(java.lang.Integer) - function in g1301_1400.s1304_find_n_unique_integers_sum_up_to_zero.Solution
superEggDrop(java.lang.Integer,java.lang.Integer) - function in g0801_0900.s0887_super_egg_drop.Solution
superpalindromesInRange(java.lang.String,java.lang.String) - function in g0901_1000.s0906_super_palindromes.Solution
superPow(java.lang.Integer,kotlin.IntArray) - function in g0301_0400.s0372_super_pow.Solution
surfaceArea(kotlin.Array) - function in g0801_0900.s0892_surface_area_of_3d_shapes.Solution
survivedRobotsHealths(kotlin.IntArray,kotlin.IntArray,java.lang.String) - function in g2701_2800.s2751_robot_collisions.Solution
swapNodes(com_github_leetcode.ListNode,java.lang.Integer) - function in g1701_1800.s1721_swapping_nodes_in_a_linked_list.Solution
swapPairs(com_github_leetcode.ListNode) - function in g0001_0100.s0024_swap_nodes_in_pairs.Solution
swimInWater(kotlin.Array) - function in g0701_0800.s0778_swim_in_rising_water.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