java.lang.Object
g2001_2100.s2053_kth_distinct_string_in_an_array.Solution

public class Solution extends Object
2053 - Kth Distinct String in an Array.<p>Easy</p> <p>A <strong>distinct string</strong> is a string that is present only <strong>once</strong> in an array.</p> <p>Given an array of strings <code>arr</code>, and an integer <code>k</code>, return <em>the</em> <code>k<sup>th</sup></code> <em><strong>distinct string</strong> present in</em> <code>arr</code>. If there are <strong>fewer</strong> than <code>k</code> distinct strings, return <em>an <strong>empty string</strong></em> <code>&quot;&quot;</code>.</p> <p>Note that the strings are considered in the <strong>order in which they appear</strong> in the array.</p> <p><strong>Example 1:</strong></p> <p><strong>Input:</strong> arr = [&ldquo;d&rdquo;,&ldquo;b&rdquo;,&ldquo;c&rdquo;,&ldquo;b&rdquo;,&ldquo;c&rdquo;,&ldquo;a&rdquo;], k = 2</p> <p><strong>Output:</strong> &ldquo;a&rdquo;</p> <p><strong>Explanation:</strong></p> <p>The only distinct strings in arr are &ldquo;d&rdquo; and &ldquo;a&rdquo;.</p> <p>&ldquo;d&rdquo; appears 1<sup>st</sup>, so it is the 1<sup>st</sup> distinct string.</p> <p>&ldquo;a&rdquo; appears 2<sup>nd</sup>, so it is the 2<sup>nd</sup> distinct string.</p> <p>Since k == 2, &ldquo;a&rdquo; is returned.</p> <p><strong>Example 2:</strong></p> <p><strong>Input:</strong> arr = [&ldquo;aaa&rdquo;,&ldquo;aa&rdquo;,&ldquo;a&rdquo;], k = 1</p> <p><strong>Output:</strong> &ldquo;aaa&rdquo;</p> <p><strong>Explanation:</strong></p> <p>All strings in arr are distinct, so the 1<sup>st</sup> string &ldquo;aaa&rdquo; is returned.</p> <p><strong>Example 3:</strong></p> <p><strong>Input:</strong> arr = [&ldquo;a&rdquo;,&ldquo;b&rdquo;,&ldquo;a&rdquo;], k = 3</p> <p><strong>Output:</strong> &quot;&quot;</p> <p><strong>Explanation:</strong> The only distinct string is &ldquo;b&rdquo;. Since there are fewer than 3 distinct strings, we return an empty string &quot;&quot;.</p> <p><strong>Constraints:</strong></p> <ul> <li><code>1 <= k <= arr.length <= 1000</code></li> <li><code>1 <= arr[i].length <= 5</code></li> <li><code>arr[i]</code> consists of lowercase English letters.</li> </ul>
  • Constructor Details

    • Solution

      public Solution()
  • Method Details

    • kthDistinct

      public String kthDistinct(String[] arr, int k)