-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathFind te largest string
86 lines (59 loc) · 1.2 KB
/
Find te largest string
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
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
//{ Driver Code Starts
//Initial Template for C++
#include <bits/stdc++.h>
using namespace std;
// } Driver Code Ends
//User function Template for C++
class Solution
{
public:
string longestString(vector<string> &words)
{
map<string, int> m1;
for(auto it: words)
{
m1[it] = 1;
}
string ans = "";
int cnt = 0;
for(auto it: m1)
{
string s = it.first;
string k = "";
bool f = true;
for(int i=0;i<s.length();i++)
{
k += s[i];
if(!m1[k]){
f = false;
break;
}
}
if(f){
if(cnt < s.length()) {ans = s;cnt = s.length();}
}
}
return ans;
}
};
//{ Driver Code Starts.
int main()
{
int t;
cin >> t;
while (t--)
{
int n;
cin >> n;
vector<string> v(n);
for (int i = 0; i < n; i++)
{
cin >> v[i];
}
Solution obj;
string w = obj.longestString(v);
cout << w << "\n";
}
return 0;
}
// } Driver Code Ends