Added task 2347.

Author: javadev

README.md

@@ -1258,7 +1258,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
 
 | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- --> | <!-- -->
 |-|-|-|-|-|-
-| 1393 |[Capital Gain/Loss](src/main/java/g1301_1400/s1393_capital_gainloss/script.sql)| Medium | LeetCode_Curated_SQL_70, Database | 457 | 79.39
+| 1393 |[Capital Gain/Loss](src/main/java/g1301_1400/s1393_capital_gainloss/script.sql)| Medium | LeetCode_Curated_SQL_70, Database | 428 | 92.01
 | 1407 |[Top Travellers](src/main/java/g1401_1500/s1407_top_travellers/script.sql)| Easy | LeetCode_Curated_SQL_70, Database | 682 | 70.16
 | 1158 |[Market Analysis I](src/main/java/g1101_1200/s1158_market_analysis_i/script.sql)| Medium | Database | 1039 | 77.70
 
@@ -1848,6 +1848,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
 
 | #    |      Title     | Difficulty  | Tag         | Time, ms | Time, %
 |------|----------------|-------------|-------------|----------|---------
+| 2347 |[Best Poker Hand](src/main/java/g2301_2400/s2347_best_poker_hand/Solution.java)| Easy | Array, Hash_Table, Counting | 1 | 76.92
 | 2344 |[Minimum Deletions to Make Array Divisible](src/main/java/g2301_2400/s2344_minimum_deletions_to_make_array_divisible/Solution.java)| Hard | Array, Math, Sorting, Heap_Priority_Queue, Number_Theory | 13 | 88.89
 | 2343 |[Query Kth Smallest Trimmed Number](src/main/java/g2301_2400/s2343_query_kth_smallest_trimmed_number/Solution.java)| Medium | Array, String, Divide_and_Conquer, Sorting, Heap_Priority_Queue, Radix_Sort, Quickselect | 52 | 75.00
 | 2342 |[Max Sum of a Pair With Equal Sum of Digits](src/main/java/g2301_2400/s2342_max_sum_of_a_pair_with_equal_sum_of_digits/Solution.java)| Medium | Array, Hash_Table, Sorting, Heap_Priority_Queue | 99 | 100.00
@@ -2591,7 +2592,7 @@ implementation 'com.github.javadev:leetcode-in-java:1.11'
 | 1396 |[Design Underground System](src/main/java/g1301_1400/s1396_design_underground_system/UndergroundSystem.java)| Medium | String, Hash_Table, Design | 89 | 89.64
 | 1395 |[Count Number of Teams](src/main/java/g1301_1400/s1395_count_number_of_teams/Solution.java)| Medium | Array, Dynamic_Programming, Binary_Indexed_Tree | 18 | 91.75
 | 1394 |[Find Lucky Integer in an Array](src/main/java/g1301_1400/s1394_find_lucky_integer_in_an_array/Solution.java)| Easy | Array, Hash_Table, Counting | 2 | 82.56
-| 1393 |[Capital Gain/Loss](src/main/java/g1301_1400/s1393_capital_gainloss/script.sql)| Medium | LeetCode_Curated_SQL_70, Database, SQL_I_Day_9_Control_of_Flow | 457 | 79.39
+| 1393 |[Capital Gain/Loss](src/main/java/g1301_1400/s1393_capital_gainloss/script.sql)| Medium | LeetCode_Curated_SQL_70, Database, SQL_I_Day_9_Control_of_Flow | 428 | 92.01
 | 1392 |[Longest Happy Prefix](src/main/java/g1301_1400/s1392_longest_happy_prefix/Solution.java)| Hard | String, Hash_Function, String_Matching, Rolling_Hash | 39 | 28.37
 | 1391 |[Check if There is a Valid Path in a Grid](src/main/java/g1301_1400/s1391_check_if_there_is_a_valid_path_in_a_grid/Solution.java)| Medium | Array, Depth_First_Search, Breadth_First_Search, Matrix, Union_Find | 14 | 85.37
 | 1390 |[Four Divisors](src/main/java/g1301_1400/s1390_four_divisors/Solution.java)| Medium | Array, Math | 13 | 97.25

src/main/java/g2301_2400/s2347_best_poker_hand/Solution.java

