-
Notifications
You must be signed in to change notification settings - Fork 0
/
question_11.cpp
41 lines (29 loc) · 861 Bytes
/
question_11.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
/*
==> Display longest name <==
Question Link:- https://practice.geeksforgeeks.org/problems/display-longest-name0853/1?page=1&difficulty[]=-2&category[]=Arrays&sortBy=submissions
Given a list of names, display the longest name.
Example:
Input:
N = 5
names[] = { "Geek", "Geeks", "Geeksfor",
"GeeksforGeek", "GeeksforGeeks" }
Output:
GeeksforGeeks
*/
#include <iostream>
using namespace std;
string longest( string names [], int n ) {
int maxlen = 0 , maxidx = 0;
for ( int i = 0; i < n; i++ ) {
if ( names[i].length() > maxlen ) {
maxlen = names[i].length();
maxidx = i;
}
}
return names[maxidx];
}
int main () {
string names [] = { "Geek", "Geeks", "Geeksfor", "GeeksforGeek", "GeeksforGeeks" };
cout << longest(names, 5);
return 0;
}