Topic: String
Questions Successfully Completed: 1
<table><tbody><tr><td>1) Non-Repeating Character</td><td>Easy</td></tr></tbody></table>

Non Repeating Character
Time Complexity : O(n)
Space Complexity : O(n)
<details><summary>Question</summary><div data-type="detailsContent">Input: S = hello Output: h Explanation: In the given string, the first non-repeating character is h, as it appears first and there is no other 'h' in the string.</div></details>

<pre><code class="lang-java">static char nonrepeatingCharacter(String S)
 {
 // hash table with 26 indexes
 int[] str_hash = new int[26];

 char[] char_hash = S.toCharArray();
 char ch = '\0';

 for(int i=0;i&lt;char_hash.length;i++){
 str_hash[char_hash[i]-97]++;
 }
 for (int i=0;i&lt;char_hash.length;i++){
 if((str_hash[char_hash[i]-97])==1){
 ch = char_hash[i];
 return ch;
 }
 }
 return '$';
 }
</code></pre>
Thank you for reading :)

Topic: ***String***

Questions Successfully Completed: 1

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

**Non Repeating Character**

Time Complexity : O(n)

Space Complexity : O(n)

<details data-node-type="hn-details-summary"><summary>Question</summary><div data-type="detailsContent">Input: S = hello Output: h Explanation: In the given string, the first non-repeating character is h, as it appears first and there is no other 'h' in the string.</div></details>

```java
static char nonrepeatingCharacter(String S)
 {
 // hash table with 26 indexes
 int[] str_hash = new int[26];
 
 char[] char_hash = S.toCharArray();
 char ch = '\0';
 
 for(int i=0;i<char_hash.length;i++){
 str_hash[char_hash[i]-97]++;
 }
 for (int i=0;i<char_hash.length;i++){
 if((str_hash[char_hash[i]-97])==1){
 ch = char_hash[i];
 return ch;
 }
 }
 return '$';
 }
```

Thank you for reading :)

DSA Day 18/100