René's URL Explorer Experiment


Title: LeetCode-in-Java | Java-based LeetCode algorithm problem solutions, regularly updated.

Open Graph Title: LeetCode-in-Java

X Title: LeetCode-in-Java

Description: Java-based LeetCode algorithm problem solutions, regularly updated.

Open Graph Description: Java-based LeetCode algorithm problem solutions, regularly updated.

Opengraph URL: https://leetcode-in-java.github.io/

Generator: Jekyll v3.10.0

direct link

Domain: leetcode-in-java.github.io

Hey, it has json ld scripts: 
{"@context":"https://schema.org","@type":"WebSite","description":"Java-based LeetCode algorithm problem solutions, regularly updated.","headline":"LeetCode-in-Java","name":"LeetCode-in-Java","url":"https://leetcode-in-java.github.io/"}
NoneIE=edge
og:localeen_US
og:site_nameLeetCode-in-Java
og:typewebsite
twitter:cardsummary

Links:

LeetCode-in-Javahttps://leetcode-in-java.github.io/
https://github.com/javadev/LeetCode-in-Java
https://github.com/javadev/LeetCode-in-Java/fork
“For coding interview preparation, LeetCode is one of the best online resource providing a rich library of more than 300 real coding interview questions for you to practice from using one of the 7 supported languages - C, C++, Java, Python, C#, JavaScript, Ruby.”https://www.quora.com/How-effective-is-Leetcode-for-preparing-for-technical-interviews
Level 1https://leetcode-in-java.github.io#level-1
Level 2https://leetcode-in-java.github.io#level-2
Udemyhttps://leetcode-in-java.github.io#udemy
Top Interview 150https://leetcode-in-java.github.io#top-interview-150
Data Structure Ihttps://leetcode-in-java.github.io#data-structure-i
Data Structure IIhttps://leetcode-in-java.github.io#data-structure-ii
Algorithm Ihttps://leetcode-in-java.github.io#algorithm-i
Algorithm IIhttps://leetcode-in-java.github.io#algorithm-ii
Binary Search Ihttps://leetcode-in-java.github.io#binary-search-i
Binary Search IIhttps://leetcode-in-java.github.io#binary-search-ii
Dynamic Programming Ihttps://leetcode-in-java.github.io#dynamic-programming-i
Programming Skills Ihttps://leetcode-in-java.github.io#programming-skills-i
Programming Skills IIhttps://leetcode-in-java.github.io#programming-skills-ii
Graph Theory Ihttps://leetcode-in-java.github.io#graph-theory-i
SQL Ihttps://leetcode-in-java.github.io#sql-i
Running Sum of 1d Arrayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1480_running_sum_of_1d_array
Find Pivot Indexhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0724_find_pivot_index
Isomorphic Stringshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0205_isomorphic_strings
Is Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0392_is_subsequence
Merge Two Sorted Listshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0021_merge_two_sorted_lists
Reverse Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0206_reverse_linked_list
Middle of the Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0876_middle_of_the_linked_list
Linked List Cycle IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0142_linked_list_cycle_ii
Best Time to Buy and Sell Stockhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock
Longest Palindromehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0409_longest_palindrome
N-ary Tree Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal
Binary Tree Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal
Binary Searchhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0704_binary_search
First Bad Versionhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0278_first_bad_version
Validate Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0098_validate_binary_search_tree
Lowest Common Ancestor of a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree
Flood Fillhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0733_flood_fill
Number of Islandshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0200_number_of_islands
Fibonacci Numberhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0509_fibonacci_number
Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0070_climbing_stairs
Min Cost Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs
Unique Pathshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0062_unique_paths
Find All Anagrams in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string
Longest Repeating Character Replacementhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0424_longest_repeating_character_replacement
Two Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0001_two_sum
Bulls and Cowshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0299_bulls_and_cows
Backspace String Comparehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0844_backspace_string_compare
Decode Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0394_decode_string
Last Stone Weighthttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1046_last_stone_weight
Top K Frequent Wordshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0692_top_k_frequent_words
Happy Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0202_happy_number
Spiral Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0054_spiral_matrix
Where Will the Ball Fallhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1706_where_will_the_ball_fall
Longest Common Prefixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0014_longest_common_prefix
Multiply Stringshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0043_multiply_strings
Remove Nth Node From End of Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list
Palindrome Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0234_palindrome_linked_list
Odd Even Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0328_odd_even_linked_list
Sort Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0148_sort_list
Longest Palindrome by Concatenating Two Letter Wordshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2131_longest_palindrome_by_concatenating_two_letter_words
Task Schedulerhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0621_task_scheduler
Invert Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0226_invert_binary_tree
Balanced Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0110_balanced_binary_tree
Diameter of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0543_diameter_of_binary_tree
Path Sum IIIhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0437_path_sum_iii
Search a 2D Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix
Search in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array
Convert Sorted Array to Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree
Kth Smallest Element in a BSThttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst
Binary Search Tree Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0173_binary_search_tree_iterator
Rotting Orangeshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0994_rotting_oranges
Pacific Atlantic Water Flowhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow
Course Schedule IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0210_course_schedule_ii
Bus Routeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0815_bus_routes
House Robberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0198_house_robber
Coin Changehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0322_coin_change
Partition Equal Subset Sumhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0416_partition_equal_subset_sum
Maximum Product Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0152_maximum_product_subarray
Longest Substring Without Repeating Charactershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters
3Sum Closesthttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0016_3sum_closest
Minimum Window Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0076_minimum_window_substring
Same Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0100_same_tree
Symmetric Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0101_symmetric_tree
Binary Tree Right Side Viewhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0199_binary_tree_right_side_view
Implement Queue using Stackshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0232_implement_queue_using_stacks
Min Stackhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0155_min_stack
Implement Trie (Prefix Tree)https://leetcode-in-java.github.io/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree
Insert Intervalhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0057_insert_interval
Merge Intervalshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0056_merge_intervals
Asteroid Collisionhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0735_asteroid_collision
Basic Calculator IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0227_basic_calculator_ii
Number of Provinceshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0547_number_of_provinces
Most Stones Removed with Same Row or Columnhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column
Combination Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0039_combination_sum
Permutationshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0046_permutations
Fizz Buzzhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0412_fizz_buzz
Single Numberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0136_single_number
Reverse Integerhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0007_reverse_integer
Palindrome Numberhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0009_palindrome_number
Factorial Trailing Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0172_factorial_trailing_zeroes
Pow(x, n)https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0050_powx_n
Reverse Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0344_reverse_string
Longest Common Prefixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0014_longest_common_prefix
Repeated DNA Sequenceshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0187_repeated_dna_sequences
Longest Substring Without Repeating Charactershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters
Valid Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0020_valid_parentheses
Longest Palindromic Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0005_longest_palindromic_substring
Decode Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0394_decode_string
Valid Anagramhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0242_valid_anagram
Group Anagramshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0049_group_anagrams
Reverse Words in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0151_reverse_words_in_a_string
Integer to English Wordshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0273_integer_to_english_words
Binary Searchhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0704_binary_search
Search in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array
Find Minimum in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array
Best Time to Buy and Sell Stockhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock
Move Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0283_move_zeroes
Two Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0001_two_sum
Contains Duplicatehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0217_contains_duplicate
Length of Last Wordhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0058_length_of_last_word
Can Place Flowershttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0605_can_place_flowers
Best Time to Buy and Sell Stock IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii
Remove Duplicates from Sorted Array IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii
Rotate Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0189_rotate_array
Jump Gamehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0055_jump_game
Sort Colorshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0075_sort_colors
Plus Onehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0066_plus_one
Product of Array Except Selfhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0238_product_of_array_except_self
Sequential Digitshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1291_sequential_digits
Find All Numbers Disappeared in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array
Find All Duplicates in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array
First Missing Positivehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0041_first_missing_positive
Degree of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0697_degree_of_an_array
K-diff Pairs in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array
Subarray Product Less Than Khttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0713_subarray_product_less_than_k
Minimum Domino Rotations For Equal Rowhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1007_minimum_domino_rotations_for_equal_row
Jump Game IIIhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1306_jump_game_iii
132 Patternhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0456_132_pattern
Sliding Window Maximumhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0239_sliding_window_maximum
Is Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0392_is_subsequence
Valid Palindromehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0125_valid_palindrome
Squares of a Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0977_squares_of_a_sorted_array
Remove Duplicates from Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array
Trapping Rain Waterhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0042_trapping_rain_water
3Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0015_3sum
Maximum Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0053_maximum_subarray
Majority Elementhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0169_majority_element
Sort an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0912_sort_an_array
Range Sum Query 2D - Immutablehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable
Search a 2D Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix
Spiral Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0054_spiral_matrix
Rotate Imagehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0048_rotate_image
Matrix Diagonal Sumhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1572_matrix_diagonal_sum
Set Matrix Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0073_set_matrix_zeroes
Merge Intervalshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0056_merge_intervals
Flatten Binary Tree to Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list
Add Two Numbers IIhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0445_add_two_numbers_ii
Odd Even Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0328_odd_even_linked_list
Rotate Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0061_rotate_list
Swap Nodes in Pairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs
Middle of the Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0876_middle_of_the_linked_list
Linked List Cycle IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0142_linked_list_cycle_ii
Linked List Cyclehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0141_linked_list_cycle
Reverse Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0206_reverse_linked_list
Merge Two Sorted Listshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0021_merge_two_sorted_lists
Intersection of Two Linked Listshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists
Palindrome Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0234_palindrome_linked_list
Copy List with Random Pointerhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer
Reverse Nodes in k-Grouphttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group
LRU Cachehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0146_lru_cache
Design Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0707_design_linked_list
Binary Tree Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0144_binary_tree_preorder_traversal
Binary Tree Inorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal
Binary Tree Postorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0145_binary_tree_postorder_traversal
Binary Tree Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal
Binary Tree Zigzag Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal
Convert Sorted Array to Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree
Construct Binary Search Tree from Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal
Diameter of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0543_diameter_of_binary_tree
Range Sum of BSThttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0938_range_sum_of_bst
Same Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0100_same_tree
Invert Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0226_invert_binary_tree
Minimum Depth of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree
Maximum Depth of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree
Balanced Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0110_balanced_binary_tree
Insert into a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree
Serialize and Deserialize Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree
Binary Tree Maximum Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum
Validate Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0098_validate_binary_search_tree
House Robber IIIhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0337_house_robber_iii
Lowest Common Ancestor of a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree
Binary Tree Camerashttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0968_binary_tree_cameras
Implement Trie (Prefix Tree)https://leetcode-in-java.github.io/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree
Prefix and Suffix Searchhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0745_prefix_and_suffix_search
Number of Islandshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0200_number_of_islands
Clone Graphhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0133_clone_graph
Pacific Atlantic Water Flowhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow
Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0120_triangle
Pascal’s Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0118_pascals_triangle
Pascal’s Triangle IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0119_pascals_triangle_ii
Word Breakhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0139_word_break
Maximum Product Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0152_maximum_product_subarray
House Robberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0198_house_robber
House Robber IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0213_house_robber_ii
Fibonacci Numberhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0509_fibonacci_number
Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0070_climbing_stairs
Minimum Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0064_minimum_path_sum
Longest Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0300_longest_increasing_subsequence
Longest Common Subsequencehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1143_longest_common_subsequence
Edit Distancehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0072_edit_distance
Wildcard Matchinghttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0044_wildcard_matching
Regular Expression Matchinghttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0010_regular_expression_matching
Generate Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0022_generate_parentheses
Combination Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0039_combination_sum
Combination Sum IIIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0216_combination_sum_iii
Subsetshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0078_subsets
Letter Combinations of a Phone Numberhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number
Permutationshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0046_permutations
Number of 1 Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0191_number_of_1_bits
Find the Differencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0389_find_the_difference
Reverse Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0190_reverse_bits
Hamming Distancehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0461_hamming_distance
Complement of Base 10 Integerhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1009_complement_of_base_10_integer
Counting Bitshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0338_counting_bits
Sum of Two Integershttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0371_sum_of_two_integers
Divide Two Integershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0029_divide_two_integers
Min Stackhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0155_min_stack
Merge Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0088_merge_sorted_array
Remove Elementhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0027_remove_element
Remove Duplicates from Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array
Remove Duplicates from Sorted Array IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii
Majority Elementhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0169_majority_element
Rotate Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0189_rotate_array
Best Time to Buy and Sell Stockhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock
Best Time to Buy and Sell Stock IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii
Jump Gamehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0055_jump_game
Jump Game IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0045_jump_game_ii
H-Indexhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0274_h_index
Insert Delete GetRandom O(1)https://leetcode-in-java.github.io/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1
Product of Array Except Selfhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0238_product_of_array_except_self
Gas Stationhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0134_gas_station
Candyhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0135_candy
Trapping Rain Waterhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0042_trapping_rain_water
Roman to Integerhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0013_roman_to_integer
Integer to Romanhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0012_integer_to_roman
Length of Last Wordhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0058_length_of_last_word
Longest Common Prefixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0014_longest_common_prefix
Reverse Words in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0151_reverse_words_in_a_string
Zigzag Conversionhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0006_zigzag_conversion
Find the Index of the First Occurrence in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string
Text Justificationhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0068_text_justification
Valid Palindromehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0125_valid_palindrome
Is Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0392_is_subsequence
Two Sum II - Input Array Is Sortedhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted
Container With Most Waterhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0011_container_with_most_water
3Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0015_3sum
Minimum Size Subarray Sumhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum
Longest Substring Without Repeating Charactershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters
Substring with Concatenation of All Wordshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words
Minimum Window Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0076_minimum_window_substring
Valid Sudokuhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0036_valid_sudoku
Spiral Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0054_spiral_matrix
Rotate Imagehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0048_rotate_image
Set Matrix Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0073_set_matrix_zeroes
Game of Lifehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0289_game_of_life
Ransom Notehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0383_ransom_note
Isomorphic Stringshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0205_isomorphic_strings
Word Patternhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0290_word_pattern
Valid Anagramhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0242_valid_anagram
Group Anagramshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0049_group_anagrams
Two Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0001_two_sum
Happy Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0202_happy_number
Contains Duplicate IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0219_contains_duplicate_ii
Longest Consecutive Sequencehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0128_longest_consecutive_sequence
Summary Rangeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0228_summary_ranges
Merge Intervalshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0056_merge_intervals
Insert Intervalhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0057_insert_interval
Minimum Number of Arrows to Burst Balloonshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons
Valid Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0020_valid_parentheses
Simplify Pathhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0071_simplify_path
Min Stackhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0155_min_stack
Evaluate Reverse Polish Notationhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0150_evaluate_reverse_polish_notation
Basic Calculatorhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0224_basic_calculator
Linked List Cyclehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0141_linked_list_cycle
Add Two Numbershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0002_add_two_numbers
Merge Two Sorted Listshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0021_merge_two_sorted_lists
Copy List with Random Pointerhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer
Reverse Linked List IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0092_reverse_linked_list_ii
Reverse Nodes in k-Grouphttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group
Remove Nth Node From End of Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list
Remove Duplicates from Sorted List IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii
Rotate Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0061_rotate_list
Partition Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0086_partition_list
LRU Cachehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0146_lru_cache
Maximum Depth of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree
Same Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0100_same_tree
Invert Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0226_invert_binary_tree
Symmetric Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0101_symmetric_tree
Construct Binary Tree from Preorder and Inorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal
Construct Binary Tree from Inorder and Postorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal
Populating Next Right Pointers in Each Node IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii
Flatten Binary Tree to Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list
Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0112_path_sum
Sum Root to Leaf Numbershttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0129_sum_root_to_leaf_numbers
Binary Tree Maximum Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum
Binary Search Tree Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0173_binary_search_tree_iterator
Count Complete Tree Nodeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0222_count_complete_tree_nodes
Lowest Common Ancestor of a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree
Binary Tree Right Side Viewhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0199_binary_tree_right_side_view
Average of Levels in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0637_average_of_levels_in_binary_tree
Binary Tree Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal
Binary Tree Zigzag Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal
Minimum Absolute Difference in BSThttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0530_minimum_absolute_difference_in_bst
Kth Smallest Element in a BSThttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst
Validate Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0098_validate_binary_search_tree
Number of Islandshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0200_number_of_islands
Surrounded Regionshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0130_surrounded_regions
Clone Graphhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0133_clone_graph
Evaluate Divisionhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0399_evaluate_division
Course Schedulehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0207_course_schedule
Course Schedule IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0210_course_schedule_ii
Snakes and Laddershttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0909_snakes_and_ladders
Minimum Genetic Mutationhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0433_minimum_genetic_mutation
Word Ladderhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0127_word_ladder
Implement Trie (Prefix Tree)https://leetcode-in-java.github.io/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree
Design Add and Search Words Data Structurehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0211_design_add_and_search_words_data_structure
Word Search IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0212_word_search_ii
Letter Combinations of a Phone Numberhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number
Combinationshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0077_combinations
Permutationshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0046_permutations
Combination Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0039_combination_sum
N-Queens IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0052_n_queens_ii
Generate Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0022_generate_parentheses
Word Searchhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0079_word_search
Convert Sorted Array to Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree
Sort Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0148_sort_list
Construct Quad Treehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0427_construct_quad_tree
Merge k Sorted Listshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0023_merge_k_sorted_lists
Maximum Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0053_maximum_subarray
Maximum Sum Circular Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0918_maximum_sum_circular_subarray
Search Insert Positionhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0035_search_insert_position
Search a 2D Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix
Find Peak Elementhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0162_find_peak_element
Search in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array
Find First and Last Position of Element in Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array
Find Minimum in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array
Median of Two Sorted Arrayshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays
Kth Largest Element in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array
IPOhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0502_ipo
Find K Pairs with Smallest Sumshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0373_find_k_pairs_with_smallest_sums
Find Median from Data Streamhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0295_find_median_from_data_stream
Add Binaryhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0067_add_binary
Reverse Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0190_reverse_bits
Number of 1 Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0191_number_of_1_bits
Single Numberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0136_single_number
Single Number IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0137_single_number_ii
Bitwise AND of Numbers Rangehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range
Palindrome Numberhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0009_palindrome_number
Plus Onehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0066_plus_one
Factorial Trailing Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0172_factorial_trailing_zeroes
Sqrt(x)https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0069_sqrtx
Pow(x, n)https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0050_powx_n
Max Points on a Linehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0149_max_points_on_a_line
Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0070_climbing_stairs
House Robberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0198_house_robber
Word Breakhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0139_word_break
Coin Changehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0322_coin_change
Longest Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0300_longest_increasing_subsequence
Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0120_triangle
Minimum Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0064_minimum_path_sum
Unique Paths IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0063_unique_paths_ii
Longest Palindromic Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0005_longest_palindromic_substring
Interleaving Stringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0097_interleaving_string
Edit Distancehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0072_edit_distance
Best Time to Buy and Sell Stock IIIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii
Best Time to Buy and Sell Stock IVhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv
Maximal Squarehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0221_maximal_square
Contains Duplicatehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0217_contains_duplicate
Maximum Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0053_maximum_subarray
Two Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0001_two_sum
Merge Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0088_merge_sorted_array
Intersection of Two Arrays IIhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii
Best Time to Buy and Sell Stockhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock
Reshape the Matrixhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0566_reshape_the_matrix
Pascal’s Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0118_pascals_triangle
Valid Sudokuhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0036_valid_sudoku
Search a 2D Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix
First Unique Character in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0387_first_unique_character_in_a_string
Ransom Notehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0383_ransom_note
Valid Anagramhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0242_valid_anagram
Linked List Cyclehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0141_linked_list_cycle
Merge Two Sorted Listshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0021_merge_two_sorted_lists
Remove Linked List Elementshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0203_remove_linked_list_elements
Reverse Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0206_reverse_linked_list
Remove Duplicates from Sorted Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list
Valid Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0020_valid_parentheses
Implement Queue using Stackshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0232_implement_queue_using_stacks
Binary Tree Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0144_binary_tree_preorder_traversal
Binary Tree Inorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal
Binary Tree Postorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0145_binary_tree_postorder_traversal
Binary Tree Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal
Maximum Depth of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree
Symmetric Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0101_symmetric_tree
Invert Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0226_invert_binary_tree
Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0112_path_sum
Search in a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree
Insert into a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree
Validate Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0098_validate_binary_search_tree
Two Sum IV - Input is a BSThttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0653_two_sum_iv_input_is_a_bst
Lowest Common Ancestor of a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree
Single Numberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0136_single_number
Majority Elementhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0169_majority_element
3Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0015_3sum
Sort Colorshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0075_sort_colors
Merge Intervalshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0056_merge_intervals
Design HashMaphttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0706_design_hashmap
Pascal’s Triangle IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0119_pascals_triangle_ii
Rotate Imagehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0048_rotate_image
Spiral Matrix IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0059_spiral_matrix_ii
Search a 2D Matrix IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii
Non-overlapping Intervalshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0435_non_overlapping_intervals
Increasing Triplet Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence
Product of Array Except Selfhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0238_product_of_array_except_self
Subarray Sum Equals Khttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0560_subarray_sum_equals_k
Add Stringshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0415_add_strings
Longest Palindromehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0409_longest_palindrome
Word Patternhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0290_word_pattern
Partition Labelshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0763_partition_labels
Group Anagramshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0049_group_anagrams
Multiply Stringshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0043_multiply_strings
Repeated DNA Sequenceshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0187_repeated_dna_sequences
Longest Palindromic Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0005_longest_palindromic_substring
Add Two Numbershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0002_add_two_numbers
Linked List Cycle IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0142_linked_list_cycle_ii
Intersection of Two Linked Listshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists
Remove Duplicates from Sorted List IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii
Swap Nodes in Pairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs
Design Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0707_design_linked_list
Reverse Nodes in k-Grouphttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group
Reorder Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0143_reorder_list
Min Stackhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0155_min_stack
Minimum Remove to Make Valid Parentheseshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1249_minimum_remove_to_make_valid_parentheses
Find the Winner of the Circular Gamehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1823_find_the_winner_of_the_circular_game
Convert Sorted Array to Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree
Construct Binary Tree from Preorder and Inorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal
Binary Tree Zigzag Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal
Binary Tree Right Side Viewhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0199_binary_tree_right_side_view
Path Sum IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0113_path_sum_ii
Delete Node in a BSThttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0450_delete_node_in_a_bst
Kth Smallest Element in a BSThttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst
Binary Search Tree Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0173_binary_search_tree_iterator
Lowest Common Ancestor of a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree
Serialize and Deserialize Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree
Find the Town Judgehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0997_find_the_town_judge
Minimum Number of Vertices to Reach All Nodeshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes
Keys and Roomshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0841_keys_and_rooms
Kth Largest Element in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array
Top K Frequent Elementshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0347_top_k_frequent_elements
Sort Characters By Frequencyhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0451_sort_characters_by_frequency
K Closest Points to Originhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0973_k_closest_points_to_origin
Binary Searchhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0704_binary_search
First Bad Versionhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0278_first_bad_version
Search Insert Positionhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0035_search_insert_position
Squares of a Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0977_squares_of_a_sorted_array
Rotate Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0189_rotate_array
Move Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0283_move_zeroes
Two Sum II - Input Array Is Sortedhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted
Reverse Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0344_reverse_string
Reverse Words in a String IIIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii
Middle of the Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0876_middle_of_the_linked_list
Remove Nth Node From End of Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list
Longest Substring Without Repeating Charactershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters
Permutation in Stringhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0567_permutation_in_string
Flood Fillhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0733_flood_fill
Max Area of Islandhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0695_max_area_of_island
Merge Two Binary Treeshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0617_merge_two_binary_trees
Populating Next Right Pointers in Each Nodehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0116_populating_next_right_pointers_in_each_node
01 Matrixhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0542_01_matrix
Rotting Orangeshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0994_rotting_oranges
Merge Two Sorted Listshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0021_merge_two_sorted_lists
Reverse Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0206_reverse_linked_list
Combinationshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0077_combinations
Permutationshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0046_permutations
Letter Case Permutationhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0784_letter_case_permutation
Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0070_climbing_stairs
House Robberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0198_house_robber
Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0120_triangle
Power of Twohttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0231_power_of_two
Number of 1 Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0191_number_of_1_bits
Reverse Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0190_reverse_bits
Single Numberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0136_single_number
Find First and Last Position of Element in Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array
Search in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array
Search a 2D Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix
Find Minimum in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array
Find Peak Elementhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0162_find_peak_element
Remove Duplicates from Sorted List IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii
3Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0015_3sum
Backspace String Comparehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0844_backspace_string_compare
Interval List Intersectionshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0986_interval_list_intersections
Container With Most Waterhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0011_container_with_most_water
Find All Anagrams in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string
Subarray Product Less Than Khttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0713_subarray_product_less_than_k
Minimum Size Subarray Sumhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum
Number of Islandshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0200_number_of_islands
Number of Provinceshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0547_number_of_provinces
Populating Next Right Pointers in Each Node IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii
Subtree of Another Treehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0572_subtree_of_another_tree
Shortest Path in Binary Matrixhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix
Surrounded Regionshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0130_surrounded_regions
All Paths From Source to Targethttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0797_all_paths_from_source_to_target
Subsetshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0078_subsets
Subsets IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0090_subsets_ii
Permutations IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0047_permutations_ii
Combination Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0039_combination_sum
Combination Sum IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0040_combination_sum_ii
Letter Combinations of a Phone Numberhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number
Generate Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0022_generate_parentheses
Word Searchhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0079_word_search
House Robber IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0213_house_robber_ii
Jump Gamehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0055_jump_game
Jump Game IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0045_jump_game_ii
Unique Pathshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0062_unique_paths
Longest Palindromic Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0005_longest_palindromic_substring
Arithmetic Sliceshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0413_arithmetic_slices
Decode Wayshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0091_decode_ways
Word Breakhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0139_word_break
Longest Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0300_longest_increasing_subsequence
Number of Longest Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0673_number_of_longest_increasing_subsequence
Longest Common Subsequencehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1143_longest_common_subsequence
Delete Operation for Two Stringshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0583_delete_operation_for_two_strings
Edit Distancehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0072_edit_distance
Coin Changehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0322_coin_change
Integer Breakhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0343_integer_break
Bitwise AND of Numbers Rangehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range
Shuffle an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0384_shuffle_an_array
Happy Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0202_happy_number
Max Points on a Linehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0149_max_points_on_a_line
Binary Searchhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0704_binary_search
Guess Number Higher or Lowerhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower
Search Insert Positionhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0035_search_insert_position
Peak Index in a Mountain Arrayhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array
Valid Perfect Squarehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0367_valid_perfect_square
Find the Distance Value Between Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1385_find_the_distance_value_between_two_arrays
Sqrt(x)https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0069_sqrtx
Find Smallest Letter Greater Than Targethttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0744_find_smallest_letter_greater_than_target
First Bad Versionhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0278_first_bad_version
Find First and Last Position of Element in Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array
Arranging Coinshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0441_arranging_coins
Kth Missing Positive Numberhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1539_kth_missing_positive_number
Two Sum II - Input Array Is Sortedhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted
Special Array With X Elements Greater Than or Equal Xhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1608_special_array_with_x_elements_greater_than_or_equal_x
Count Negative Numbers in a Sorted Matrixhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix
Search a 2D Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix
The K Weakest Rows in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix
Check If N and Its Double Existhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1346_check_if_n_and_its_double_exist
Intersection of Two Arrays IIhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii
Sum of Square Numbershttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0633_sum_of_square_numbers
Maximum Distance Between a Pair of Valueshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1855_maximum_distance_between_a_pair_of_values
Search in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array
Find Minimum in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array
Minimum Size Subarray Sumhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum
Valid Triangle Numberhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0611_valid_triangle_number
Find K Closest Elementshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0658_find_k_closest_elements
Find the Student that Will Replace the Chalkhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1894_find_the_student_that_will_replace_the_chalk
Longest Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0300_longest_increasing_subsequence
Minimum Limit of Balls in a Baghttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag
Koko Eating Bananashttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0875_koko_eating_bananas
Magnetic Force Between Two Ballshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1552_magnetic_force_between_two_balls
Find the Duplicate Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0287_find_the_duplicate_number
Find the Smallest Divisor Given a Thresholdhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1283_find_the_smallest_divisor_given_a_threshold
Maximum Number of Removable Charactershttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1898_maximum_number_of_removable_characters
Minimum Speed to Arrive on Timehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1870_minimum_speed_to_arrive_on_time
Minimum Number of Days to Make m Bouquetshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1482_minimum_number_of_days_to_make_m_bouquets
Minimum Absolute Sum Differencehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1818_minimum_absolute_sum_difference
Search a 2D Matrix IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii
H-Index IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0275_h_index_ii
Frequency of the Most Frequent Elementhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1838_frequency_of_the_most_frequent_element
Single Element in a Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0540_single_element_in_a_sorted_array
Count Complete Tree Nodeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0222_count_complete_tree_nodes
Ways to Split Array Into Three Subarrayshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1712_ways_to_split_array_into_three_subarrays
Most Profit Assigning Workhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0826_most_profit_assigning_work
Find Right Intervalhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0436_find_right_interval
Search in Rotated Sorted Array IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii
Find Peak Elementhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0162_find_peak_element
Find Minimum in Rotated Sorted Array IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii
Random Pick with Weighthttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0528_random_pick_with_weight
Range Sum of Sorted Subarray Sumshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1508_range_sum_of_sorted_subarray_sums
Shortest Subarray to be Removed to Make Array Sortedhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1574_shortest_subarray_to_be_removed_to_make_array_sorted
Maximum Side Length of a Square with Sum Less than or Equal to Thresholdhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold
Number of Subsequences That Satisfy the Given Sum Conditionhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1498_number_of_subsequences_that_satisfy_the_given_sum_condition
Time Based Key-Value Storehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0981_time_based_key_value_store
Sum of Mutated Array Closest to Targethttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1300_sum_of_mutated_array_closest_to_target
Maximum Value at a Given Index in a Bounded Arrayhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1802_maximum_value_at_a_given_index_in_a_bounded_array
Find a Peak Element IIhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1901_find_a_peak_element_ii
Snapshot Arrayhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1146_snapshot_array
Avoid Flood in The Cityhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1488_avoid_flood_in_the_city
Find Latest Group of Size Mhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1562_find_latest_group_of_size_m
Sell Diminishing-Valued Colored Ballshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1648_sell_diminishing_valued_colored_balls
Ugly Number IIIhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1201_ugly_number_iii
Online Electionhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0911_online_election
Fibonacci Numberhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0509_fibonacci_number
N-th Tribonacci Numberhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1137_n_th_tribonacci_number
Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0070_climbing_stairs
Min Cost Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs
House Robberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0198_house_robber
House Robber IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0213_house_robber_ii
Delete and Earnhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0740_delete_and_earn
Jump Gamehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0055_jump_game
Jump Game IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0045_jump_game_ii
Maximum Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0053_maximum_subarray
Maximum Sum Circular Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0918_maximum_sum_circular_subarray
Maximum Product Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0152_maximum_product_subarray
Maximum Length of Subarray With Positive Producthttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1567_maximum_length_of_subarray_with_positive_product
Best Sightseeing Pairhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1014_best_sightseeing_pair
Best Time to Buy and Sell Stockhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock
Best Time to Buy and Sell Stock IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii
Best Time to Buy and Sell Stock with Cooldownhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0309_best_time_to_buy_and_sell_stock_with_cooldown
Best Time to Buy and Sell Stock with Transaction Feehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee
Word Breakhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0139_word_break
Trapping Rain Waterhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0042_trapping_rain_water
Arithmetic Sliceshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0413_arithmetic_slices
Decode Wayshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0091_decode_ways
Ugly Number IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0264_ugly_number_ii
Unique Binary Search Treeshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0096_unique_binary_search_trees
Pascal’s Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0118_pascals_triangle
Pascal’s Triangle IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0119_pascals_triangle_ii
Minimum Falling Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0931_minimum_falling_path_sum
Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0120_triangle
Matrix Block Sumhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1314_matrix_block_sum
Range Sum Query 2D - Immutablehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable
Unique Pathshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0062_unique_paths
Unique Paths IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0063_unique_paths_ii
Minimum Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0064_minimum_path_sum
Maximal Squarehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0221_maximal_square
Longest Palindromic Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0005_longest_palindromic_substring
Longest Palindromic Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0516_longest_palindromic_subsequence
Longest Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0300_longest_increasing_subsequence
Wiggle Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0376_wiggle_subsequence
Is Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0392_is_subsequence
Longest Common Subsequencehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1143_longest_common_subsequence
Edit Distancehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0072_edit_distance
Coin Changehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0322_coin_change
Coin Change 2https://leetcode-in-java.github.io/src/main/java/g0501_0600/s0518_coin_change_2
Combination Sum IVhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0377_combination_sum_iv
Integer Breakhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0343_integer_break
Perfect Squareshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0279_perfect_squares
Count Odd Numbers in an Interval Rangehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1523_count_odd_numbers_in_an_interval_range
Average Salary Excluding the Minimum and Maximum Salaryhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary
Number of 1 Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0191_number_of_1_bits
Subtract the Product and Sum of Digits of an Integerhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1281_subtract_the_product_and_sum_of_digits_of_an_integer
Largest Perimeter Trianglehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0976_largest_perimeter_triangle
Find Nearest Point That Has the Same X or Y Coordinatehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate
Sign of the Product of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1822_sign_of_the_product_of_an_array
Can Make Arithmetic Progression From Sequencehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence
Happy Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0202_happy_number
Check if One String Swap Can Make Strings Equalhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal
N-ary Tree Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal
Next Greater Element Ihttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0496_next_greater_element_i
Check If It Is a Straight Linehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1232_check_if_it_is_a_straight_line
Sum of All Odd Length Subarrayshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1588_sum_of_all_odd_length_subarrays
Move Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0283_move_zeroes
Richest Customer Wealthhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1672_richest_customer_wealth
Matrix Diagonal Sumhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1572_matrix_diagonal_sum
Reshape the Matrixhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0566_reshape_the_matrix
Merge Strings Alternatelyhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1768_merge_strings_alternately
Goal Parser Interpretationhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1678_goal_parser_interpretation
Find the Differencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0389_find_the_difference
To Lower Casehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0709_to_lower_case
Decrypt String from Alphabet to Integer Mappinghttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1309_decrypt_string_from_alphabet_to_integer_mapping
Verifying an Alien Dictionaryhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0953_verifying_an_alien_dictionary
Convert Binary Number in a Linked List to Integerhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1290_convert_binary_number_in_a_linked_list_to_integer
Middle of the Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0876_middle_of_the_linked_list
Maximum Depth of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree
Sum of Left Leaveshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0404_sum_of_left_leaves
Sort Integers by The Number of 1 Bitshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits
Implement Queue using Stackshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0232_implement_queue_using_stacks
Valid Anagramhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0242_valid_anagram
Contains Duplicatehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0217_contains_duplicate
Design Parking Systemhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1603_design_parking_system
Range Sum Query - Immutablehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0303_range_sum_query_immutable
Monotonic Arrayhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0896_monotonic_array
Find the Index of the First Occurrence in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string
Balanced Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0110_balanced_binary_tree
Repeated Substring Patternhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0459_repeated_substring_pattern
Evaluate Reverse Polish Notationhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0150_evaluate_reverse_polish_notation
Plus Onehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0066_plus_one
Linked List in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1367_linked_list_in_binary_tree
Multiply Stringshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0043_multiply_strings
Add Binaryhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0067_add_binary
Add to Array-Form of Integerhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0989_add_to_array_form_of_integer
Daily Temperatureshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0739_daily_temperatures
Length of Last Wordhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0058_length_of_last_word
Rotate Imagehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0048_rotate_image
Determine Whether Matrix Can Be Obtained By Rotationhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1886_determine_whether_matrix_can_be_obtained_by_rotation
Spiral Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0054_spiral_matrix
K Closest Points to Originhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0973_k_closest_points_to_origin
Arithmetic Subarrayshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1630_arithmetic_subarrays
N-ary Tree Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0429_n_ary_tree_level_order_traversal
Next Greater Element IIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0503_next_greater_element_ii
Next Greater Element IIIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0556_next_greater_element_iii
Time Needed to Inform All Employeeshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1376_time_needed_to_inform_all_employees
Group Anagramshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0049_group_anagrams
Find All Anagrams in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string
Subarray Product Less Than Khttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0713_subarray_product_less_than_k
Range Sum Query 2D - Immutablehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable
Smallest Range IIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0910_smallest_range_ii
Reorder Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0143_reorder_list
Copy List with Random Pointerhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer
Add Two Numbershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0002_add_two_numbers
Add Two Numbers IIhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0445_add_two_numbers_ii
Rotate Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0061_rotate_list
Binary Search Tree Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0173_binary_search_tree_iterator
Seat Reservation Managerhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1845_seat_reservation_manager
Lemonade Changehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0860_lemonade_change
Min Stackhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0155_min_stack
Flatten Nested List Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator
Design Authentication Managerhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1797_design_authentication_manager
Design Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0707_design_linked_list
Insert Delete GetRandom O(1)https://leetcode-in-java.github.io/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1
Design Circular Queuehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0622_design_circular_queue
My Calendar Ihttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0729_my_calendar_i
Flood Fillhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0733_flood_fill
Number of Islandshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0200_number_of_islands
Max Area of Islandhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0695_max_area_of_island
Number of Closed Islandshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1254_number_of_closed_islands
Number of Enclaveshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1020_number_of_enclaves
Count Sub Islandshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1905_count_sub_islands
As Far from Land as Possiblehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1162_as_far_from_land_as_possible
Pacific Atlantic Water Flowhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow
Shortest Path in Binary Matrixhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix
01 Matrixhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0542_01_matrix
Shortest Bridgehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0934_shortest_bridge
Nearest Exit from Entrance in Mazehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze
All Paths From Source to Targethttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0797_all_paths_from_source_to_target
Keys and Roomshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0841_keys_and_rooms
Number of Provinceshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0547_number_of_provinces
Number of Operations to Make Network Connectedhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1319_number_of_operations_to_make_network_connected
Time Needed to Inform All Employeeshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1376_time_needed_to_inform_all_employees
Find Eventual Safe Stateshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0802_find_eventual_safe_states
Shortest Path with Alternating Colorshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1129_shortest_path_with_alternating_colors
Reorder Routes to Make All Paths Lead to the City Zerohttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero
Shortest Path Visiting All Nodeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0847_shortest_path_visiting_all_nodes
Jump Game IIIhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1306_jump_game_iii
Minimum Jumps to Reach Homehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1654_minimum_jumps_to_reach_home
Water and Jug Problemhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0365_water_and_jug_problem
Minimum Genetic Mutationhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0433_minimum_genetic_mutation
Open the Lockhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0752_open_the_lock
Word Ladderhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0127_word_ladder
Find the Town Judgehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0997_find_the_town_judge
Minimum Number of Vertices to Reach All Nodeshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes
Maximal Network Rankhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1615_maximal_network_rank
Possible Bipartitionhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0886_possible_bipartition
Is Graph Bipartite?https://leetcode-in-java.github.io/src/main/java/g0701_0800/s0785_is_graph_bipartite
Big Countrieshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0595_big_countries
Recyclable and Low Fat Productshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1757_recyclable_and_low_fat_products
Find Customer Refereehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0584_find_customer_referee
Customers Who Never Orderhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0183_customers_who_never_order
Calculate Special Bonushttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1873_calculate_special_bonus
Swap Salaryhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0627_swap_salary
Delete Duplicate Emailshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0196_delete_duplicate_emails
Fix Names in a Tablehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1667_fix_names_in_a_table
Group Sold Products By The Datehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1484_group_sold_products_by_the_date
Patients With a Conditionhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1527_patients_with_a_condition
Employees With Missing Informationhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1965_employees_with_missing_information
Rearrange Products Tablehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1795_rearrange_products_table
Tree Nodehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0608_tree_node
Second Highest Salaryhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0176_second_highest_salary
Combine Two Tableshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0175_combine_two_tables
Customer Who Visited but Did Not Make Any Transactionshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1581_customer_who_visited_but_did_not_make_any_transactions
Article Views Ihttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1148_article_views_i
Rising Temperaturehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0197_rising_temperature
Sales Personhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0607_sales_person
User Activity for the Past 30 Days Ihttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1141_user_activity_for_the_past_30_days_i
Daily Leads and Partnershttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1693_daily_leads_and_partners
Find Followers Counthttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1729_find_followers_count
Customer Placing the Largest Number of Ordershttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders
Game Play Analysis Ihttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0511_game_play_analysis_i
The Latest Login in 2020https://leetcode-in-java.github.io/src/main/java/g1801_1900/s1890_the_latest_login_in_2020
Find Total Time Spent by Each Employeehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1741_find_total_time_spent_by_each_employee
Capital Gain/Losshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1393_capital_gainloss
Top Travellershttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1407_top_travellers
Market Analysis Ihttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1158_market_analysis_i
Duplicate Emailshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0182_duplicate_emails
Actors and Directors Who Cooperated At Least Three Timeshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times
Bank Account Summary IIhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1587_bank_account_summary_ii
Sales Analysis IIIhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1084_sales_analysis_iii
Lexicographically Smallest Palindromic Permutation Greater Than Targethttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3734_lexicographically_smallest_palindromic_permutation_greater_than_target
Minimum Time to Complete All Deliverieshttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3733_minimum_time_to_complete_all_deliveries
Maximum Product of Three Elements After One Replacementhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3732_maximum_product_of_three_elements_after_one_replacement
Find Missing Elementshttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3731_find_missing_elements
Count Distinct Subarrays Divisible by K in Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3729_count_distinct_subarrays_divisible_by_k_in_sorted_array
Stable Subarrays With Equal Boundary and Interior Sumhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3728_stable_subarrays_with_equal_boundary_and_interior_sum
Maximum Alternating Sum of Squareshttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3727_maximum_alternating_sum_of_squares
Remove Zeros in Decimal Representationhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3726_remove_zeros_in_decimal_representation
Count Ways to Choose Coprime Integers from Rowshttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3725_count_ways_to_choose_coprime_integers_from_rows
Minimum Operations to Transform Arrayhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3724_minimum_operations_to_transform_array
Maximize Sum of Squares of Digitshttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3723_maximize_sum_of_squares_of_digits
Lexicographically Smallest String After Reversehttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3722_lexicographically_smallest_string_after_reverse
Longest Balanced Subarray IIhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3721_longest_balanced_subarray_ii
Lexicographically Smallest Permutation Greater Than Targethttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3720_lexicographically_smallest_permutation_greater_than_target
Longest Balanced Subarray Ihttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3719_longest_balanced_subarray_i
Smallest Missing Multiple of Khttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3718_smallest_missing_multiple_of_k
Find Churn Risk Customershttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3716_find_churn_risk_customers
Sum of Perfect Square Ancestorshttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3715_sum_of_perfect_square_ancestors
Longest Balanced Substring IIhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3714_longest_balanced_substring_ii
Longest Balanced Substring Ihttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3713_longest_balanced_substring_i
Sum of Elements With Frequency Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3712_sum_of_elements_with_frequency_divisible_by_k
Maximum Partition Factorhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3710_maximum_partition_factor
Design Exam Scores Trackerhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3709_design_exam_scores_tracker
Longest Fibonacci Subarrayhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3708_longest_fibonacci_subarray
Equal Score Substringshttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3707_equal_score_substrings
Find Golden Hour Customershttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3705_find_golden_hour_customers
Count No-Zero Pairs That Sum to Nhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3704_count_no_zero_pairs_that_sum_to_n
Remove K-Balanced Substringshttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3703_remove_k_balanced_substrings
Longest Subsequence With Non-Zero Bitwise XORhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3702_longest_subsequence_with_non_zero_bitwise_xor
Compute Alternating Sumhttps://leetcode-in-java.github.io/src/main/java/g3701_3800/s3701_compute_alternating_sum
Number of ZigZag Arrays IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3700_number_of_zigzag_arrays_ii
Number of ZigZag Arrays Ihttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3699_number_of_zigzag_arrays_i
Split Array With Minimum Differencehttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3698_split_array_with_minimum_difference
Compute Decimal Representationhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3697_compute_decimal_representation
Maximize Alternating Sum Using Swapshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3695_maximize_alternating_sum_using_swaps
Distinct Points Reachable After Substring Removalhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3694_distinct_points_reachable_after_substring_removal
Climbing Stairs IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3693_climbing_stairs_ii
Majority Frequency Charactershttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3692_majority_frequency_characters
Maximum Total Subarray Value IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3691_maximum_total_subarray_value_ii
Split and Merge Array Transformationhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3690_split_and_merge_array_transformation
Maximum Total Subarray Value Ihttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3689_maximum_total_subarray_value_i
Bitwise OR of Even Numbers in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3688_bitwise_or_of_even_numbers_in_an_array
Number of Stable Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3686_number_of_stable_subsequences
Subsequence Sum After Capping Elementshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3685_subsequence_sum_after_capping_elements
Maximize Sum of At Most K Distinct Elementshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3684_maximize_sum_of_at_most_k_distinct_elements
Earliest Time to Finish One Taskhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3683_earliest_time_to_finish_one_task
Maximum XOR of Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3681_maximum_xor_of_subsequences
Generate Schedulehttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3680_generate_schedule
Minimum Discards to Balance Inventoryhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3679_minimum_discards_to_balance_inventory
Smallest Absent Positive Greater Than Averagehttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3678_smallest_absent_positive_greater_than_average
Count Binary Palindromic Numbershttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3677_count_binary_palindromic_numbers
Count Bowl Subarrayshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3676_count_bowl_subarrays
Minimum Operations to Transform Stringhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3675_minimum_operations_to_transform_string
Minimum Operations to Equalize Arrayhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3674_minimum_operations_to_equalize_array
Find Zombie Sessionshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3673_find_zombie_sessions
Sum of Beautiful Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3671_sum_of_beautiful_subsequences
Maximum Product of Two Integers With No Common Bitshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3670_maximum_product_of_two_integers_with_no_common_bits
Balanced K-Factor Decompositionhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3669_balanced_k_factor_decomposition
Restore Finishing Orderhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3668_restore_finishing_order
Minimum Operations to Equalize Binary Stringhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3666_minimum_operations_to_equalize_binary_string
Twisted Mirror Path Counthttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3665_twisted_mirror_path_count
Two-Letter Card Gamehttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3664_two_letter_card_game
Find The Least Frequent Digithttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3663_find_the_least_frequent_digit
Maximum Walls Destroyed by Robotshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3661_maximum_walls_destroyed_by_robots
Jump Game IXhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3660_jump_game_ix
Partition Array Into K-Distinct Groupshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3659_partition_array_into_k_distinct_groups
GCD of Odd and Even Sumshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3658_gcd_of_odd_and_even_sums
Find Loyal Customershttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3657_find_loyal_customers
XOR After Range Multiplication Queries IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3655_xor_after_range_multiplication_queries_ii
Minimum Sum After Divisible Sum Deletionshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3654_minimum_sum_after_divisible_sum_deletions
XOR After Range Multiplication Queries Ihttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3653_xor_after_range_multiplication_queries_i
Best Time to Buy and Sell Stock using Strategyhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3652_best_time_to_buy_and_sell_stock_using_strategy
Minimum Cost Path with Teleportationshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3651_minimum_cost_path_with_teleportations
Minimum Cost Path with Edge Reversalshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3650_minimum_cost_path_with_edge_reversals
Number of Perfect Pairshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3649_number_of_perfect_pairs
Minimum Sensors to Cover Gridhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3648_minimum_sensors_to_cover_grid
Next Special Palindrome Numberhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3646_next_special_palindrome_number
Maximum Total from Optimal Activation Orderhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3645_maximum_total_from_optimal_activation_order
Maximum K to Sort a Permutationhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3644_maximum_k_to_sort_a_permutation
Flip Square Submatrix Verticallyhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3643_flip_square_submatrix_vertically
Find Books with Polarized Opinionshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3642_find_books_with_polarized_opinions
Trionic Array IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3640_trionic_array_ii
Minimum Time to Activate Stringhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3639_minimum_time_to_activate_string
Maximum Balanced Shipmentshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3638_maximum_balanced_shipments
Trionic Array Ihttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3637_trionic_array_i
Threshold Majority Querieshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3636_threshold_majority_queries
Earliest Finish Time for Land and Water Rides IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3635_earliest_finish_time_for_land_and_water_rides_ii
Minimum Removals to Balance Arrayhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3634_minimum_removals_to_balance_array
Earliest Finish Time for Land and Water Rides Ihttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3633_earliest_finish_time_for_land_and_water_rides_i
Partition Array for Maximum XOR and ANDhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3630_partition_array_for_maximum_xor_and_and
Minimum Jumps to Reach End via Prime Teleportationhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3629_minimum_jumps_to_reach_end_via_prime_teleportation
Maximum Number of Subsequences After One Insertinghttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3628_maximum_number_of_subsequences_after_one_inserting
Maximum Median Sum of Subsequences of Size 3https://leetcode-in-java.github.io/src/main/java/g3601_3700/s3627_maximum_median_sum_of_subsequences_of_size_3
Find Stores with Inventory Imbalancehttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3626_find_stores_with_inventory_imbalance
Count Number of Trapezoids IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3625_count_number_of_trapezoids_ii
Number of Integers With Popcount-Depth Equal to K IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3624_number_of_integers_with_popcount_depth_equal_to_k_ii
Count Number of Trapezoids Ihttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3623_count_number_of_trapezoids_i
Check Divisibility by Digit Sum and Producthttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3622_check_divisibility_by_digit_sum_and_product
Number of Integers With Popcount-Depth Equal to K Ihttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3621_number_of_integers_with_popcount_depth_equal_to_k_i
Network Recovery Pathwayshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3620_network_recovery_pathways
Count Islands With Total Value Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3619_count_islands_with_total_value_divisible_by_k
Split Array by Prime Indiceshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3618_split_array_by_prime_indices
Find Students with Study Spiral Patternhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3617_find_students_with_study_spiral_pattern
Longest Palindromic Path in Graphhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3615_longest_palindromic_path_in_graph
Process String with Special Operations IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3614_process_string_with_special_operations_ii
Minimize Maximum Component Costhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3613_minimize_maximum_component_cost
Process String with Special Operations Ihttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3612_process_string_with_special_operations_i
Find Overbooked Employeeshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3611_find_overbooked_employees
Minimum Moves to Reach Target in Gridhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3609_minimum_moves_to_reach_target_in_grid
Minimum Time for K Connected Componentshttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3608_minimum_time_for_k_connected_components
Power Grid Maintenancehttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3607_power_grid_maintenance
Coupon Code Validatorhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3606_coupon_code_validator
Minimum Stability Factor of Arrayhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3605_minimum_stability_factor_of_array
Minimum Time to Reach Destination in Directed Graphhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3604_minimum_time_to_reach_destination_in_directed_graph
Minimum Cost Path with Alternating Directions IIhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3603_minimum_cost_path_with_alternating_directions_ii
Hexadecimal and Hexatrigesimal Conversionhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3602_hexadecimal_and_hexatrigesimal_conversion
Find Drivers with Improved Fuel Efficiencyhttps://leetcode-in-java.github.io/src/main/java/g3601_3700/s3601_find_drivers_with_improved_fuel_efficiency
Maximize Spanning Tree Stability with Upgradeshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3600_maximize_spanning_tree_stability_with_upgrades
Partition Array to Minimize XORhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3599_partition_array_to_minimize_xor
Longest Common Prefix Between Adjacent Strings After Removalshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3598_longest_common_prefix_between_adjacent_strings_after_removals
Partition Stringhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3597_partition_string
Minimum Time to Transport All Individualshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3594_minimum_time_to_transport_all_individuals
Minimum Increments to Equalize Leaf Pathshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3593_minimum_increments_to_equalize_leaf_paths
Inverse Coin Changehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3592_inverse_coin_change
Check if Any Element Has Prime Frequencyhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3591_check_if_any_element_has_prime_frequency
Kth Smallest Path XOR Sumhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3590_kth_smallest_path_xor_sum
Count Prime-Gap Balanced Subarrayshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3589_count_prime_gap_balanced_subarrays
Find Maximum Area of a Trianglehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3588_find_maximum_area_of_a_triangle
Minimum Adjacent Swaps to Alternate Parityhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3587_minimum_adjacent_swaps_to_alternate_parity
Find COVID Recovery Patientshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3586_find_covid_recovery_patients
Find Weighted Median Node in Treehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3585_find_weighted_median_node_in_tree
Maximum Product of First and Last Elements of a Subsequencehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3584_maximum_product_of_first_and_last_elements_of_a_subsequence
Count Special Tripletshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3583_count_special_triplets
Generate Tag for Video Captionhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3582_generate_tag_for_video_caption
Find Consistently Improving Employeeshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3580_find_consistently_improving_employees
Minimum Steps to Convert String with Operationshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3579_minimum_steps_to_convert_string_with_operations
Count Partitions With Max-Min Difference at Most Khttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3578_count_partitions_with_max_min_difference_at_most_k
Count the Number of Computer Unlocking Permutationshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3577_count_the_number_of_computer_unlocking_permutations
Transform Array to All Equal Elementshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3576_transform_array_to_all_equal_elements
Maximum Good Subtree Scorehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3575_maximum_good_subtree_score
Maximize Subarray GCD Scorehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3574_maximize_subarray_gcd_score
Best Time to Buy and Sell Stock Vhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3573_best_time_to_buy_and_sell_stock_v
Maximize Y‑Sum by Picking a Triplet of Distinct X‑Valueshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3572_maximize_ysum_by_picking_a_triplet_of_distinct_xvalues
Find Books with No Available Copieshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3570_find_books_with_no_available_copies
Maximize Count of Distinct Primes After Splithttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3569_maximize_count_of_distinct_primes_after_split
Minimum Moves to Clean the Classroomhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3568_minimum_moves_to_clean_the_classroom
Minimum Absolute Difference in Sliding Submatrixhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3567_minimum_absolute_difference_in_sliding_submatrix
Partition Array into Two Equal Product Subsetshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3566_partition_array_into_two_equal_product_subsets
Seasonal Sales Analysishttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3564_seasonal_sales_analysis
Lexicographically Smallest String After Adjacent Removalshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3563_lexicographically_smallest_string_after_adjacent_removals
Maximum Profit from Trading Stocks with Discountshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3562_maximum_profit_from_trading_stocks_with_discounts
Resulting String After Adjacent Removalshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3561_resulting_string_after_adjacent_removals
Find Minimum Log Transportation Costhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3560_find_minimum_log_transportation_cost
Number of Ways to Assign Edge Weights IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3559_number_of_ways_to_assign_edge_weights_ii
Number of Ways to Assign Edge Weights Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3558_number_of_ways_to_assign_edge_weights_i
Find Maximum Number of Non Intersecting Substringshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3557_find_maximum_number_of_non_intersecting_substrings
Sum of Largest Prime Substringshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3556_sum_of_largest_prime_substrings
Find Category Recommendation Pairshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3554_find_category_recommendation_pairs
Minimum Weighted Subgraph With the Required Paths IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3553_minimum_weighted_subgraph_with_the_required_paths_ii
Grid Teleportation Traversalhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3552_grid_teleportation_traversal
Minimum Swaps to Sort by Digit Sumhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3551_minimum_swaps_to_sort_by_digit_sum
Smallest Index With Digit Sum Equal to Indexhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3550_smallest_index_with_digit_sum_equal_to_index
Equal Sum Grid Partition IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3548_equal_sum_grid_partition_ii
Maximum Sum of Edge Values in a Graphhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3547_maximum_sum_of_edge_values_in_a_graph
Equal Sum Grid Partition Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3546_equal_sum_grid_partition_i
Minimum Deletions for At Most K Distinct Charactershttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3545_minimum_deletions_for_at_most_k_distinct_characters
Subtree Inversion Sumhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3544_subtree_inversion_sum
Maximum Weighted K-Edge Pathhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3543_maximum_weighted_k_edge_path
Minimum Operations to Convert All Elements to Zerohttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3542_minimum_operations_to_convert_all_elements_to_zero
Find Most Frequent Vowel and Consonanthttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3541_find_most_frequent_vowel_and_consonant
Find Sum of Array Product of Magical Sequenceshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3539_find_sum_of_array_product_of_magical_sequences
Merge Operations for Minimum Travel Timehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3538_merge_operations_for_minimum_travel_time
Fill a Special Gridhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3537_fill_a_special_grid
Maximum Product of Two Digitshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3536_maximum_product_of_two_digits
Path Existence Queries in a Graph IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3534_path_existence_queries_in_a_graph_ii
Concatenated Divisibilityhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3533_concatenated_divisibility
Path Existence Queries in a Graph Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3532_path_existence_queries_in_a_graph_i
Count Covered Buildingshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3531_count_covered_buildings
Maximum Profit from Valid Topological Order in DAGhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3530_maximum_profit_from_valid_topological_order_in_dag
Count Cells in Overlapping Horizontal and Vertical Substringshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3529_count_cells_in_overlapping_horizontal_and_vertical_substrings
Unit Conversion Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3528_unit_conversion_i
Find the Most Common Responsehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3527_find_the_most_common_response
Find X Value of Array IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3525_find_x_value_of_array_ii
Find X Value of Array Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3524_find_x_value_of_array_i
Make Array Non-decreasinghttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3523_make_array_non_decreasing
Calculate Score After Performing Instructionshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3522_calculate_score_after_performing_instructions
Find Product Recommendation Pairshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3521_find_product_recommendation_pairs
Count Numbers with Non-Decreasing Digitshttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3519_count_numbers_with_non_decreasing_digits
Smallest Palindromic Rearrangement IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3518_smallest_palindromic_rearrangement_ii
Smallest Palindromic Rearrangement Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3517_smallest_palindromic_rearrangement_i
Find Closest Personhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3516_find_closest_person
Shortest Path in a Weighted Treehttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3515_shortest_path_in_a_weighted_tree
Number of Unique XOR Triplets IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3514_number_of_unique_xor_triplets_ii
Number of Unique XOR Triplets Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3513_number_of_unique_xor_triplets_i
Minimum Operations to Make Array Sum Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3512_minimum_operations_to_make_array_sum_divisible_by_k
Minimum Pair Removal to Sort Array IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3510_minimum_pair_removal_to_sort_array_ii
Maximum Product of Subsequences With an Alternating Sum Equal to Khttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3509_maximum_product_of_subsequences_with_an_alternating_sum_equal_to_k
Implement Routerhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3508_implement_router
Minimum Pair Removal to Sort Array Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3507_minimum_pair_removal_to_sort_array_i
Minimum Operations to Make Elements Within K Subarrays Equalhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3505_minimum_operations_to_make_elements_within_k_subarrays_equal
Longest Palindrome After Substring Concatenation IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3504_longest_palindrome_after_substring_concatenation_ii
Longest Palindrome After Substring Concatenation Ihttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3503_longest_palindrome_after_substring_concatenation_i
Minimum Cost to Reach Every Positionhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3502_minimum_cost_to_reach_every_position
Maximize Active Section with Trade IIhttps://leetcode-in-java.github.io/src/main/java/g3501_3600/s3501_maximize_active_section_with_trade_ii
Minimum Cost to Divide Array Into Subarrayshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3500_minimum_cost_to_divide_array_into_subarrays
Maximize Active Section with Trade Ihttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3499_maximize_active_section_with_trade_i
Reverse Degree of a Stringhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3498_reverse_degree_of_a_string
Analyze Subscription Conversionhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3497_analyze_subscription_conversion
Minimum Operations to Make Array Elements Zerohttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3495_minimum_operations_to_make_array_elements_zero
Find the Minimum Amount of Time to Brew Potionshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3494_find_the_minimum_amount_of_time_to_brew_potions
Properties Graphhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3493_properties_graph
Maximum Containers on a Shiphttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3492_maximum_containers_on_a_ship
Count Beautiful Numbershttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3490_count_beautiful_numbers
Zero Array Transformation IVhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3489_zero_array_transformation_iv
Closest Equal Element Querieshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3488_closest_equal_element_queries
Maximum Unique Subarray Sum After Deletionhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3487_maximum_unique_subarray_sum_after_deletion
Longest Special Path IIhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3486_longest_special_path_ii
Longest Common Prefix of K Strings After Removalhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3485_longest_common_prefix_of_k_strings_after_removal
Design Spreadsheethttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3484_design_spreadsheet
Unique 3-Digit Even Numbershttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3483_unique_3_digit_even_numbers
Analyze Organization Hierarchyhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3482_analyze_organization_hierarchy
Maximize Subarrays After Removing One Conflicting Pairhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3480_maximize_subarrays_after_removing_one_conflicting_pair
Fruits Into Baskets IIIhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3479_fruits_into_baskets_iii
Choose K Elements With Maximum Sumhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3478_choose_k_elements_with_maximum_sum
Fruits Into Baskets IIhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3477_fruits_into_baskets_ii
DNA Pattern Recognitionhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3475_dna_pattern_recognition
Lexicographically Smallest Generated Stringhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3474_lexicographically_smallest_generated_string
Sum of K Subarrays With Length at Least Mhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3473_sum_of_k_subarrays_with_length_at_least_m
Longest Palindromic Subsequence After at Most K Operationshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3472_longest_palindromic_subsequence_after_at_most_k_operations
Find the Largest Almost Missing Integerhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3471_find_the_largest_almost_missing_integer
Permutations IVhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3470_permutations_iv
Find Minimum Cost to Remove Array Elementshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3469_find_minimum_cost_to_remove_array_elements
Find the Number of Copy Arrayshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3468_find_the_number_of_copy_arrays
Transform Array by Parityhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3467_transform_array_by_parity
Find Products with Valid Serial Numbershttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3465_find_products_with_valid_serial_numbers
Maximize the Distance Between Points on a Squarehttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3464_maximize_the_distance_between_points_on_a_square
Check If Digits Are Equal in String After Operations IIhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3463_check_if_digits_are_equal_in_string_after_operations_ii
Maximum Sum With at Most K Elementshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3462_maximum_sum_with_at_most_k_elements
Check If Digits Are Equal in String After Operations Ihttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3461_check_if_digits_are_equal_in_string_after_operations_i
Length of Longest V-Shaped Diagonal Segmenthttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3459_length_of_longest_v_shaped_diagonal_segment
Select K Disjoint Special Substringshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3458_select_k_disjoint_special_substrings
Eat Pizzas!https://leetcode-in-java.github.io/src/main/java/g3401_3500/s3457_eat_pizzas
Find Special Substring of Length Khttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3456_find_special_substring_of_length_k
Shortest Matching Substringhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3455_shortest_matching_substring
Separate Squares IIhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3454_separate_squares_ii
Separate Squares Ihttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3453_separate_squares_i
Sum of Good Numbershttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3452_sum_of_good_numbers
Find Invalid IP Addresseshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3451_find_invalid_ip_addresses
Maximize the Minimum Game Scorehttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3449_maximize_the_minimum_game_score
Count Substrings Divisible By Last Digithttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3448_count_substrings_divisible_by_last_digit
Assign Elements to Groups with Constraintshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3447_assign_elements_to_groups_with_constraints
Sort Matrix by Diagonalshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3446_sort_matrix_by_diagonals
Maximum Difference Between Even and Odd Frequency IIhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3445_maximum_difference_between_even_and_odd_frequency_ii
Minimum Increments for Target Multiples in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3444_minimum_increments_for_target_multiples_in_an_array
Maximum Manhattan Distance After K Changeshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3443_maximum_manhattan_distance_after_k_changes
Maximum Difference Between Even and Odd Frequency Ihttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3442_maximum_difference_between_even_and_odd_frequency_i
Minimum Cost Good Captionhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3441_minimum_cost_good_caption
Reschedule Meetings for Maximum Free Time IIhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3440_reschedule_meetings_for_maximum_free_time_ii
Reschedule Meetings for Maximum Free Time Ihttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3439_reschedule_meetings_for_maximum_free_time_i
Find Valid Pair of Adjacent Digits in Stringhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3438_find_valid_pair_of_adjacent_digits_in_string
Find Valid Emailshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3436_find_valid_emails
Frequencies of Shortest Supersequenceshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3435_frequencies_of_shortest_supersequences
Maximum Frequency After Subarray Operationhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3434_maximum_frequency_after_subarray_operation
Count Mentions Per Userhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3433_count_mentions_per_user
Count Partitions with Even Sum Differencehttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3432_count_partitions_with_even_sum_difference
Maximum and Minimum Sums of at Most Size K Subarrayshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3430_maximum_and_minimum_sums_of_at_most_size_k_subarrays
Paint House IVhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3429_paint_house_iv
Maximum and Minimum Sums of at Most Size K Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3428_maximum_and_minimum_sums_of_at_most_size_k_subsequences
Sum of Variable Length Subarrayshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3427_sum_of_variable_length_subarrays
Manhattan Distances of All Arrangements of Pieceshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3426_manhattan_distances_of_all_arrangements_of_pieces
Longest Special Pathhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3425_longest_special_path
Minimum Cost to Make Arrays Identicalhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3424_minimum_cost_to_make_arrays_identical
Maximum Difference Between Adjacent Elements in a Circular Arrayhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3423_maximum_difference_between_adjacent_elements_in_a_circular_array
Find Students Who Improvedhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3421_find_students_who_improved
Count Non-Decreasing Subarrays After K Operationshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3420_count_non_decreasing_subarrays_after_k_operations
Minimize the Maximum Edge Weight of Graphhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3419_minimize_the_maximum_edge_weight_of_graph
Maximum Amount of Money Robot Can Earnhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3418_maximum_amount_of_money_robot_can_earn
Zigzag Grid Traversal With Skiphttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3417_zigzag_grid_traversal_with_skip
Maximum Score of Non-overlapping Intervalshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3414_maximum_score_of_non_overlapping_intervals
Maximum Coins From K Consecutive Bagshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3413_maximum_coins_from_k_consecutive_bags
Find Mirror Score of a Stringhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3412_find_mirror_score_of_a_string
Maximum Subarray With Equal Productshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3411_maximum_subarray_with_equal_products
Maximize Subarray Sum After Removing All Occurrences of One Elementhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3410_maximize_subarray_sum_after_removing_all_occurrences_of_one_element
Longest Subsequence With Decreasing Adjacent Differencehttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3409_longest_subsequence_with_decreasing_adjacent_difference
Design Task Managerhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3408_design_task_manager
Substring Matching Patternhttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3407_substring_matching_pattern
Count the Number of Arrays with K Matching Adjacent Elementshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3405_count_the_number_of_arrays_with_k_matching_adjacent_elements
Count Special Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3404_count_special_subsequences
Find the Lexicographically Largest String From the Box Ihttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3403_find_the_lexicographically_largest_string_from_the_box_i
Minimum Operations to Make Columns Strictly Increasinghttps://leetcode-in-java.github.io/src/main/java/g3401_3500/s3402_minimum_operations_to_make_columns_strictly_increasing
Smallest Substring With Identical Characters IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3399_smallest_substring_with_identical_characters_ii
Smallest Substring With Identical Characters Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3398_smallest_substring_with_identical_characters_i
Maximum Number of Distinct Elements After Operationshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3397_maximum_number_of_distinct_elements_after_operations
Minimum Number of Operations to Make Elements in Array Distincthttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3396_minimum_number_of_operations_to_make_elements_in_array_distinct
Subsequences with a Unique Middle Mode Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3395_subsequences_with_a_unique_middle_mode_i
Check if Grid can be Cut into Sectionshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3394_check_if_grid_can_be_cut_into_sections
Count Paths With the Given XOR Valuehttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3393_count_paths_with_the_given_xor_value
Count Subarrays of Length Three With a Conditionhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3392_count_subarrays_of_length_three_with_a_condition
Minimum Operations to Make Character Frequencies Equalhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3389_minimum_operations_to_make_character_frequencies_equal
Count Beautiful Splits in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3388_count_beautiful_splits_in_an_array
Maximize Amount After Two Days of Conversionshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3387_maximize_amount_after_two_days_of_conversions
Button with Longest Push Timehttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3386_button_with_longest_push_time
Maximum Area Rectangle With Point Constraints IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3382_maximum_area_rectangle_with_point_constraints_ii
Maximum Subarray Sum With Length Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3381_maximum_subarray_sum_with_length_divisible_by_k
Maximum Area Rectangle With Point Constraints Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3380_maximum_area_rectangle_with_point_constraints_i
Transformed Arrayhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3379_transformed_array
Count Connected Components in LCM Graphhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3378_count_connected_components_in_lcm_graph
Digit Operations to Make Two Integers Equalhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3377_digit_operations_to_make_two_integers_equal
Minimum Time to Break Locks Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3376_minimum_time_to_break_locks_i
Minimum Operations to Make Array Values Equal to Khttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3375_minimum_operations_to_make_array_values_equal_to_k
First Letter Capitalization IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3374_first_letter_capitalization_ii
Maximize the Number of Target Nodes After Connecting Trees IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3373_maximize_the_number_of_target_nodes_after_connecting_trees_ii
Maximize the Number of Target Nodes After Connecting Trees Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3372_maximize_the_number_of_target_nodes_after_connecting_trees_i
Identify the Largest Outlier in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3371_identify_the_largest_outlier_in_an_array
Smallest Number With All Set Bitshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3370_smallest_number_with_all_set_bits
Maximize Sum of Weights after Edge Removalshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3367_maximize_sum_of_weights_after_edge_removals
Minimum Array Sumhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3366_minimum_array_sum
Rearrange K Substrings to Form Target Stringhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3365_rearrange_k_substrings_to_form_target_string
Minimum Positive Sum Subarrayhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3364_minimum_positive_sum_subarray
Find the Maximum Number of Fruits Collectedhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3363_find_the_maximum_number_of_fruits_collected
Zero Array Transformation IIIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3362_zero_array_transformation_iii
Shift Distance Between Two Stringshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3361_shift_distance_between_two_strings
Stone Removal Gamehttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3360_stone_removal_game
Minimize the Maximum Adjacent Element Differencehttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3357_minimize_the_maximum_adjacent_element_difference
Zero Array Transformation IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3356_zero_array_transformation_ii
Zero Array Transformation Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3355_zero_array_transformation_i
Make Array Elements Equal to Zerohttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3354_make_array_elements_equal_to_zero
Count K-Reducible Numbers Less Than Nhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3352_count_k_reducible_numbers_less_than_n
Sum of Good Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3351_sum_of_good_subsequences
Adjacent Increasing Subarrays Detection IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3350_adjacent_increasing_subarrays_detection_ii
Adjacent Increasing Subarrays Detection Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3349_adjacent_increasing_subarrays_detection_i
Smallest Divisible Digit Product IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3348_smallest_divisible_digit_product_ii
Maximum Frequency of an Element After Performing Operations IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3347_maximum_frequency_of_an_element_after_performing_operations_ii
Maximum Frequency of an Element After Performing Operations Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3346_maximum_frequency_of_an_element_after_performing_operations_i
Smallest Divisible Digit Product Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3345_smallest_divisible_digit_product_i
Count Number of Balanced Permutationshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3343_count_number_of_balanced_permutations
Find Minimum Time to Reach Last Room IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3342_find_minimum_time_to_reach_last_room_ii
Find Minimum Time to Reach Last Room Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3341_find_minimum_time_to_reach_last_room_i
Check Balanced Stringhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3340_check_balanced_string
Total Characters in String After Transformations IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3337_total_characters_in_string_after_transformations_ii
Find the Number of Subsequences With Equal GCDhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3336_find_the_number_of_subsequences_with_equal_gcd
Total Characters in String After Transformations Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3335_total_characters_in_string_after_transformations_i
Find the Maximum Factor Score of Arrayhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3334_find_the_maximum_factor_score_of_array
Find the Original Typed String IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3333_find_the_original_typed_string_ii
Maximum Points Tourist Can Earnhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3332_maximum_points_tourist_can_earn
Find Subtree Sizes After Changeshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3331_find_subtree_sizes_after_changes
Find the Original Typed String Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3330_find_the_original_typed_string_i
Check if DFS Strings Are Palindromeshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3327_check_if_dfs_strings_are_palindromes
Minimum Division Operations to Make Array Non Decreasinghttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3326_minimum_division_operations_to_make_array_non_decreasing
Count Substrings With K-Frequency Characters Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3325_count_substrings_with_k_frequency_characters_i
Find the Sequence of Strings Appeared on the Screenhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3324_find_the_sequence_of_strings_appeared_on_the_screen
Find X-Sum of All K-Long Subarrays IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3321_find_x_sum_of_all_k_long_subarrays_ii
Count The Number of Winning Sequenceshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3320_count_the_number_of_winning_sequences
K-th Largest Perfect Subtree Size in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3319_k_th_largest_perfect_subtree_size_in_binary_tree
Find X-Sum of All K-Long Subarrays Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3318_find_x_sum_of_all_k_long_subarrays_i
Find the Number of Possible Ways for an Eventhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3317_find_the_number_of_possible_ways_for_an_event
Find Maximum Removals From Source Stringhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3316_find_maximum_removals_from_source_string
Construct the Minimum Bitwise Array IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3315_construct_the_minimum_bitwise_array_ii
Construct the Minimum Bitwise Array Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3314_construct_the_minimum_bitwise_array_i
Sorted GCD Pair Querieshttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3312_sorted_gcd_pair_queries
Construct 2D Grid Matching Graph Layouthttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3311_construct_2d_grid_matching_graph_layout
Remove Methods From Projecthttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3310_remove_methods_from_project
Maximum Possible Number by Binary Concatenationhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3309_maximum_possible_number_by_binary_concatenation
Find the K-th Character in String Game IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3307_find_the_k_th_character_in_string_game_ii
Count of Substrings Containing Every Vowel and K Consonants IIhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3306_count_of_substrings_containing_every_vowel_and_k_consonants_ii
Count of Substrings Containing Every Vowel and K Consonants Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3305_count_of_substrings_containing_every_vowel_and_k_consonants_i
Find the K-th Character in String Game Ihttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3304_find_the_k_th_character_in_string_game_i
Find the Occurrence of First Almost Equal Substringhttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3303_find_the_occurrence_of_first_almost_equal_substring
Find the Lexicographically Smallest Valid Sequencehttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3302_find_the_lexicographically_smallest_valid_sequence
Maximize the Total Height of Unique Towershttps://leetcode-in-java.github.io/src/main/java/g3301_3400/s3301_maximize_the_total_height_of_unique_towers
Minimum Element After Replacement With Digit Sumhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3300_minimum_element_after_replacement_with_digit_sum
Count Substrings That Can Be Rearranged to Contain a String IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3298_count_substrings_that_can_be_rearranged_to_contain_a_string_ii
Count Substrings That Can Be Rearranged to Contain a String Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3297_count_substrings_that_can_be_rearranged_to_contain_a_string_i
Minimum Number of Seconds to Make Mountain Height Zerohttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3296_minimum_number_of_seconds_to_make_mountain_height_zero
Report Spam Messagehttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3295_report_spam_message
Minimum Number of Valid Strings to Form Target IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3292_minimum_number_of_valid_strings_to_form_target_ii
Minimum Number of Valid Strings to Form Target Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3291_minimum_number_of_valid_strings_to_form_target_i
Maximum Multiplication Scorehttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3290_maximum_multiplication_score
The Two Sneaky Numbers of Digitvillehttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3289_the_two_sneaky_numbers_of_digitville
Length of the Longest Increasing Pathhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3288_length_of_the_longest_increasing_path
Find the Maximum Sequence Value of Arrayhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3287_find_the_maximum_sequence_value_of_array
Find a Safe Walk Through a Gridhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3286_find_a_safe_walk_through_a_grid
Find Indices of Stable Mountainshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3285_find_indices_of_stable_mountains
Maximum Number of Moves to Kill All Pawnshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3283_maximum_number_of_moves_to_kill_all_pawns
Reach End of Array With Max Scorehttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3282_reach_end_of_array_with_max_score
Maximize Score of Numbers in Rangeshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3281_maximize_score_of_numbers_in_ranges
Convert Date to Binaryhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3280_convert_date_to_binary
Maximum XOR Score Subarray Querieshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3277_maximum_xor_score_subarray_queries
Select Cells in Grid With Maximum Scorehttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3276_select_cells_in_grid_with_maximum_score
K-th Nearest Obstacle Querieshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3275_k_th_nearest_obstacle_queries
Check if Two Chessboard Squares Have the Same Colorhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3274_check_if_two_chessboard_squares_have_the_same_color
Minimum Amount of Damage Dealt to Bobhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3273_minimum_amount_of_damage_dealt_to_bob
Find the Count of Good Integershttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3272_find_the_count_of_good_integers
Hash Divided Stringhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3271_hash_divided_string
Find the Key of the Numbershttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3270_find_the_key_of_the_numbers
Count Almost Equal Pairs IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3267_count_almost_equal_pairs_ii
Final Array State After K Multiplication Operations IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3266_final_array_state_after_k_multiplication_operations_ii
Count Almost Equal Pairs Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3265_count_almost_equal_pairs_i
Final Array State After K Multiplication Operations Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3264_final_array_state_after_k_multiplication_operations_i
Count Substrings That Satisfy K-Constraint IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3261_count_substrings_that_satisfy_k_constraint_ii
Find the Largest Palindrome Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3260_find_the_largest_palindrome_divisible_by_k
Maximum Energy Boost From Two Drinkshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3259_maximum_energy_boost_from_two_drinks
Count Substrings That Satisfy K-Constraint Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3258_count_substrings_that_satisfy_k_constraint_i
Maximum Value Sum by Placing Three Rooks IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3257_maximum_value_sum_by_placing_three_rooks_ii
Maximum Value Sum by Placing Three Rooks Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3256_maximum_value_sum_by_placing_three_rooks_i
Find the Power of K-Size Subarrays IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3255_find_the_power_of_k_size_subarrays_ii
Find the Power of K-Size Subarrays Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3254_find_the_power_of_k_size_subarrays_i
Find the Count of Monotonic Pairs IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3251_find_the_count_of_monotonic_pairs_ii
Find the Count of Monotonic Pairs Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3250_find_the_count_of_monotonic_pairs_i
Count the Number of Good Nodeshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3249_count_the_number_of_good_nodes
Snake in Matrixhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3248_snake_in_matrix
Alternating Groups IIIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3245_alternating_groups_iii
Shortest Distance After Road Addition Queries IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3244_shortest_distance_after_road_addition_queries_ii
Shortest Distance After Road Addition Queries Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3243_shortest_distance_after_road_addition_queries_i
Design Neighbor Sum Servicehttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3242_design_neighbor_sum_service
Time Taken to Mark All Nodeshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3241_time_taken_to_mark_all_nodes
Minimum Number of Flips to Make Binary Grid Palindromic IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3240_minimum_number_of_flips_to_make_binary_grid_palindromic_ii
Minimum Number of Flips to Make Binary Grid Palindromic Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3239_minimum_number_of_flips_to_make_binary_grid_palindromic_i
Find the Number of Winning Playershttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3238_find_the_number_of_winning_players
Check if the Rectangle Corner Is Reachablehttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3235_check_if_the_rectangle_corner_is_reachable
Count the Number of Substrings With Dominant Oneshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3234_count_the_number_of_substrings_with_dominant_ones
Find the Count of Numbers Which Are Not Specialhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3233_find_the_count_of_numbers_which_are_not_special
Find if Digit Game Can Be Wonhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3232_find_if_digit_game_can_be_won
Minimum Operations to Make Array Equal to Targethttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3229_minimum_operations_to_make_array_equal_to_target
Maximum Number of Operations to Move Ones to the Endhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3228_maximum_number_of_operations_to_move_ones_to_the_end
Vowels Game in a Stringhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3227_vowels_game_in_a_string
Number of Bit Changes to Make Two Integers Equalhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3226_number_of_bit_changes_to_make_two_integers_equal
Maximum Score From Grid Operationshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3225_maximum_score_from_grid_operations
Minimum Array Changes to Make Differences Equalhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3224_minimum_array_changes_to_make_differences_equal
Minimum Length of String After Operationshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3223_minimum_length_of_string_after_operations
Find the Winning Player in Coin Gamehttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3222_find_the_winning_player_in_coin_game
Odd and Even Transactionshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3220_odd_and_even_transactions
Minimum Cost for Cutting Cake IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3219_minimum_cost_for_cutting_cake_ii
Minimum Cost for Cutting Cake Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3218_minimum_cost_for_cutting_cake_i
Delete Nodes From Linked List Present in Arrayhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3217_delete_nodes_from_linked_list_present_in_array
Lexicographically Smallest String After a Swaphttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3216_lexicographically_smallest_string_after_a_swap
Construct String with Minimum Costhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3213_construct_string_with_minimum_cost
Count Submatrices With Equal Frequency of X and Yhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3212_count_submatrices_with_equal_frequency_of_x_and_y
Generate Binary Strings Without Adjacent Zeroshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3211_generate_binary_strings_without_adjacent_zeros
Find the Encrypted Stringhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3210_find_the_encrypted_string
Number of Subarrays With AND Value of Khttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3209_number_of_subarrays_with_and_value_of_k
Alternating Groups IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3208_alternating_groups_ii
Maximum Points After Enemy Battleshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3207_maximum_points_after_enemy_battles
Alternating Groups Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3206_alternating_groups_i
Find Minimum Diameter After Merging Two Treeshttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3203_find_minimum_diameter_after_merging_two_trees
Find the Maximum Length of Valid Subsequence IIhttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3202_find_the_maximum_length_of_valid_subsequence_ii
Find the Maximum Length of Valid Subsequence Ihttps://leetcode-in-java.github.io/src/main/java/g3201_3300/s3201_find_the_maximum_length_of_valid_subsequence_i
Maximum Height of a Trianglehttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3200_maximum_height_of_a_triangle
Find the Minimum Area to Cover All Ones IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3197_find_the_minimum_area_to_cover_all_ones_ii
Maximize Total Cost of Alternating Subarrayshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3196_maximize_total_cost_of_alternating_subarrays
Find the Minimum Area to Cover All Ones Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3195_find_the_minimum_area_to_cover_all_ones_i
Minimum Average of Smallest and Largest Elementshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3194_minimum_average_of_smallest_and_largest_elements
Count the Number of Inversionshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3193_count_the_number_of_inversions
Minimum Operations to Make Binary Array Elements Equal to One IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3192_minimum_operations_to_make_binary_array_elements_equal_to_one_ii
Minimum Operations to Make Binary Array Elements Equal to One Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3191_minimum_operations_to_make_binary_array_elements_equal_to_one_i
Find Minimum Operations to Make All Elements Divisible by Threehttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3190_find_minimum_operations_to_make_all_elements_divisible_by_three
Peaks in Arrayhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3187_peaks_in_array
Maximum Total Damage With Spell Castinghttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3186_maximum_total_damage_with_spell_casting
Count Pairs That Form a Complete Day IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3185_count_pairs_that_form_a_complete_day_ii
Count Pairs That Form a Complete Day Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3184_count_pairs_that_form_a_complete_day_i
Maximum Total Reward Using Operations IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3181_maximum_total_reward_using_operations_ii
Maximum Total Reward Using Operations Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3180_maximum_total_reward_using_operations_i
Find the N-th Value After K Secondshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3179_find_the_n_th_value_after_k_seconds
Find the Child Who Has the Ball After K Secondshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3178_find_the_child_who_has_the_ball_after_k_seconds
Find the Maximum Length of a Good Subsequence IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3177_find_the_maximum_length_of_a_good_subsequence_ii
Find the Maximum Length of a Good Subsequence Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3176_find_the_maximum_length_of_a_good_subsequence_i
Find The First Player to win K Games in a Rowhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3175_find_the_first_player_to_win_k_games_in_a_row
Clear Digitshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3174_clear_digits
Find Subarray With Bitwise AND Closest to Khttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3171_find_subarray_with_bitwise_and_closest_to_k
Lexicographically Minimum String After Removing Starshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3170_lexicographically_minimum_string_after_removing_stars
Count Days Without Meetingshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3169_count_days_without_meetings
Minimum Number of Chairs in a Waiting Roomhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3168_minimum_number_of_chairs_in_a_waiting_room
Maximum Sum of Subsequence With Non-adjacent Elementshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3165_maximum_sum_of_subsequence_with_non_adjacent_elements
Find the Number of Good Pairs IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3164_find_the_number_of_good_pairs_ii
String Compression IIIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3163_string_compression_iii
Find the Number of Good Pairs Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3162_find_the_number_of_good_pairs_i
Block Placement Querieshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3161_block_placement_queries
Find the Number of Distinct Colors Among the Ballshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3160_find_the_number_of_distinct_colors_among_the_balls
Find Occurrences of an Element in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3159_find_occurrences_of_an_element_in_an_array
Find the XOR of Numbers Which Appear Twicehttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3158_find_the_xor_of_numbers_which_appear_twice
Find Number of Ways to Reach the K-th Stairhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3154_find_number_of_ways_to_reach_the_k_th_stair
Sum of Digit Differences of All Pairshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3153_sum_of_digit_differences_of_all_pairs
Special Array IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3152_special_array_ii
Special Array Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3151_special_array_i
Find the Minimum Cost Array Permutationhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3149_find_the_minimum_cost_array_permutation
Maximum Difference Score in a Gridhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3148_maximum_difference_score_in_a_grid
Taking Maximum Energy From the Mystic Dungeonhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3147_taking_maximum_energy_from_the_mystic_dungeon
Permutation Difference between Two Stringshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3146_permutation_difference_between_two_strings
Find Products of Elements of Big Arrayhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3145_find_products_of_elements_of_big_array
Minimum Substring Partition of Equal Character Frequencyhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3144_minimum_substring_partition_of_equal_character_frequency
Maximum Points Inside the Squarehttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3143_maximum_points_inside_the_square
Check if Grid Satisfies Conditionshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3142_check_if_grid_satisfies_conditions
Minimum Cost to Equalize Arrayhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3139_minimum_cost_to_equalize_array
Minimum Length of Anagram Concatenationhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3138_minimum_length_of_anagram_concatenation
Minimum Number of Operations to Make Word K-Periodichttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3137_minimum_number_of_operations_to_make_word_k_periodic
Valid Wordhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3136_valid_word
Find the Median of the Uniqueness Arrayhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3134_find_the_median_of_the_uniqueness_array
Minimum Array Endhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3133_minimum_array_end
Find the Integer Added to Array IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3132_find_the_integer_added_to_array_ii
Find the Integer Added to Array Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3131_find_the_integer_added_to_array_i
Find All Possible Stable Binary Arrays IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3130_find_all_possible_stable_binary_arrays_ii
Find All Possible Stable Binary Arrays Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3129_find_all_possible_stable_binary_arrays_i
Right Triangleshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3128_right_triangles
Make a Square with the Same Colorhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3127_make_a_square_with_the_same_color
Find Edges in Shortest Pathshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3123_find_edges_in_shortest_paths
Minimum Number of Operations to Satisfy Conditionshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3122_minimum_number_of_operations_to_satisfy_conditions
Count the Number of Special Characters IIhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3121_count_the_number_of_special_characters_ii
Count the Number of Special Characters Ihttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3120_count_the_number_of_special_characters_i
Minimum Sum of Values by Dividing Arrayhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3117_minimum_sum_of_values_by_dividing_array
Kth Smallest Amount With Single Denomination Combinationhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3116_kth_smallest_amount_with_single_denomination_combination
Maximum Prime Differencehttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3115_maximum_prime_difference
Latest Time You Can Obtain After Replacing Charactershttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3114_latest_time_you_can_obtain_after_replacing_characters
Find the Number of Subarrays Where Boundary Elements Are Maximumhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3113_find_the_number_of_subarrays_where_boundary_elements_are_maximum
Minimum Time to Visit Disappearing Nodeshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3112_minimum_time_to_visit_disappearing_nodes
Minimum Rectangles to Cover Pointshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3111_minimum_rectangles_to_cover_points
Score of a Stringhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3110_score_of_a_string
Minimum Cost Walk in Weighted Graphhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3108_minimum_cost_walk_in_weighted_graph
Minimum Operations to Make Median of Array Equal to Khttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3107_minimum_operations_to_make_median_of_array_equal_to_k
Lexicographically Smallest String After Operations With Constrainthttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3106_lexicographically_smallest_string_after_operations_with_constraint
Longest Strictly Increasing or Strictly Decreasing Subarrayhttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3105_longest_strictly_increasing_or_strictly_decreasing_subarray
Minimize Manhattan Distanceshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3102_minimize_manhattan_distances
Count Alternating Subarrayshttps://leetcode-in-java.github.io/src/main/java/g3101_3200/s3101_count_alternating_subarrays
Water Bottles IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3100_water_bottles_ii
Harshad Numberhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3099_harshad_number
Find the Sum of Subsequence Powershttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3098_find_the_sum_of_subsequence_powers
Shortest Subarray With OR at Least K IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3097_shortest_subarray_with_or_at_least_k_ii
Minimum Levels to Gain More Pointshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3096_minimum_levels_to_gain_more_points
Shortest Subarray With OR at Least K Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3095_shortest_subarray_with_or_at_least_k_i
Longest Common Suffix Querieshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3093_longest_common_suffix_queries
Most Frequent IDshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3092_most_frequent_ids
Apply Operations to Make Sum of Array Greater Than or Equal to khttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3091_apply_operations_to_make_sum_of_array_greater_than_or_equal_to_k
Maximum Length Substring With Two Occurrenceshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3090_maximum_length_substring_with_two_occurrences
Minimum Moves to Pick K Oneshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3086_minimum_moves_to_pick_k_ones
Minimum Deletions to Make String K-Specialhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3085_minimum_deletions_to_make_string_k_special
Count Substrings Starting and Ending with Given Characterhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3084_count_substrings_starting_and_ending_with_given_character
Existence of a Substring in a String and Its Reversehttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3083_existence_of_a_substring_in_a_string_and_its_reverse
Find the Sum of the Power of All Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3082_find_the_sum_of_the_power_of_all_subsequences
Replace Question Marks in String to Minimize Its Valuehttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3081_replace_question_marks_in_string_to_minimize_its_value
Mark Elements on Array by Performing Querieshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3080_mark_elements_on_array_by_performing_queries
Find the Sum of Encrypted Integershttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3079_find_the_sum_of_encrypted_integers
Maximum Strength of K Disjoint Subarrayshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3077_maximum_strength_of_k_disjoint_subarrays
Shortest Uncommon Substring in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3076_shortest_uncommon_substring_in_an_array
Maximize Happiness of Selected Childrenhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3075_maximize_happiness_of_selected_children
Apple Redistribution into Boxeshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3074_apple_redistribution_into_boxes
Distribute Elements Into Two Arrays IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3072_distribute_elements_into_two_arrays_ii
Minimum Operations to Write the Letter Y on a Gridhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3071_minimum_operations_to_write_the_letter_y_on_a_grid
Count Submatrices with Top-Left Element and Sum Less Than khttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3070_count_submatrices_with_top_left_element_and_sum_less_than_k
Distribute Elements Into Two Arrays Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3069_distribute_elements_into_two_arrays_i
Find the Maximum Sum of Node Valueshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3068_find_the_maximum_sum_of_node_values
Count Pairs of Connectable Servers in a Weighted Tree Networkhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3067_count_pairs_of_connectable_servers_in_a_weighted_tree_network
Minimum Operations to Exceed Threshold Value IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3066_minimum_operations_to_exceed_threshold_value_ii
Minimum Operations to Exceed Threshold Value Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3065_minimum_operations_to_exceed_threshold_value_i
Earliest Second to Mark Indices IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3049_earliest_second_to_mark_indices_ii
Earliest Second to Mark Indices Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3048_earliest_second_to_mark_indices_i
Find the Largest Area of Square Inside Two Rectangleshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3047_find_the_largest_area_of_square_inside_two_rectangles
Split the Arrayhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3046_split_the_array
Count Prefix and Suffix Pairs IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3045_count_prefix_and_suffix_pairs_ii
Most Frequent Primehttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3044_most_frequent_prime
Find the Length of the Longest Common Prefixhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3043_find_the_length_of_the_longest_common_prefix
Count Prefix and Suffix Pairs Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3042_count_prefix_and_suffix_pairs_i
Maximize Consecutive Elements in an Array After Modificationhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3041_maximize_consecutive_elements_in_an_array_after_modification
Maximum Number of Operations With the Same Score IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3040_maximum_number_of_operations_with_the_same_score_ii
Apply Operations to Make String Emptyhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3039_apply_operations_to_make_string_empty
Maximum Number of Operations With the Same Score Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3038_maximum_number_of_operations_with_the_same_score_i
Number of Subarrays That Match a Pattern IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3036_number_of_subarrays_that_match_a_pattern_ii
Maximum Palindromes After Operationshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3035_maximum_palindromes_after_operations
Number of Subarrays That Match a Pattern Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3034_number_of_subarrays_that_match_a_pattern_i
Modify the Matrixhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3033_modify_the_matrix
Minimum Time to Revert Word to Initial State IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3031_minimum_time_to_revert_word_to_initial_state_ii
Find the Grid of Region Averagehttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3030_find_the_grid_of_region_average
Minimum Time to Revert Word to Initial State Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3029_minimum_time_to_revert_word_to_initial_state_i
Ant on the Boundaryhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3028_ant_on_the_boundary
Find the Number of Ways to Place People IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3027_find_the_number_of_ways_to_place_people_ii
Maximum Good Subarray Sumhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3026_maximum_good_subarray_sum
Find the Number of Ways to Place People Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3025_find_the_number_of_ways_to_place_people_i
Type of Trianglehttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3024_type_of_triangle
Minimize OR of Remaining Elements Using Operationshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3022_minimize_or_of_remaining_elements_using_operations
Alice and Bob Playing Flower Gamehttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3021_alice_and_bob_playing_flower_game
Find the Maximum Number of Elements in Subsethttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3020_find_the_maximum_number_of_elements_in_subset
Number of Changing Keyshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3019_number_of_changing_keys
Count the Number of Houses at a Certain Distance IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3017_count_the_number_of_houses_at_a_certain_distance_ii
Minimum Number of Pushes to Type Word IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3016_minimum_number_of_pushes_to_type_word_ii
Count the Number of Houses at a Certain Distance Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3015_count_the_number_of_houses_at_a_certain_distance_i
Minimum Number of Pushes to Type Word Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3014_minimum_number_of_pushes_to_type_word_i
Divide an Array Into Subarrays With Minimum Cost IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3013_divide_an_array_into_subarrays_with_minimum_cost_ii
Minimize Length of Array Using Operationshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3012_minimize_length_of_array_using_operations
Find if Array Can Be Sortedhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3011_find_if_array_can_be_sorted
Divide an Array Into Subarrays With Minimum Cost Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3010_divide_an_array_into_subarrays_with_minimum_cost_i
Find Beautiful Indices in the Given Array IIhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3008_find_beautiful_indices_in_the_given_array_ii
Maximum Number That Sum of the Prices Is Less Than or Equal to Khttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3007_maximum_number_that_sum_of_the_prices_is_less_than_or_equal_to_k
Find Beautiful Indices in the Given Array Ihttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3006_find_beautiful_indices_in_the_given_array_i
Count Elements With Maximum Frequencyhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3005_count_elements_with_maximum_frequency
Maximize the Number of Partitions After Operationshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3003_maximize_the_number_of_partitions_after_operations
Maximum Size of a Set After Removalshttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3002_maximum_size_of_a_set_after_removals
Minimum Moves to Capture The Queenhttps://leetcode-in-java.github.io/src/main/java/g3001_3100/s3001_minimum_moves_to_capture_the_queen
Maximum Area of Longest Diagonal Rectanglehttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s3000_maximum_area_of_longest_diagonal_rectangle
Count the Number of Powerful Integershttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2999_count_the_number_of_powerful_integers
Minimum Number of Operations to Make X and Y Equalhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2998_minimum_number_of_operations_to_make_x_and_y_equal
Minimum Number of Operations to Make Array XOR Equal to Khttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2997_minimum_number_of_operations_to_make_array_xor_equal_to_k
Smallest Missing Integer Greater Than Sequential Prefix Sumhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2996_smallest_missing_integer_greater_than_sequential_prefix_sum
Palindrome Rearrangement Querieshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2983_palindrome_rearrangement_queries
Find Longest Special Substring That Occurs Thrice IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2982_find_longest_special_substring_that_occurs_thrice_ii
Find Longest Special Substring That Occurs Thrice Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2981_find_longest_special_substring_that_occurs_thrice_i
Check if Bitwise OR Has Trailing Zeroshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2980_check_if_bitwise_or_has_trailing_zeros
Minimum Cost to Convert String IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2977_minimum_cost_to_convert_string_ii
Minimum Cost to Convert String Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2976_minimum_cost_to_convert_string_i
Maximum Square Area by Removing Fences From a Fieldhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2975_maximum_square_area_by_removing_fences_from_a_field
Minimum Number Gamehttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2974_minimum_number_game
Find Number of Coins to Place in Tree Nodeshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2973_find_number_of_coins_to_place_in_tree_nodes
Count the Number of Incremovable Subarrays IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2972_count_the_number_of_incremovable_subarrays_ii
Find Polygon With the Largest Perimeterhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2971_find_polygon_with_the_largest_perimeter
Count the Number of Incremovable Subarrays Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2970_count_the_number_of_incremovable_subarrays_i
Apply Operations to Maximize Frequency Scorehttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2968_apply_operations_to_maximize_frequency_score
Minimum Cost to Make Array Equalindromichttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2967_minimum_cost_to_make_array_equalindromic
Divide Array Into Arrays With Max Differencehttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2966_divide_array_into_arrays_with_max_difference
Find Missing and Repeated Valueshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2965_find_missing_and_repeated_values
Count the Number of Good Partitionshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2963_count_the_number_of_good_partitions
Count Subarrays Where Max Element Appears at Least K Timeshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2962_count_subarrays_where_max_element_appears_at_least_k_times
Double Modular Exponentiationhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2961_double_modular_exponentiation
Count Tested Devices After Test Operationshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2960_count_tested_devices_after_test_operations
Number of Possible Sets of Closing Brancheshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2959_number_of_possible_sets_of_closing_branches
Length of Longest Subarray With at Most K Frequencyhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2958_length_of_longest_subarray_with_at_most_k_frequency
Remove Adjacent Almost-Equal Charactershttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2957_remove_adjacent_almost_equal_characters
Find Common Elements Between Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2956_find_common_elements_between_two_arrays
Count the Number of Infection Sequenceshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2954_count_the_number_of_infection_sequences
Count Complete Substringshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2953_count_complete_substrings
Minimum Number of Coins to be Addedhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2952_minimum_number_of_coins_to_be_added
Find the Peakshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2951_find_the_peaks
Count Beautiful Substrings IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2949_count_beautiful_substrings_ii
Make Lexicographically Smallest Array by Swapping Elementshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2948_make_lexicographically_smallest_array_by_swapping_elements
Count Beautiful Substrings Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2947_count_beautiful_substrings_i
Matrix Similarity After Cyclic Shiftshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2946_matrix_similarity_after_cyclic_shifts
Find Maximum Non-decreasing Array Lengthhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2945_find_maximum_non_decreasing_array_length
Minimum Number of Coins for Fruitshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2944_minimum_number_of_coins_for_fruits
Maximize Area of Square Hole in Gridhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2943_maximize_area_of_square_hole_in_grid
Find Words Containing Characterhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2942_find_words_containing_character
Find Building Where Alice and Bob Can Meethttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2940_find_building_where_alice_and_bob_can_meet
Maximum Xor Producthttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2939_maximum_xor_product
Separate Black and White Ballshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2938_separate_black_and_white_balls
Make Three Strings Equalhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2937_make_three_strings_equal
Maximum Strong Pair XOR IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2935_maximum_strong_pair_xor_ii
Minimum Operations to Maximize Last Elements in Arrayshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2934_minimum_operations_to_maximize_last_elements_in_arrays
High-Access Employeeshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2933_high_access_employees
Maximum Strong Pair XOR Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2932_maximum_strong_pair_xor_i
Maximum Spending After Buying Itemshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2931_maximum_spending_after_buying_items
Number of Strings Which Can Be Rearranged to Contain Substringhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2930_number_of_strings_which_can_be_rearranged_to_contain_substring
Distribute Candies Among Children IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2929_distribute_candies_among_children_ii
Distribute Candies Among Children Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2928_distribute_candies_among_children_i
Maximum Balanced Subsequence Sumhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2926_maximum_balanced_subsequence_sum
Maximum Score After Applying Operations on a Treehttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2925_maximum_score_after_applying_operations_on_a_tree
Find Champion IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2924_find_champion_ii
Find Champion Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2923_find_champion_i
Maximum Points After Collecting Coins From All Nodeshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2920_maximum_points_after_collecting_coins_from_all_nodes
Minimum Increment Operations to Make Array Beautifulhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2919_minimum_increment_operations_to_make_array_beautiful
Minimum Equal Sum of Two Arrays After Replacing Zeroshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2918_minimum_equal_sum_of_two_arrays_after_replacing_zeros
Find the K-or of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2917_find_the_k_or_of_an_array
Subarrays Distinct Element Sum of Squares IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2916_subarrays_distinct_element_sum_of_squares_ii
Length of the Longest Subsequence That Sums to Targethttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2915_length_of_the_longest_subsequence_that_sums_to_target
Minimum Number of Changes to Make Binary String Beautifulhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2914_minimum_number_of_changes_to_make_binary_string_beautiful
Subarrays Distinct Element Sum of Squares Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2913_subarrays_distinct_element_sum_of_squares_i
Minimum Changes to Make K Semi-palindromeshttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2911_minimum_changes_to_make_k_semi_palindromes
Minimum Number of Groups to Create a Valid Assignmenthttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2910_minimum_number_of_groups_to_create_a_valid_assignment
Minimum Sum of Mountain Triplets IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2909_minimum_sum_of_mountain_triplets_ii
Minimum Sum of Mountain Triplets Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2908_minimum_sum_of_mountain_triplets_i
Construct Product Matrixhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2906_construct_product_matrix
Find Indices With Index and Value Difference IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2905_find_indices_with_index_and_value_difference_ii
Shortest and Lexicographically Smallest Beautiful Stringhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2904_shortest_and_lexicographically_smallest_beautiful_string
Find Indices With Index and Value Difference Ihttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2903_find_indices_with_index_and_value_difference_i
Count of Sub-Multisets With Bounded Sumhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2902_count_of_sub_multisets_with_bounded_sum
Longest Unequal Adjacent Groups Subsequence IIhttps://leetcode-in-java.github.io/src/main/java/g2901_3000/s2901_longest_unequal_adjacent_groups_subsequence_ii
Longest Unequal Adjacent Groups Subsequence Ihttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2900_longest_unequal_adjacent_groups_subsequence_i
Last Visited Integershttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2899_last_visited_integers
Apply Operations on Array to Maximize Sum of Squareshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2897_apply_operations_on_array_to_maximize_sum_of_squares
Apply Operations to Make Two Strings Equalhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2896_apply_operations_to_make_two_strings_equal
Minimum Processing Timehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2895_minimum_processing_time
Divisible and Non-divisible Sums Differencehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2894_divisible_and_non_divisible_sums_difference
Method Chaininghttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2891_method_chaining
Reshape Data: Melthttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2890_reshape_data_melt
Reshape Data: Pivothttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2889_reshape_data_pivot
Reshape Data: Concatenatehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2888_reshape_data_concatenate
Fill Missing Datahttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2887_fill_missing_data
Change Data Typehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2886_change_data_type
Rename Columnshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2885_rename_columns
Modify Columnshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2884_modify_columns
Drop Missing Datahttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2883_drop_missing_data
Drop Duplicate Rowshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2882_drop_duplicate_rows
Create a New Columnhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2881_create_a_new_column
Select Datahttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2880_select_data
Display the First Three Rowshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2879_display_the_first_three_rows
Get the Size of a DataFramehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2878_get_the_size_of_a_dataframe
Create a DataFrame from Listhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2877_create_a_dataframe_from_list
Count Visited Nodes in a Directed Graphhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2876_count_visited_nodes_in_a_directed_graph
Minimum Size Subarray in Infinite Arrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2875_minimum_size_subarray_in_infinite_array
Maximum Value of an Ordered Triplet IIhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2874_maximum_value_of_an_ordered_triplet_ii
Maximum Value of an Ordered Triplet Ihttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2873_maximum_value_of_an_ordered_triplet_i
Maximum Number of K-Divisible Componentshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2872_maximum_number_of_k_divisible_components
Split Array Into Maximum Number of Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2871_split_array_into_maximum_number_of_subarrays
Minimum Number of Operations to Make Array Emptyhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2870_minimum_number_of_operations_to_make_array_empty
Minimum Operations to Collect Elementshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2869_minimum_operations_to_collect_elements
Count Valid Paths in a Treehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2867_count_valid_paths_in_a_tree
Beautiful Towers IIhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2866_beautiful_towers_ii
Beautiful Towers Ihttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2865_beautiful_towers_i
Maximum Odd Binary Numberhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2864_maximum_odd_binary_number
Maximum Element-Sum of a Complete Subset of Indiceshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2862_maximum_element_sum_of_a_complete_subset_of_indices
Maximum Number of Alloyshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2861_maximum_number_of_alloys
Happy Studentshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2860_happy_students
Sum of Values at Indices With K Set Bitshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2859_sum_of_values_at_indices_with_k_set_bits
Minimum Edge Reversals So Every Node Is Reachablehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2858_minimum_edge_reversals_so_every_node_is_reachable
Count Pairs of Points With Distance khttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2857_count_pairs_of_points_with_distance_k
Minimum Array Length After Pair Removalshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2856_minimum_array_length_after_pair_removals
Minimum Right Shifts to Sort the Arrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2855_minimum_right_shifts_to_sort_the_array
String Transformationhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2851_string_transformation
Minimum Moves to Spread Stones Over Gridhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2850_minimum_moves_to_spread_stones_over_grid
Determine if a Cell Is Reachable at a Given Timehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2849_determine_if_a_cell_is_reachable_at_a_given_time
Points That Intersect With Carshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2848_points_that_intersect_with_cars
Minimum Edge Weight Equilibrium Queries in a Treehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2846_minimum_edge_weight_equilibrium_queries_in_a_tree
Count of Interesting Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2845_count_of_interesting_subarrays
Minimum Operations to Make a Special Numberhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2844_minimum_operations_to_make_a_special_number
Count Symmetric Integershttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2843_count_symmetric_integers
Count K-Subsequences of a String With Maximum Beautyhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2842_count_k_subsequences_of_a_string_with_maximum_beauty
Maximum Sum of Almost Unique Subarrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2841_maximum_sum_of_almost_unique_subarray
Check if Strings Can be Made Equal With Operations IIhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2840_check_if_strings_can_be_made_equal_with_operations_ii
Check if Strings Can be Made Equal With Operations Ihttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2839_check_if_strings_can_be_made_equal_with_operations_i
Maximize Value of Function in a Ball Passing Gamehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2836_maximize_value_of_function_in_a_ball_passing_game
Minimum Operations to Form Subsequence With Target Sumhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2835_minimum_operations_to_form_subsequence_with_target_sum
Find the Minimum Possible Sum of a Beautiful Arrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2834_find_the_minimum_possible_sum_of_a_beautiful_array
Furthest Point From Originhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2833_furthest_point_from_origin
Find the Longest Equal Subarrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2831_find_the_longest_equal_subarray
Maximize the Profit as the Salesmanhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2830_maximize_the_profit_as_the_salesman
Determine the Minimum Sum of a k-avoiding Arrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2829_determine_the_minimum_sum_of_a_k_avoiding_array
Check if a String Is an Acronym of Wordshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2828_check_if_a_string_is_an_acronym_of_words
Number of Beautiful Integers in the Rangehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2827_number_of_beautiful_integers_in_the_range
Sorting Three Groupshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2826_sorting_three_groups
Make String a Subsequence Using Cyclic Incrementshttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2825_make_string_a_subsequence_using_cyclic_increments
Count Pairs Whose Sum is Less than Targethttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2824_count_pairs_whose_sum_is_less_than_target
Apply Operations to Maximize Scorehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2818_apply_operations_to_maximize_score
Minimum Absolute Difference Between Elements With Constrainthttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2817_minimum_absolute_difference_between_elements_with_constraint
Double a Number Represented as a Linked Listhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2816_double_a_number_represented_as_a_linked_list
Max Pair Sum in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2815_max_pair_sum_in_an_array
Maximum Elegance of a K-Length Subsequencehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2813_maximum_elegance_of_a_k_length_subsequence
Find the Safest Path in a Gridhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2812_find_the_safest_path_in_a_grid
Check if it is Possible to Split Arrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2811_check_if_it_is_possible_to_split_array
Faulty Keyboardhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2810_faulty_keyboard
Minimum Time to Make Array Sum At Most xhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2809_minimum_time_to_make_array_sum_at_most_x
Minimum Seconds to Equalize a Circular Arrayhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2808_minimum_seconds_to_equalize_a_circular_array
Insert Greatest Common Divisors in Linked Listhttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2807_insert_greatest_common_divisors_in_linked_list
Account Balance After Rounded Purchasehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2806_account_balance_after_rounded_purchase
Count Stepping Numbers in Rangehttps://leetcode-in-java.github.io/src/main/java/g2801_2900/s2801_count_stepping_numbers_in_range
Shortest String That Contains Three Stringshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2800_shortest_string_that_contains_three_strings
Count Complete Subarrays in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2799_count_complete_subarrays_in_an_array
Number of Employees Who Met the Targethttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2798_number_of_employees_who_met_the_target
Count Paths That Can Form a Palindrome in a Treehttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2791_count_paths_that_can_form_a_palindrome_in_a_tree
Maximum Number of Groups With Increasing Lengthhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2790_maximum_number_of_groups_with_increasing_length
Largest Element in an Array after Merge Operationshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2789_largest_element_in_an_array_after_merge_operations
Split Strings by Separatorhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2788_split_strings_by_separator
Ways to Express an Integer as Sum of Powershttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2787_ways_to_express_an_integer_as_sum_of_powers
Visit Array Positions to Maximize Scorehttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2786_visit_array_positions_to_maximize_score
Sort Vowels in a Stringhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2785_sort_vowels_in_a_string
Check if Array is Goodhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2784_check_if_array_is_good
Length of the Longest Valid Substringhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2781_length_of_the_longest_valid_substring
Minimum Index of a Valid Splithttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2780_minimum_index_of_a_valid_split
Maximum Beauty of an Array After Applying Operationhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2779_maximum_beauty_of_an_array_after_applying_operation
Sum of Squares of Special Elementshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2778_sum_of_squares_of_special_elements
Apply Operations to Make All Array Elements Equal to Zerohttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2772_apply_operations_to_make_all_array_elements_equal_to_zero
Longest Non-decreasing Subarray From Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2771_longest_non_decreasing_subarray_from_two_arrays
Maximum Number of Jumps to Reach the Last Indexhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2770_maximum_number_of_jumps_to_reach_the_last_index
Find the Maximum Achievable Numberhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2769_find_the_maximum_achievable_number
Number of Black Blockshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2768_number_of_black_blocks
Partition String Into Minimum Beautiful Substringshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2767_partition_string_into_minimum_beautiful_substrings
Relocate Marbleshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2766_relocate_marbles
Longest Alternating Subarrayhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2765_longest_alternating_subarray
Sum of Imbalance Numbers of All Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2763_sum_of_imbalance_numbers_of_all_subarrays
Continuous Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2762_continuous_subarrays
Prime Pairs With Target Sumhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2761_prime_pairs_with_target_sum
Longest Even Odd Subarray With Thresholdhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2760_longest_even_odd_subarray_with_threshold
Robot Collisionshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2751_robot_collisions
Ways to Split Array Into Good Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2750_ways_to_split_array_into_good_subarrays
Minimum Operations to Make the Integer Zerohttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2749_minimum_operations_to_make_the_integer_zero
Number of Beautiful Pairshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2748_number_of_beautiful_pairs
Count Zero Request Servershttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2747_count_zero_request_servers
Decremental String Concatenationhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2746_decremental_string_concatenation
Construct the Longest New Stringhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2745_construct_the_longest_new_string
Find Maximum Number of String Pairshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2744_find_maximum_number_of_string_pairs
Painting the Wallshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2742_painting_the_walls
Special Permutationshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2741_special_permutations
Find the Value of the Partitionhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2740_find_the_value_of_the_partition
Total Distance Traveledhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2739_total_distance_traveled
Maximum Sum Querieshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2736_maximum_sum_queries
Collecting Chocolateshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2735_collecting_chocolates
Lexicographically Smallest String After Substring Operationhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2734_lexicographically_smallest_string_after_substring_operation
Neither Minimum nor Maximumhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2733_neither_minimum_nor_maximum
Find a Good Subset of the Matrixhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2732_find_a_good_subset_of_the_matrix
Movement of Robotshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2731_movement_of_robots
Find the Longest Semi-Repetitive Substringhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2730_find_the_longest_semi_repetitive_substring
Check if The Number is Fascinatinghttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2729_check_if_the_number_is_fascinating
Is Object Emptyhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2727_is_object_empty
Calculator with Method Chaininghttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2726_calculator_with_method_chaining
Interval Cancellationhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2725_interval_cancellation
Sort Byhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2724_sort_by
Add Two Promiseshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2723_add_two_promises
Join Two Arrays by IDhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2722_join_two_arrays_by_id
Execute Asynchronous Functions in Parallelhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2721_execute_asynchronous_functions_in_parallel
Count of Integershttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2719_count_of_integers
Sum of Matrix After Querieshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2718_sum_of_matrix_after_queries
Semi-Ordered Permutationhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2717_semi_ordered_permutation
Minimize String Lengthhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2716_minimize_string_length
Timeout Cancellationhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2715_timeout_cancellation
Maximum Strictly Increasing Cells in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2713_maximum_strictly_increasing_cells_in_a_matrix
Minimum Cost to Make All Characters Equalhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2712_minimum_cost_to_make_all_characters_equal
Difference of Number of Distinct Values on Diagonalshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2711_difference_of_number_of_distinct_values_on_diagonals
Remove Trailing Zeros From a Stringhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2710_remove_trailing_zeros_from_a_string
Greatest Common Divisor Traversalhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2709_greatest_common_divisor_traversal
Maximum Strength of a Grouphttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2708_maximum_strength_of_a_group
Extra Characters in a Stringhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2707_extra_characters_in_a_string
Buy Two Chocolateshttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2706_buy_two_chocolates
Compact Objecthttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2705_compact_object
To Be Or Not To Behttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2704_to_be_or_not_to_be
Return Length of Arguments Passedhttps://leetcode-in-java.github.io/src/main/java/g2701_2800/s2703_return_length_of_arguments_passed
Modify Graph Edge Weightshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2699_modify_graph_edge_weights
Find the Punishment Number of an Integerhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2698_find_the_punishment_number_of_an_integer
Lexicographically Smallest Palindromehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2697_lexicographically_smallest_palindrome
Minimum String Length After Removing Substringshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2696_minimum_string_length_after_removing_substrings
Array Wrapperhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2695_array_wrapper
Event Emitterhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2694_event_emitter
Call Function with Custom Contexthttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2693_call_function_with_custom_context
Count the Number of Complete Componentshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2685_count_the_number_of_complete_components
Maximum Number of Moves in a Gridhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2684_maximum_number_of_moves_in_a_grid
Neighboring Bitwise XORhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2683_neighboring_bitwise_xor
Find the Losers of the Circular Gamehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2682_find_the_losers_of_the_circular_game
Power of Heroeshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2681_power_of_heroes
Maximum ORhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2680_maximum_or
Sum in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2679_sum_in_a_matrix
Number of Senior Citizenshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2678_number_of_senior_citizens
Chunk Arrayhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2677_chunk_array
Make Costs of Paths Equal in a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2673_make_costs_of_paths_equal_in_a_binary_tree
Number of Adjacent Elements With the Same Colorhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2672_number_of_adjacent_elements_with_the_same_color
Frequency Trackerhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2671_frequency_tracker
Find the Distinct Difference Arrayhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2670_find_the_distinct_difference_array
Create Hello World Functionhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2667_create_hello_world_function
Allow One Function Callhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2666_allow_one_function_call
Counter IIhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2665_counter_ii
Lexicographically Smallest Beautiful Stringhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2663_lexicographically_smallest_beautiful_string
Minimum Cost of a Path With Special Roadshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2662_minimum_cost_of_a_path_with_special_roads
First Completely Painted Row or Columnhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2661_first_completely_painted_row_or_column
Determine the Winner of a Bowling Gamehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2660_determine_the_winner_of_a_bowling_game
Make Array Emptyhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2659_make_array_empty
Maximum Number of Fish in a Gridhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2658_maximum_number_of_fish_in_a_grid
Find the Prefix Common Array of Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2657_find_the_prefix_common_array_of_two_arrays
Maximum Sum With Exactly K Elementshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2656_maximum_sum_with_exactly_k_elements
Minimum Number of Operations to Make All Array Elements Equal to 1https://leetcode-in-java.github.io/src/main/java/g2601_2700/s2654_minimum_number_of_operations_to_make_all_array_elements_equal_to_1
Sliding Subarray Beautyhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2653_sliding_subarray_beauty
Sum Multipleshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2652_sum_multiples
Calculate Delayed Arrival Timehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2651_calculate_delayed_arrival_time
Design Cancellable Functionhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2650_design_cancellable_function
Nested Array Generatorhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2649_nested_array_generator
Generate Fibonacci Sequencehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2648_generate_fibonacci_sequence
Minimize the Total Price of the Tripshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2646_minimize_the_total_price_of_the_trips
Minimum Additions to Make Valid Stringhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2645_minimum_additions_to_make_valid_string
Find the Maximum Divisibility Scorehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2644_find_the_maximum_divisibility_score
Row With Maximum Oneshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2643_row_with_maximum_ones
Design Graph With Shortest Path Calculatorhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2642_design_graph_with_shortest_path_calculator
Cousins in Binary Tree IIhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2641_cousins_in_binary_tree_ii
Find the Score of All Prefixes of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2640_find_the_score_of_all_prefixes_of_an_array
Find the Width of Columns of a Gridhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2639_find_the_width_of_columns_of_a_grid
Promise Time Limithttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2637_promise_time_limit
Apply Transform Over Each Element in Arrayhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2635_apply_transform_over_each_element_in_array
Filter Elements from Arrayhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2634_filter_elements_from_array
Group Byhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2631_group_by
Memoize IIhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2630_memoize_ii
Function Compositionhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2629_function_composition
Debouncehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2627_debounce
Array Reduce Transformationhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2626_array_reduce_transformation
Flatten Deeply Nested Arrayhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2625_flatten_deeply_nested_array
Snail Traversalhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2624_snail_traversal
Memoizehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2623_memoize
Cache With Time Limithttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2622_cache_with_time_limit
Sleephttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2621_sleep
Counterhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2620_counter
Array Prototype Lasthttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2619_array_prototype_last
Check if Object Instance of Classhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2618_check_if_object_instance_of_class
Minimum Number of Visited Cells in a Gridhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2617_minimum_number_of_visited_cells_in_a_grid
Minimize the Maximum Difference of Pairshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2616_minimize_the_maximum_difference_of_pairs
Sum of Distanceshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2615_sum_of_distances
Prime In Diagonalhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2614_prime_in_diagonal
Minimum Reverse Operationshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2612_minimum_reverse_operations
Mice and Cheesehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2611_mice_and_cheese
Convert an Array Into a 2D Array With Conditionshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2610_convert_an_array_into_a_2d_array_with_conditions
Find the Longest Balanced Substring of a Binary Stringhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2609_find_the_longest_balanced_substring_of_a_binary_string
Shortest Cycle in a Graphhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2608_shortest_cycle_in_a_graph
Make K-Subarray Sums Equalhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2607_make_k_subarray_sums_equal
Find the Substring With Maximum Costhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2606_find_the_substring_with_maximum_cost
Form Smallest Number From Two Digit Arrayshttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2605_form_smallest_number_from_two_digit_arrays
Collect Coins in a Treehttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2603_collect_coins_in_a_tree
Minimum Operations to Make All Array Elements Equalhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2602_minimum_operations_to_make_all_array_elements_equal
Prime Subtraction Operationhttps://leetcode-in-java.github.io/src/main/java/g2601_2700/s2601_prime_subtraction_operation
K Items With the Maximum Sumhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2600_k_items_with_the_maximum_sum
Smallest Missing Non-negative Integer After Operationshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2598_smallest_missing_non_negative_integer_after_operations
The Number of Beautiful Subsetshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2597_the_number_of_beautiful_subsets
Check Knight Tour Configurationhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2596_check_knight_tour_configuration
Number of Even and Odd Bitshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2595_number_of_even_and_odd_bits
Minimum Time to Repair Carshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2594_minimum_time_to_repair_cars
Find Score of an Array After Marking All Elementshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2593_find_score_of_an_array_after_marking_all_elements
Maximize Greatness of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2592_maximize_greatness_of_an_array
Distribute Money to Maximum Childrenhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2591_distribute_money_to_maximum_children
Minimum Time to Complete All Taskshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2589_minimum_time_to_complete_all_tasks
Count the Number of Beautiful Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2588_count_the_number_of_beautiful_subarrays
Rearrange Array to Maximize Prefix Scorehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2587_rearrange_array_to_maximize_prefix_score
Count the Number of Vowel Strings in Rangehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2586_count_the_number_of_vowel_strings_in_range
Number of Ways to Earn Pointshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2585_number_of_ways_to_earn_points
Split the Array to Make Coprime Productshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2584_split_the_array_to_make_coprime_products
Kth Largest Sum in a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2583_kth_largest_sum_in_a_binary_tree
Pass the Pillowhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2582_pass_the_pillow
Count Number of Possible Root Nodeshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2581_count_number_of_possible_root_nodes
Count Ways to Group Overlapping Rangeshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2580_count_ways_to_group_overlapping_ranges
Count Total Number of Colored Cellshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2579_count_total_number_of_colored_cells
Split With Minimum Sumhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2578_split_with_minimum_sum
Minimum Time to Visit a Cell In a Gridhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2577_minimum_time_to_visit_a_cell_in_a_grid
Find the Maximum Number of Marked Indiceshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2576_find_the_maximum_number_of_marked_indices
Find the Divisibility Array of a Stringhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2575_find_the_divisibility_array_of_a_string
Left and Right Sum Differenceshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2574_left_and_right_sum_differences
Find the String with LCPhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2573_find_the_string_with_lcp
Count the Number of Square-Free Subsetshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2572_count_the_number_of_square_free_subsets
Minimum Operations to Reduce an Integer to 0https://leetcode-in-java.github.io/src/main/java/g2501_2600/s2571_minimum_operations_to_reduce_an_integer_to_0
Merge Two 2D Arrays by Summing Valueshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2570_merge_two_2d_arrays_by_summing_values
Handling Sum Queries After Updatehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2569_handling_sum_queries_after_update
Minimum Impossible ORhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2568_minimum_impossible_or
Minimum Score by Changing Two Elementshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2567_minimum_score_by_changing_two_elements
Maximum Difference by Remapping a Digithttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2566_maximum_difference_by_remapping_a_digit
Subsequence With the Minimum Scorehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2565_subsequence_with_the_minimum_score
Substring XOR Querieshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2564_substring_xor_queries
Count the Number of Fair Pairshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2563_count_the_number_of_fair_pairs
Find the Array Concatenation Valuehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2562_find_the_array_concatenation_value
Rearranging Fruitshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2561_rearranging_fruits
House Robber IVhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2560_house_robber_iv
Count Vowel Strings in Rangeshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2559_count_vowel_strings_in_ranges
Take Gifts From the Richest Pilehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2558_take_gifts_from_the_richest_pile
Disconnect Path in a Binary Matrix by at Most One Fliphttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2556_disconnect_path_in_a_binary_matrix_by_at_most_one_flip
Maximize Win From Two Segmentshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2555_maximize_win_from_two_segments
Maximum Number of Integers to Choose From a Range Ihttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2554_maximum_number_of_integers_to_choose_from_a_range_i
Separate the Digits in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2553_separate_the_digits_in_an_array
Count Increasing Quadrupletshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2552_count_increasing_quadruplets
Put Marbles in Bagshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2551_put_marbles_in_bags
Count Collisions of Monkeys on a Polygonhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2550_count_collisions_of_monkeys_on_a_polygon
Count Distinct Numbers on Boardhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2549_count_distinct_numbers_on_board
Minimum Cost to Split an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2547_minimum_cost_to_split_an_array
Apply Bitwise Operations to Make Strings Equalhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2546_apply_bitwise_operations_to_make_strings_equal
Sort the Students by Their Kth Scorehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2545_sort_the_students_by_their_kth_score
Alternating Digit Sumhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2544_alternating_digit_sum
Check if Point Is Reachablehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2543_check_if_point_is_reachable
Maximum Subsequence Scorehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2542_maximum_subsequence_score
Minimum Operations to Make Array Equal IIhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2541_minimum_operations_to_make_array_equal_ii
Minimum Common Valuehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2540_minimum_common_value
Difference Between Maximum and Minimum Price Sumhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2538_difference_between_maximum_and_minimum_price_sum
Count the Number of Good Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2537_count_the_number_of_good_subarrays
Increment Submatrices by Onehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2536_increment_submatrices_by_one
Difference Between Element Sum and Digit Sum of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2535_difference_between_element_sum_and_digit_sum_of_an_array
Time to Cross a Bridgehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2532_time_to_cross_a_bridge
Make Number of Distinct Characters Equalhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2531_make_number_of_distinct_characters_equal
Maximal Score After Applying K Operationshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2530_maximal_score_after_applying_k_operations
Maximum Count of Positive Integer and Negative Integerhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2529_maximum_count_of_positive_integer_and_negative_integer
Maximize the Minimum Powered Cityhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2528_maximize_the_minimum_powered_city
Find Xor-Beauty of Arrayhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2527_find_xor_beauty_of_array
Find Consecutive Integers from a Data Streamhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2526_find_consecutive_integers_from_a_data_stream
Categorize Box According to Criteriahttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2525_categorize_box_according_to_criteria
Closest Prime Numbers in Rangehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2523_closest_prime_numbers_in_range
Partition String Into Substrings With Values at Most Khttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2522_partition_string_into_substrings_with_values_at_most_k
Distinct Prime Factors of Product of Arrayhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2521_distinct_prime_factors_of_product_of_array
Count the Digits That Divide a Numberhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2520_count_the_digits_that_divide_a_number
Number of Great Partitionshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2518_number_of_great_partitions
Maximum Tastiness of Candy Baskethttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2517_maximum_tastiness_of_candy_basket
Take K of Each Character From Left and Righthttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2516_take_k_of_each_character_from_left_and_right
Shortest Distance to Target String in a Circular Arrayhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2515_shortest_distance_to_target_string_in_a_circular_array
Count Anagramshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2514_count_anagrams
Minimize the Maximum of Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2513_minimize_the_maximum_of_two_arrays
Reward Top K Studentshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2512_reward_top_k_students
Maximum Enemy Forts That Can Be Capturedhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2511_maximum_enemy_forts_that_can_be_captured
Cycle Length Queries in a Treehttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2509_cycle_length_queries_in_a_tree
Add Edges to Make Degrees of All Nodes Evenhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2508_add_edges_to_make_degrees_of_all_nodes_even
Smallest Value After Replacing With Sum of Prime Factorshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2507_smallest_value_after_replacing_with_sum_of_prime_factors
Count Pairs Of Similar Stringshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2506_count_pairs_of_similar_strings
Maximum Number of Points From Grid Querieshttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2503_maximum_number_of_points_from_grid_queries
Design Memory Allocatorhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2502_design_memory_allocator
Longest Square Streak in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2501_2600/s2501_longest_square_streak_in_an_array
Delete Greatest Value in Each Rowhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2500_delete_greatest_value_in_each_row
Minimum Total Cost to Make Arrays Unequalhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2499_minimum_total_cost_to_make_arrays_unequal
Frog Jump IIhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2498_frog_jump_ii
Maximum Star Sum of a Graphhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2497_maximum_star_sum_of_a_graph
Maximum Value of a String in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2496_maximum_value_of_a_string_in_an_array
Divide Nodes Into the Maximum Number of Groupshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2493_divide_nodes_into_the_maximum_number_of_groups
Minimum Score of a Path Between Two Citieshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2492_minimum_score_of_a_path_between_two_cities
Divide Players Into Teams of Equal Skillhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2491_divide_players_into_teams_of_equal_skill
Circular Sentencehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2490_circular_sentence
Count Subarrays With Median Khttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2488_count_subarrays_with_median_k
Remove Nodes From Linked Listhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2487_remove_nodes_from_linked_list
Append Characters to String to Make Subsequencehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2486_append_characters_to_string_to_make_subsequence
Find the Pivot Integerhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2485_find_the_pivot_integer
Count Palindromic Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2484_count_palindromic_subsequences
Minimum Penalty for a Shophttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2483_minimum_penalty_for_a_shop
Difference Between Ones and Zeros in Row and Columnhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2482_difference_between_ones_and_zeros_in_row_and_column
Minimum Cuts to Divide a Circlehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2481_minimum_cuts_to_divide_a_circle
Number of Beautiful Partitionshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2478_number_of_beautiful_partitions
Minimum Fuel Cost to Report to the Capitalhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2477_minimum_fuel_cost_to_report_to_the_capital
Closest Nodes Queries in a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2476_closest_nodes_queries_in_a_binary_search_tree
Number of Unequal Triplets in Arrayhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2475_number_of_unequal_triplets_in_array
Maximum Number of Non-overlapping Palindrome Substringshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2472_maximum_number_of_non_overlapping_palindrome_substrings
Minimum Number of Operations to Sort a Binary Tree by Levelhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level
Number of Subarrays With LCM Equal to Khttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2470_number_of_subarrays_with_lcm_equal_to_k
Convert the Temperaturehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2469_convert_the_temperature
Split Message Based on Limithttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2468_split_message_based_on_limit
Most Profitable Path in a Treehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2467_most_profitable_path_in_a_tree
Count Ways To Build Good Stringshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2466_count_ways_to_build_good_strings
Number of Distinct Averageshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2465_number_of_distinct_averages
Minimum Total Distance Traveledhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2463_minimum_total_distance_traveled
Total Cost to Hire K Workershttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2462_total_cost_to_hire_k_workers
Maximum Sum of Distinct Subarrays With Length Khttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2461_maximum_sum_of_distinct_subarrays_with_length_k
Apply Operations to an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2460_apply_operations_to_an_array
Height of Binary Tree After Subtree Removal Querieshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2458_height_of_binary_tree_after_subtree_removal_queries
Minimum Addition to Make Integer Beautifulhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2457_minimum_addition_to_make_integer_beautiful
Most Popular Video Creatorhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2456_most_popular_video_creator
Average Value of Even Numbers That Are Divisible by Threehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2455_average_value_of_even_numbers_that_are_divisible_by_three
Next Greater Element IVhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2454_next_greater_element_iv
Destroy Sequential Targetshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2453_destroy_sequential_targets
Words Within Two Edits of Dictionaryhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2452_words_within_two_edits_of_dictionary
Odd String Differencehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2451_odd_string_difference
Minimum Number of Operations to Make Arrays Similarhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2449_minimum_number_of_operations_to_make_arrays_similar
Minimum Cost to Make Array Equalhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2448_minimum_cost_to_make_array_equal
Number of Subarrays With GCD Equal to Khttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2447_number_of_subarrays_with_gcd_equal_to_k
Determine if Two Events Have Conflicthttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2446_determine_if_two_events_have_conflict
Count Subarrays With Fixed Boundshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2444_count_subarrays_with_fixed_bounds
Sum of Number and Its Reversehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2443_sum_of_number_and_its_reverse
Count Number of Distinct Integers After Reverse Operationshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2442_count_number_of_distinct_integers_after_reverse_operations
Largest Positive Integer That Exists With Its Negativehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2441_largest_positive_integer_that_exists_with_its_negative
Create Components With Same Valuehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2440_create_components_with_same_value
Minimize Maximum of Arrayhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2439_minimize_maximum_of_array
Range Product Queries of Powershttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2438_range_product_queries_of_powers
Number of Valid Clock Timeshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2437_number_of_valid_clock_times
Paths in Matrix Whose Sum Is Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2435_paths_in_matrix_whose_sum_is_divisible_by_k
Using a Robot to Print the Lexicographically Smallest Stringhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2434_using_a_robot_to_print_the_lexicographically_smallest_string
Find The Original Array of Prefix Xorhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2433_find_the_original_array_of_prefix_xor
The Employee That Worked on the Longest Taskhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2432_the_employee_that_worked_on_the_longest_task
Maximum Deletions on a Stringhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2430_maximum_deletions_on_a_string
Minimize XORhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2429_minimize_xor
Maximum Sum of an Hourglasshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2428_maximum_sum_of_an_hourglass
Number of Common Factorshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2427_number_of_common_factors
Number of Pairs Satisfying Inequalityhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2426_number_of_pairs_satisfying_inequality
Bitwise XOR of All Pairingshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2425_bitwise_xor_of_all_pairings
Longest Uploaded Prefixhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2424_longest_uploaded_prefix
Remove Letter To Equalize Frequencyhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2423_remove_letter_to_equalize_frequency
Number of Good Pathshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2421_number_of_good_paths
Find All Good Indiceshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2420_find_all_good_indices
Longest Subarray With Maximum Bitwise ANDhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2419_longest_subarray_with_maximum_bitwise_and
Sort the Peoplehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2418_sort_the_people
Sum of Prefix Scores of Stringshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2416_sum_of_prefix_scores_of_strings
Reverse Odd Levels of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2415_reverse_odd_levels_of_binary_tree
Length of the Longest Alphabetical Continuous Substringhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2414_length_of_the_longest_alphabetical_continuous_substring
Smallest Even Multiplehttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2413_smallest_even_multiple
Minimum Money Required Before Transactionshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2412_minimum_money_required_before_transactions
Smallest Subarrays With Maximum Bitwise ORhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2411_smallest_subarrays_with_maximum_bitwise_or
Maximum Matching of Players With Trainershttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2410_maximum_matching_of_players_with_trainers
Count Days Spent Togetherhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2409_count_days_spent_together
Longest Increasing Subsequence IIhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2407_longest_increasing_subsequence_ii
Divide Intervals Into Minimum Number of Groupshttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2406_divide_intervals_into_minimum_number_of_groups
Optimal Partition of Stringhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2405_optimal_partition_of_string
Most Frequent Even Elementhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2404_most_frequent_even_element
Meeting Rooms IIIhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2402_meeting_rooms_iii
Longest Nice Subarrayhttps://leetcode-in-java.github.io/src/main/java/g2401_2500/s2401_longest_nice_subarray
Number of Ways to Reach a Position After Exactly k Stepshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2400_number_of_ways_to_reach_a_position_after_exactly_k_steps
Check Distances Between Same Lettershttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2399_check_distances_between_same_letters
Maximum Number of Robots Within Budgethttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2398_maximum_number_of_robots_within_budget
Maximum Rows Covered by Columnshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2397_maximum_rows_covered_by_columns
Strictly Palindromic Numberhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2396_strictly_palindromic_number
Find Subarrays With Equal Sumhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2395_find_subarrays_with_equal_sum
Build a Matrix With Conditionshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2392_build_a_matrix_with_conditions
Minimum Amount of Time to Collect Garbagehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2391_minimum_amount_of_time_to_collect_garbage
Removing Stars From a Stringhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2390_removing_stars_from_a_string
Longest Subsequence With Limited Sumhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2389_longest_subsequence_with_limited_sum
Find the K-Sum of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2386_find_the_k_sum_of_an_array
Amount of Time for Binary Tree to Be Infectedhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2385_amount_of_time_for_binary_tree_to_be_infected
Largest Palindromic Numberhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2384_largest_palindromic_number
Minimum Hours of Training to Win a Competitionhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2383_minimum_hours_of_training_to_win_a_competition
Maximum Segment Sum After Removalshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2382_maximum_segment_sum_after_removals
Shifting Letters IIhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2381_shifting_letters_ii
Time Needed to Rearrange a Binary Stringhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2380_time_needed_to_rearrange_a_binary_string
Minimum Recolors to Get K Consecutive Black Blockshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2379_minimum_recolors_to_get_k_consecutive_black_blocks
Count Special Integershttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2376_count_special_integers
Construct Smallest Number From DI Stringhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2375_construct_smallest_number_from_di_string
Node With Highest Edge Scorehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2374_node_with_highest_edge_score
Largest Local Values in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2373_largest_local_values_in_a_matrix
Longest Ideal Subsequencehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2370_longest_ideal_subsequence
Check if There is a Valid Partition For The Arrayhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2369_check_if_there_is_a_valid_partition_for_the_array
Reachable Nodes With Restrictionshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2368_reachable_nodes_with_restrictions
Number of Arithmetic Tripletshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2367_number_of_arithmetic_triplets
Minimum Replacements to Sort the Arrayhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2366_minimum_replacements_to_sort_the_array
Task Scheduler IIhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2365_task_scheduler_ii
Count Number of Bad Pairshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2364_count_number_of_bad_pairs
Merge Similar Itemshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2363_merge_similar_items
Longest Cycle in a Graphhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2360_longest_cycle_in_a_graph
Find Closest Node to Given Two Nodeshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2359_find_closest_node_to_given_two_nodes
Maximum Number of Groups Entering a Competitionhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2358_maximum_number_of_groups_entering_a_competition
Make Array Zero by Subtracting Equal Amountshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2357_make_array_zero_by_subtracting_equal_amounts
Number of Unique Subjects Taught by Each Teacherhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2356_number_of_unique_subjects_taught_by_each_teacher
Number of Excellent Pairshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2354_number_of_excellent_pairs
Design a Food Rating Systemhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2353_design_a_food_rating_system
Equal Row and Column Pairshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2352_equal_row_and_column_pairs
First Letter to Appear Twicehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2351_first_letter_to_appear_twice
Shortest Impossible Sequence of Rollshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2350_shortest_impossible_sequence_of_rolls
Design a Number Container Systemhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2349_design_a_number_container_system
Number of Zero-Filled Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2348_number_of_zero_filled_subarrays
Best Poker Handhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2347_best_poker_hand
Minimum Deletions to Make Array Divisiblehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2344_minimum_deletions_to_make_array_divisible
Query Kth Smallest Trimmed Numberhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number
Max Sum of a Pair With Equal Sum of Digitshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2342_max_sum_of_a_pair_with_equal_sum_of_digits
Maximum Number of Pairs in Arrayhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2341_maximum_number_of_pairs_in_array
Count the Number of Ideal Arrayshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2338_count_the_number_of_ideal_arrays
Move Pieces to Obtain a Stringhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2337_move_pieces_to_obtain_a_string
Smallest Number in Infinite Sethttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2336_smallest_number_in_infinite_set
Minimum Amount of Time to Fill Cupshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2335_minimum_amount_of_time_to_fill_cups
Subarray With Elements Greater Than Varying Thresholdhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2334_subarray_with_elements_greater_than_varying_threshold
Minimum Sum of Squared Differencehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2333_minimum_sum_of_squared_difference
The Latest Time to Catch a Bushttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2332_the_latest_time_to_catch_a_bus
Evaluate Boolean Binary Treehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2331_evaluate_boolean_binary_tree
Number of Increasing Paths in a Gridhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2328_number_of_increasing_paths_in_a_grid
Number of People Aware of a Secrethttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2327_number_of_people_aware_of_a_secret
Spiral Matrix IVhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2326_spiral_matrix_iv
Decode the Messagehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2325_decode_the_message
Minimum Score After Removals on a Treehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2322_minimum_score_after_removals_on_a_tree
Maximum Score Of Spliced Arrayhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2321_maximum_score_of_spliced_array
Count Number of Ways to Place Houseshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2320_count_number_of_ways_to_place_houses
Check if Matrix Is X-Matrixhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2319_check_if_matrix_is_x_matrix
Number of Distinct Roll Sequenceshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2318_number_of_distinct_roll_sequences
Maximum XOR After Operationshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2317_maximum_xor_after_operations
Count Unreachable Pairs of Nodes in an Undirected Graphhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2316_count_unreachable_pairs_of_nodes_in_an_undirected_graph
Count Asteriskshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2315_count_asterisks
Selling Pieces of Woodhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2312_selling_pieces_of_wood
Longest Binary Subsequence Less Than or Equal to Khttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2311_longest_binary_subsequence_less_than_or_equal_to_k
Sum of Numbers With Units Digit Khttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2310_sum_of_numbers_with_units_digit_k
Greatest English Letter in Upper and Lower Casehttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2309_greatest_english_letter_in_upper_and_lower_case
Naming a Companyhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2306_naming_a_company
Fair Distribution of Cookieshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2305_fair_distribution_of_cookies
Minimum Path Cost in a Gridhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2304_minimum_path_cost_in_a_grid
Calculate Amount Paid in Taxeshttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2303_calculate_amount_paid_in_taxes
Count Subarrays With Score Less Than Khttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2302_count_subarrays_with_score_less_than_k
Match Substring After Replacementhttps://leetcode-in-java.github.io/src/main/java/g2301_2400/s2301_match_substring_after_replacement
Successful Pairs of Spells and Potionshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2300_successful_pairs_of_spells_and_potions
Strong Password Checker IIhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2299_strong_password_checker_ii
Design a Text Editorhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2296_design_a_text_editor
Replace Elements in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2295_replace_elements_in_an_array
Partition Array Such That Maximum Difference Is Khttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2294_partition_array_such_that_maximum_difference_is_k
Min Max Gamehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2293_min_max_game
Minimum Obstacle Removal to Reach Cornerhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2290_minimum_obstacle_removal_to_reach_corner
Steps to Make Array Non-decreasinghttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2289_steps_to_make_array_non_decreasing
Apply Discount to Priceshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2288_apply_discount_to_prices
Rearrange Characters to Make Target Stringhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2287_rearrange_characters_to_make_target_string
Booking Concert Tickets in Groupshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2286_booking_concert_tickets_in_groups
Maximum Total Importance of Roadshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2285_maximum_total_importance_of_roads
Sender With Largest Word Counthttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2284_sender_with_largest_word_count
Check if Number Has Equal Digit Count and Digit Valuehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2283_check_if_number_has_equal_digit_count_and_digit_value
Sum of Total Strength of Wizardshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2281_sum_of_total_strength_of_wizards
Minimum Lines to Represent a Line Charthttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2280_minimum_lines_to_represent_a_line_chart
Maximum Bags With Full Capacity of Rockshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2279_maximum_bags_with_full_capacity_of_rocks
Percentage of Letter in Stringhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2278_percentage_of_letter_in_string
Count Integers in Intervalshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2276_count_integers_in_intervals
Largest Combination With Bitwise AND Greater Than Zerohttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2275_largest_combination_with_bitwise_and_greater_than_zero
Maximum Consecutive Floors Without Special Floorshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2274_maximum_consecutive_floors_without_special_floors
Find Resultant Array After Removing Anagramshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2273_find_resultant_array_after_removing_anagrams
Substring With Largest Variancehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2272_substring_with_largest_variance
Maximum White Tiles Covered by a Carpethttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2271_maximum_white_tiles_covered_by_a_carpet
Number of Ways to Split Arrayhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2270_number_of_ways_to_split_array
Find the K-Beauty of a Numberhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2269_find_the_k_beauty_of_a_number
Check if There Is a Valid Parentheses String Pathhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2267_check_if_there_is_a_valid_parentheses_string_path
Count Number of Textshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2266_count_number_of_texts
Count Nodes Equal to Average of Subtreehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2265_count_nodes_equal_to_average_of_subtree
Largest 3-Same-Digit Number in Stringhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2264_largest_3_same_digit_number_in_string
Total Appeal of A Stringhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2262_total_appeal_of_a_string
K Divisible Elements Subarrayshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2261_k_divisible_elements_subarrays
Minimum Consecutive Cards to Pick Uphttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2260_minimum_consecutive_cards_to_pick_up
Remove Digit From Number to Maximize Resulthttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2259_remove_digit_from_number_to_maximize_result
Escape the Spreading Firehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2258_escape_the_spreading_fire
Count Unguarded Cells in the Gridhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2257_count_unguarded_cells_in_the_grid
Minimum Average Differencehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2256_minimum_average_difference
Count Prefixes of a Given Stringhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2255_count_prefixes_of_a_given_string
Number of Flowers in Full Bloomhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2251_number_of_flowers_in_full_bloom
Count Number of Rectangles Containing Each Pointhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2250_count_number_of_rectangles_containing_each_point
Count Lattice Points Inside a Circlehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2249_count_lattice_points_inside_a_circle
Intersection of Multiple Arrayshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2248_intersection_of_multiple_arrays
Longest Path With Different Adjacent Charactershttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2246_longest_path_with_different_adjacent_characters
Maximum Trailing Zeros in a Cornered Pathhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2245_maximum_trailing_zeros_in_a_cornered_path
Minimum Rounds to Complete All Taskshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2244_minimum_rounds_to_complete_all_tasks
Calculate Digit Sum of a Stringhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2243_calculate_digit_sum_of_a_string
Maximum Score of a Node Sequencehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2242_maximum_score_of_a_node_sequence
Design an ATM Machinehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2241_design_an_atm_machine
Number of Ways to Buy Pens and Pencilshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2240_number_of_ways_to_buy_pens_and_pencils
Find Closest Number to Zerohttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2239_find_closest_number_to_zero
Root Equals Sum of Childrenhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2236_root_equals_sum_of_children
Add Two Integershttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2235_add_two_integers
Maximum Total Beauty of the Gardenshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2234_maximum_total_beauty_of_the_gardens
Maximum Product After K Incrementshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2233_maximum_product_after_k_increments
Minimize Result by Adding Parentheses to Expressionhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2232_minimize_result_by_adding_parentheses_to_expression
Largest Number After Digit Swaps by Parityhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2231_largest_number_after_digit_swaps_by_parity
Encrypt and Decrypt Stringshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2227_encrypt_and_decrypt_strings
Maximum Candies Allocated to K Childrenhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2226_maximum_candies_allocated_to_k_children
Find Players With Zero or One Losseshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2225_find_players_with_zero_or_one_losses
Minimum Number of Operations to Convert Timehttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2224_minimum_number_of_operations_to_convert_time
Sum of Scores of Built Stringshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2223_sum_of_scores_of_built_strings
Number of Ways to Select Buildingshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2222_number_of_ways_to_select_buildings
Find Triangular Sum of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2221_find_triangular_sum_of_an_array
Minimum Bit Flips to Convert Numberhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2220_minimum_bit_flips_to_convert_number
Maximum Value of K Coins From Pileshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2218_maximum_value_of_k_coins_from_piles
Find Palindrome With Fixed Lengthhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2217_find_palindrome_with_fixed_length
Minimum Deletions to Make Array Beautifulhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2216_minimum_deletions_to_make_array_beautiful
Find the Difference of Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2215_find_the_difference_of_two_arrays
Longest Substring of One Repeating Characterhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2213_longest_substring_of_one_repeating_character
Maximum Points in an Archery Competitionhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2212_maximum_points_in_an_archery_competition
Count Collisions on a Roadhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2211_count_collisions_on_a_road
Count Hills and Valleys in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2210_count_hills_and_valleys_in_an_array
Minimum White Tiles After Covering With Carpetshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2209_minimum_white_tiles_after_covering_with_carpets
Minimum Operations to Halve Array Sumhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2208_minimum_operations_to_halve_array_sum
Maximize Number of Subsequences in a Stringhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2207_maximize_number_of_subsequences_in_a_string
Divide Array Into Equal Pairshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2206_divide_array_into_equal_pairs
Minimum Weighted Subgraph With the Required Pathshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2203_minimum_weighted_subgraph_with_the_required_paths
Maximize the Topmost Element After K Moveshttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2202_maximize_the_topmost_element_after_k_moves
Count Artifacts That Can Be Extractedhttps://leetcode-in-java.github.io/src/main/java/g2201_2300/s2201_count_artifacts_that_can_be_extracted
Find All K-Distant Indices in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2200_find_all_k_distant_indices_in_an_array
Replace Non-Coprime Numbers in Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2197_replace_non_coprime_numbers_in_array
Create Binary Tree From Descriptionshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2196_create_binary_tree_from_descriptions
Append K Integers With Minimal Sumhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2195_append_k_integers_with_minimal_sum
Cells in a Range on an Excel Sheethttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2194_cells_in_a_range_on_an_excel_sheet
Minimum Number of Moves to Make Palindromehttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2193_minimum_number_of_moves_to_make_palindrome
All Ancestors of a Node in a Directed Acyclic Graphhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2192_all_ancestors_of_a_node_in_a_directed_acyclic_graph
Sort the Jumbled Numbershttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2191_sort_the_jumbled_numbers
Most Frequent Number Following Key In an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2190_most_frequent_number_following_key_in_an_array
Minimum Time to Finish the Racehttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2188_minimum_time_to_finish_the_race
Minimum Time to Complete Tripshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2187_minimum_time_to_complete_trips
Minimum Number of Steps to Make Two Strings Anagram IIhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2186_minimum_number_of_steps_to_make_two_strings_anagram_ii
Counting Words With a Given Prefixhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2185_counting_words_with_a_given_prefix
Count Array Pairs Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2183_count_array_pairs_divisible_by_k
Construct String With Repeat Limithttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2182_construct_string_with_repeat_limit
Merge Nodes in Between Zeroshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2181_merge_nodes_in_between_zeros
Count Integers With Even Digit Sumhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2180_count_integers_with_even_digit_sum
Count Good Triplets in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2179_count_good_triplets_in_an_array
Maximum Split of Positive Even Integershttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2178_maximum_split_of_positive_even_integers
Find Three Consecutive Integers That Sum to a Given Numberhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2177_find_three_consecutive_integers_that_sum_to_a_given_number
Count Equal and Divisible Pairs in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2176_count_equal_and_divisible_pairs_in_an_array
Maximum AND Sum of Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2172_maximum_and_sum_of_array
Removing Minimum Number of Magic Beanshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2171_removing_minimum_number_of_magic_beans
Minimum Operations to Make the Array Alternatinghttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2170_minimum_operations_to_make_the_array_alternating
Count Operations to Obtain Zerohttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2169_count_operations_to_obtain_zero
Minimum Time to Remove All Cars Containing Illegal Goodshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2167_minimum_time_to_remove_all_cars_containing_illegal_goods
Design Bitsethttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2166_design_bitset
Smallest Value of the Rearranged Numberhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2165_smallest_value_of_the_rearranged_number
Sort Even and Odd Indices Independentlyhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2164_sort_even_and_odd_indices_independently
Minimum Difference in Sums After Removal of Elementshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2163_minimum_difference_in_sums_after_removal_of_elements
Minimum Cost to Set Cooking Timehttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2162_minimum_cost_to_set_cooking_time
Partition Array According to Given Pivothttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2161_partition_array_according_to_given_pivot
Minimum Sum of Four Digit Number After Splitting Digitshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2160_minimum_sum_of_four_digit_number_after_splitting_digits
Groups of Stringshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2157_groups_of_strings
Find Substring With Given Hash Valuehttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2156_find_substring_with_given_hash_value
All Divisions With the Highest Score of a Binary Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2155_all_divisions_with_the_highest_score_of_a_binary_array
Keep Multiplying Found Values by Twohttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2154_keep_multiplying_found_values_by_two
Maximum Good People Based on Statementshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2151_maximum_good_people_based_on_statements
Find All Lonely Numbers in the Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2150_find_all_lonely_numbers_in_the_array
Rearrange Array Elements by Signhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2149_rearrange_array_elements_by_sign
Count Elements With Strictly Smaller and Greater Elementshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2148_count_elements_with_strictly_smaller_and_greater_elements
Number of Ways to Divide a Long Corridorhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2147_number_of_ways_to_divide_a_long_corridor
K Highest Ranked Items Within a Price Rangehttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2146_k_highest_ranked_items_within_a_price_range
Count the Hidden Sequenceshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2145_count_the_hidden_sequences
Minimum Cost of Buying Candies With Discounthttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2144_minimum_cost_of_buying_candies_with_discount
Maximum Running Time of N Computershttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2141_maximum_running_time_of_n_computers
Solving Questions With Brainpowerhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2140_solving_questions_with_brainpower
Minimum Moves to Reach Target Scorehttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2139_minimum_moves_to_reach_target_score
Divide a String Into Groups of Size khttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2138_divide_a_string_into_groups_of_size_k
Earliest Possible Day of Full Bloomhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2136_earliest_possible_day_of_full_bloom
Count Words Obtained After Adding a Letterhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2135_count_words_obtained_after_adding_a_letter
Minimum Swaps to Group All 1’s Together IIhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2134_minimum_swaps_to_group_all_1s_together_ii
Check if Every Row and Column Contains All Numbershttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2133_check_if_every_row_and_column_contains_all_numbers
Stamping the Gridhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2132_stamping_the_grid
Longest Palindrome by Concatenating Two Letter Wordshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2131_longest_palindrome_by_concatenating_two_letter_words
Maximum Twin Sum of a Linked Listhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2130_maximum_twin_sum_of_a_linked_list
Capitalize the Titlehttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2129_capitalize_the_title
Maximum Employees to Be Invited to a Meetinghttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2127_maximum_employees_to_be_invited_to_a_meeting
Destroying Asteroidshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2126_destroying_asteroids
Number of Laser Beams in a Bankhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2125_number_of_laser_beams_in_a_bank
Check if All A’s Appears Before All B’shttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2124_check_if_all_as_appears_before_all_bs
Recover the Original Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2122_recover_the_original_array
Intervals Between Identical Elementshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2121_intervals_between_identical_elements
Execution of All Suffix Instructions Staying in a Gridhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2120_execution_of_all_suffix_instructions_staying_in_a_grid
A Number After a Double Reversalhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2119_a_number_after_a_double_reversal
Abbreviating the Product of a Rangehttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2117_abbreviating_the_product_of_a_range
Check if a Parentheses String Can Be Validhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2116_check_if_a_parentheses_string_can_be_valid
Find All Possible Recipes from Given Supplieshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2115_find_all_possible_recipes_from_given_supplies
Maximum Number of Words Found in Sentenceshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2114_maximum_number_of_words_found_in_sentences
Minimum Operations to Make the Array K-Increasinghttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2111_minimum_operations_to_make_the_array_k_increasing
Number of Smooth Descent Periods of a Stockhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2110_number_of_smooth_descent_periods_of_a_stock
Adding Spaces to a Stringhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2109_adding_spaces_to_a_string
Find First Palindromic String in the Arrayhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2108_find_first_palindromic_string_in_the_array
Maximum Fruits Harvested After at Most K Stepshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2106_maximum_fruits_harvested_after_at_most_k_steps
Watering Plants IIhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2105_watering_plants_ii
Sum of Subarray Rangeshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2104_sum_of_subarray_ranges
Rings and Rodshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2103_rings_and_rods
Sequentially Ordinal Rank Trackerhttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2102_sequentially_ordinal_rank_tracker
Detonate the Maximum Bombshttps://leetcode-in-java.github.io/src/main/java/g2101_2200/s2101_detonate_the_maximum_bombs
Find Good Days to Rob the Bankhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2100_find_good_days_to_rob_the_bank
Find Subsequence of Length K With the Largest Sumhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2099_find_subsequence_of_length_k_with_the_largest_sum
Valid Arrangement of Pairshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2097_valid_arrangement_of_pairs
Step-By-Step Directions From a Binary Tree Node to Anotherhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2096_step_by_step_directions_from_a_binary_tree_node_to_another
Delete the Middle Node of a Linked Listhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2095_delete_the_middle_node_of_a_linked_list
Finding 3-Digit Even Numbershttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2094_finding_3_digit_even_numbers
Find All People With Secrethttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2092_find_all_people_with_secret
Removing Minimum and Maximum From Arrayhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2091_removing_minimum_and_maximum_from_array
K Radius Subarray Averageshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2090_k_radius_subarray_averages
Find Target Indices After Sorting Arrayhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2089_find_target_indices_after_sorting_array
Count Fertile Pyramids in a Landhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2088_count_fertile_pyramids_in_a_land
Minimum Cost Homecoming of a Robot in a Gridhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2087_minimum_cost_homecoming_of_a_robot_in_a_grid
Minimum Number of Buckets Required to Collect Rainwater from Houseshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2086_minimum_number_of_buckets_required_to_collect_rainwater_from_houses
Count Common Words With One Occurrencehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2085_count_common_words_with_one_occurrence
Sum of k-Mirror Numbershttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2081_sum_of_k_mirror_numbers
Range Frequency Querieshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2080_range_frequency_queries
Watering Plantshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2079_watering_plants
Two Furthest Houses With Different Colorshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2078_two_furthest_houses_with_different_colors
Process Restricted Friend Requestshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2076_process_restricted_friend_requests
Decode the Slanted Ciphertexthttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2075_decode_the_slanted_ciphertext
Reverse Nodes in Even Length Groupshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2074_reverse_nodes_in_even_length_groups
Time Needed to Buy Ticketshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2073_time_needed_to_buy_tickets
Maximum Number of Tasks You Can Assignhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2071_maximum_number_of_tasks_you_can_assign
Most Beautiful Item for Each Queryhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2070_most_beautiful_item_for_each_query
Walking Robot Simulation IIhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2069_walking_robot_simulation_ii
Check Whether Two Strings are Almost Equivalenthttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2068_check_whether_two_strings_are_almost_equivalent
Maximum Path Quality of a Graphhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2065_maximum_path_quality_of_a_graph
Minimized Maximum of Products Distributed to Any Storehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2064_minimized_maximum_of_products_distributed_to_any_store
Vowels of All Substringshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2063_vowels_of_all_substrings
Count Vowel Substrings of a Stringhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2062_count_vowel_substrings_of_a_string
Check if an Original String Exists Given Two Encoded Stringshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2060_check_if_an_original_string_exists_given_two_encoded_strings
Minimum Operations to Convert Numberhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2059_minimum_operations_to_convert_number
Find the Minimum and Maximum Number of Nodes Between Critical Pointshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2058_find_the_minimum_and_maximum_number_of_nodes_between_critical_points
Smallest Index With Equal Valuehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2057_smallest_index_with_equal_value
Number of Valid Move Combinations On Chessboardhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2056_number_of_valid_move_combinations_on_chessboard
Plates Between Candleshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2055_plates_between_candles
Two Best Non-Overlapping Eventshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2054_two_best_non_overlapping_events
Kth Distinct String in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2053_kth_distinct_string_in_an_array
Parallel Courses IIIhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2050_parallel_courses_iii
Count Nodes With the Highest Scorehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2049_count_nodes_with_the_highest_score
Next Greater Numerically Balanced Numberhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2048_next_greater_numerically_balanced_number
Number of Valid Words in a Sentencehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2047_number_of_valid_words_in_a_sentence
Second Minimum Time to Reach Destinationhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2045_second_minimum_time_to_reach_destination
Count Number of Maximum Bitwise-OR Subsetshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2044_count_number_of_maximum_bitwise_or_subsets
Simple Bank Systemhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2043_simple_bank_system
Check if Numbers Are Ascending in a Sentencehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2042_check_if_numbers_are_ascending_in_a_sentence
Kth Smallest Product of Two Sorted Arrayshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2040_kth_smallest_product_of_two_sorted_arrays
The Time When the Network Becomes Idlehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2039_the_time_when_the_network_becomes_idle
Remove Colored Pieces if Both Neighbors are the Same Colorhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2038_remove_colored_pieces_if_both_neighbors_are_the_same_color
Minimum Number of Moves to Seat Everyonehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2037_minimum_number_of_moves_to_seat_everyone
Partition Array Into Two Arrays to Minimize Sum Differencehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2035_partition_array_into_two_arrays_to_minimize_sum_difference
Stock Price Fluctuationhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2034_stock_price_fluctuation
Minimum Operations to Make a Uni-Value Gridhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2033_minimum_operations_to_make_a_uni_value_grid
Two Out of Threehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2032_two_out_of_three
Smallest K-Length Subsequence With Occurrences of a Letterhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2030_smallest_k_length_subsequence_with_occurrences_of_a_letter
Stone Game IXhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2029_stone_game_ix
Find Missing Observationshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2028_find_missing_observations
Minimum Moves to Convert Stringhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2027_minimum_moves_to_convert_string
Maximum Number of Ways to Partition an Arrayhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2025_maximum_number_of_ways_to_partition_an_array
Maximize the Confusion of an Examhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2024_maximize_the_confusion_of_an_exam
Number of Pairs of Strings With Concatenation Equal to Targethttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2023_number_of_pairs_of_strings_with_concatenation_equal_to_target
Convert 1D Array Into 2D Arrayhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2022_convert_1d_array_into_2d_array
The Score of Students Solving Math Expressionhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2019_the_score_of_students_solving_math_expression
Check if Word Can Be Placed In Crosswordhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2018_check_if_word_can_be_placed_in_crossword
Grid Gamehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2017_grid_game
Maximum Difference Between Increasing Elementshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2016_maximum_difference_between_increasing_elements
Longest Subsequence Repeated k Timeshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2014_longest_subsequence_repeated_k_times
Detect Squareshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2013_detect_squares
Sum of Beauty in the Arrayhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2012_sum_of_beauty_in_the_array
Final Value of Variable After Performing Operationshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2011_final_value_of_variable_after_performing_operations
Minimum Number of Operations to Make Array Continuoushttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2009_minimum_number_of_operations_to_make_array_continuous
Maximum Earnings From Taxihttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2008_maximum_earnings_from_taxi
Find Original Array From Doubled Arrayhttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2007_find_original_array_from_doubled_array
Count Number of Pairs With Absolute Difference Khttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2006_count_number_of_pairs_with_absolute_difference_k
Smallest Missing Genetic Value in Each Subtreehttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2003_smallest_missing_genetic_value_in_each_subtree
Maximum Product of the Length of Two Palindromic Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2002_maximum_product_of_the_length_of_two_palindromic_subsequences
Number of Pairs of Interchangeable Rectangleshttps://leetcode-in-java.github.io/src/main/java/g2001_2100/s2001_number_of_pairs_of_interchangeable_rectangles
Reverse Prefix of Wordhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s2000_reverse_prefix_of_word
GCD Sort of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1998_gcd_sort_of_an_array
First Day Where You Have Been in All the Roomshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1997_first_day_where_you_have_been_in_all_the_rooms
The Number of Weak Characters in the Gamehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1996_the_number_of_weak_characters_in_the_game
Count Special Quadrupletshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1995_count_special_quadruplets
The Number of Good Subsetshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1994_the_number_of_good_subsets
Operations on Treehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1993_operations_on_tree
Find All Groups of Farmlandhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1992_find_all_groups_of_farmland
Find the Middle Index in Arrayhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1991_find_the_middle_index_in_array
Number of Unique Good Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1987_number_of_unique_good_subsequences
Minimum Number of Work Sessions to Finish the Taskshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1986_minimum_number_of_work_sessions_to_finish_the_tasks
Find the Kth Largest Integer in the Arrayhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1985_find_the_kth_largest_integer_in_the_array
Minimum Difference Between Highest and Lowest of K Scoreshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1984_minimum_difference_between_highest_and_lowest_of_k_scores
Find Array Given Subset Sumshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1982_find_array_given_subset_sums
Minimize the Difference Between Target and Chosen Elementshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1981_minimize_the_difference_between_target_and_chosen_elements
Find Unique Binary Stringhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1980_find_unique_binary_string
Find Greatest Common Divisor of Arrayhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1979_find_greatest_common_divisor_of_array
Employees Whose Manager Left the Companyhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1978_employees_whose_manager_left_the_company
Number of Ways to Separate Numbershttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1977_number_of_ways_to_separate_numbers
Number of Ways to Arrive at Destinationhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1976_number_of_ways_to_arrive_at_destination
Maximum Matrix Sumhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1975_maximum_matrix_sum
Minimum Time to Type Word Using Special Typewriterhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1974_minimum_time_to_type_word_using_special_typewriter
Find if Path Exists in Graphhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1971_find_if_path_exists_in_graph
Last Day Where You Can Still Crosshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1970_last_day_where_you_can_still_cross
Minimum Non-Zero Product of the Array Elementshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1969_minimum_non_zero_product_of_the_array_elements
Array With Elements Not Equal to Average of Neighborshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1968_array_with_elements_not_equal_to_average_of_neighbors
Number of Strings That Appear as Substrings in Wordhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1967_number_of_strings_that_appear_as_substrings_in_word
Employees With Missing Informationhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1965_employees_with_missing_information
Find the Longest Valid Obstacle Course at Each Positionhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1964_find_the_longest_valid_obstacle_course_at_each_position
Minimum Number of Swaps to Make the String Balancedhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1963_minimum_number_of_swaps_to_make_the_string_balanced
Remove Stones to Minimize the Totalhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1962_remove_stones_to_minimize_the_total
Check If String Is a Prefix of Arrayhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1961_check_if_string_is_a_prefix_of_array
Maximum Product of the Length of Two Palindromic Substringshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1960_maximum_product_of_the_length_of_two_palindromic_substrings
Minimum Total Space Wasted With K Resizing Operationshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1959_minimum_total_space_wasted_with_k_resizing_operations
Check if Move is Legalhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1958_check_if_move_is_legal
Delete Characters to Make Fancy Stringhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1957_delete_characters_to_make_fancy_string
Count Number of Special Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1955_count_number_of_special_subsequences
Minimum Garden Perimeter to Collect Enough Appleshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1954_minimum_garden_perimeter_to_collect_enough_apples
Maximum Number of Weeks for Which You Can Workhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1953_maximum_number_of_weeks_for_which_you_can_work
Three Divisorshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1952_three_divisors
Delete Duplicate Folders in Systemhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1948_delete_duplicate_folders_in_system
Maximum Compatibility Score Sumhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1947_maximum_compatibility_score_sum
Largest Number After Mutating Substringhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1946_largest_number_after_mutating_substring
Sum of Digits of String After Converthttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1945_sum_of_digits_of_string_after_convert
Number of Visible People in a Queuehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1944_number_of_visible_people_in_a_queue
Describe the Paintinghttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1943_describe_the_painting
The Number of the Smallest Unoccupied Chairhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1942_the_number_of_the_smallest_unoccupied_chair
Check if All Characters Have Equal Number of Occurrenceshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1941_check_if_all_characters_have_equal_number_of_occurrences
Maximum Genetic Difference Queryhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1938_maximum_genetic_difference_query
Maximum Number of Points with Costhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1937_maximum_number_of_points_with_cost
Add Minimum Number of Rungshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1936_add_minimum_number_of_rungs
Maximum Number of Words You Can Typehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1935_maximum_number_of_words_you_can_type
Confirmation Ratehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1934_confirmation_rate
Merge BSTs to Create Single BSThttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1932_merge_bsts_to_create_single_bst
Painting a Grid With Three Different Colorshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1931_painting_a_grid_with_three_different_colors
Unique Length-3 Palindromic Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1930_unique_length_3_palindromic_subsequences
Concatenation of Arrayhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1929_concatenation_of_array
Minimum Cost to Reach Destination in Timehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1928_minimum_cost_to_reach_destination_in_time
Sum Gamehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1927_sum_game
Nearest Exit from Entrance in Mazehttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1926_nearest_exit_from_entrance_in_maze
Count Square Sum Tripleshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1925_count_square_sum_triples
Longest Common Subpathhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1923_longest_common_subpath
Count Good Numbershttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1922_count_good_numbers
Eliminate Maximum Number of Monstershttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1921_eliminate_maximum_number_of_monsters
Build Array from Permutationhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1920_build_array_from_permutation
Count Ways to Build Rooms in an Ant Colonyhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1916_count_ways_to_build_rooms_in_an_ant_colony
Number of Wonderful Substringshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1915_number_of_wonderful_substrings
Cyclically Rotating a Gridhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1914_cyclically_rotating_a_grid
Maximum Product Difference Between Two Pairshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1913_maximum_product_difference_between_two_pairs
Design Movie Rental Systemhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1912_design_movie_rental_system
Maximum Alternating Subsequence Sumhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1911_maximum_alternating_subsequence_sum
Remove All Occurrences of a Substringhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1910_remove_all_occurrences_of_a_substring
Remove One Element to Make the Array Strictly Increasinghttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1909_remove_one_element_to_make_the_array_strictly_increasing
Count Salary Categorieshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1907_count_salary_categories
Minimum Absolute Difference Querieshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1906_minimum_absolute_difference_queries
Count Sub Islandshttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1905_count_sub_islands
The Number of Full Rounds You Have Playedhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1904_the_number_of_full_rounds_you_have_played
Largest Odd Number in Stringhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1903_largest_odd_number_in_string
Find a Peak Element IIhttps://leetcode-in-java.github.io/src/main/java/g1901_2000/s1901_find_a_peak_element_ii
The Earliest and Latest Rounds Where Players Competehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1900_the_earliest_and_latest_rounds_where_players_compete
Merge Triplets to Form Target Triplethttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1899_merge_triplets_to_form_target_triplet
Maximum Number of Removable Charactershttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1898_maximum_number_of_removable_characters
Redistribute Characters to Make All Strings Equalhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1897_redistribute_characters_to_make_all_strings_equal
Minimum Cost to Change the Final Value of Expressionhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1896_minimum_cost_to_change_the_final_value_of_expression
Largest Magic Squarehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1895_largest_magic_square
Find the Student that Will Replace the Chalkhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1894_find_the_student_that_will_replace_the_chalk
Check if All the Integers in a Range Are Coveredhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1893_check_if_all_the_integers_in_a_range_are_covered
The Latest Login in 2020https://leetcode-in-java.github.io/src/main/java/g1801_1900/s1890_the_latest_login_in_2020
Minimum Space Wasted From Packaginghttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1889_minimum_space_wasted_from_packaging
Minimum Number of Flips to Make the Binary String Alternatinghttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1888_minimum_number_of_flips_to_make_the_binary_string_alternating
Reduction Operations to Make the Array Elements Equalhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1887_reduction_operations_to_make_the_array_elements_equal
Determine Whether Matrix Can Be Obtained By Rotationhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1886_determine_whether_matrix_can_be_obtained_by_rotation
Egg Drop With 2 Eggs and N Floorshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1884_egg_drop_with_2_eggs_and_n_floors
Minimum Skips to Arrive at Meeting On Timehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1883_minimum_skips_to_arrive_at_meeting_on_time
Process Tasks Using Servershttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1882_process_tasks_using_servers
Maximum Value after Insertionhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1881_maximum_value_after_insertion
Check if Word Equals Summation of Two Wordshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1880_check_if_word_equals_summation_of_two_words
Minimum XOR Sum of Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1879_minimum_xor_sum_of_two_arrays
Get Biggest Three Rhombus Sums in a Gridhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1878_get_biggest_three_rhombus_sums_in_a_grid
Minimize Maximum Pair Sum in Arrayhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1877_minimize_maximum_pair_sum_in_array
Substrings of Size Three with Distinct Charactershttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1876_substrings_of_size_three_with_distinct_characters
Calculate Special Bonushttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1873_calculate_special_bonus
Stone Game VIIIhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1872_stone_game_viii
Jump Game VIIhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1871_jump_game_vii
Minimum Speed to Arrive on Timehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1870_minimum_speed_to_arrive_on_time
Longer Contiguous Segments of Ones than Zeroshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1869_longer_contiguous_segments_of_ones_than_zeros
Number of Ways to Rearrange Sticks With K Sticks Visiblehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1866_number_of_ways_to_rearrange_sticks_with_k_sticks_visible
Finding Pairs With a Certain Sumhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1865_finding_pairs_with_a_certain_sum
Minimum Number of Swaps to Make the Binary String Alternatinghttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1864_minimum_number_of_swaps_to_make_the_binary_string_alternating
Sum of All Subset XOR Totalshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1863_sum_of_all_subset_xor_totals
Sum of Floored Pairshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1862_sum_of_floored_pairs
Rotating the Boxhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1861_rotating_the_box
Incremental Memory Leakhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1860_incremental_memory_leak
Sorting the Sentencehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1859_sorting_the_sentence
Largest Color Value in a Directed Graphhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1857_largest_color_value_in_a_directed_graph
Maximum Subarray Min-Producthttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1856_maximum_subarray_min_product
Maximum Distance Between a Pair of Valueshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1855_maximum_distance_between_a_pair_of_values
Maximum Population Yearhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1854_maximum_population_year
Minimum Interval to Include Each Queryhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1851_minimum_interval_to_include_each_query
Minimum Adjacent Swaps to Reach the Kth Smallest Numberhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1850_minimum_adjacent_swaps_to_reach_the_kth_smallest_number
Splitting a String Into Descending Consecutive Valueshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1849_splitting_a_string_into_descending_consecutive_values
Minimum Distance to the Target Elementhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1848_minimum_distance_to_the_target_element
Closest Roomhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1847_closest_room
Maximum Element After Decreasing and Rearranginghttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1846_maximum_element_after_decreasing_and_rearranging
Seat Reservation Managerhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1845_seat_reservation_manager
Replace All Digits with Charactershttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1844_replace_all_digits_with_characters
Maximum Building Heighthttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1840_maximum_building_height
Longest Substring Of All Vowels in Orderhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1839_longest_substring_of_all_vowels_in_order
Frequency of the Most Frequent Elementhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1838_frequency_of_the_most_frequent_element
Sum of Digits in Base Khttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1837_sum_of_digits_in_base_k
Find XOR Sum of All Pairs Bitwise ANDhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1835_find_xor_sum_of_all_pairs_bitwise_and
Single-Threaded CPUhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1834_single_threaded_cpu
Maximum Ice Cream Barshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1833_maximum_ice_cream_bars
Check if the Sentence Is Pangramhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1832_check_if_the_sentence_is_pangram
Minimum Number of Operations to Make String Sortedhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1830_minimum_number_of_operations_to_make_string_sorted
Maximum XOR for Each Queryhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1829_maximum_xor_for_each_query
Queries on Number of Points Inside a Circlehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1828_queries_on_number_of_points_inside_a_circle
Minimum Operations to Make the Array Increasinghttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1827_minimum_operations_to_make_the_array_increasing
Finding MK Averagehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1825_finding_mk_average
Minimum Sideway Jumpshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1824_minimum_sideway_jumps
Find the Winner of the Circular Gamehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1823_find_the_winner_of_the_circular_game
Sign of the Product of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1822_sign_of_the_product_of_an_array
Number of Different Subsequences GCDshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1819_number_of_different_subsequences_gcds
Minimum Absolute Sum Differencehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1818_minimum_absolute_sum_difference
Finding the Users Active Minuteshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1817_finding_the_users_active_minutes
Truncate Sentencehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1816_truncate_sentence
Maximum Number of Groups Getting Fresh Donutshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1815_maximum_number_of_groups_getting_fresh_donuts
Count Nice Pairs in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1814_count_nice_pairs_in_an_array
Sentence Similarity IIIhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1813_sentence_similarity_iii
Determine Color of a Chessboard Squarehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1812_determine_color_of_a_chessboard_square
Maximize Number of Nice Divisorshttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1808_maximize_number_of_nice_divisors
Evaluate the Bracket Pairs of a Stringhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1807_evaluate_the_bracket_pairs_of_a_string
Minimum Number of Operations to Reinitialize a Permutationhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1806_minimum_number_of_operations_to_reinitialize_a_permutation
Number of Different Integers in a Stringhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1805_number_of_different_integers_in_a_string
Count Pairs With XOR in a Rangehttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1803_count_pairs_with_xor_in_a_range
Maximum Value at a Given Index in a Bounded Arrayhttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1802_maximum_value_at_a_given_index_in_a_bounded_array
Number of Orders in the Backloghttps://leetcode-in-java.github.io/src/main/java/g1801_1900/s1801_number_of_orders_in_the_backlog
Maximum Ascending Subarray Sumhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1800_maximum_ascending_subarray_sum
Maximize Score After N Operationshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1799_maximize_score_after_n_operations
Maximum Number of Consecutive Values You Can Makehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1798_maximum_number_of_consecutive_values_you_can_make
Design Authentication Managerhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1797_design_authentication_manager
Second Largest Digit in a Stringhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1796_second_largest_digit_in_a_string
Rearrange Products Tablehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1795_rearrange_products_table
Maximum Score of a Good Subarrayhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1793_maximum_score_of_a_good_subarray
Maximum Average Pass Ratiohttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1792_maximum_average_pass_ratio
Find Center of Star Graphhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1791_find_center_of_star_graph
Check if One String Swap Can Make Strings Equalhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1790_check_if_one_string_swap_can_make_strings_equal
Primary Department for Each Employeehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1789_primary_department_for_each_employee
Make the XOR of All Segments Equal to Zerohttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1787_make_the_xor_of_all_segments_equal_to_zero
Number of Restricted Paths From First to Last Nodehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1786_number_of_restricted_paths_from_first_to_last_node
Minimum Elements to Add to Form a Given Sumhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1785_minimum_elements_to_add_to_form_a_given_sum
Check if Binary String Has at Most One Segment of Oneshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1784_check_if_binary_string_has_at_most_one_segment_of_ones
Count Pairs Of Nodeshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1782_count_pairs_of_nodes
Sum of Beauty of All Substringshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1781_sum_of_beauty_of_all_substrings
Check if Number is a Sum of Powers of Threehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1780_check_if_number_is_a_sum_of_powers_of_three
Find Nearest Point That Has the Same X or Y Coordinatehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1779_find_nearest_point_that_has_the_same_x_or_y_coordinate
Car Fleet IIhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1776_car_fleet_ii
Equal Sum Arrays With Minimum Number of Operationshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1775_equal_sum_arrays_with_minimum_number_of_operations
Closest Dessert Costhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1774_closest_dessert_cost
Count Items Matching a Rulehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1773_count_items_matching_a_rule
Maximize Palindrome Length From Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1771_maximize_palindrome_length_from_subsequences
Maximum Score from Performing Multiplication Operationshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1770_maximum_score_from_performing_multiplication_operations
Minimum Number of Operations to Move All Balls to Each Boxhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1769_minimum_number_of_operations_to_move_all_balls_to_each_box
Merge Strings Alternatelyhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1768_merge_strings_alternately
Tree of Coprimeshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1766_tree_of_coprimes
Map of Highest Peakhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1765_map_of_highest_peak
Form Array by Concatenating Subarrays of Another Arrayhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1764_form_array_by_concatenating_subarrays_of_another_array
Longest Nice Substringhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1763_longest_nice_substring
Minimum Degree of a Connected Trio in a Graphhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1761_minimum_degree_of_a_connected_trio_in_a_graph
Minimum Limit of Balls in a Baghttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1760_minimum_limit_of_balls_in_a_bag
Count Number of Homogenous Substringshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1759_count_number_of_homogenous_substrings
Minimum Changes To Make Alternating Binary Stringhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1758_minimum_changes_to_make_alternating_binary_string
Recyclable and Low Fat Productshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1757_recyclable_and_low_fat_products
Closest Subsequence Sumhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1755_closest_subsequence_sum
Largest Merge Of Two Stringshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1754_largest_merge_of_two_strings
Maximum Score From Removing Stoneshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1753_maximum_score_from_removing_stones
Check if Array Is Sorted and Rotatedhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1752_check_if_array_is_sorted_and_rotated
Maximum Number of Events That Can Be Attended IIhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1751_maximum_number_of_events_that_can_be_attended_ii
Minimum Length of String After Deleting Similar Endshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1750_minimum_length_of_string_after_deleting_similar_ends
Maximum Absolute Sum of Any Subarrayhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1749_maximum_absolute_sum_of_any_subarray
Sum of Unique Elementshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1748_sum_of_unique_elements
Palindrome Partitioning IVhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1745_palindrome_partitioning_iv
Can You Eat Your Favorite Candy on Your Favorite Day?https://leetcode-in-java.github.io/src/main/java/g1701_1800/s1744_can_you_eat_your_favorite_candy_on_your_favorite_day
Restore the Array From Adjacent Pairshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1743_restore_the_array_from_adjacent_pairs
Maximum Number of Balls in a Boxhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1742_maximum_number_of_balls_in_a_box
Find Total Time Spent by Each Employeehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1741_find_total_time_spent_by_each_employee
Building Boxeshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1739_building_boxes
Find Kth Largest XOR Coordinate Valuehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1738_find_kth_largest_xor_coordinate_value
Change Minimum Characters to Satisfy One of Three Conditionshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1737_change_minimum_characters_to_satisfy_one_of_three_conditions
Latest Time by Replacing Hidden Digitshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1736_latest_time_by_replacing_hidden_digits
Count Ways to Make Array With Producthttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1735_count_ways_to_make_array_with_product
Decode XORed Permutationhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1734_decode_xored_permutation
Minimum Number of People to Teachhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1733_minimum_number_of_people_to_teach
Find the Highest Altitudehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1732_find_the_highest_altitude
The Number of Employees Which Report to Each Employeehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1731_the_number_of_employees_which_report_to_each_employee
Find Followers Counthttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1729_find_followers_count
Cat and Mouse IIhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1728_cat_and_mouse_ii
Largest Submatrix With Rearrangementshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1727_largest_submatrix_with_rearrangements
Tuple with Same Producthttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1726_tuple_with_same_product
Number Of Rectangles That Can Form The Largest Squarehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1725_number_of_rectangles_that_can_form_the_largest_square
Find Minimum Time to Finish All Jobshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1723_find_minimum_time_to_finish_all_jobs
Minimize Hamming Distance After Swap Operationshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1722_minimize_hamming_distance_after_swap_operations
Swapping Nodes in a Linked Listhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1721_swapping_nodes_in_a_linked_list
Decode XORed Arrayhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1720_decode_xored_array
Number Of Ways To Reconstruct A Treehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1719_number_of_ways_to_reconstruct_a_tree
Construct the Lexicographically Largest Valid Sequencehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1718_construct_the_lexicographically_largest_valid_sequence
Maximum Score From Removing Substringshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1717_maximum_score_from_removing_substrings
Calculate Money in Leetcode Bankhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1716_calculate_money_in_leetcode_bank
Minimum Operations to Make a Subsequencehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1713_minimum_operations_to_make_a_subsequence
Ways to Split Array Into Three Subarrayshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1712_ways_to_split_array_into_three_subarrays
Count Good Mealshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1711_count_good_meals
Maximum Units on a Truckhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1710_maximum_units_on_a_truck
Maximum XOR With an Element From Arrayhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1707_maximum_xor_with_an_element_from_array
Where Will the Ball Fallhttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1706_where_will_the_ball_fall
Maximum Number of Eaten Appleshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1705_maximum_number_of_eaten_apples
Determine if String Halves Are Alikehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1704_determine_if_string_halves_are_alike
Minimum Adjacent Swaps for K Consecutive Oneshttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1703_minimum_adjacent_swaps_for_k_consecutive_ones
Maximum Binary String After Changehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1702_maximum_binary_string_after_change
Average Waiting Timehttps://leetcode-in-java.github.io/src/main/java/g1701_1800/s1701_average_waiting_time
Number of Students Unable to Eat Lunchhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1700_number_of_students_unable_to_eat_lunch
Checking Existence of Edge Length Limited Pathshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1697_checking_existence_of_edge_length_limited_paths
Jump Game VIhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1696_jump_game_vi
Maximum Erasure Valuehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1695_maximum_erasure_value
Reformat Phone Numberhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1694_reformat_phone_number
Daily Leads and Partnershttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1693_daily_leads_and_partners
Maximum Height by Stacking Cuboidshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1691_maximum_height_by_stacking_cuboids
Stone Game VIIhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1690_stone_game_vii
Partitioning Into Minimum Number Of Deci-Binary Numbershttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1689_partitioning_into_minimum_number_of_deci_binary_numbers
Count of Matches in Tournamenthttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1688_count_of_matches_in_tournament
Delivering Boxes from Storage to Portshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1687_delivering_boxes_from_storage_to_ports
Stone Game VIhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1686_stone_game_vi
Sum of Absolute Differences in a Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1685_sum_of_absolute_differences_in_a_sorted_array
Count the Number of Consistent Stringshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1684_count_the_number_of_consistent_strings
Invalid Tweetshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1683_invalid_tweets
Minimum Incompatibilityhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1681_minimum_incompatibility
Concatenation of Consecutive Binary Numbershttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1680_concatenation_of_consecutive_binary_numbers
Max Number of K-Sum Pairshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1679_max_number_of_k_sum_pairs
Goal Parser Interpretationhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1678_goal_parser_interpretation
Minimize Deviation in Arrayhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1675_minimize_deviation_in_array
Minimum Moves to Make Array Complementaryhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1674_minimum_moves_to_make_array_complementary
Find the Most Competitive Subsequencehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1673_find_the_most_competitive_subsequence
Richest Customer Wealthhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1672_richest_customer_wealth
Minimum Number of Removals to Make Mountain Arrayhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1671_minimum_number_of_removals_to_make_mountain_array
Design Front Middle Back Queuehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1670_design_front_middle_back_queue
Merge In Between Linked Listshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1669_merge_in_between_linked_lists
Maximum Repeating Substringhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1668_maximum_repeating_substring
Fix Names in a Tablehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1667_fix_names_in_a_table
Minimum Initial Energy to Finish Taskshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1665_minimum_initial_energy_to_finish_tasks
Ways to Make a Fair Arrayhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1664_ways_to_make_a_fair_array
Smallest String With A Given Numeric Valuehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1663_smallest_string_with_a_given_numeric_value
Check If Two String Arrays are Equivalenthttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1662_check_if_two_string_arrays_are_equivalent
Average Time of Process per Machinehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1661_average_time_of_process_per_machine
Maximize Grid Happinesshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1659_maximize_grid_happiness
Minimum Operations to Reduce X to Zerohttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1658_minimum_operations_to_reduce_x_to_zero
Determine if Two Strings Are Closehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1657_determine_if_two_strings_are_close
Design an Ordered Streamhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1656_design_an_ordered_stream
Distribute Repeating Integershttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1655_distribute_repeating_integers
Minimum Jumps to Reach Homehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1654_minimum_jumps_to_reach_home
Minimum Deletions to Make String Balancedhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1653_minimum_deletions_to_make_string_balanced
Defuse the Bombhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1652_defuse_the_bomb
Create Sorted Array through Instructionshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1649_create_sorted_array_through_instructions
Sell Diminishing-Valued Colored Ballshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1648_sell_diminishing_valued_colored_balls
Minimum Deletions to Make Character Frequencies Uniquehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1647_minimum_deletions_to_make_character_frequencies_unique
Get Maximum in Generated Arrayhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1646_get_maximum_in_generated_array
Kth Smallest Instructionshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1643_kth_smallest_instructions
Furthest Building You Can Reachhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1642_furthest_building_you_can_reach
Count Sorted Vowel Stringshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1641_count_sorted_vowel_strings
Check Array Formation Through Concatenationhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1640_check_array_formation_through_concatenation
Number of Ways to Form a Target String Given a Dictionaryhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1639_number_of_ways_to_form_a_target_string_given_a_dictionary
Count Substrings That Differ by One Characterhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1638_count_substrings_that_differ_by_one_character
Widest Vertical Area Between Two Points Containing No Pointshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1637_widest_vertical_area_between_two_points_containing_no_points
Sort Array by Increasing Frequencyhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1636_sort_array_by_increasing_frequency
Percentage of Users Attended a Contesthttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1633_percentage_of_users_attended_a_contest
Rank Transform of a Matrixhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1632_rank_transform_of_a_matrix
Path With Minimum Efforthttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1631_path_with_minimum_effort
Arithmetic Subarrayshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1630_arithmetic_subarrays
Slowest Keyhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1629_slowest_key
Graph Connectivity With Thresholdhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1627_graph_connectivity_with_threshold
Best Team With No Conflictshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1626_best_team_with_no_conflicts
Lexicographically Smallest String After Applying Operationshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1625_lexicographically_smallest_string_after_applying_operations
Largest Substring Between Two Equal Charactershttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1624_largest_substring_between_two_equal_characters
Fancy Sequencehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1622_fancy_sequence
Number of Sets of K Non-Overlapping Line Segmentshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1621_number_of_sets_of_k_non_overlapping_line_segments
Coordinate With Maximum Network Qualityhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1620_coordinate_with_maximum_network_quality
Mean of Array After Removing Some Elementshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1619_mean_of_array_after_removing_some_elements
Count Subtrees With Max Distance Between Citieshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1617_count_subtrees_with_max_distance_between_cities
Split Two Strings to Make Palindromehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1616_split_two_strings_to_make_palindrome
Maximal Network Rankhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1615_maximal_network_rank
Maximum Nesting Depth of the Parentheseshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1614_maximum_nesting_depth_of_the_parentheses
Minimum One Bit Operations to Make Integers Zerohttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1611_minimum_one_bit_operations_to_make_integers_zero
Maximum Number of Visible Pointshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1610_maximum_number_of_visible_points
Even Odd Treehttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1609_even_odd_tree
Special Array With X Elements Greater Than or Equal Xhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1608_special_array_with_x_elements_greater_than_or_equal_x
Find Servers That Handled Most Number of Requestshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1606_find_servers_that_handled_most_number_of_requests
Find Valid Matrix Given Row and Column Sumshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1605_find_valid_matrix_given_row_and_column_sums
Alert Using Same Key-Card Three or More Times in a One Hour Periodhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1604_alert_using_same_key_card_three_or_more_times_in_a_one_hour_period
Design Parking Systemhttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1603_design_parking_system
Maximum Number of Achievable Transfer Requestshttps://leetcode-in-java.github.io/src/main/java/g1601_1700/s1601_maximum_number_of_achievable_transfer_requests
Throne Inheritancehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1600_throne_inheritance
Maximum Profit of Operating a Centennial Wheelhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1599_maximum_profit_of_operating_a_centennial_wheel
Crawler Log Folderhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1598_crawler_log_folder
Minimum Cost to Connect Two Groups of Pointshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1595_minimum_cost_to_connect_two_groups_of_points
Maximum Non Negative Product in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1594_maximum_non_negative_product_in_a_matrix
Split a String Into the Max Number of Unique Substringshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1593_split_a_string_into_the_max_number_of_unique_substrings
Rearrange Spaces Between Wordshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1592_rearrange_spaces_between_words
Strange Printer IIhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1591_strange_printer_ii
Make Sum Divisible by Phttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1590_make_sum_divisible_by_p
Maximum Sum Obtained of Any Permutationhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1589_maximum_sum_obtained_of_any_permutation
Sum of All Odd Length Subarrayshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1588_sum_of_all_odd_length_subarrays
Bank Account Summary IIhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1587_bank_account_summary_ii
Check If String Is Transformable With Substring Sort Operationshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1585_check_if_string_is_transformable_with_substring_sort_operations
Min Cost to Connect All Pointshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1584_min_cost_to_connect_all_points
Count Unhappy Friendshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1583_count_unhappy_friends
Special Positions in a Binary Matrixhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1582_special_positions_in_a_binary_matrix
Customer Who Visited but Did Not Make Any Transactionshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1581_customer_who_visited_but_did_not_make_any_transactions
Remove Max Number of Edges to Keep Graph Fully Traversablehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1579_remove_max_number_of_edges_to_keep_graph_fully_traversable
Minimum Time to Make Rope Colorfulhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1578_minimum_time_to_make_rope_colorful
Number of Ways Where Square of Number Is Equal to Product of Two Numbershttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1577_number_of_ways_where_square_of_number_is_equal_to_product_of_two_numbers
Replace All ?’s to Avoid Consecutive Repeating Charactershttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1576_replace_all_s_to_avoid_consecutive_repeating_characters
Count All Possible Routeshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1575_count_all_possible_routes
Shortest Subarray to be Removed to Make Array Sortedhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1574_shortest_subarray_to_be_removed_to_make_array_sorted
Number of Ways to Split a Stringhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1573_number_of_ways_to_split_a_string
Matrix Diagonal Sumhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1572_matrix_diagonal_sum
Number of Ways to Reorder Array to Get Same BSThttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1569_number_of_ways_to_reorder_array_to_get_same_bst
Minimum Number of Days to Disconnect Islandhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1568_minimum_number_of_days_to_disconnect_island
Maximum Length of Subarray With Positive Producthttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1567_maximum_length_of_subarray_with_positive_product
Detect Pattern of Length M Repeated K or More Timeshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1566_detect_pattern_of_length_m_repeated_k_or_more_times
Stone Game Vhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1563_stone_game_v
Find Latest Group of Size Mhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1562_find_latest_group_of_size_m
Maximum Number of Coins You Can Gethttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1561_maximum_number_of_coins_you_can_get
Most Visited Sector in a Circular Trackhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1560_most_visited_sector_in_a_circular_track
Detect Cycles in 2D Gridhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1559_detect_cycles_in_2d_grid
Minimum Numbers of Function Calls to Make Target Arrayhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1558_minimum_numbers_of_function_calls_to_make_target_array
Minimum Number of Vertices to Reach All Nodeshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1557_minimum_number_of_vertices_to_reach_all_nodes
Thousand Separatorhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1556_thousand_separator
Minimum Number of Days to Eat N Orangeshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1553_minimum_number_of_days_to_eat_n_oranges
Magnetic Force Between Two Ballshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1552_magnetic_force_between_two_balls
Minimum Operations to Make Array Equalhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1551_minimum_operations_to_make_array_equal
Three Consecutive Oddshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1550_three_consecutive_odds
Minimum Cost to Cut a Stickhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1547_minimum_cost_to_cut_a_stick
Maximum Number of Non-Overlapping Subarrays With Sum Equals Targethttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1546_maximum_number_of_non_overlapping_subarrays_with_sum_equals_target
Find Kth Bit in Nth Binary Stringhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1545_find_kth_bit_in_nth_binary_string
Make The String Greathttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1544_make_the_string_great
Find Longest Awesome Substringhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1542_find_longest_awesome_substring
Minimum Insertions to Balance a Parentheses Stringhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1541_minimum_insertions_to_balance_a_parentheses_string
Can Convert String in K Moveshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1540_can_convert_string_in_k_moves
Kth Missing Positive Numberhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1539_kth_missing_positive_number
Get the Maximum Scorehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1537_get_the_maximum_score
Minimum Swaps to Arrange a Binary Gridhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1536_minimum_swaps_to_arrange_a_binary_grid
Find the Winner of an Array Gamehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1535_find_the_winner_of_an_array_game
Count Good Tripletshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1534_count_good_triplets
String Compression IIhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1531_string_compression_ii
Number of Good Leaf Nodes Pairshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1530_number_of_good_leaf_nodes_pairs
Minimum Suffix Flipshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1529_bulb_switcher_iv
Shuffle Stringhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1528_shuffle_string
Patients With a Conditionhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1527_patients_with_a_condition
Minimum Number of Increments on Subarrays to Form a Target Arrayhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1526_minimum_number_of_increments_on_subarrays_to_form_a_target_array
Number of Good Ways to Split a Stringhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1525_number_of_good_ways_to_split_a_string
Number of Sub-arrays With Odd Sumhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1524_number_of_sub_arrays_with_odd_sum
Count Odd Numbers in an Interval Rangehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1523_count_odd_numbers_in_an_interval_range
Find a Value of a Mysterious Function Closest to Targethttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1521_find_a_value_of_a_mysterious_function_closest_to_target
Maximum Number of Non-Overlapping Substringshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1520_maximum_number_of_non_overlapping_substrings
Number of Nodes in the Sub-Tree With the Same Labelhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1519_number_of_nodes_in_the_sub_tree_with_the_same_label
Water Bottleshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1518_water_bottles
Find Users With Valid E-Mailshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1517_find_users_with_valid_e_mails
Best Position for a Service Centrehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1515_best_position_for_a_service_centre
Path with Maximum Probabilityhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1514_path_with_maximum_probability
Number of Substrings With Only 1shttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1513_number_of_substrings_with_only_1s
Number of Good Pairshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1512_number_of_good_pairs
Stone Game IVhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1510_stone_game_iv
Minimum Difference Between Largest and Smallest Value in Three Moveshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1509_minimum_difference_between_largest_and_smallest_value_in_three_moves
Range Sum of Sorted Subarray Sumshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1508_range_sum_of_sorted_subarray_sums
Reformat Datehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1507_reformat_date
Minimum Possible Integer After at Most K Adjacent Swaps On Digitshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1505_minimum_possible_integer_after_at_most_k_adjacent_swaps_on_digits
Count Submatrices With All Oneshttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1504_count_submatrices_with_all_ones
Last Moment Before All Ants Fall Out of a Plankhttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1503_last_moment_before_all_ants_fall_out_of_a_plank
Can Make Arithmetic Progression From Sequencehttps://leetcode-in-java.github.io/src/main/java/g1501_1600/s1502_can_make_arithmetic_progression_from_sequence
Max Value of Equationhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1499_max_value_of_equation
Number of Subsequences That Satisfy the Given Sum Conditionhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1498_number_of_subsequences_that_satisfy_the_given_sum_condition
Check If Array Pairs Are Divisible by khttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1497_check_if_array_pairs_are_divisible_by_k
Path Crossinghttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1496_path_crossing
Parallel Courses IIhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1494_parallel_courses_ii
Longest Subarray of 1’s After Deleting One Elementhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1493_longest_subarray_of_1s_after_deleting_one_element
The kth Factor of nhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1492_the_kth_factor_of_n
Average Salary Excluding the Minimum and Maximum Salaryhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1491_average_salary_excluding_the_minimum_and_maximum_salary
Find Critical and Pseudo-Critical Edges in Minimum Spanning Treehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1489_find_critical_and_pseudo_critical_edges_in_minimum_spanning_tree
Avoid Flood in The Cityhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1488_avoid_flood_in_the_city
Making File Names Uniquehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1487_making_file_names_unique
XOR Operation in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1486_xor_operation_in_an_array
Group Sold Products By The Datehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1484_group_sold_products_by_the_date
Kth Ancestor of a Tree Nodehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1483_kth_ancestor_of_a_tree_node
Minimum Number of Days to Make m Bouquetshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1482_minimum_number_of_days_to_make_m_bouquets
Least Number of Unique Integers after K Removalshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1481_least_number_of_unique_integers_after_k_removals
Running Sum of 1d Arrayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1480_running_sum_of_1d_array
Allocate Mailboxeshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1478_allocate_mailboxes
Find Two Non-overlapping Sub-arrays Each With Target Sumhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1477_find_two_non_overlapping_sub_arrays_each_with_target_sum
Subrectangle Querieshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1476_subrectangle_queries
Final Prices With a Special Discount in a Shophttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1475_final_prices_with_a_special_discount_in_a_shop
Paint House IIIhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1473_paint_house_iii
Design Browser Historyhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1472_design_browser_history
The k Strongest Values in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1471_the_k_strongest_values_in_an_array
Shuffle the Arrayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1470_shuffle_the_array
Probability of a Two Boxes Having The Same Number of Distinct Ballshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1467_probability_of_a_two_boxes_having_the_same_number_of_distinct_balls
Reorder Routes to Make All Paths Lead to the City Zerohttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1466_reorder_routes_to_make_all_paths_lead_to_the_city_zero
Maximum Area of a Piece of Cake After Horizontal and Vertical Cutshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1465_maximum_area_of_a_piece_of_cake_after_horizontal_and_vertical_cuts
Maximum Product of Two Elements in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1464_maximum_product_of_two_elements_in_an_array
Cherry Pickup IIhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1463_cherry_pickup_ii
Course Schedule IVhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1462_course_schedule_iv
Check If a String Contains All Binary Codes of Size Khttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1461_check_if_a_string_contains_all_binary_codes_of_size_k
Make Two Arrays Equal by Reversing Sub-arrayshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1460_make_two_arrays_equal_by_reversing_sub_arrays
Max Dot Product of Two Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1458_max_dot_product_of_two_subsequences
Pseudo-Palindromic Paths in a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1457_pseudo_palindromic_paths_in_a_binary_tree
Maximum Number of Vowels in a Substring of Given Lengthhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1456_maximum_number_of_vowels_in_a_substring_of_given_length
Check If a Word Occurs As a Prefix of Any Word in a Sentencehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1455_check_if_a_word_occurs_as_a_prefix_of_any_word_in_a_sentence
Maximum Number of Darts Inside of a Circular Dartboardhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1453_maximum_number_of_darts_inside_of_a_circular_dartboard
People Whose List of Favorite Companies Is Not a Subset of Another Listhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1452_people_whose_list_of_favorite_companies_is_not_a_subset_of_another_list
Rearrange Words in a Sentencehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1451_rearrange_words_in_a_sentence
Number of Students Doing Homework at a Given Timehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1450_number_of_students_doing_homework_at_a_given_time
Form Largest Integer With Digits That Add up to Targethttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1449_form_largest_integer_with_digits_that_add_up_to_target
Count Good Nodes in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1448_count_good_nodes_in_binary_tree
Simplified Fractionshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1447_simplified_fractions
Consecutive Charactershttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1446_consecutive_characters
Number of Ways of Cutting a Pizzahttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1444_number_of_ways_of_cutting_a_pizza
Minimum Time to Collect All Apples in a Treehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1443_minimum_time_to_collect_all_apples_in_a_tree
Count Triplets That Can Form Two Arrays of Equal XORhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1442_count_triplets_that_can_form_two_arrays_of_equal_xor
Build an Array With Stack Operationshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1441_build_an_array_with_stack_operations
Find the Kth Smallest Sum of a Matrix With Sorted Rowshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1439_find_the_kth_smallest_sum_of_a_matrix_with_sorted_rows
Longest Continuous Subarray With Absolute Diff Less Than or Equal to Limithttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1438_longest_continuous_subarray_with_absolute_diff_less_than_or_equal_to_limit
Check If All 1’s Are at Least Length K Places Awayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1437_check_if_all_1s_are_at_least_length_k_places_away
Destination Cityhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1436_destination_city
Number of Ways to Wear Different Hats to Each Otherhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1434_number_of_ways_to_wear_different_hats_to_each_other
Check If a String Can Break Another Stringhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1433_check_if_a_string_can_break_another_string
Max Difference You Can Get From Changing an Integerhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1432_max_difference_you_can_get_from_changing_an_integer
Kids With the Greatest Number of Candieshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1431_kids_with_the_greatest_number_of_candies
Constrained Subsequence Sumhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1425_constrained_subsequence_sum
Diagonal Traverse IIhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1424_diagonal_traverse_ii
Maximum Points You Can Obtain from Cardshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1423_maximum_points_you_can_obtain_from_cards
Maximum Score After Splitting a Stringhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1422_maximum_score_after_splitting_a_string
Build Array Where You Can Find The Maximum Exactly K Comparisonshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1420_build_array_where_you_can_find_the_maximum_exactly_k_comparisons
Minimum Number of Frogs Croakinghttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1419_minimum_number_of_frogs_croaking
Display Table of Food Orders in a Restauranthttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1418_display_table_of_food_orders_in_a_restaurant
Reformat The Stringhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1417_reformat_the_string
Restore The Arrayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1416_restore_the_array
The k-th Lexicographical String of All Happy Strings of Length nhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1415_the_k_th_lexicographical_string_of_all_happy_strings_of_length_n
Find the Minimum Number of Fibonacci Numbers Whose Sum Is Khttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1414_find_the_minimum_number_of_fibonacci_numbers_whose_sum_is_k
Minimum Value to Get Positive Step by Step Sumhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1413_minimum_value_to_get_positive_step_by_step_sum
Number of Ways to Paint N × 3 Gridhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1411_number_of_ways_to_paint_n_3_grid
HTML Entity Parserhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1410_html_entity_parser
Queries on a Permutation With Keyhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1409_queries_on_a_permutation_with_key
String Matching in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1408_string_matching_in_an_array
Top Travellershttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1407_top_travellers
Stone Game IIIhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1406_stone_game_iii
Longest Happy Stringhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1405_longest_happy_string
Number of Steps to Reduce a Number in Binary Representation to Onehttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1404_number_of_steps_to_reduce_a_number_in_binary_representation_to_one
Minimum Subsequence in Non-Increasing Orderhttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1403_minimum_subsequence_in_non_increasing_order
Reducing Disheshttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1402_reducing_dishes
Circle and Rectangle Overlappinghttps://leetcode-in-java.github.io/src/main/java/g1401_1500/s1401_circle_and_rectangle_overlapping
Construct K Palindrome Stringshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1400_construct_k_palindrome_strings
Count Largest Grouphttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1399_count_largest_group
Find All Good Stringshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1397_find_all_good_strings
Design Underground Systemhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1396_design_underground_system
Count Number of Teamshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1395_count_number_of_teams
Find Lucky Integer in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1394_find_lucky_integer_in_an_array
Capital Gain/Losshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1393_capital_gainloss
Longest Happy Prefixhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1392_longest_happy_prefix
Check if There is a Valid Path in a Gridhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid
Four Divisorshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1390_four_divisors
Create Target Array in the Given Orderhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1389_create_target_array_in_the_given_order
Pizza With 3n Sliceshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1388_pizza_with_3n_slices
Sort Integers by The Power Valuehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1387_sort_integers_by_the_power_value
Cinema Seat Allocationhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1386_cinema_seat_allocation
Find the Distance Value Between Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1385_find_the_distance_value_between_two_arrays
Maximum Performance of a Teamhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1383_maximum_performance_of_a_team
Balance a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1382_balance_a_binary_search_tree
Design a Stack With Increment Operationhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1381_design_a_stack_with_increment_operation
Lucky Numbers in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1380_lucky_numbers_in_a_matrix
Find a Corresponding Node of a Binary Tree in a Clone of That Treehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1379_find_a_corresponding_node_of_a_binary_tree_in_a_clone_of_that_tree
Replace Employee ID With The Unique Identifierhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1378_replace_employee_id_with_the_unique_identifier
Frog Position After T Secondshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1377_frog_position_after_t_seconds
Time Needed to Inform All Employeeshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1376_time_needed_to_inform_all_employees
Number of Times Binary String Is Prefix-Alignedhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1375_number_of_times_binary_string_is_prefix_aligned
Generate a String With Characters That Have Odd Countshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1374_generate_a_string_with_characters_that_have_odd_counts
Maximum Sum BST in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1373_maximum_sum_bst_in_binary_tree
Longest ZigZag Path in a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1372_longest_zigzag_path_in_a_binary_tree
Find the Longest Substring Containing Vowels in Even Countshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1371_find_the_longest_substring_containing_vowels_in_even_counts
Increasing Decreasing Stringhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1370_increasing_decreasing_string
Minimum Cost to Make at Least One Valid Path in a Gridhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1368_minimum_cost_to_make_at_least_one_valid_path_in_a_grid
Linked List in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1367_linked_list_in_binary_tree
Rank Teams by Voteshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1366_rank_teams_by_votes
How Many Numbers Are Smaller Than the Current Numberhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1365_how_many_numbers_are_smaller_than_the_current_number
Largest Multiple of Threehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1363_largest_multiple_of_three
Closest Divisorshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1362_closest_divisors
Validate Binary Tree Nodeshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1361_validate_binary_tree_nodes
Number of Days Between Two Dateshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1360_number_of_days_between_two_dates
Count All Valid Pickup and Delivery Optionshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1359_count_all_valid_pickup_and_delivery_options
Number of Substrings Containing All Three Charactershttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1358_number_of_substrings_containing_all_three_characters
Apply Discount Every n Ordershttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1357_apply_discount_every_n_orders
Sort Integers by The Number of 1 Bitshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1356_sort_integers_by_the_number_of_1_bits
Construct Target Array With Multiple Sumshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1354_construct_target_array_with_multiple_sums
Maximum Number of Events That Can Be Attendedhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1353_maximum_number_of_events_that_can_be_attended
Product of the Last K Numbershttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1352_product_of_the_last_k_numbers
Count Negative Numbers in a Sorted Matrixhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1351_count_negative_numbers_in_a_sorted_matrix
Maximum Students Taking Examhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1349_maximum_students_taking_exam
Tweet Counts Per Frequencyhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1348_tweet_counts_per_frequency
Minimum Number of Steps to Make Two Strings Anagramhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1347_minimum_number_of_steps_to_make_two_strings_anagram
Check If N and Its Double Existhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1346_check_if_n_and_its_double_exist
Jump Game IVhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1345_jump_game_iv
Angle Between Hands of a Clockhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1344_angle_between_hands_of_a_clock
Number of Sub-arrays of Size K and Average Greater than or Equal to Thresholdhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1343_number_of_sub_arrays_of_size_k_and_average_greater_than_or_equal_to_threshold
Number of Steps to Reduce a Number to Zerohttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1342_number_of_steps_to_reduce_a_number_to_zero
Movie Ratinghttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1341_movie_rating
Jump Game Vhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1340_jump_game_v
Maximum Product of Splitted Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1339_maximum_product_of_splitted_binary_tree
Reduce Array Size to The Halfhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1338_reduce_array_size_to_the_half
The K Weakest Rows in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1337_the_k_weakest_rows_in_a_matrix
Minimum Difficulty of a Job Schedulehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1335_minimum_difficulty_of_a_job_schedule
Find the City With the Smallest Number of Neighbors at a Threshold Distancehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1334_find_the_city_with_the_smallest_number_of_neighbors_at_a_threshold_distance
Filter Restaurants by Vegan-Friendly, Price and Distancehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1333_filter_restaurants_by_vegan_friendly_price_and_distance
Remove Palindromic Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1332_remove_palindromic_subsequences
Rank Transform of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1331_rank_transform_of_an_array
Reverse Subarray To Maximize Array Valuehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1330_reverse_subarray_to_maximize_array_value
Sort the Matrix Diagonallyhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1329_sort_the_matrix_diagonally
Break a Palindromehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1328_break_a_palindrome
List the Products Ordered in a Periodhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1327_list_the_products_ordered_in_a_period
Minimum Number of Taps to Open to Water a Gardenhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1326_minimum_number_of_taps_to_open_to_water_a_garden
Delete Leaves With a Given Valuehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1325_delete_leaves_with_a_given_value
Print Words Verticallyhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1324_print_words_vertically
Maximum 69 Numberhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1323_maximum_69_number
Restaurant Growthhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1321_restaurant_growth
Minimum Distance to Type a Word Using Two Fingershttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1320_minimum_distance_to_type_a_word_using_two_fingers
Number of Operations to Make Network Connectedhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1319_number_of_operations_to_make_network_connected
Minimum Flips to Make a OR b Equal to chttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1318_minimum_flips_to_make_a_or_b_equal_to_c
Convert Integer to the Sum of Two No-Zero Integershttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1317_convert_integer_to_the_sum_of_two_no_zero_integers
Distinct Echo Substringshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1316_distinct_echo_substrings
Sum of Nodes with Even-Valued Grandparenthttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1315_sum_of_nodes_with_even_valued_grandparent
Matrix Block Sumhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1314_matrix_block_sum
Decompress Run-Length Encoded Listhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1313_decompress_run_length_encoded_list
Minimum Insertion Steps to Make a String Palindromehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1312_minimum_insertion_steps_to_make_a_string_palindrome
Get Watched Videos by Your Friendshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1311_get_watched_videos_by_your_friends
XOR Queries of a Subarrayhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1310_xor_queries_of_a_subarray
Decrypt String from Alphabet to Integer Mappinghttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1309_decrypt_string_from_alphabet_to_integer_mapping
Verbal Arithmetic Puzzlehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1307_verbal_arithmetic_puzzle
Jump Game IIIhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1306_jump_game_iii
All Elements in Two Binary Search Treeshttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1305_all_elements_in_two_binary_search_trees
Find N Unique Integers Sum up to Zerohttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1304_find_n_unique_integers_sum_up_to_zero
Deepest Leaves Sumhttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1302_deepest_leaves_sum
Number of Paths with Max Scorehttps://leetcode-in-java.github.io/src/main/java/g1301_1400/s1301_number_of_paths_with_max_score
Sum of Mutated Array Closest to Targethttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1300_sum_of_mutated_array_closest_to_target
Replace Elements with Greatest Element on Right Sidehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1299_replace_elements_with_greatest_element_on_right_side
Maximum Candies You Can Get from Boxeshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1298_maximum_candies_you_can_get_from_boxes
Maximum Number of Occurrences of a Substringhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1297_maximum_number_of_occurrences_of_a_substring
Divide Array in Sets of K Consecutive Numbershttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1296_divide_array_in_sets_of_k_consecutive_numbers
Find Numbers with Even Number of Digitshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1295_find_numbers_with_even_number_of_digits
Shortest Path in a Grid with Obstacles Eliminationhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1293_shortest_path_in_a_grid_with_obstacles_elimination
Maximum Side Length of a Square with Sum Less than or Equal to Thresholdhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1292_maximum_side_length_of_a_square_with_sum_less_than_or_equal_to_threshold
Sequential Digitshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1291_sequential_digits
Convert Binary Number in a Linked List to Integerhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1290_convert_binary_number_in_a_linked_list_to_integer
Minimum Falling Path Sum IIhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1289_minimum_falling_path_sum_ii
Remove Covered Intervalshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1288_remove_covered_intervals
Element Appearing More Than 25% In Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1287_element_appearing_more_than_25_in_sorted_array
Iterator for Combinationhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1286_iterator_for_combination
Minimum Number of Flips to Convert Binary Matrix to Zero Matrixhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1284_minimum_number_of_flips_to_convert_binary_matrix_to_zero_matrix
Find the Smallest Divisor Given a Thresholdhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1283_find_the_smallest_divisor_given_a_threshold
Group the People Given the Group Size They Belong Tohttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1282_group_the_people_given_the_group_size_they_belong_to
Subtract the Product and Sum of Digits of an Integerhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1281_subtract_the_product_and_sum_of_digits_of_an_integer
Students and Examinationshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1280_students_and_examinations
Palindrome Partitioning IIIhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1278_palindrome_partitioning_iii
Count Square Submatrices with All Oneshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1277_count_square_submatrices_with_all_ones
Number of Burgers with No Waste of Ingredientshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1276_number_of_burgers_with_no_waste_of_ingredients
Find Winner on a Tic Tac Toe Gamehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1275_find_winner_on_a_tic_tac_toe_game
Number of Ways to Stay in the Same Place After Some Stepshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1269_number_of_ways_to_stay_in_the_same_place_after_some_steps
Search Suggestions Systemhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1268_search_suggestions_system
Count Servers that Communicatehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1267_count_servers_that_communicate
Minimum Time Visiting All Pointshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1266_minimum_time_visiting_all_points
Minimum Moves to Move a Box to Their Target Locationhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1263_minimum_moves_to_move_a_box_to_their_target_location
Greatest Sum Divisible by Threehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1262_greatest_sum_divisible_by_three
Find Elements in a Contaminated Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1261_find_elements_in_a_contaminated_binary_tree
Shift 2D Gridhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1260_shift_2d_grid
Maximum Score Words Formed by Lettershttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1255_maximum_score_words_formed_by_letters
Number of Closed Islandshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1254_number_of_closed_islands
Reconstruct a 2-Row Binary Matrixhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1253_reconstruct_a_2_row_binary_matrix
Cells with Odd Values in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1252_cells_with_odd_values_in_a_matrix
Average Selling Pricehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1251_average_selling_price
Check If It Is a Good Arrayhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1250_check_if_it_is_a_good_array
Minimum Remove to Make Valid Parentheseshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1249_minimum_remove_to_make_valid_parentheses
Count Number of Nice Subarrayshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1248_count_number_of_nice_subarrays
Minimum Swaps to Make Strings Equalhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1247_minimum_swaps_to_make_strings_equal
Tiling a Rectangle with the Fewest Squareshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1240_tiling_a_rectangle_with_the_fewest_squares
Maximum Length of a Concatenated String with Unique Charactershttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1239_maximum_length_of_a_concatenated_string_with_unique_characters
Circular Permutation in Binary Representationhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1238_circular_permutation_in_binary_representation
Find Positive Integer Solution for a Given Equationhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1237_find_positive_integer_solution_for_a_given_equation
Maximum Profit in Job Schedulinghttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1235_maximum_profit_in_job_scheduling
Replace the Substring for Balanced Stringhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1234_replace_the_substring_for_balanced_string
Remove Sub-Folders from the Filesystemhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1233_remove_sub_folders_from_the_filesystem
Check If It Is a Straight Linehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1232_check_if_it_is_a_straight_line
Airplane Seat Assignment Probabilityhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1227_airplane_seat_assignment_probability
The Dining Philosophershttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1226_the_dining_philosophers
Maximum Equal Frequencyhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1224_maximum_equal_frequency
Dice Roll Simulationhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1223_dice_roll_simulation
Queens That Can Attack the Kinghttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1222_queens_that_can_attack_the_king
Split a String in Balanced Stringshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1221_split_a_string_in_balanced_strings
Count Vowels Permutationhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1220_count_vowels_permutation
Path with Maximum Goldhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1219_path_with_maximum_gold
Longest Arithmetic Subsequence of Given Differencehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1218_longest_arithmetic_subsequence_of_given_difference
Minimum Cost to Move Chips to The Same Positionhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1217_minimum_cost_to_move_chips_to_the_same_position
Queries Quality and Percentagehttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1211_queries_quality_and_percentage
Minimum Moves to Reach Target with Rotationshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1210_minimum_moves_to_reach_target_with_rotations
Remove All Adjacent Duplicates in String IIhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1209_remove_all_adjacent_duplicates_in_string_ii
Get Equal Substrings Within Budgethttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1208_get_equal_substrings_within_budget
Unique Number of Occurrenceshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1207_unique_number_of_occurrences
Design Skiplisthttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1206_design_skiplist
Last Person to Fit in the Bushttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1204_last_person_to_fit_in_the_bus
Sort Items by Groups Respecting Dependencieshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1203_sort_items_by_groups_respecting_dependencies
Smallest String With Swapshttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1202_smallest_string_with_swaps
Ugly Number IIIhttps://leetcode-in-java.github.io/src/main/java/g1201_1300/s1201_ugly_number_iii
Minimum Absolute Differencehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1200_minimum_absolute_difference
Fizz Buzz Multithreadedhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1195_fizz_buzz_multithreaded
Monthly Transactions Ihttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1193_monthly_transactions_i
Critical Connections in a Networkhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1192_critical_connections_in_a_network
K-Concatenation Maximum Sumhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1191_k_concatenation_maximum_sum
Reverse Substrings Between Each Pair of Parentheseshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1190_reverse_substrings_between_each_pair_of_parentheses
Maximum Number of Balloonshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1189_maximum_number_of_balloons
Make Array Strictly Increasinghttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1187_make_array_strictly_increasing
Maximum Subarray Sum with One Deletionhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1186_maximum_subarray_sum_with_one_deletion
Day of the Weekhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1185_day_of_the_week
Distance Between Bus Stopshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1184_distance_between_bus_stops
Reformat Department Tablehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1179_reformat_department_table
Number of Valid Words for Each Puzzlehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1178_number_of_valid_words_for_each_puzzle
Can Make Palindrome from Substringhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1177_can_make_palindrome_from_substring
Prime Arrangementshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1175_prime_arrangements
Immediate Food Delivery IIhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1174_immediate_food_delivery_ii
Dinner Plate Stackshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1172_dinner_plate_stacks
Remove Zero Sum Consecutive Nodes from Linked Listhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1171_remove_zero_sum_consecutive_nodes_from_linked_list
Compare Strings by Frequency of the Smallest Characterhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1170_compare_strings_by_frequency_of_the_smallest_character
Invalid Transactionshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1169_invalid_transactions
Product Price at a Given Datehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1164_product_price_at_a_given_date
Last Substring in Lexicographical Orderhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1163_last_substring_in_lexicographical_order
As Far from Land as Possiblehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1162_as_far_from_land_as_possible
Maximum Level Sum of a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1161_maximum_level_sum_of_a_binary_tree
Find Words That Can Be Formed by Charactershttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1160_find_words_that_can_be_formed_by_characters
Market Analysis Ihttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1158_market_analysis_i
Online Majority Element In Subarrayhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1157_online_majority_element_in_subarray
Swap For Longest Repeated Character Substringhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1156_swap_for_longest_repeated_character_substring
Number of Dice Rolls With Target Sumhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1155_number_of_dice_rolls_with_target_sum
Day of the Yearhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1154_day_of_the_year
Article Views Ihttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1148_article_views_i
Longest Chunked Palindrome Decompositionhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1147_longest_chunked_palindrome_decomposition
Snapshot Arrayhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1146_snapshot_array
Binary Tree Coloring Gamehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1145_binary_tree_coloring_game
Decrease Elements To Make Array Zigzaghttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1144_decrease_elements_to_make_array_zigzag
Longest Common Subsequencehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1143_longest_common_subsequence
User Activity for the Past 30 Days Ihttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1141_user_activity_for_the_past_30_days_i
Stone Game IIhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1140_stone_game_ii
Largest 1-Bordered Squarehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1139_largest_1_bordered_square
Alphabet Board Pathhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1138_alphabet_board_path
N-th Tribonacci Numberhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1137_n_th_tribonacci_number
Maximum of Absolute Value Expressionhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1131_maximum_of_absolute_value_expression
Minimum Cost Tree From Leaf Valueshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1130_minimum_cost_tree_from_leaf_values
Shortest Path with Alternating Colorshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1129_shortest_path_with_alternating_colors
Number of Equivalent Domino Pairshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1128_number_of_equivalent_domino_pairs
Smallest Sufficient Teamhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1125_smallest_sufficient_team
Longest Well-Performing Intervalhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1124_longest_well_performing_interval
Lowest Common Ancestor of Deepest Leaveshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1123_lowest_common_ancestor_of_deepest_leaves
Relative Sort Arrayhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1122_relative_sort_array
Building H2Ohttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1117_building_h2o
Print Zero Even Oddhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1116_print_zero_even_odd
Print FooBar Alternatelyhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1115_print_foobar_alternately
Print in Orderhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1114_print_in_order
Maximum Nesting Depth of Two Valid Parentheses Stringshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1111_maximum_nesting_depth_of_two_valid_parentheses_strings
Delete Nodes And Return Foresthttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1110_delete_nodes_and_return_forest
Corporate Flight Bookingshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1109_corporate_flight_bookings
Defanging an IP Addresshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1108_defanging_an_ip_address
Parsing A Boolean Expressionhttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1106_parsing_a_boolean_expression
Filling Bookcase Shelveshttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1105_filling_bookcase_shelves
Path In Zigzag Labelled Binary Treehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1104_path_in_zigzag_labelled_binary_tree
Distribute Candies to Peoplehttps://leetcode-in-java.github.io/src/main/java/g1101_1200/s1103_distribute_candies_to_people
Brace Expansion IIhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1096_brace_expansion_ii
Find in Mountain Arrayhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1095_find_in_mountain_array
Car Poolinghttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1094_car_pooling
Statistics from a Large Samplehttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1093_statistics_from_a_large_sample
Shortest Common Supersequencehttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1092_shortest_common_supersequence
Shortest Path in Binary Matrixhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1091_shortest_path_in_binary_matrix
Largest Values From Labelshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1090_largest_values_from_labels
Duplicate Zeroshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1089_duplicate_zeros
Sales Analysis IIIhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1084_sales_analysis_iii
Smallest Subsequence of Distinct Charactershttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1081_smallest_subsequence_of_distinct_characters
Insufficient Nodes in Root to Leaf Pathshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1080_insufficient_nodes_in_root_to_leaf_paths
Letter Tile Possibilitieshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1079_letter_tile_possibilities
Occurrences After Bigramhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1078_occurrences_after_bigram
Project Employees Ihttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1075_project_employees_i
Number of Submatrices That Sum to Targethttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1074_number_of_submatrices_that_sum_to_target
Adding Two Negabinary Numbershttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1073_adding_two_negabinary_numbers
Flip Columns For Maximum Number of Equal Rowshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1072_flip_columns_for_maximum_number_of_equal_rows
Greatest Common Divisor of Stringshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1071_greatest_common_divisor_of_strings
Product Sales Analysis IIIhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1070_product_sales_analysis_iii
Product Sales Analysis Ihttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1068_product_sales_analysis_i
Lexicographically Smallest Equivalent Stringhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1061_lexicographically_smallest_equivalent_string
Distant Barcodeshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1054_distant_barcodes
Previous Permutation With One Swaphttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1053_previous_permutation_with_one_swap
Grumpy Bookstore Ownerhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1052_grumpy_bookstore_owner
Height Checkerhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1051_height_checker
Actors and Directors Who Cooperated At Least Three Timeshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1050_actors_and_directors_who_cooperated_at_least_three_times
Last Stone Weight IIhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1049_last_stone_weight_ii
Longest String Chainhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1048_longest_string_chain
Remove All Adjacent Duplicates In Stringhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1047_remove_all_adjacent_duplicates_in_string
Last Stone Weighthttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1046_last_stone_weight
Customers Who Bought All Productshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1045_customers_who_bought_all_products
Longest Duplicate Substringhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1044_longest_duplicate_substring
Partition Array for Maximum Sumhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1043_partition_array_for_maximum_sum
Flower Planting With No Adjacenthttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1042_flower_planting_with_no_adjacent
Robot Bounded In Circlehttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1041_robot_bounded_in_circle
Moving Stones Until Consecutive IIhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1040_moving_stones_until_consecutive_ii
Minimum Score Triangulation of Polygonhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1039_minimum_score_triangulation_of_polygon
Binary Search Tree to Greater Sum Treehttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1038_binary_search_tree_to_greater_sum_tree
Valid Boomeranghttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1037_valid_boomerang
Escape a Large Mazehttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1036_escape_a_large_maze
Uncrossed Lineshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1035_uncrossed_lines
Coloring A Borderhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1034_coloring_a_border
Moving Stones Until Consecutivehttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1033_moving_stones_until_consecutive
Stream of Charactershttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1032_stream_of_characters
Maximum Sum of Two Non-Overlapping Subarrayshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1031_maximum_sum_of_two_non_overlapping_subarrays
Matrix Cells in Distance Orderhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1030_matrix_cells_in_distance_order
Two City Schedulinghttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1029_two_city_scheduling
Recover a Tree From Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1028_recover_a_tree_from_preorder_traversal
Longest Arithmetic Subsequencehttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1027_longest_arithmetic_subsequence
Maximum Difference Between Node and Ancestorhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1026_maximum_difference_between_node_and_ancestor
Divisor Gamehttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1025_divisor_game
Video Stitchinghttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1024_video_stitching
Camelcase Matchinghttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1023_camelcase_matching
Sum of Root To Leaf Binary Numbershttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1022_sum_of_root_to_leaf_binary_numbers
Remove Outermost Parentheseshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1021_remove_outermost_parentheses
Number of Enclaveshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1020_number_of_enclaves
Next Greater Node In Linked Listhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1019_next_greater_node_in_linked_list
Binary Prefix Divisible By 5https://leetcode-in-java.github.io/src/main/java/g1001_1100/s1018_binary_prefix_divisible_by_5
Convert to Base -2https://leetcode-in-java.github.io/src/main/java/g1001_1100/s1017_convert_to_base_2
Binary String With Substrings Representing 1 To Nhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1016_binary_string_with_substrings_representing_1_to_n
Smallest Integer Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1015_smallest_integer_divisible_by_k
Best Sightseeing Pairhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1014_best_sightseeing_pair
Partition Array Into Three Parts With Equal Sumhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1013_partition_array_into_three_parts_with_equal_sum
Numbers With Repeated Digitshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1012_numbers_with_repeated_digits
Capacity To Ship Packages Within D Dayshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1011_capacity_to_ship_packages_within_d_days
Pairs of Songs With Total Durations Divisible by 60https://leetcode-in-java.github.io/src/main/java/g1001_1100/s1010_pairs_of_songs_with_total_durations_divisible_by_60
Complement of Base 10 Integerhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1009_complement_of_base_10_integer
Construct Binary Search Tree from Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1008_construct_binary_search_tree_from_preorder_traversal
Minimum Domino Rotations For Equal Rowhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1007_minimum_domino_rotations_for_equal_row
Clumsy Factorialhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1006_clumsy_factorial
Maximize Sum Of Array After K Negationshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1005_maximize_sum_of_array_after_k_negations
Max Consecutive Ones IIIhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1004_max_consecutive_ones_iii
Check If Word Is Valid After Substitutionshttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1003_check_if_word_is_valid_after_substitutions
Find Common Charactershttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1002_find_common_characters
Grid Illuminationhttps://leetcode-in-java.github.io/src/main/java/g1001_1100/s1001_grid_illumination
Minimum Cost to Merge Stoneshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s1000_minimum_cost_to_merge_stones
Available Captures for Rookhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0999_available_captures_for_rook
Maximum Binary Tree IIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0998_maximum_binary_tree_ii
Find the Town Judgehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0997_find_the_town_judge
Number of Squareful Arrayshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0996_number_of_squareful_arrays
Minimum Number of K Consecutive Bit Flipshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0995_minimum_number_of_k_consecutive_bit_flips
Rotting Orangeshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0994_rotting_oranges
Cousins in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0993_cousins_in_binary_tree
Subarrays with K Different Integershttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0992_subarrays_with_k_different_integers
Broken Calculatorhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0991_broken_calculator
Satisfiability of Equality Equationshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0990_satisfiability_of_equality_equations
Add to Array-Form of Integerhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0989_add_to_array_form_of_integer
Smallest String Starting From Leafhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0988_smallest_string_starting_from_leaf
Vertical Order Traversal of a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0987_vertical_order_traversal_of_a_binary_tree
Interval List Intersectionshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0986_interval_list_intersections
Sum of Even Numbers After Querieshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0985_sum_of_even_numbers_after_queries
String Without AAA or BBBhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0984_string_without_aaa_or_bbb
Minimum Cost For Ticketshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0983_minimum_cost_for_tickets
Triples with Bitwise AND Equal To Zerohttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0982_triples_with_bitwise_and_equal_to_zero
Time Based Key-Value Storehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0981_time_based_key_value_store
Unique Paths IIIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0980_unique_paths_iii
Distribute Coins in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0979_distribute_coins_in_binary_tree
Longest Turbulent Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0978_longest_turbulent_subarray
Squares of a Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0977_squares_of_a_sorted_array
Largest Perimeter Trianglehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0976_largest_perimeter_triangle
Odd Even Jumphttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0975_odd_even_jump
Subarray Sums Divisible by Khttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0974_subarray_sums_divisible_by_k
K Closest Points to Originhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0973_k_closest_points_to_origin
Equal Rational Numbershttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0972_equal_rational_numbers
Flip Binary Tree To Match Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0971_flip_binary_tree_to_match_preorder_traversal
Powerful Integershttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0970_powerful_integers
Pancake Sortinghttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0969_pancake_sorting
Binary Tree Camerashttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0968_binary_tree_cameras
Numbers With Same Consecutive Differenceshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0967_numbers_with_same_consecutive_differences
Vowel Spellcheckerhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0966_vowel_spellchecker
Univalued Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0965_univalued_binary_tree
Least Operators to Express Numberhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0964_least_operators_to_express_number
Minimum Area Rectangle IIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0963_minimum_area_rectangle_ii
Maximum Width Ramphttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0962_maximum_width_ramp
N-Repeated Element in Size 2N Arrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0961_n_repeated_element_in_size_2n_array
Delete Columns to Make Sorted IIIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0960_delete_columns_to_make_sorted_iii
Regions Cut By Slasheshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0959_regions_cut_by_slashes
Check Completeness of a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0958_check_completeness_of_a_binary_tree
Prison Cells After N Dayshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0957_prison_cells_after_n_days
Tallest Billboardhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0956_tallest_billboard
Delete Columns to Make Sorted IIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0955_delete_columns_to_make_sorted_ii
Array of Doubled Pairshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0954_array_of_doubled_pairs
Verifying an Alien Dictionaryhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0953_verifying_an_alien_dictionary
Largest Component Size by Common Factorhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0952_largest_component_size_by_common_factor
Flip Equivalent Binary Treeshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0951_flip_equivalent_binary_trees
Reveal Cards In Increasing Orderhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0950_reveal_cards_in_increasing_order
Largest Time for Given Digitshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0949_largest_time_for_given_digits
Bag of Tokenshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0948_bag_of_tokens
Most Stones Removed with Same Row or Columnhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0947_most_stones_removed_with_same_row_or_column
Validate Stack Sequenceshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0946_validate_stack_sequences
Minimum Increment to Make Array Uniquehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0945_minimum_increment_to_make_array_unique
Delete Columns to Make Sortedhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0944_delete_columns_to_make_sorted
Find the Shortest Superstringhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0943_find_the_shortest_superstring
DI String Matchhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0942_di_string_match
Valid Mountain Arrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0941_valid_mountain_array
Distinct Subsequences IIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0940_distinct_subsequences_ii
Minimum Area Rectanglehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0939_minimum_area_rectangle
Range Sum of BSThttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0938_range_sum_of_bst
Reorder Data in Log Fileshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0937_reorder_data_in_log_files
Stamping The Sequencehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0936_stamping_the_sequence
Knight Dialerhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0935_knight_dialer
Shortest Bridgehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0934_shortest_bridge
Number of Recent Callshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0933_number_of_recent_calls
Beautiful Arrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0932_beautiful_array
Minimum Falling Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0931_minimum_falling_path_sum
Binary Subarrays With Sumhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0930_binary_subarrays_with_sum
Unique Email Addresseshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0929_unique_email_addresses
Minimize Malware Spread IIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0928_minimize_malware_spread_ii
Three Equal Partshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0927_three_equal_parts
Flip String to Monotone Increasinghttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0926_flip_string_to_monotone_increasing
Long Pressed Namehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0925_long_pressed_name
Minimize Malware Spreadhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0924_minimize_malware_spread
3Sum With Multiplicityhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0923_3sum_with_multiplicity
Sort Array By Parity IIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0922_sort_array_by_parity_ii
Minimum Add to Make Parentheses Validhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0921_minimum_add_to_make_parentheses_valid
Number of Music Playlistshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0920_number_of_music_playlists
Complete Binary Tree Inserterhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0919_complete_binary_tree_inserter
Maximum Sum Circular Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0918_maximum_sum_circular_subarray
Reverse Only Lettershttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0917_reverse_only_letters
Word Subsetshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0916_word_subsets
Partition Array into Disjoint Intervalshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0915_partition_array_into_disjoint_intervals
X of a Kind in a Deck of Cardshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0914_x_of_a_kind_in_a_deck_of_cards
Cat and Mousehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0913_cat_and_mouse
Sort an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0912_sort_an_array
Online Electionhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0911_online_election
Smallest Range IIhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0910_smallest_range_ii
Snakes and Laddershttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0909_snakes_and_ladders
Smallest Range Ihttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0908_smallest_range_i
Sum of Subarray Minimumshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0907_sum_of_subarray_minimums
Super Palindromeshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0906_super_palindromes
Sort Array By Parityhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0905_sort_array_by_parity
Fruit Into Basketshttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0904_fruit_into_baskets
Valid Permutations for DI Sequencehttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0903_valid_permutations_for_di_sequence
Numbers At Most N Given Digit Sethttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0902_numbers_at_most_n_given_digit_set
Online Stock Spanhttps://leetcode-in-java.github.io/src/main/java/g0901_1000/s0901_online_stock_span
RLE Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0900_rle_iterator
Orderly Queuehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0899_orderly_queue
Bitwise ORs of Subarrayshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0898_bitwise_ors_of_subarrays
Increasing Order Search Treehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0897_increasing_order_search_tree
Monotonic Arrayhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0896_monotonic_array
Maximum Frequency Stackhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0895_maximum_frequency_stack
All Possible Full Binary Treeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0894_all_possible_full_binary_trees
Groups of Special-Equivalent Stringshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0893_groups_of_special_equivalent_strings
Surface Area of 3D Shapeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0892_surface_area_of_3d_shapes
Sum of Subsequence Widthshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0891_sum_of_subsequence_widths
Find and Replace Patternhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0890_find_and_replace_pattern
Construct Binary Tree from Preorder and Postorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0889_construct_binary_tree_from_preorder_and_postorder_traversal
Fair Candy Swaphttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0888_fair_candy_swap
Super Egg Drophttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0887_super_egg_drop
Possible Bipartitionhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0886_possible_bipartition
Spiral Matrix IIIhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0885_spiral_matrix_iii
Uncommon Words from Two Sentenceshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0884_uncommon_words_from_two_sentences
Projection Area of 3D Shapeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0883_projection_area_of_3d_shapes
Reachable Nodes In Subdivided Graphhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0882_reachable_nodes_in_subdivided_graph
Boats to Save Peoplehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0881_boats_to_save_people
Decoded String at Indexhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0880_decoded_string_at_index
Profitable Schemeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0879_profitable_schemes
Nth Magical Numberhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0878_nth_magical_number
Stone Gamehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0877_stone_game
Middle of the Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0876_middle_of_the_linked_list
Koko Eating Bananashttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0875_koko_eating_bananas
Walking Robot Simulationhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0874_walking_robot_simulation
Length of Longest Fibonacci Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0873_length_of_longest_fibonacci_subsequence
Leaf-Similar Treeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0872_leaf_similar_trees
Minimum Number of Refueling Stopshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0871_minimum_number_of_refueling_stops
Advantage Shufflehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0870_advantage_shuffle
Reordered Power of 2https://leetcode-in-java.github.io/src/main/java/g0801_0900/s0869_reordered_power_of_2
Binary Gaphttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0868_binary_gap
Transpose Matrixhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0867_transpose_matrix
Prime Palindromehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0866_prime_palindrome
Smallest Subtree with all the Deepest Nodeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0865_smallest_subtree_with_all_the_deepest_nodes
Shortest Path to Get All Keyshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0864_shortest_path_to_get_all_keys
All Nodes Distance K in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0863_all_nodes_distance_k_in_binary_tree
Shortest Subarray with Sum at Least Khttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0862_shortest_subarray_with_sum_at_least_k
Score After Flipping Matrixhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0861_score_after_flipping_matrix
Lemonade Changehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0860_lemonade_change
Buddy Stringshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0859_buddy_strings
Mirror Reflectionhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0858_mirror_reflection
Minimum Cost to Hire K Workershttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0857_minimum_cost_to_hire_k_workers
Score of Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0856_score_of_parentheses
Exam Roomhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0855_exam_room
K-Similar Stringshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0854_k_similar_strings
Car Fleethttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0853_car_fleet
Peak Index in a Mountain Arrayhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0852_peak_index_in_a_mountain_array
Loud and Richhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0851_loud_and_rich
Rectangle Area IIhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0850_rectangle_area_ii
Maximize Distance to Closest Personhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0849_maximize_distance_to_closest_person
Shifting Lettershttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0848_shifting_letters
Shortest Path Visiting All Nodeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0847_shortest_path_visiting_all_nodes
Hand of Straightshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0846_hand_of_straights
Longest Mountain in Arrayhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0845_longest_mountain_in_array
Backspace String Comparehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0844_backspace_string_compare
Guess the Wordhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0843_guess_the_word
Split Array into Fibonacci Sequencehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0842_split_array_into_fibonacci_sequence
Keys and Roomshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0841_keys_and_rooms
Magic Squares In Gridhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0840_magic_squares_in_grid
Similar String Groupshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0839_similar_string_groups
Push Dominoeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0838_push_dominoes
New 21 Gamehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0837_new_21_game
Rectangle Overlaphttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0836_rectangle_overlap
Image Overlaphttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0835_image_overlap
Sum of Distances in Treehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0834_sum_of_distances_in_tree
Find And Replace in Stringhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0833_find_and_replace_in_string
Flipping an Imagehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0832_flipping_an_image
Masking Personal Informationhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0831_masking_personal_information
Positions of Large Groupshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0830_positions_of_large_groups
Consecutive Numbers Sumhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0829_consecutive_numbers_sum
Count Unique Characters of All Substrings of a Given Stringhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0828_count_unique_characters_of_all_substrings_of_a_given_string
Making A Large Islandhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0827_making_a_large_island
Most Profit Assigning Workhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0826_most_profit_assigning_work
Friends Of Appropriate Ageshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0825_friends_of_appropriate_ages
Goat Latinhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0824_goat_latin
Binary Trees With Factorshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0823_binary_trees_with_factors
Card Flipping Gamehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0822_card_flipping_game
Shortest Distance to a Characterhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0821_shortest_distance_to_a_character
Short Encoding of Wordshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0820_short_encoding_of_words
Most Common Wordhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0819_most_common_word
Race Carhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0818_race_car
Linked List Componentshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0817_linked_list_components
Ambiguous Coordinateshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0816_ambiguous_coordinates
Bus Routeshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0815_bus_routes
Binary Tree Pruninghttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0814_binary_tree_pruning
Largest Sum of Averageshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0813_largest_sum_of_averages
Largest Triangle Areahttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0812_largest_triangle_area
Subdomain Visit Counthttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0811_subdomain_visit_count
Chalkboard XOR Gamehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0810_chalkboard_xor_game
Expressive Wordshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0809_expressive_words
Soup Servingshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0808_soup_servings
Max Increase to Keep City Skylinehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0807_max_increase_to_keep_city_skyline
Number of Lines To Write Stringhttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0806_number_of_lines_to_write_string
Split Array With Same Averagehttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0805_split_array_with_same_average
Unique Morse Code Wordshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0804_unique_morse_code_words
Bricks Falling When Hithttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0803_bricks_falling_when_hit
Find Eventual Safe Stateshttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0802_find_eventual_safe_states
Minimum Swaps To Make Sequences Increasinghttps://leetcode-in-java.github.io/src/main/java/g0801_0900/s0801_minimum_swaps_to_make_sequences_increasing
Champagne Towerhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0799_champagne_tower
Smallest Rotation with Highest Scorehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0798_smallest_rotation_with_highest_score
All Paths From Source to Targethttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0797_all_paths_from_source_to_target
Rotate Stringhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0796_rotate_string
Number of Subarrays with Bounded Maximumhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0795_number_of_subarrays_with_bounded_maximum
Valid Tic-Tac-Toe Statehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0794_valid_tic_tac_toe_state
Preimage Size of Factorial Zeroes Functionhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0793_preimage_size_of_factorial_zeroes_function
Number of Matching Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0792_number_of_matching_subsequences
Custom Sort Stringhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0791_custom_sort_string
Domino and Tromino Tilinghttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0790_domino_and_tromino_tiling
Escape The Ghostshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0789_escape_the_ghosts
Rotated Digitshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0788_rotated_digits
Cheapest Flights Within K Stopshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0787_cheapest_flights_within_k_stops
K-th Smallest Prime Fractionhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0786_k_th_smallest_prime_fraction
Is Graph Bipartite?https://leetcode-in-java.github.io/src/main/java/g0701_0800/s0785_is_graph_bipartite
Letter Case Permutationhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0784_letter_case_permutation
Minimum Distance Between BST Nodeshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0783_minimum_distance_between_bst_nodes
Transform to Chessboardhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0782_transform_to_chessboard
Rabbits in Foresthttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0781_rabbits_in_forest
Reaching Pointshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0780_reaching_points
K-th Symbol in Grammarhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0779_k_th_symbol_in_grammar
Swim in Rising Waterhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0778_swim_in_rising_water
Swap Adjacent in LR Stringhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0777_swap_adjacent_in_lr_string
Global and Local Inversionshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0775_global_and_local_inversions
Sliding Puzzlehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0773_sliding_puzzle
Jewels and Stoneshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0771_jewels_and_stones
Basic Calculator IVhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0770_basic_calculator_iv
Max Chunks To Make Sortedhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0769_max_chunks_to_make_sorted
Max Chunks To Make Sorted IIhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0768_max_chunks_to_make_sorted_ii
Reorganize Stringhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0767_reorganize_string
Toeplitz Matrixhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0766_toeplitz_matrix
Couples Holding Handshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0765_couples_holding_hands
Largest Plus Signhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0764_largest_plus_sign
Partition Labelshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0763_partition_labels
Prime Number of Set Bits in Binary Representationhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0762_prime_number_of_set_bits_in_binary_representation
Special Binary Stringhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0761_special_binary_string
Set Intersection Size At Least Twohttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0757_set_intersection_size_at_least_two
Pyramid Transition Matrixhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0756_pyramid_transition_matrix
Reach a Numberhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0754_reach_a_number
Cracking the Safehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0753_cracking_the_safe
Open the Lockhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0752_open_the_lock
Contain Virushttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0749_contain_virus
Shortest Completing Wordhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0748_shortest_completing_word
Largest Number At Least Twice of Othershttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0747_largest_number_at_least_twice_of_others
Min Cost Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0746_min_cost_climbing_stairs
Prefix and Suffix Searchhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0745_prefix_and_suffix_search
Find Smallest Letter Greater Than Targethttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0744_find_smallest_letter_greater_than_target
Network Delay Timehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0743_network_delay_time
Cherry Pickuphttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0741_cherry_pickup
Delete and Earnhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0740_delete_and_earn
Daily Temperatureshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0739_daily_temperatures
Monotone Increasing Digitshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0738_monotone_increasing_digits
Parse Lisp Expressionhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0736_parse_lisp_expression
Asteroid Collisionhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0735_asteroid_collision
Flood Fillhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0733_flood_fill
My Calendar IIIhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0732_my_calendar_iii
My Calendar IIhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0731_my_calendar_ii
Count Different Palindromic Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0730_count_different_palindromic_subsequences
My Calendar Ihttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0729_my_calendar_i
Self Dividing Numbershttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0728_self_dividing_numbers
Number of Atomshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0726_number_of_atoms
Split Linked List in Partshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0725_split_linked_list_in_parts
Find Pivot Indexhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0724_find_pivot_index
Remove Commentshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0722_remove_comments
Accounts Mergehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0721_accounts_merge
Longest Word in Dictionaryhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0720_longest_word_in_dictionary
Find K-th Smallest Pair Distancehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0719_find_k_th_smallest_pair_distance
Maximum Length of Repeated Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0718_maximum_length_of_repeated_subarray
1-bit and 2-bit Charactershttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0717_1_bit_and_2_bit_characters
Range Modulehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0715_range_module
Best Time to Buy and Sell Stock with Transaction Feehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0714_best_time_to_buy_and_sell_stock_with_transaction_fee
Subarray Product Less Than Khttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0713_subarray_product_less_than_k
Minimum ASCII Delete Sum for Two Stringshttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0712_minimum_ascii_delete_sum_for_two_strings
Random Pick with Blacklisthttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0710_random_pick_with_blacklist
To Lower Casehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0709_to_lower_case
Design Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0707_design_linked_list
Design HashMaphttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0706_design_hashmap
Design HashSethttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0705_design_hashset
Binary Searchhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0704_binary_search
Kth Largest Element in a Streamhttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0703_kth_largest_element_in_a_stream
Insert into a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0701_0800/s0701_insert_into_a_binary_search_tree
Search in a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0700_search_in_a_binary_search_tree
Falling Squareshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0699_falling_squares
Partition to K Equal Sum Subsetshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0698_partition_to_k_equal_sum_subsets
Degree of an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0697_degree_of_an_array
Count Binary Substringshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0696_count_binary_substrings
Max Area of Islandhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0695_max_area_of_island
Binary Number with Alternating Bitshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0693_binary_number_with_alternating_bits
Top K Frequent Wordshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0692_top_k_frequent_words
Stickers to Spell Wordhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0691_stickers_to_spell_word
Employee Importancehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0690_employee_importance
Maximum Sum of 3 Non-Overlapping Subarrayshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0689_maximum_sum_of_3_non_overlapping_subarrays
Knight Probability in Chessboardhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0688_knight_probability_in_chessboard
Longest Univalue Pathhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0687_longest_univalue_path
Repeated String Matchhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0686_repeated_string_match
Redundant Connection IIhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0685_redundant_connection_ii
Redundant Connectionhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0684_redundant_connection
Baseball Gamehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0682_baseball_game
Valid Palindrome IIhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0680_valid_palindrome_ii
24 Gamehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0679_24_game
Valid Parenthesis Stringhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0678_valid_parenthesis_string
Map Sum Pairshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0677_map_sum_pairs
Implement Magic Dictionaryhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0676_implement_magic_dictionary
Cut Off Trees for Golf Eventhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0675_cut_off_trees_for_golf_event
Longest Continuous Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0674_longest_continuous_increasing_subsequence
Number of Longest Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0673_number_of_longest_increasing_subsequence
Bulb Switcher IIhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0672_bulb_switcher_ii
Second Minimum Node In a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0671_second_minimum_node_in_a_binary_tree
Maximum Swaphttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0670_maximum_swap
Trim a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0669_trim_a_binary_search_tree
Kth Smallest Number in Multiplication Tablehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0668_kth_smallest_number_in_multiplication_table
Beautiful Arrangement IIhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0667_beautiful_arrangement_ii
Non-decreasing Arrayhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0665_non_decreasing_array
Strange Printerhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0664_strange_printer
Maximum Width of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0662_maximum_width_of_binary_tree
Image Smootherhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0661_image_smoother
Split Array into Consecutive Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0659_split_array_into_consecutive_subsequences
Find K Closest Elementshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0658_find_k_closest_elements
Robot Return to Originhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0657_robot_return_to_origin
Print Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0655_print_binary_tree
Maximum Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0654_maximum_binary_tree
Two Sum IV - Input is a BSThttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0653_two_sum_iv_input_is_a_bst
Find Duplicate Subtreeshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0652_find_duplicate_subtrees
2 Keys Keyboardhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0650_2_keys_keyboard
Dota2 Senatehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0649_dota2_senate
Replace Wordshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0648_replace_words
Palindromic Substringshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0647_palindromic_substrings
Maximum Length of Pair Chainhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0646_maximum_length_of_pair_chain
Set Mismatchhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0645_set_mismatch
Maximum Average Subarray Ihttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0643_maximum_average_subarray_i
Design Circular Dequehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0641_design_circular_deque
Solve the Equationhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0640_solve_the_equation
Decode Ways IIhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0639_decode_ways_ii
Shopping Offershttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0638_shopping_offers
Average of Levels in Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0637_average_of_levels_in_binary_tree
Exclusive Time of Functionshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0636_exclusive_time_of_functions
Sum of Square Numbershttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0633_sum_of_square_numbers
Smallest Range Covering Elements from K Listshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0632_smallest_range_covering_elements_from_k_lists
Course Schedule IIIhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0630_course_schedule_iii
K Inverse Pairs Arrayhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0629_k_inverse_pairs_array
Maximum Product of Three Numbershttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0628_maximum_product_of_three_numbers
Swap Salaryhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0627_swap_salary
Exchange Seatshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0626_exchange_seats
Add One Row to Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0623_add_one_row_to_tree
Design Circular Queuehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0622_design_circular_queue
Task Schedulerhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0621_task_scheduler
Not Boring Movieshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0620_not_boring_movies
Biggest Single Numberhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0619_biggest_single_number
Merge Two Binary Treeshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0617_merge_two_binary_trees
Valid Triangle Numberhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0611_valid_triangle_number
Triangle Judgementhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0610_triangle_judgement
Find Duplicate File in Systemhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0609_find_duplicate_file_in_system
Tree Nodehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0608_tree_node
Sales Personhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0607_sales_person
Construct String from Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0606_construct_string_from_binary_tree
Can Place Flowershttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0605_can_place_flowers
Friend Requests II: Who Has the Most Friendshttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0602_friend_requests_ii_who_has_the_most_friends
Human Traffic of Stadiumhttps://leetcode-in-java.github.io/src/main/java/g0601_0700/s0601_human_traffic_of_stadium
Non-negative Integers without Consecutive Oneshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0600_non_negative_integers_without_consecutive_ones
Minimum Index Sum of Two Listshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0599_minimum_index_sum_of_two_lists
Range Addition IIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0598_range_addition_ii
Classes More Than 5 Studentshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0596_classes_more_than_5_students
Big Countrieshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0595_big_countries
Longest Harmonious Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0594_longest_harmonious_subsequence
Valid Squarehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0593_valid_square
Fraction Addition and Subtractionhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0592_fraction_addition_and_subtraction
Tag Validatorhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0591_tag_validator
N-ary Tree Postorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0590_n_ary_tree_postorder_traversal
N-ary Tree Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0589_n_ary_tree_preorder_traversal
Erect the Fencehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0587_erect_the_fence
Customer Placing the Largest Number of Ordershttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0586_customer_placing_the_largest_number_of_orders
Investments in 2016https://leetcode-in-java.github.io/src/main/java/g0501_0600/s0585_investments_in_2016
Find Customer Refereehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0584_find_customer_referee
Delete Operation for Two Stringshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0583_delete_operation_for_two_strings
Shortest Unsorted Continuous Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0581_shortest_unsorted_continuous_subarray
Employee Bonushttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0577_employee_bonus
Out of Boundary Pathshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0576_out_of_boundary_paths
Distribute Candieshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0575_distribute_candies
Subtree of Another Treehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0572_subtree_of_another_tree
Managers with at Least 5 Direct Reportshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0570_managers_with_at_least_5_direct_reports
Permutation in Stringhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0567_permutation_in_string
Reshape the Matrixhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0566_reshape_the_matrix
Array Nestinghttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0565_array_nesting
Find the Closest Palindromehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0564_find_the_closest_palindrome
Binary Tree Tilthttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0563_binary_tree_tilt
Array Partition Ihttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0561_array_partition_i
Subarray Sum Equals Khttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0560_subarray_sum_equals_k
Maximum Depth of N-ary Treehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0559_maximum_depth_of_n_ary_tree
Logical OR of Two Binary Grids Represented as Quad-Treeshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0558_logical_or_of_two_binary_grids_represented_as_quad_trees
Reverse Words in a String IIIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0557_reverse_words_in_a_string_iii
Next Greater Element IIIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0556_next_greater_element_iii
Brick Wallhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0554_brick_wall
Optimal Divisionhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0553_optimal_division
Student Attendance Record IIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0552_student_attendance_record_ii
Student Attendance Record Ihttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0551_student_attendance_record_i
Game Play Analysis IVhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0550_game_play_analysis_iv
Number of Provinceshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0547_number_of_provinces
Remove Boxeshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0546_remove_boxes
Diameter of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0543_diameter_of_binary_tree
01 Matrixhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0542_01_matrix
Reverse String IIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0541_reverse_string_ii
Single Element in a Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0540_single_element_in_a_sorted_array
Minimum Time Differencehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0539_minimum_time_difference
Convert BST to Greater Treehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0538_convert_bst_to_greater_tree
Complex Number Multiplicationhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0537_complex_number_multiplication
Encode and Decode TinyURLhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0535_encode_and_decode_tinyurl
K-diff Pairs in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0532_k_diff_pairs_in_an_array
Minimum Absolute Difference in BSThttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0530_minimum_absolute_difference_in_bst
Minesweeperhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0529_minesweeper
Random Pick with Weighthttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0528_random_pick_with_weight
Beautiful Arrangementhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0526_beautiful_arrangement
Contiguous Arrayhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0525_contiguous_array
Longest Word in Dictionary through Deletinghttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0524_longest_word_in_dictionary_through_deleting
Continuous Subarray Sumhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0523_continuous_subarray_sum
Longest Uncommon Subsequence IIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0522_longest_uncommon_subsequence_ii
Longest Uncommon Subsequence Ihttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0521_longest_uncommon_subsequence_i
Detect Capitalhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0520_detect_capital
Random Flip Matrixhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0519_random_flip_matrix
Coin Change 2https://leetcode-in-java.github.io/src/main/java/g0501_0600/s0518_coin_change_2
Super Washing Machineshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0517_super_washing_machines
Longest Palindromic Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0516_longest_palindromic_subsequence
Find Largest Value in Each Tree Rowhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0515_find_largest_value_in_each_tree_row
Freedom Trailhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0514_freedom_trail
Find Bottom Left Tree Valuehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0513_find_bottom_left_tree_value
Game Play Analysis Ihttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0511_game_play_analysis_i
Fibonacci Numberhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0509_fibonacci_number
Most Frequent Subtree Sumhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0508_most_frequent_subtree_sum
Perfect Numberhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0507_perfect_number
Relative Rankshttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0506_relative_ranks
Base 7https://leetcode-in-java.github.io/src/main/java/g0501_0600/s0504_base_7
Next Greater Element IIhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0503_next_greater_element_ii
IPOhttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0502_ipo
Find Mode in Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0501_0600/s0501_find_mode_in_binary_search_tree
Keyboard Rowhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0500_keyboard_row
Diagonal Traversehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0498_diagonal_traverse
Random Point in Non-overlapping Rectangleshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0497_random_point_in_non_overlapping_rectangles
Next Greater Element Ihttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0496_next_greater_element_i
Teemo Attackinghttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0495_teemo_attacking
Target Sumhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0494_target_sum
Reverse Pairshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0493_reverse_pairs
Construct the Rectanglehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0492_construct_the_rectangle
Increasing Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0491_increasing_subsequences
Zuma Gamehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0488_zuma_game
Predict the Winnerhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0486_predict_the_winner
Max Consecutive Oneshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0485_max_consecutive_ones
Smallest Good Basehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0483_smallest_good_base
License Key Formattinghttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0482_license_key_formatting
Magical Stringhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0481_magical_string
Sliding Window Medianhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0480_sliding_window_median
Largest Palindrome Producthttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0479_largest_palindrome_product
Generate Random Point in a Circlehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0478_generate_random_point_in_a_circle
Total Hamming Distancehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0477_total_hamming_distance
Number Complementhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0476_number_complement
Heatershttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0475_heaters
Ones and Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0474_ones_and_zeroes
Matchsticks to Squarehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0473_matchsticks_to_square
Concatenated Wordshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0472_concatenated_words
Implement Rand10() Using Rand7()https://leetcode-in-java.github.io/src/main/java/g0401_0500/s0470_implement_rand10_using_rand7
Validate IP Addresshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0468_validate_ip_address
Unique Substrings in Wraparound Stringhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0467_unique_substrings_in_wraparound_string
Count The Repetitionshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0466_count_the_repetitions
Can I Winhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0464_can_i_win
Island Perimeterhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0463_island_perimeter
Minimum Moves to Equal Array Elements IIhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0462_minimum_moves_to_equal_array_elements_ii
Hamming Distancehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0461_hamming_distance
LFU Cachehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0460_lfu_cache
Repeated Substring Patternhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0459_repeated_substring_pattern
Poor Pigshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0458_poor_pigs
Circular Array Loophttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0457_circular_array_loop
132 Patternhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0456_132_pattern
Assign Cookieshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0455_assign_cookies
4Sum IIhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0454_4sum_ii
Minimum Moves to Equal Array Elementshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0453_minimum_moves_to_equal_array_elements
Minimum Number of Arrows to Burst Balloonshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0452_minimum_number_of_arrows_to_burst_balloons
Sort Characters By Frequencyhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0451_sort_characters_by_frequency
Delete Node in a BSThttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0450_delete_node_in_a_bst
Serialize and Deserialize BSThttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0449_serialize_and_deserialize_bst
Find All Numbers Disappeared in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0448_find_all_numbers_disappeared_in_an_array
Number of Boomerangshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0447_number_of_boomerangs
Arithmetic Slices II - Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0446_arithmetic_slices_ii_subsequence
Add Two Numbers IIhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0445_add_two_numbers_ii
String Compressionhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0443_string_compression
Find All Duplicates in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0442_find_all_duplicates_in_an_array
Arranging Coinshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0441_arranging_coins
K-th Smallest in Lexicographical Orderhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0440_k_th_smallest_in_lexicographical_order
Find All Anagrams in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0438_find_all_anagrams_in_a_string
Path Sum IIIhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0437_path_sum_iii
Find Right Intervalhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0436_find_right_interval
Non-overlapping Intervalshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0435_non_overlapping_intervals
Number of Segments in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0434_number_of_segments_in_a_string
Minimum Genetic Mutationhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0433_minimum_genetic_mutation
All O`one Data Structurehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0432_all_oone_data_structure
Flatten a Multilevel Doubly Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0430_flatten_a_multilevel_doubly_linked_list
N-ary Tree Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0429_n_ary_tree_level_order_traversal
Construct Quad Treehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0427_construct_quad_tree
Longest Repeating Character Replacementhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0424_longest_repeating_character_replacement
Reconstruct Original Digits from Englishhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0423_reconstruct_original_digits_from_english
Maximum XOR of Two Numbers in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0421_maximum_xor_of_two_numbers_in_an_array
Strong Password Checkerhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0420_strong_password_checker
Battleships in a Boardhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0419_battleships_in_a_board
Pacific Atlantic Water Flowhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0417_pacific_atlantic_water_flow
Partition Equal Subset Sumhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0416_partition_equal_subset_sum
Add Stringshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0415_add_strings
Third Maximum Numberhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0414_third_maximum_number
Arithmetic Sliceshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0413_arithmetic_slices
Fizz Buzzhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0412_fizz_buzz
Split Array Largest Sumhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0410_split_array_largest_sum
Longest Palindromehttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0409_longest_palindrome
Trapping Rain Water IIhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0407_trapping_rain_water_ii
Queue Reconstruction by Heighthttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0406_queue_reconstruction_by_height
Convert a Number to Hexadecimalhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0405_convert_a_number_to_hexadecimal
Sum of Left Leaveshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0404_sum_of_left_leaves
Frog Jumphttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0403_frog_jump
Remove K Digitshttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0402_remove_k_digits
Binary Watchhttps://leetcode-in-java.github.io/src/main/java/g0401_0500/s0401_binary_watch
Nth Digithttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0400_nth_digit
Evaluate Divisionhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0399_evaluate_division
Random Pick Indexhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0398_random_pick_index
Integer Replacementhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0397_integer_replacement
Rotate Functionhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0396_rotate_function
Longest Substring with At Least K Repeating Charactershttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0395_longest_substring_with_at_least_k_repeating_characters
Decode Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0394_decode_string
UTF-8 Validationhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0393_utf_8_validation
Is Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0392_is_subsequence
Perfect Rectanglehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0391_perfect_rectangle
Elimination Gamehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0390_elimination_game
Find the Differencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0389_find_the_difference
Longest Absolute File Pathhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0388_longest_absolute_file_path
First Unique Character in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0387_first_unique_character_in_a_string
Lexicographical Numbershttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0386_lexicographical_numbers
Mini Parserhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0385_mini_parser
Shuffle an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0384_shuffle_an_array
Ransom Notehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0383_ransom_note
Linked List Random Nodehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0382_linked_list_random_node
Insert Delete GetRandom O(1) - Duplicates allowedhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0381_insert_delete_getrandom_o1_duplicates_allowed
Insert Delete GetRandom O(1)https://leetcode-in-java.github.io/src/main/java/g0301_0400/s0380_insert_delete_getrandom_o1
Kth Smallest Element in a Sorted Matrixhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0378_kth_smallest_element_in_a_sorted_matrix
Combination Sum IVhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0377_combination_sum_iv
Wiggle Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0376_wiggle_subsequence
Guess Number Higher or Lower IIhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0375_guess_number_higher_or_lower_ii
Guess Number Higher or Lowerhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0374_guess_number_higher_or_lower
Find K Pairs with Smallest Sumshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0373_find_k_pairs_with_smallest_sums
Super Powhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0372_super_pow
Sum of Two Integershttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0371_sum_of_two_integers
Largest Divisible Subsethttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0368_largest_divisible_subset
Valid Perfect Squarehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0367_valid_perfect_square
Water and Jug Problemhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0365_water_and_jug_problem
Max Sum of Rectangle No Larger Than Khttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0363_max_sum_of_rectangle_no_larger_than_k
Count Numbers with Unique Digitshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0357_count_numbers_with_unique_digits
Design Twitterhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0355_design_twitter
Russian Doll Envelopeshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0354_russian_doll_envelopes
Data Stream as Disjoint Intervalshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0352_data_stream_as_disjoint_intervals
Intersection of Two Arrays IIhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0350_intersection_of_two_arrays_ii
Intersection of Two Arrayshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0349_intersection_of_two_arrays
Top K Frequent Elementshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0347_top_k_frequent_elements
Reverse Vowels of a Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0345_reverse_vowels_of_a_string
Reverse Stringhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0344_reverse_string
Integer Breakhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0343_integer_break
Power of Fourhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0342_power_of_four
Flatten Nested List Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0341_flatten_nested_list_iterator
Counting Bitshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0338_counting_bits
House Robber IIIhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0337_house_robber_iii
Palindrome Pairshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0336_palindrome_pairs
Self Crossinghttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0335_self_crossing
Increasing Triplet Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0334_increasing_triplet_subsequence
Reconstruct Itineraryhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0332_reconstruct_itinerary
Verify Preorder Serialization of a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0331_verify_preorder_serialization_of_a_binary_tree
Patching Arrayhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0330_patching_array
Longest Increasing Path in a Matrixhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0329_longest_increasing_path_in_a_matrix
Odd Even Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0328_odd_even_linked_list
Count of Range Sumhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0327_count_of_range_sum
Power of Threehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0326_power_of_three
Wiggle Sort IIhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0324_wiggle_sort_ii
Coin Changehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0322_coin_change
Create Maximum Numberhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0321_create_maximum_number
Bulb Switcherhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0319_bulb_switcher
Maximum Product of Word Lengthshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0318_maximum_product_of_word_lengths
Remove Duplicate Lettershttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0316_remove_duplicate_letters
Count of Smaller Numbers After Selfhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0315_count_of_smaller_numbers_after_self
Super Ugly Numberhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0313_super_ugly_number
Burst Balloonshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0312_burst_balloons
Minimum Height Treeshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0310_minimum_height_trees
Best Time to Buy and Sell Stock with Cooldownhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0309_best_time_to_buy_and_sell_stock_with_cooldown
Range Sum Query - Mutablehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0307_range_sum_query_mutable
Additive Numberhttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0306_additive_number
Range Sum Query 2D - Immutablehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0304_range_sum_query_2d_immutable
Range Sum Query - Immutablehttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0303_range_sum_query_immutable
Remove Invalid Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0301_0400/s0301_remove_invalid_parentheses
Longest Increasing Subsequencehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0300_longest_increasing_subsequence
Bulls and Cowshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0299_bulls_and_cows
Serialize and Deserialize Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0297_serialize_and_deserialize_binary_tree
Find Median from Data Streamhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0295_find_median_from_data_stream
Nim Gamehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0292_nim_game
Word Patternhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0290_word_pattern
Game of Lifehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0289_game_of_life
Find the Duplicate Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0287_find_the_duplicate_number
Peeking Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0284_peeking_iterator
Move Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0283_move_zeroes
Expression Add Operatorshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0282_expression_add_operators
Perfect Squareshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0279_perfect_squares
First Bad Versionhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0278_first_bad_version
H-Index IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0275_h_index_ii
H-Indexhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0274_h_index
Integer to English Wordshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0273_integer_to_english_words
Missing Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0268_missing_number
Ugly Number IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0264_ugly_number_ii
Ugly Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0263_ugly_number
Trips and Usershttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0262_trips_and_users
Single Number IIIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0260_single_number_iii
Add Digitshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0258_add_digits
Binary Tree Pathshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0257_binary_tree_paths
Valid Anagramhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0242_valid_anagram
Different Ways to Add Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0241_different_ways_to_add_parentheses
Search a 2D Matrix IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0240_search_a_2d_matrix_ii
Sliding Window Maximumhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0239_sliding_window_maximum
Product of Array Except Selfhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0238_product_of_array_except_self
Delete Node in a Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0237_delete_node_in_a_linked_list
Lowest Common Ancestor of a Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0236_lowest_common_ancestor_of_a_binary_tree
Lowest Common Ancestor of a Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0235_lowest_common_ancestor_of_a_binary_search_tree
Palindrome Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0234_palindrome_linked_list
Number of Digit Onehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0233_number_of_digit_one
Implement Queue using Stackshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0232_implement_queue_using_stacks
Power of Twohttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0231_power_of_two
Kth Smallest Element in a BSThttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0230_kth_smallest_element_in_a_bst
Majority Element IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0229_majority_element_ii
Summary Rangeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0228_summary_ranges
Basic Calculator IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0227_basic_calculator_ii
Invert Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0226_invert_binary_tree
Implement Stack using Queueshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0225_implement_stack_using_queues
Basic Calculatorhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0224_basic_calculator
Rectangle Areahttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0223_rectangle_area
Count Complete Tree Nodeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0222_count_complete_tree_nodes
Maximal Squarehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0221_maximal_square
Contains Duplicate IIIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0220_contains_duplicate_iii
Contains Duplicate IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0219_contains_duplicate_ii
The Skyline Problemhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0218_the_skyline_problem
Contains Duplicatehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0217_contains_duplicate
Combination Sum IIIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0216_combination_sum_iii
Kth Largest Element in an Arrayhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0215_kth_largest_element_in_an_array
Shortest Palindromehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0214_shortest_palindrome
House Robber IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0213_house_robber_ii
Word Search IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0212_word_search_ii
Design Add and Search Words Data Structurehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0211_design_add_and_search_words_data_structure
Course Schedule IIhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0210_course_schedule_ii
Minimum Size Subarray Sumhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0209_minimum_size_subarray_sum
Implement Trie (Prefix Tree)https://leetcode-in-java.github.io/src/main/java/g0201_0300/s0208_implement_trie_prefix_tree
Course Schedulehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0207_course_schedule
Reverse Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0206_reverse_linked_list
Isomorphic Stringshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0205_isomorphic_strings
Count Primeshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0204_count_primes
Remove Linked List Elementshttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0203_remove_linked_list_elements
Happy Numberhttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0202_happy_number
Bitwise AND of Numbers Rangehttps://leetcode-in-java.github.io/src/main/java/g0201_0300/s0201_bitwise_and_of_numbers_range
Number of Islandshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0200_number_of_islands
Binary Tree Right Side Viewhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0199_binary_tree_right_side_view
House Robberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0198_house_robber
Rising Temperaturehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0197_rising_temperature
Delete Duplicate Emailshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0196_delete_duplicate_emails
Tenth Linehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0195_tenth_line
Transpose Filehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0194_transpose_file
Valid Phone Numbershttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0193_valid_phone_numbers
Word Frequencyhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0192_word_frequency
Number of 1 Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0191_number_of_1_bits
Reverse Bitshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0190_reverse_bits
Rotate Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0189_rotate_array
Best Time to Buy and Sell Stock IVhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0188_best_time_to_buy_and_sell_stock_iv
Repeated DNA Sequenceshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0187_repeated_dna_sequences
Department Top Three Salarieshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0185_department_top_three_salaries
Department Highest Salaryhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0184_department_highest_salary
Customers Who Never Orderhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0183_customers_who_never_order
Duplicate Emailshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0182_duplicate_emails
Employees Earning More Than Their Managershttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0181_employees_earning_more_than_their_managers
Consecutive Numbershttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0180_consecutive_numbers
Largest Numberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0179_largest_number
Rank Scoreshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0178_rank_scores
Nth Highest Salaryhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0177_nth_highest_salary
Second Highest Salaryhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0176_second_highest_salary
Combine Two Tableshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0175_combine_two_tables
Dungeon Gamehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0174_dungeon_game
Binary Search Tree Iteratorhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0173_binary_search_tree_iterator
Factorial Trailing Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0172_factorial_trailing_zeroes
Excel Sheet Column Numberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0171_excel_sheet_column_number
Majority Elementhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0169_majority_element
Excel Sheet Column Titlehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0168_excel_sheet_column_title
Two Sum II - Input Array Is Sortedhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0167_two_sum_ii_input_array_is_sorted
Fraction to Recurring Decimalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0166_fraction_to_recurring_decimal
Compare Version Numbershttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0165_compare_version_numbers
Maximum Gaphttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0164_maximum_gap
Find Peak Elementhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0162_find_peak_element
Intersection of Two Linked Listshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0160_intersection_of_two_linked_lists
Min Stackhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0155_min_stack
Find Minimum in Rotated Sorted Array IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0154_find_minimum_in_rotated_sorted_array_ii
Find Minimum in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0153_find_minimum_in_rotated_sorted_array
Maximum Product Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0152_maximum_product_subarray
Reverse Words in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0151_reverse_words_in_a_string
Evaluate Reverse Polish Notationhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0150_evaluate_reverse_polish_notation
Max Points on a Linehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0149_max_points_on_a_line
Sort Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0148_sort_list
Insertion Sort Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0147_insertion_sort_list
LRU Cachehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0146_lru_cache
Binary Tree Postorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0145_binary_tree_postorder_traversal
Binary Tree Preorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0144_binary_tree_preorder_traversal
Reorder Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0143_reorder_list
Linked List Cycle IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0142_linked_list_cycle_ii
Linked List Cyclehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0141_linked_list_cycle
Word Break IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0140_word_break_ii
Word Breakhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0139_word_break
Copy List with Random Pointerhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0138_copy_list_with_random_pointer
Single Number IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0137_single_number_ii
Single Numberhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0136_single_number
Candyhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0135_candy
Gas Stationhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0134_gas_station
Clone Graphhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0133_clone_graph
Palindrome Partitioning IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0132_palindrome_partitioning_ii
Palindrome Partitioninghttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0131_palindrome_partitioning
Surrounded Regionshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0130_surrounded_regions
Sum Root to Leaf Numbershttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0129_sum_root_to_leaf_numbers
Longest Consecutive Sequencehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0128_longest_consecutive_sequence
Word Ladderhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0127_word_ladder
Word Ladder IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0126_word_ladder_ii
Valid Palindromehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0125_valid_palindrome
Binary Tree Maximum Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0124_binary_tree_maximum_path_sum
Best Time to Buy and Sell Stock IIIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0123_best_time_to_buy_and_sell_stock_iii
Best Time to Buy and Sell Stock IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0122_best_time_to_buy_and_sell_stock_ii
Best Time to Buy and Sell Stockhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0121_best_time_to_buy_and_sell_stock
Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0120_triangle
Pascal’s Triangle IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0119_pascals_triangle_ii
Pascal’s Trianglehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0118_pascals_triangle
Populating Next Right Pointers in Each Node IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0117_populating_next_right_pointers_in_each_node_ii
Populating Next Right Pointers in Each Nodehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0116_populating_next_right_pointers_in_each_node
Distinct Subsequenceshttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0115_distinct_subsequences
Flatten Binary Tree to Linked Listhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0114_flatten_binary_tree_to_linked_list
Path Sum IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0113_path_sum_ii
Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0112_path_sum
Minimum Depth of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0111_minimum_depth_of_binary_tree
Balanced Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0110_balanced_binary_tree
Convert Sorted List to Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0109_convert_sorted_list_to_binary_search_tree
Convert Sorted Array to Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0108_convert_sorted_array_to_binary_search_tree
Binary Tree Level Order Traversal IIhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0107_binary_tree_level_order_traversal_ii
Construct Binary Tree from Inorder and Postorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0106_construct_binary_tree_from_inorder_and_postorder_traversal
Construct Binary Tree from Preorder and Inorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0105_construct_binary_tree_from_preorder_and_inorder_traversal
Maximum Depth of Binary Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0104_maximum_depth_of_binary_tree
Binary Tree Zigzag Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0103_binary_tree_zigzag_level_order_traversal
Binary Tree Level Order Traversalhttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0102_binary_tree_level_order_traversal
Symmetric Treehttps://leetcode-in-java.github.io/src/main/java/g0101_0200/s0101_symmetric_tree
Same Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0100_same_tree
Recover Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0099_recover_binary_search_tree
Validate Binary Search Treehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0098_validate_binary_search_tree
Interleaving Stringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0097_interleaving_string
Unique Binary Search Treeshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0096_unique_binary_search_trees
Unique Binary Search Trees IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0095_unique_binary_search_trees_ii
Binary Tree Inorder Traversalhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0094_binary_tree_inorder_traversal
Restore IP Addresseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0093_restore_ip_addresses
Reverse Linked List IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0092_reverse_linked_list_ii
Decode Wayshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0091_decode_ways
Subsets IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0090_subsets_ii
Gray Codehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0089_gray_code
Merge Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0088_merge_sorted_array
Scramble Stringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0087_scramble_string
Partition Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0086_partition_list
Maximal Rectanglehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0085_maximal_rectangle
Largest Rectangle in Histogramhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0084_largest_rectangle_in_histogram
Remove Duplicates from Sorted Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0083_remove_duplicates_from_sorted_list
Remove Duplicates from Sorted List IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0082_remove_duplicates_from_sorted_list_ii
Search in Rotated Sorted Array IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0081_search_in_rotated_sorted_array_ii
Remove Duplicates from Sorted Array IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0080_remove_duplicates_from_sorted_array_ii
Word Searchhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0079_word_search
Subsetshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0078_subsets
Combinationshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0077_combinations
Minimum Window Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0076_minimum_window_substring
Sort Colorshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0075_sort_colors
Search a 2D Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0074_search_a_2d_matrix
Set Matrix Zeroeshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0073_set_matrix_zeroes
Edit Distancehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0072_edit_distance
Simplify Pathhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0071_simplify_path
Climbing Stairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0070_climbing_stairs
Sqrt(x)https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0069_sqrtx
Text Justificationhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0068_text_justification
Add Binaryhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0067_add_binary
Plus Onehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0066_plus_one
Valid Numberhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0065_valid_number
Minimum Path Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0064_minimum_path_sum
Unique Paths IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0063_unique_paths_ii
Unique Pathshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0062_unique_paths
Rotate Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0061_rotate_list
Permutation Sequencehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0060_permutation_sequence
Spiral Matrix IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0059_spiral_matrix_ii
Length of Last Wordhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0058_length_of_last_word
Insert Intervalhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0057_insert_interval
Merge Intervalshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0056_merge_intervals
Jump Gamehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0055_jump_game
Spiral Matrixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0054_spiral_matrix
Maximum Subarrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0053_maximum_subarray
N-Queens IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0052_n_queens_ii
N-Queenshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0051_n_queens
Pow(x, n)https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0050_powx_n
Group Anagramshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0049_group_anagrams
Rotate Imagehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0048_rotate_image
Permutations IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0047_permutations_ii
Permutationshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0046_permutations
Jump Game IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0045_jump_game_ii
Wildcard Matchinghttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0044_wildcard_matching
Multiply Stringshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0043_multiply_strings
Trapping Rain Waterhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0042_trapping_rain_water
First Missing Positivehttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0041_first_missing_positive
Combination Sum IIhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0040_combination_sum_ii
Combination Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0039_combination_sum
Count and Sayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0038_count_and_say
Sudoku Solverhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0037_sudoku_solver
Valid Sudokuhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0036_valid_sudoku
Search Insert Positionhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0035_search_insert_position
Find First and Last Position of Element in Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0034_find_first_and_last_position_of_element_in_sorted_array
Search in Rotated Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0033_search_in_rotated_sorted_array
Longest Valid Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0032_longest_valid_parentheses
Next Permutationhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0031_next_permutation
Substring with Concatenation of All Wordshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0030_substring_with_concatenation_of_all_words
Divide Two Integershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0029_divide_two_integers
Find the Index of the First Occurrence in a Stringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0028_find_the_index_of_the_first_occurrence_in_a_string
Remove Elementhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0027_remove_element
Remove Duplicates from Sorted Arrayhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0026_remove_duplicates_from_sorted_array
Reverse Nodes in k-Grouphttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0025_reverse_nodes_in_k_group
Swap Nodes in Pairshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0024_swap_nodes_in_pairs
Merge k Sorted Listshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0023_merge_k_sorted_lists
Generate Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0022_generate_parentheses
Merge Two Sorted Listshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0021_merge_two_sorted_lists
Valid Parentheseshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0020_valid_parentheses
Remove Nth Node From End of Listhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0019_remove_nth_node_from_end_of_list
4Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0018_4sum
Letter Combinations of a Phone Numberhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0017_letter_combinations_of_a_phone_number
3Sum Closesthttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0016_3sum_closest
3Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0015_3sum
Longest Common Prefixhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0014_longest_common_prefix
Roman to Integerhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0013_roman_to_integer
Integer to Romanhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0012_integer_to_roman
Container With Most Waterhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0011_container_with_most_water
Regular Expression Matchinghttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0010_regular_expression_matching
Palindrome Numberhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0009_palindrome_number
String to Integer (atoi)https://leetcode-in-java.github.io/src/main/java/g0001_0100/s0008_string_to_integer_atoi
Reverse Integerhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0007_reverse_integer
Zigzag Conversionhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0006_zigzag_conversion
Longest Palindromic Substringhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0005_longest_palindromic_substring
Median of Two Sorted Arrayshttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0004_median_of_two_sorted_arrays
Longest Substring Without Repeating Charactershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0003_longest_substring_without_repeating_characters
Add Two Numbershttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0002_add_two_numbers
Two Sumhttps://leetcode-in-java.github.io/src/main/java/g0001_0100/s0001_two_sum
Improve this pagehttps://github.com/LeetCode-in-Java/LeetCode-in-Java.github.io/edit/main/README.md

Viewport: width=device-width, initial-scale=1

URLs of crawlers that visited me.