Topic: Strings
Questions Successfully Completed: 1
<table><tbody><tr><td>1) Repeating Character - First Appearance Leftmost</td><td>Easy</td></tr></tbody></table>

<details><summary>Question</summary><div data-type="detailsContent">Input: S = geeksforgeeks Output: g Explanation: We see that both e and g repeat as we move from left to right. But the leftmost is g so we print g.</div></details>

<pre><code class="lang-java"> static int repeatedCharacter(String S)
 {
 /* APPROACH 1
 1- Create Hash Table 
 2- Traverse S and store the count in hash table
 3- Traverse S again and check which character value is &gt;1
 */


 int[] CharHash = new int[125];
 char[] chr = S.toCharArray();

 for(int i=0;i&lt;chr.length;i++){
 CharHash[chr[i]-'0'+'0']++;
 }

 for(int j=0;j&lt;chr.length;j++){
 if(CharHash[chr[j]-'0'+'0']&gt;1){
 return j;
 }
 }
 return -1;

 }
</code></pre>
Thank you for reading :)

Topic: **Strings**

Questions Successfully Completed: 1

<table><tbody><tr><td colspan="1" rowspan="1">1) Repeating Character - First Appearance Leftmost</td><td colspan="1" rowspan="1">Easy</td></tr></tbody></table>

<details data-node-type="hn-details-summary"><summary>Question</summary><div data-type="detailsContent">Input: S = geeksforgeeks Output: g Explanation: We see that both e and g repeat as we move from left to right. But the leftmost is g so we print g.</div></details>

```java
 static int repeatedCharacter(String S)
 {
 /* APPROACH 1
 1- Create Hash Table 
 2- Traverse S and store the count in hash table
 3- Traverse S again and check which character value is >1
 */
 
 
 int[] CharHash = new int[125];
 char[] chr = S.toCharArray();
 
 for(int i=0;i<chr.length;i++){
 CharHash[chr[i]-'0'+'0']++;
 }
 
 for(int j=0;j<chr.length;j++){
 if(CharHash[chr[j]-'0'+'0']>1){
 return j;
 }
 }
 return -1;
 
 }
```

Thank you for reading :)

DSA Day 78/100