[](https://central.sonatype.com/artifact/com.github.javadev/leetcode-in-java/1.20)

[](https://central.sonatype.com/artifact/com.github.javadev/leetcode-in-java/1.21)

[](https://github.com/javadev/leetcode-in-java/blob/main/LICENSE)

[](https://github.com/javadev/LeetCode-in-Java/actions/workflows/maven.yml)

[](https://sonarcloud.io/summary/overall?id=javadev_LeetCode-in-Java)

<dependency>

<groupId>com.github.javadev</groupId>

<artifactId>leetcode-in-java</artifactId>

<version>1.20</version>

<version>1.21</version>

</dependency>

...

</dependencies>

Gradle:

| 1936 |[Add Minimum Number of Rungs](src/main/java/g1901_2000/s1936_add_minimum_number_of_rungs/Solution.java)| Medium | Array, Greedy | 1 | 100.00

| 1935 |[Maximum Number of Words You Can Type](src/main/java/g1901_2000/s1935_maximum_number_of_words_you_can_type/Solution.java)| Easy | String, Hash_Table | 2 | 95.06

| 1932 |[Merge BSTs to Create Single BST](src/main/java/g1901_2000/s1932_merge_bsts_to_create_single_bst/Solution.java)| Hard | Hash_Table, Depth_First_Search, Tree, Binary_Search, Binary_Tree | 87 | 48.43

| 1931 |[Painting a Grid With Three Different Colors](src/main/java/g1901_2000/s1931_painting_a_grid_with_three_different_colors/Solution.java)| Hard | Dynamic_Programming |7 |99.32

| 1931 |[Painting a Grid With Three Different Colors](src/main/java/g1901_2000/s1931_painting_a_grid_with_three_different_colors/Solution.java)| Hard | Dynamic_Programming |4 |100.00

| 1930 |[Unique Length-3 Palindromic Subsequences](src/main/java/g1901_2000/s1930_unique_length_3_palindromic_subsequences/Solution.java)| Medium | String, Hash_Table, Prefix_Sum | 31 | 93.44

| 1929 |[Concatenation of Array](src/main/java/g1901_2000/s1929_concatenation_of_array/Solution.java)| Easy | Array | 1 | 92.52

| 1928 |[Minimum Cost to Reach Destination in Time](src/main/java/g1901_2000/s1928_minimum_cost_to_reach_destination_in_time/Solution.java)| Hard | Dynamic_Programming, Graph | 52 | 87.97

| 1004 |[Max Consecutive Ones III](src/main/java/g1001_1100/s1004_max_consecutive_ones_iii/Solution.java)| Medium | Array, Binary_Search, Prefix_Sum, Sliding_Window | 3 | 79.01

| 1003 |[Check If Word Is Valid After Substitutions](src/main/java/g1001_1100/s1003_check_if_word_is_valid_after_substitutions/Solution.java)| Medium | String, Stack | 5 | 98.54

| 1002 |[Find Common Characters](src/main/java/g1001_1100/s1002_find_common_characters/Solution.java)| Easy | Array, String, Hash_Table | 4 | 83.51

| 1001 |[Grid Illumination](src/main/java/g1001_1100/s1001_grid_illumination/Solution.java)| Hard | Array, Hash_Table |75 |90.57

| 1001 |[Grid Illumination](src/main/java/g1001_1100/s1001_grid_illumination/Solution.java)| Hard | Array, Hash_Table |82 |89.13

| 1000 |[Minimum Cost to Merge Stones](src/main/java/g0901_1000/s1000_minimum_cost_to_merge_stones/Solution.java)| Hard | Array, Dynamic_Programming | 1 | 99.65

| 0999 |[Available Captures for Rook](src/main/java/g0901_1000/s0999_available_captures_for_rook/Solution.java)| Easy | Array, Matrix, Simulation | 0 | 100.00

| 0998 |[Maximum Binary Tree II](src/main/java/g0901_1000/s0998_maximum_binary_tree_ii/Solution.java)| Medium | Tree, Binary_Tree | 0 | 100.00

| 0888 |[Fair Candy Swap](src/main/java/g0801_0900/s0888_fair_candy_swap/Solution.java)| Easy | Array, Hash_Table, Sorting, Binary_Search | 18 | 68.20

| 0887 |[Super Egg Drop](src/main/java/g0801_0900/s0887_super_egg_drop/Solution.java)| Hard | Dynamic_Programming, Math, Binary_Search | 0 | 100.00

| 0886 |[Possible Bipartition](src/main/java/g0801_0900/s0886_possible_bipartition/Solution.java)| Medium | Depth_First_Search, Breadth_First_Search, Graph, Union_Find, Graph_Theory_I_Day_14_Graph_Theory | 20 | 80.12

| 0885 |[Spiral Matrix III](src/main/java/g0801_0900/s0885_spiral_matrix_iii/Solution.java)| Medium | Array, Matrix, Simulation |3 |95.45

| 0885 |[Spiral Matrix III](src/main/java/g0801_0900/s0885_spiral_matrix_iii/Solution.java)| Medium | Array, Matrix, Simulation |2 |100.00

| 0884 |[Uncommon Words from Two Sentences](src/main/java/g0801_0900/s0884_uncommon_words_from_two_sentences/Solution.java)| Easy | String, Hash_Table | 1 | 100.00

| 0883 |[Projection Area of 3D Shapes](src/main/java/g0801_0900/s0883_projection_area_of_3d_shapes/Solution.java)| Easy | Array, Math, Matrix, Geometry | 1 | 100.00

| 0882 |[Reachable Nodes In Subdivided Graph](src/main/java/g0801_0900/s0882_reachable_nodes_in_subdivided_graph/Solution.java)| Hard | Heap_Priority_Queue, Graph, Shortest_Path | 28 | 95.85

}

group='com.github.javadev'

version='1.20-SNAPSHOT'

version='1.21-SNAPSHOT'

description='leetcode-in-java'

java.sourceCompatibility=JavaVersion.VERSION_11

<groupId>com.github.javadev</groupId>

<artifactId>leetcode-in-java</artifactId>

<packaging>jar</packaging>

<version>1.20</version>

<version>1.21</version>

<name>leetcode-in-java</name>

<description>Java Solution for LeetCode algorithm problems, continually updating</description>

<url>https://github.com/javadev/LeetCode-in-Java</url>

<groupId>com.github.javadev</groupId>

<artifactId>leetcode-in-java17</artifactId>

<packaging>jar</packaging>

<version>1.20</version>

<version>1.21</version>

<name>leetcode-in-java</name>

<description>Java Solution for LeetCode algorithm problems, continually updating</description>

<url>https://github.com/javadev/LeetCode-in-Java</url>

<groupId>com.github.javadev</groupId>

<artifactId>leetcode-in-java</artifactId>

<packaging>jar</packaging>

<version>1.20-SNAPSHOT</version>

<version>1.21-SNAPSHOT</version>

<name>leetcode-in-java</name>

<description>Java Solution for LeetCode algorithm problems, continually updating</description>

<url>https://github.com/javadev/LeetCode-in-Java</url>