# Leetcode题解

## Leetcode题解

- [README](https://dfine.gitbook.io/leetcode/readme.md)
- [7.Reverse Integer](https://dfine.gitbook.io/leetcode/7.reverse_integer.md)
- [9.Palindrome Number](https://dfine.gitbook.io/leetcode/9.palindrome_number.md)
- [13.Roman to Integer](https://dfine.gitbook.io/leetcode/13.roman_to_integer.md)
- [19.Remove Nth Node from End of List](https://dfine.gitbook.io/leetcode/19.remove-nth-node-from-end-of-list.md)
- [20.Valid Parentheses](https://dfine.gitbook.io/leetcode/20.valid_parentheses.md)
- [21.Merge Two Sorted Lists](https://dfine.gitbook.io/leetcode/21.merge_two_sorted_lists.md)
- [22.Generate Parentheses](https://dfine.gitbook.io/leetcode/22.generate_parentheses.md)
- [26.Remove Duplicates from Sorted Array](https://dfine.gitbook.io/leetcode/26.remove_duplicates_from_sorted_array.md)
- [27.Remove Element](https://dfine.gitbook.io/leetcode/27.remove_element.md)
- [28.Implement strStr()](https://dfine.gitbook.io/leetcode/28.implement_strstr.md)
- [35.Search Insert Position](https://dfine.gitbook.io/leetcode/35.search_insert_position.md)
- [38.Count and Say](https://dfine.gitbook.io/leetcode/38.count_and_say.md)
- [46.Permutations](https://dfine.gitbook.io/leetcode/46.permutations.md)
- [53.Maximum Subarray](https://dfine.gitbook.io/leetcode/53.maximum_subarray.md)
- [58.Length of Last Word](https://dfine.gitbook.io/leetcode/58.length_of_last_word.md)
- [59.Spiral Matrix II](https://dfine.gitbook.io/leetcode/59.spiral_matrix_ii.md)
- [66.Plus One](https://dfine.gitbook.io/leetcode/66.plus_one.md)
- [67.Add Binary](https://dfine.gitbook.io/leetcode/67.add_binary.md)
- [69.Sqrt](https://dfine.gitbook.io/leetcode/69.sqrt.md)
- [70.Climbing Stairs](https://dfine.gitbook.io/leetcode/70.climbing_stairs.md)
- [77.Combinations](https://dfine.gitbook.io/leetcode/77.combinations.md)
- [78.Subsets](https://dfine.gitbook.io/leetcode/78.subsets.md)
- [83.Remove Duplicates from Sorted List](https://dfine.gitbook.io/leetcode/83.remove_duplicates_from_sorted_list.md)
- [88.Merge Sorted Array](https://dfine.gitbook.io/leetcode/88.merge_sorted_array.md)
- [104.Maximum Depth of Binary Tree](https://dfine.gitbook.io/leetcode/104.maximum_depth_of_binary_tree.md)
- [107.Binary Tree Level Order Traversal II](https://dfine.gitbook.io/leetcode/107.binary_tree_level_order_traversal_ii.md)
- [108.Convert Sorted Array to Binary Search Tree](https://dfine.gitbook.io/leetcode/108.convert_sorted_array_to_binary_search_tree.md)
- [100.Same Tree](https://dfine.gitbook.io/leetcode/100.same_tree.md)
- [101.Symmetric Tree](https://dfine.gitbook.io/leetcode/101.symmetric_tree.md)
- [105.Construct Binary Tree from Preorder and Inorder Traversal](https://dfine.gitbook.io/leetcode/105.construct_binary_tree_from_preorder_and_inorder_traversal.md)
- [110.Balanced Binary Tree](https://dfine.gitbook.io/leetcode/110.balanced_binary_tree.md)
- [111.Minimum Depth of Binary Tree](https://dfine.gitbook.io/leetcode/111.minimum_depth_of_binary_tree.md)
- [112.Path Sum](https://dfine.gitbook.io/leetcode/112.path_sum.md)
- [118.Pascals Triangle](https://dfine.gitbook.io/leetcode/118.pascals_triangle.md)
- [119.Pascals Triangle II](https://dfine.gitbook.io/leetcode/119.pascals_triangle_ii.md)
- [121.Best Time to Buy and Sell Stock](https://dfine.gitbook.io/leetcode/121.best_time_to_buy_and_sell_stock.md)
- [125.Valid Palindrome](https://dfine.gitbook.io/leetcode/125.valid_palindrome.md)
- [131.Palindrome Partitioning](https://dfine.gitbook.io/leetcode/131.palindrome_partitioning.md)
- [139.Word Break](https://dfine.gitbook.io/leetcode/139.word_break.md)
- [140.Word Break II](https://dfine.gitbook.io/leetcode/140.word_break_ii.md)
- [141.Linked List Cycle](https://dfine.gitbook.io/leetcode/141.linked_list_cycle.md)
- [143.Reorder List](https://dfine.gitbook.io/leetcode/143.reorder_list.md)
- [155.Min Stack](https://dfine.gitbook.io/leetcode/155.min_stack.md)
- [167.Two Sum II- Input Array is Sorted](https://dfine.gitbook.io/leetcode/167.two-sum-ii-input-array-is-sorted.md)
- [168.Excel Sheet Column Title](https://dfine.gitbook.io/leetcode/168.excel_sheet_column_title.md)
- [169.Majority Element](https://dfine.gitbook.io/leetcode/169.majority_element.md)
- [171.Excel Sheet Column Number](https://dfine.gitbook.io/leetcode/171.excel_sheet_column_number.md)
- [172.Factorial Trailing Zeroes](https://dfine.gitbook.io/leetcode/172.factorial_trailing_zeroes.md)
- [175.Combine Two Tables](https://dfine.gitbook.io/leetcode/175.combine_two_tables.md)
- [181.Employee Earning More Than Their Managers](https://dfine.gitbook.io/leetcode/181.employees_earning_more_than_their_managers.md)
- [182.Duplicate Emails](https://dfine.gitbook.io/leetcode/182.duplicate_emails.md)
- [183.Customers Who Never Order](https://dfine.gitbook.io/leetcode/183.customers_who_never_order.md)
- [189.Rotate Array](https://dfine.gitbook.io/leetcode/189.rotate_array.md)
- [191.Number of 1 Bits](https://dfine.gitbook.io/leetcode/191.number_of_1_bits.md)
- [193.Valid Phone Numbers](https://dfine.gitbook.io/leetcode/193.valid_phone_numbers.md)
- [195.Tenth Line](https://dfine.gitbook.io/leetcode/195.tenth_line.md)
- [196.Delete Duplicate Emails](https://dfine.gitbook.io/leetcode/196.delete_duplicate_emails.md)
- [197.Rising Temperature](https://dfine.gitbook.io/leetcode/197.rising_temperature.md)
- [198.House Robber](https://dfine.gitbook.io/leetcode/198.house_robber.md)
- [202.Happy Number](https://dfine.gitbook.io/leetcode/202.happy_number.md)
- [203.Remove Linked List Elements](https://dfine.gitbook.io/leetcode/203.remove_linked_list_elements.md)
- [204.Count Primes](https://dfine.gitbook.io/leetcode/204.count_primes.md)
- [205.Isomorphic Strings](https://dfine.gitbook.io/leetcode/205.isomorphic_strings.md)
- [206.Reverse Linked List](https://dfine.gitbook.io/leetcode/206.reverse_linked_list.md)
- [217.Contains Duplicate](https://dfine.gitbook.io/leetcode/217.contains_duplicate.md)
- [219.Contains Duplicate II](https://dfine.gitbook.io/leetcode/219.contains_duplicate_ii.md)
- [225.Implement Stack Using Queues](https://dfine.gitbook.io/leetcode/225.implement_stack_using_queues.md)
- [226.Invert Binary Tree](https://dfine.gitbook.io/leetcode/226.invert_binary_tree.md)
- [231.Power of Two](https://dfine.gitbook.io/leetcode/231.power_of_two.md)
- [232.Implement Queue Using Stack](https://dfine.gitbook.io/leetcode/232.implement_queue_using_stack.md)
- [234.Palindrome Linked List](https://dfine.gitbook.io/leetcode/234.palindrome_linked_list.md)
- [237.Delete Node in a Linked List](https://dfine.gitbook.io/leetcode/237.delete_node_in_a_linked_list.md)
- [240.Search a 2D Matrix II](https://dfine.gitbook.io/leetcode/240.search_a_2d_matrix_ii.md)
- [242.Valid Anagram](https://dfine.gitbook.io/leetcode/242.valid_anagram.md)
- [257.Binary Tree Paths](https://dfine.gitbook.io/leetcode/257.binary_tree_paths.md)
- [258.Add Digits](https://dfine.gitbook.io/leetcode/258.add_digits.md)
- [263.Ugly Numbers](https://dfine.gitbook.io/leetcode/263.ugly_numbers.md)
- [268.Missing Number](https://dfine.gitbook.io/leetcode/268.missing_number.md)
- [278.First Bad Version](https://dfine.gitbook.io/leetcode/278.first_bad_version.md)
- [284.Peeking Iterator](https://dfine.gitbook.io/leetcode/284.peeking_iterator.md)
- [290.Word Pattern](https://dfine.gitbook.io/leetcode/290.word_pattern.md)
- [282.Nim Game](https://dfine.gitbook.io/leetcode/292.nim_game.md)
- [303.Range Sum Query Immutable](https://dfine.gitbook.io/leetcode/303.range_sum_query_immutable.md)
- [338.Counting Bits](https://dfine.gitbook.io/leetcode/338.counting_bits.md)
- [342.Power of Four](https://dfine.gitbook.io/leetcode/342.power_of_four.md)
- [344.Reverse String](https://dfine.gitbook.io/leetcode/344.reverse_string.md)
- [345.Reverse Vowels of a String](https://dfine.gitbook.io/leetcode/345.reverse_vowels_of_a_string.md)
- [349.Intersection of Two Arrays](https://dfine.gitbook.io/leetcode/349.intersection_of_two_arrays.md)
- [350.Intersection of Two Arrays II](https://dfine.gitbook.io/leetcode/350.intersection_of_two_arrays_ii.md)
- [367.Valid Perfect Square](https://dfine.gitbook.io/leetcode/367.valid_perfect_square.md)
- [371.Sum of Two Integers](https://dfine.gitbook.io/leetcode/371.sum_of_two_integers.md)
- [374.Guess Number Higher or Lower](https://dfine.gitbook.io/leetcode/374.guess_number_higher_or_lower.md)
- [383.Ransom Note](https://dfine.gitbook.io/leetcode/383.ransom_note.md)
- [387.First Unique Character in a String](https://dfine.gitbook.io/leetcode/387.first_unique_character_in_a_string.md)
- [400.Nth Digit](https://dfine.gitbook.io/leetcode/400.nth_digit.md)
- [401.Binary Watch](https://dfine.gitbook.io/leetcode/401.binary_watch.md)
- [404.Sum of Left Leaves](https://dfine.gitbook.io/leetcode/404.sum_of_left_leaves.md)
- [405.Convert A Number to Hexadecimal](https://dfine.gitbook.io/leetcode/405.convert_a_number_to_hexadecimal.md)
- [409.Longest Palindrome](https://dfine.gitbook.io/leetcode/409.longest_palindrome.md)
- [412.Fizz Buzz](https://dfine.gitbook.io/leetcode/412.fizz_buzz.md)
- [414.Third Maximum Number](https://dfine.gitbook.io/leetcode/414.third_maximum_number.md)
- [415.Add Strings](https://dfine.gitbook.io/leetcode/415.add_strings.md)
- [427.Construct Quad Tree](https://dfine.gitbook.io/leetcode/427.construct_quad_tree.md)
- [429.N Ary Tree Level Order Traversal](https://dfine.gitbook.io/leetcode/429.n_ary_tree_level_order_traversal.md)
- [434.Number of Segments in a String](https://dfine.gitbook.io/leetcode/434.number_of_segments_in_a_string.md)
- [437.Path Sum III](https://dfine.gitbook.io/leetcode/437.path_sum_iii.md)
- [438.Find All Anagrams in a String](https://dfine.gitbook.io/leetcode/438.find_all_anagrams_in_a_string.md)
- [441.Arranging Coins](https://dfine.gitbook.io/leetcode/441.arranging_coins.md)
- [443.String Compression](https://dfine.gitbook.io/leetcode/443.string_compression.md)
- [447.Number of Boomerangs](https://dfine.gitbook.io/leetcode/447.number_of_boomerangs.md)
- [448.Find All Numbers Disappeared in an Array](https://dfine.gitbook.io/leetcode/448.find_all_numbers_disappeared_in_an_array.md)
- [453.Minimum Moves to Equal Array Elements](https://dfine.gitbook.io/leetcode/453.minimum_moves_to_equal_array_elements.md)
- [455.Assign Cookies](https://dfine.gitbook.io/leetcode/455.assign_cookies.md)
- [459.Repeated Substring Pattern](https://dfine.gitbook.io/leetcode/459.repeated_substring_pattern.md)
- [461.Hamming Distance](https://dfine.gitbook.io/leetcode/461.hamming_distance.md)
- [463.Island Perimeter](https://dfine.gitbook.io/leetcode/463.island_perimeter.md)
- [475.Heaters](https://dfine.gitbook.io/leetcode/475.heaters.md)
- [476.Number Complement](https://dfine.gitbook.io/leetcode/476.number_complement.md)
- [482.License Key Formatting](https://dfine.gitbook.io/leetcode/482.license_key_formatting.md)
- [485.Max Consecutive Ones](https://dfine.gitbook.io/leetcode/485.max_consecutive_ones.md)
- [492.Construct the Rectangle](https://dfine.gitbook.io/leetcode/492.construct_the_rectangle.md)
- [496.Next Greater Element I](https://dfine.gitbook.io/leetcode/496.next_greater_element_i.md)
- [500.Keyboard Row](https://dfine.gitbook.io/leetcode/500.keyboard_row.md)
- [501.Find Mode in Binary Tree](https://dfine.gitbook.io/leetcode/501.find_mode_in_binary_search_tree.md)
- [504.Base 7](https://dfine.gitbook.io/leetcode/504.base_7.md)
- [506.Relative Ranks](https://dfine.gitbook.io/leetcode/506.relative_ranks.md)
- [507.Perfect Number](https://dfine.gitbook.io/leetcode/507.perfect_number.md)
- [509.Fibonacci Number](https://dfine.gitbook.io/leetcode/509.fibonacci_number.md)
- [520.Detect Capital](https://dfine.gitbook.io/leetcode/520.detect_capital.md)
- [521.Longest Uncommon Subsequence I](https://dfine.gitbook.io/leetcode/521.longest_uncommon_subsequence_i.md)
- [530.Minimum Absolute Difference in BST](https://dfine.gitbook.io/leetcode/530.minimum_absolute_difference_in_bst.md)
- [532.K-diff Pairs in an Array](https://dfine.gitbook.io/leetcode/532.k-diff_pairs_in_an_array.md)
- [535.Encode and Decode TinyURL](https://dfine.gitbook.io/leetcode/535.encode_and_decode_tinyurl.md)
- [538.Convert BST to Greater Tree](https://dfine.gitbook.io/leetcode/538.convert_bst_to_greater_tree.md)
- [541.Reverse String II](https://dfine.gitbook.io/leetcode/541.reverse_string_ii.md)
- [543.Diameter of Binary Tree](https://dfine.gitbook.io/leetcode/543.diameter_of_binary_tree.md)
- [551.Student Attendace Record I](https://dfine.gitbook.io/leetcode/551.student_attendance_record_i.md)
- [557.Reverse Words in a String](https://dfine.gitbook.io/leetcode/557.reverse_words_in_a_string.md)
- [558.Quad Tree Intersection](https://dfine.gitbook.io/leetcode/558.quad_tree_intersection.md)
- [559.Maxmium Depth of N Ary Tree](https://dfine.gitbook.io/leetcode/559.maxmium_depth_of_n_ary_tree.md)
- [561.Array Partition I](https://dfine.gitbook.io/leetcode/561.array-partition-i.md)
- [563.Binary Tree Tilt](https://dfine.gitbook.io/leetcode/563.binary_tree_tilt.md)
- [566.Reshape the Matrix](https://dfine.gitbook.io/leetcode/566.reshape_the_matrix.md)
- [572.Subtree of Another Tree](https://dfine.gitbook.io/leetcode/572.subtree_of_another_tree.md)
- [575.Distribute Candies](https://dfine.gitbook.io/leetcode/575.distribute_candies.md)
- [581.Shortest Unsorted Continuous Subarray](https://dfine.gitbook.io/leetcode/581.shortest_unsorted_continuous_subarray.md)
- [589.N Ary Tree Preorder Traversal](https://dfine.gitbook.io/leetcode/589.n_ary_tree_preorder_traversal.md)
- [590.N Ary Tree Postorder Traversal](https://dfine.gitbook.io/leetcode/590.n_ary_tree_postorder_traversal.md)
- [594.Longest Harmonious Subsequence](https://dfine.gitbook.io/leetcode/594.longest_harmonious_subsequence.md)
- [595.Big Countires](https://dfine.gitbook.io/leetcode/595.big_countries.md)
- [596.Classes More Than 5 Students](https://dfine.gitbook.io/leetcode/596.classes_more_than_5_students.md)
- [598.Range Addition II](https://dfine.gitbook.io/leetcode/598.range_addition_ii.md)
- [599.Minimum Index of Two Lists](https://dfine.gitbook.io/leetcode/599.minimum-index-of-two-lists.md)
- [605.Can Place Flowers](https://dfine.gitbook.io/leetcode/605.can_place_flowers.md)
- [606.Construct String from Binary Tree](https://dfine.gitbook.io/leetcode/606.construct_string_from_binary_tree.md)
- [617.Merge Two Binary Trees](https://dfine.gitbook.io/leetcode/617.merge_two_binary_trees.md)
- [620.Not Boring Movies](https://dfine.gitbook.io/leetcode/620.not_boring_movies.md)
- [627.Swap Salary](https://dfine.gitbook.io/leetcode/627.swap_salary.md)
- [628.Maximum Product of Three Numbers](https://dfine.gitbook.io/leetcode/628.maximum_product_of_three_numbers.md)
- [633.Sum of Square Numbers](https://dfine.gitbook.io/leetcode/633.sum_of_square_numbers.md)
- [637.Average of Levels in Binary Tree](https://dfine.gitbook.io/leetcode/637.average_of_levels_in_binary_tree.md)
- [643.Maximum Average Subarray I](https://dfine.gitbook.io/leetcode/643.maximum_average_subarray_i.md)
- [645.Set Mismatch](https://dfine.gitbook.io/leetcode/645.set_mismatch.md)
- [653.Two Sum IV - Input is a BST](https://dfine.gitbook.io/leetcode/653.two_sum_iv_input_is_a_bst.md)
- [654.Maximum Binary Tree](https://dfine.gitbook.io/leetcode/654.maximum_binary_tree.md)
- [657.Robot Return to Origin](https://dfine.gitbook.io/leetcode/657.robot_return_to_origin.md)
- [661.Image Smoother](https://dfine.gitbook.io/leetcode/661.image_smoother.md)
- [665.Non-Decreasing Array](https://dfine.gitbook.io/leetcode/665.non-decreasing_array.md)
- [669.Trim a Binary Search Tree](https://dfine.gitbook.io/leetcode/669.trim_a_binary_search_tree.md)
- [671.Second Minimum Node in a Binary Tree](https://dfine.gitbook.io/leetcode/671.second_minimum_node_in_a_binary_tree.md)
- [680.Valid Palindrome II](https://dfine.gitbook.io/leetcode/680.valid_palindrome_ii.md)
- [682.Baseball Game](https://dfine.gitbook.io/leetcode/682.baseball_game.md)
- [686.Repeated String Match](https://dfine.gitbook.io/leetcode/686.repeated_string_match.md)
- [687.Longest Univalue Path](https://dfine.gitbook.io/leetcode/687.longest_univalue_path.md)
- [690.Employee Importance](https://dfine.gitbook.io/leetcode/690.employee_importance.md)
- [693.Binary Number with Alternating Bits](https://dfine.gitbook.io/leetcode/693.binary_number_with_alternating_bits.md)
- [696.Count Binary Substring](https://dfine.gitbook.io/leetcode/696.count-binary-substring.md)
- [697.Degree of an Array](https://dfine.gitbook.io/leetcode/697.degree_of_an_array.md)
- [700.Search in a Binary Search Tree](https://dfine.gitbook.io/leetcode/700.search_in_a_binary_search_tree.md)
- [701.Insert Into a Binary Search Tree](https://dfine.gitbook.io/leetcode/701.insert_into_a_binary_search_tree.md)
- [703.Kth Largest Element in a Stream](https://dfine.gitbook.io/leetcode/703.kth_largest_element_in_a_stream.md)
- [704.Binary Search](https://dfine.gitbook.io/leetcode/704.binary_search.md)
- [705.Design Hashset](https://dfine.gitbook.io/leetcode/705.design_hashset.md)
- [706.Design Hashmap](https://dfine.gitbook.io/leetcode/706.design_hashmap.md)
- [707.Design Linked List](https://dfine.gitbook.io/leetcode/707.design_linked_list.md)
- [709.To Lower Case](https://dfine.gitbook.io/leetcode/709.to_lower_case.md)
- [713.Subarray Product Less Than K](https://dfine.gitbook.io/leetcode/713.subarray_product_less_than_k.md)
- [717.1 Bit and 2 Bit Characters](https://dfine.gitbook.io/leetcode/717.1_bit_and_2_bit_characters.md)
- [720.Longest Word in Dictionary](https://dfine.gitbook.io/leetcode/720.longest_word_in_dictionary.md)
- [724.Find Pivot Index](https://dfine.gitbook.io/leetcode/724.find_pivot_index.md)
- [728.Self Dividing Numbers](https://dfine.gitbook.io/leetcode/728.self_dividing_numbers.md)
- [733.Flood Fill](https://dfine.gitbook.io/leetcode/733.flood_fill.md)
- [739.每日温度](https://dfine.gitbook.io/leetcode/739.-mei-ri-wen-du.md)
- [744.Find Smallest Letter Greater Than Target](https://dfine.gitbook.io/leetcode/744.find_smallest_letter_greater_than_target.md)
- [746.Min Cost Climbing Stairs](https://dfine.gitbook.io/leetcode/746.min_cost_climbing_stairs.md)
- [747.Largest Number At Least Twice Of Others](https://dfine.gitbook.io/leetcode/747.largest_number_at_least_twice_of_others.md)
- [748.Shortest Completing Word](https://dfine.gitbook.io/leetcode/748.shortest_completing_word.md)
- [754.Reach A Number](https://dfine.gitbook.io/leetcode/754.reach_a_number.md)
- [762.Prime Number of Set Bits in Binary Representation](https://dfine.gitbook.io/leetcode/762.prime_number_of_set_bits_in_binary_representation.md)
- [766.Toeplitz Matrix](https://dfine.gitbook.io/leetcode/766.toeplitz_matrix.md)
- [771.Jewels and Stones](https://dfine.gitbook.io/leetcode/771.jewels_and_stones.md)
- [783.Minimum Distance Between BST Nodes](https://dfine.gitbook.io/leetcode/783.minimum_distance_between_bst_nodes.md)
- [784.Letter Case Permutation](https://dfine.gitbook.io/leetcode/784.letter_case_permutation.md)
- [788.Rotated Digits](https://dfine.gitbook.io/leetcode/788.rotated_digits.md)
- [796.Rotate String](https://dfine.gitbook.io/leetcode/796.rotate_string.md)
- [804.Unique Morse Code Words](https://dfine.gitbook.io/leetcode/804.unique_morse_code_words.md)
- [806.Number of Lines to Write String](https://dfine.gitbook.io/leetcode/806.number_of_lines_to_write_string.md)
- [807.Max Increase to Keep City Skyline](https://dfine.gitbook.io/leetcode/807.max_increase_to_keep_city_skyline.md)
- [811.Subdomain Visit Count](https://dfine.gitbook.io/leetcode/811.subdomain_visit_count.md)
- [812.Largest Triangle Area](https://dfine.gitbook.io/leetcode/812.largest_triangle_area.md)
- [814.Binary Tree Pruning](https://dfine.gitbook.io/leetcode/814.binary_tree_pruning.md)
- [819.Most Common Word](https://dfine.gitbook.io/leetcode/819.most_common_word.md)
- [821.Shortest Distance to a Character](https://dfine.gitbook.io/leetcode/821.shortest_distance_to_a_character.md)
- [824.Goat Latin](https://dfine.gitbook.io/leetcode/824.goat_latin.md)
- [829.Consecutive Numbers Sum](https://dfine.gitbook.io/leetcode/829.consecutive_numbers_sum.md)
- [830.Position of Large Groups](https://dfine.gitbook.io/leetcode/830.position_of_large_groups.md)
- [831.Masking Personal Information](https://dfine.gitbook.io/leetcode/831.masking_personal_information.md)
- [832,Flipping an Image](https://dfine.gitbook.io/leetcode/832.flipping_an_image.md)
- [833.Find And Replace in String](https://dfine.gitbook.io/leetcode/833.find_and_replace_in_string.md)
- [835,Image Overlap](https://dfine.gitbook.io/leetcode/835.image_overlap.md)
- [836.Rectangle Overlap](https://dfine.gitbook.io/leetcode/836.rectangle_overlap.md)
- [840.Magic Squares In Grid](https://dfine.gitbook.io/leetcode/840.magic_squares_in_grid.md)
- [844.Backspace String Compare](https://dfine.gitbook.io/leetcode/844.backspace_string_compare.md)
- [848.Shifting Letters](https://dfine.gitbook.io/leetcode/848.shifting_letters.md)
- [849.Maximize Distance to Closest Person](https://dfine.gitbook.io/leetcode/849.maximize_distance_to_closest_person.md)
- [852.Peak Index in A Mountain Array](https://dfine.gitbook.io/leetcode/852.peak_index_in_a_mountain_array.md)
- [853.Car Fleet](https://dfine.gitbook.io/leetcode/853.car_fleet.md)
- [855.Exam Room](https://dfine.gitbook.io/leetcode/855.exam_room.md)
- [859.Buddy Strings](https://dfine.gitbook.io/leetcode/859.buddy_strings.md)
- [860.Lemonade Change](https://dfine.gitbook.io/leetcode/860.lemonade_change.md)
- [861.Score After Flipping Matrix](https://dfine.gitbook.io/leetcode/861.score_after_flipping_matrix.md)
- [864.Shortest Path to Get All Keys](https://dfine.gitbook.io/leetcode/864.shortest_path_to_get_all_keys.md)
- [865.Smallest Subtree with all the Deepest Nodes](https://dfine.gitbook.io/leetcode/865.smallest_subtree_with_all_the_deepest_nodes.md)
- [866.Prime Palindrome](https://dfine.gitbook.io/leetcode/866.prime_palindrome.md)
- [867.transpose](https://dfine.gitbook.io/leetcode/867.transpose.md)
- [868.Binary Gap](https://dfine.gitbook.io/leetcode/868.binary_gap.md)
- [872.Leaf Similar Trees](https://dfine.gitbook.io/leetcode/872.leaf_similar_trees.md)
- [874.Walking Robot Simulation](https://dfine.gitbook.io/leetcode/874.walking-robot-simulation.md)
- [876.Middle of the Linked List](https://dfine.gitbook.io/leetcode/876.middle_of_the_linked_list.md)
- [883.Projection Area of 3D Shapes](https://dfine.gitbook.io/leetcode/883.projection_area_of_3d_shapes.md)
- [884.Uncommon Words from Two Sentences](https://dfine.gitbook.io/leetcode/884.uncommon_words_from_two_sentences.md)
- [887.Super Egg Drop](https://dfine.gitbook.io/leetcode/887.super_egg_drop.md)
- [888.Fair Candy Swap](https://dfine.gitbook.io/leetcode/888.fair_candy_swap.md)
- [892.Surface Area of 3D Shapes](https://dfine.gitbook.io/leetcode/892.surface_area_of_3d_shapes.md)
- [893.Groups of Special Equivalent Strings](https://dfine.gitbook.io/leetcode/893.groups_of_special_equivalent_strings.md)
- [894.All Possible Full Binary Trees](https://dfine.gitbook.io/leetcode/894.all_possible_full_binary_trees.md)
- [896.monotonic array](https://dfine.gitbook.io/leetcode/896.monotonic_array.md)
- [897.increasing order search tree](https://dfine.gitbook.io/leetcode/897.increasing_order_search_tree.md)
- [900.RLE Iterator](https://dfine.gitbook.io/leetcode/900.rle_iterator.md)
- [901.Online Stock Span](https://dfine.gitbook.io/leetcode/901.online_stock_span.md)
- [905.Sort Array by Parity](https://dfine.gitbook.io/leetcode/905.sort_array_by_parity.md)
- [908.Smallest Range I](https://dfine.gitbook.io/leetcode/908.smallest_range_i.md)
- [910.Smallest Range II](https://dfine.gitbook.io/leetcode/910.smallest_range_ii.md)
- [913.Cat and Mouse](https://dfine.gitbook.io/leetcode/913.cat_and_mouse.md)
- [914.X of a Kind in a Deck of Cards](https://dfine.gitbook.io/leetcode/914.x-of-a-kind-in-a-deck-of-cards.md)
- [915.Partition Array into Disjoint Intervals](https://dfine.gitbook.io/leetcode/915.partition_array_into_disjoint_intervals.md)
- [916.Word Subsets](https://dfine.gitbook.io/leetcode/916.word_subsets.md)
- [917.Reverse Only Letters](https://dfine.gitbook.io/leetcode/917.reverse_only_letters.md)
- [922.Sort Array by Parity II](https://dfine.gitbook.io/leetcode/922.sort_array_by_parity_ii.md)
- [925.Long Pressed Name](https://dfine.gitbook.io/leetcode/925.long_pressed_name.md)
- [929.Unique Email Address](https://dfine.gitbook.io/leetcode/929.unique_email_address.md)
- [937.Reorder Log Files](https://dfine.gitbook.io/leetcode/937.reorder_log_files.md)
- [938.Range Sum of BST](https://dfine.gitbook.io/leetcode/938.range_sum_of_bst.md)
- [941.Valid Mountain Array](https://dfine.gitbook.io/leetcode/941.valid_mountain_array.md)
- [942.Di String Match](https://dfine.gitbook.io/leetcode/942.di_string_match.md)
- [944.Delete Column to Make Sorted](https://dfine.gitbook.io/leetcode/944.delete_column_to_make_sorted.md)
- [949.Largest Time For Given Digits](https://dfine.gitbook.io/leetcode/949.largest_time_for_given_digits.md)
- [950.Reveal Cards in Increasing Order](https://dfine.gitbook.io/leetcode/950.reveal_cards_in_increasing_order.md)
- [953.Verifying an Alien Dictionary](https://dfine.gitbook.io/leetcode/953.verifying_an_alien_dictionary.md)
- [961.N Repeated Element in Size 2N Array](https://dfine.gitbook.io/leetcode/961.n_repeated_element_in_size_2n_array.md)
- [965.Univalued Binary Tree](https://dfine.gitbook.io/leetcode/965.univalued_binary_tree.md)
- [970.Powerful Integers](https://dfine.gitbook.io/leetcode/970.powerful_integers.md)
- [974.Subarray Sums Divisible By K](https://dfine.gitbook.io/leetcode/974.subarray_sums_divisible_by_k.md)
- [976.Largest Perimeter Triangle](https://dfine.gitbook.io/leetcode/976.largest_perimeter_triangle.md)
- [977.Squares of a Sorted Array](https://dfine.gitbook.io/leetcode/977.squares_of_a_sorted_array.md)
- [985.Sum of Even Numbers After Queries](https://dfine.gitbook.io/leetcode/985.sum_of_even_numbers_after_queries.md)
- [989.Add to Array-Form of Integer](https://dfine.gitbook.io/leetcode/989.add_to_array_form_of_integer.md)
- [990.Satisfiability of Equality Equations](https://dfine.gitbook.io/leetcode/990.satisfiability-of-equality-equations.md)
- [993.Cousins in Binary Tree](https://dfine.gitbook.io/leetcode/993.cousins_in_binary_tree.md)
- [994.Rotting Oranges](https://dfine.gitbook.io/leetcode/994.rotting_oranges.md)
- [997.Find the Town Judge](https://dfine.gitbook.io/leetcode/997.find_the_town_judge.md)
- [999.Available Captures for Rook](https://dfine.gitbook.io/leetcode/999.available_captures_for_rook.md)
- [1002.Find Common Characters](https://dfine.gitbook.io/leetcode/1002.find_common_characters.md)
- [1005.Maximise Sum of Array after K Negations](https://dfine.gitbook.io/leetcode/1005.maximise-sum-of-array-after-k-negations.md)
- [1008.Construct Binary Search Tree from Preorder Traversal](https://dfine.gitbook.io/leetcode/1008.construct_binary_search_tree_from_preorder_traversal.md)
- [1021.Remove Outermost Parentheses](https://dfine.gitbook.io/leetcode/1021.remove_outermost_parentheses.md)
- [1025.Divisor Game](https://dfine.gitbook.io/leetcode/1025.divisor_game.md)
- [1029.Tow City Scheduling](https://dfine.gitbook.io/leetcode/1029.tow-city-scheduling.md)
- [1030.Matrix Cells in Distance Order](https://dfine.gitbook.io/leetcode/1030.matrix_cells_in_distance_order.md)
- [1033.Moving Stones Until Consecutive](https://dfine.gitbook.io/leetcode/1033.moving_stones_until_consecutive.md)
- [1037.Valid Boomerang](https://dfine.gitbook.io/leetcode/1037.valid_boomerang.md)
- [1038.Binary Search Tree to Greater Sum Tree](https://dfine.gitbook.io/leetcode/1038.binary_search_tree_to_greater_sum_tree.md)
- [1041.Robot Bounded in Circle](https://dfine.gitbook.io/leetcode/1041.robot_bounded_in_circle.md)
- [1042.Flower Planting with no Adjacent](https://dfine.gitbook.io/leetcode/1042.flower_planting_with_no_adjacent.md)
- [1046.Last Stone Weight](https://dfine.gitbook.io/leetcode/1046.last_stone_weight.md)
- [1089.Duplicate Zeros](https://dfine.gitbook.io/leetcode/1089.duplicate_zeros.md)
- [1013.Partition Array Into Three Parts with Equal Sum](https://dfine.gitbook.io/leetcode/1013.partition_array_into_three_parts_with_equal_sum.md)
- [1018.Binary Prefix Divisible By 5](https://dfine.gitbook.io/leetcode/1018.binary_prefix_divisible_by_5.md)
- [1022.Sum of Root To Leaf Binary Numbers](https://dfine.gitbook.io/leetcode/1022.sum_of_root_to_leaf_binary_numbers.md)
- [1071.Greatest Common Divisor of Strings](https://dfine.gitbook.io/leetcode/1071.greatest_common_divisor_of_strings.md)
- [1079.Letter Tile Possibilities](https://dfine.gitbook.io/leetcode/1079.letter_tile_possiblities.md)
- [1103.Distribute Candies to People](https://dfine.gitbook.io/leetcode/1103.distribute_candies_to_people.md)
- [1114.Print in Order](https://dfine.gitbook.io/leetcode/1114.print_in_order.md)
- [1115.Print FooBar Alternately](https://dfine.gitbook.io/leetcode/1115.print_foobar_alternately.md)
- [1116.Print Zero Even Odd](https://dfine.gitbook.io/leetcode/1116.print_zero_even_odd.md)
- [1117.Building H2O](https://dfine.gitbook.io/leetcode/1117.building_h2o.md)
- [1128.Number of Equivalent Domino Pairs](https://dfine.gitbook.io/leetcode/1128.number_of_equivalent_domino_pairs.md)
- [1169.Invalid Transactions](https://dfine.gitbook.io/leetcode/1169.invalid_transactions.md)
- [1176.Diet Plan Performance](https://dfine.gitbook.io/leetcode/1176.diet_plan_performance.md)
- [1282.用户分组](https://dfine.gitbook.io/leetcode/1282.group_the_people_given_the_group_size_they_belong_to.md)
- [1329.Sort the Matrix Diagonally](https://dfine.gitbook.io/leetcode/1329.sort_the_matrix_diagonally.md)
- [1379.Find a Corresponding Node of a Binary Tree in a Clone of That Tree](https://dfine.gitbook.io/leetcode/1379.find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree.md)
- [1395.Count Number of Teams](https://dfine.gitbook.io/leetcode/1395.count_number_of_teams.md)
- [ByteDance](https://dfine.gitbook.io/leetcode/bytedance.md)
- [面试题 64](https://dfine.gitbook.io/leetcode/qiu_12n_lcof.md)
- [面试题 16.01](https://dfine.gitbook.io/leetcode/interview_1601.md)
- [面试题 16.18](https://dfine.gitbook.io/leetcode/interview_1618.md)
- [面试题 29](https://dfine.gitbook.io/leetcode/interview_29.md)
- [面试题 46](https://dfine.gitbook.io/leetcode/interview_46.md)