-
Notifications
You must be signed in to change notification settings - Fork 0
/
11.First_Unique_Character.cpp
57 lines (53 loc) · 1.28 KB
/
11.First_Unique_Character.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
/**
* @file 11_First_Unique_Character.cpp
* @author Kashif Raza (https://www.kashifraza.tech)
* @brief Problem 11 Day 11 First Unique Character
* @date 2021-12-03
*/
#include <iostream>
#include <bits/stdc++.h>
#include <string>
#include <map>
#include <utility>
#include <algorithm>
using namespace std;
int firstUniqueChar(string str){
// First we will iterate through all
// saving the char, its index and its count in whole string
// in a Hash Map
// Key Value
// | |
// | Index Count
// | | |
map<char, pair<int, int>> map;
for(int idx = 0; idx < str.length(); idx++){
if(map.find(str[idx]) != map.end()){
map[str[idx]].second++;
}
else{
map[str[idx]] = make_pair(idx, 1);
}
}
for(int i = 0; i < str.length(); i++){
if(map[str[i]].second == 1){
return map[str[i]].first;
}
}
return 0;
}
// Testing main function
int main(){
int testCases;
cin >> testCases;
int showCase = 0;
while(testCases){
showCase += 1;
cout<<"Case: #"<<showCase<<endl;
string str;
cin >> str;
cout<<firstUniqueChar(str);
cout<<endl;
testCases--;
}
return 0;
}