@@ -0,0 +1,38 @@
+package g2301_2400.s2347_best_poker_hand;
+
+// #Easy #Array #Hash_Table #Counting
+// #2022_07_26_Time_1_ms_(76.92%)_Space_41.6_MB_(30.77%)
+
+import java.util.HashMap;
+
+public class Solution {
+    public String bestHand(int[] ranks, char[] suits) {
+        HashMap<Character, Integer> map = new HashMap<>();
+        for (char suit : suits) {
+            if (map.containsKey(suit)) {
+                map.put(suit, map.get(suit) + 1);
+                if (map.get(suit) == 5) {
+                    return "Flush";
+                }
+            } else {
+                map.put(suit, 1);
+            }
+        }
+        String s = "";
+        HashMap<Integer, Integer> map2 = new HashMap<>();
+        for (int rank : ranks) {
+            if (map2.containsKey(rank)) {
+                map2.put(rank, map2.get(rank) + 1);
+                if (map2.get(rank) == 2) {
+                    s = "Pair";
+                } else if (map2.get(rank) == 3) {
+                    s = "Three of a Kind";
+                    return s;
+                }
+            } else {
+                map2.put(rank, 1);
+            }
+        }
+        return s.isEmpty() ? "High Card" : s;
+    }
+}

src/main/java/g2301_2400/s2347_best_poker_hand/readme.md

@@ -0,0 +1,53 @@
+2347\. Best Poker Hand
+
+Easy
+
+You are given an integer array `ranks` and a character array `suits`. You have `5` cards where the <code>i<sup>th</sup></code> card has a rank of `ranks[i]` and a suit of `suits[i]`.
+
+The following are the types of **poker hands** you can make from best to worst:
+
+1.  `"Flush"`: Five cards of the same suit.
+2.  `"Three of a Kind"`: Three cards of the same rank.
+3.  `"Pair"`: Two cards of the same rank.
+4.  `"High Card"`: Any single card.
+
+Return _a string representing the **best** type of **poker hand** you can make with the given cards._
+
+**Note** that the return values are **case-sensitive**.
+
+**Example 1:**
+
+**Input:** ranks = [13,2,3,1,9], suits = ["a","a","a","a","a"]
+
+**Output:** "Flush"
+
+**Explanation:** The hand with all the cards consists of 5 cards with the same suit, so we have a "Flush". 
+
+**Example 2:**
+
+**Input:** ranks = [4,4,2,4,4], suits = ["d","a","a","b","c"]
+
+**Output:** "Three of a Kind"
+
+**Explanation:** The hand with the first, second, and fourth card consists of 3 cards with the same rank, so we have a "Three of a Kind".
+
+Note that we could also make a "Pair" hand but "Three of a Kind" is a better hand.
+
+Also note that other cards could be used to make the "Three of a Kind" hand.
+
+**Example 3:**
+
+**Input:** ranks = [10,10,2,12,9], suits = ["a","b","c","a","d"]
+
+**Output:** "Pair"
+
+**Explanation:** The hand with the first and second card consists of 2 cards with the same rank, so we have a "Pair".
+
+Note that we cannot make a "Flush" or a "Three of a Kind". 
+
+**Constraints:**
+
+*   `ranks.length == suits.length == 5`
+*   `1 <= ranks[i] <= 13`
+*   `'a' <= suits[i] <= 'd'`
+*   No two cards have the same rank and suit.

src/test/java/g2301_2400/s2347_best_poker_hand/SolutionTest.java

@@ -0,0 +1,42 @@
+package g2301_2400.s2347_best_poker_hand;
+
+import static org.hamcrest.CoreMatchers.equalTo;
+import static org.hamcrest.MatcherAssert.assertThat;
+
+import org.junit.jupiter.api.Test;
+
+class SolutionTest {
+    @Test
+    void bestHand() {
+        assertThat(
+                new Solution()
+                        .bestHand(new int[] {13, 2, 3, 1, 9}, new char[] {'a', 'a', 'a', 'a', 'a'}),
+                equalTo("Flush"));
+    }
+
+    @Test
+    void bestHand2() {
+        assertThat(
+                new Solution()
+                        .bestHand(new int[] {4, 4, 2, 4, 4}, new char[] {'d', 'a', 'a', 'b', 'c'}),
+                equalTo("Three of a Kind"));
+    }
+
+    @Test
+    void bestHand3() {
+        assertThat(
+                new Solution()
+                        .bestHand(
+                                new int[] {10, 10, 2, 12, 9}, new char[] {'a', 'b', 'c', 'a', 'd'}),
+                equalTo("Pair"));
+    }
+
+    @Test
+    void bestHand4() {
+        assertThat(
+                new Solution()
+                        .bestHand(
+                                new int[] {13, 12, 3, 4, 7}, new char[] {'a', 'd', 'c', 'b', 'c'}),
+                equalTo("High Card"));
+    }
+}