Find the first maximum length even word from a string
Last Updated :
07 May, 2025
Given a string of words separated by spaces. The task is to find the first maximum length even word from the string. Eg: “You are given an array of n numbers” The answer would be “an” and not “of” because “an” comes before “of”.
Examples:
Input: "this is a test string"
Output: string
Even length words are this, is, test, string. Even
maximum length word is string.
Input: "geeksforgeeks is a platform for geeks"
Output: platform
Only even length word is platform.
Approach:
Approach to solve this problem is to split the string into words, and then iterate over each word to check if it has even length and is longer than the current maximum length even word found so far. If a suitable word is found, update the maximum length even word.
Here are the steps of the approach:
- Initialize a variable maxLenEvenWord to an empty string.
- Split the input string str into words using stringstream and getline.
- For each word w in the list of words, If the length of w is even and greater than the length of maxLenEvenWord, update maxLenEvenWord to w.
- Return maxLenEvenWord.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
string findMaxLenEven(string str) {
string maxLenEvenWord = "";
stringstream ss(str);
string word;
while (getline(ss, word, ' ')) {
if (word.length() % 2 == 0 && word.length() > maxLenEvenWord.length()) {
maxLenEvenWord = word;
}
}
return maxLenEvenWord;
}
int main() {
string str = "this is a test string";
cout << findMaxLenEven(str) << endl;
return 0;
}
import java.util.StringTokenizer;
public class GFG {
// Function to find the word with the maximum even length
public static String findMaxLenEven(String str) {
String maxLenEvenWord = "";
StringTokenizer st = new StringTokenizer(str);
while (st.hasMoreTokens()) {
String word = st.nextToken();
if (word.length() % 2 == 0 && word.length() > maxLenEvenWord.length()) {
maxLenEvenWord = word;
}
}
return maxLenEvenWord;
}
public static void main(String[] args) {
String str = "this is a test string";
System.out.println(findMaxLenEven(str));
}
}
# Define a function that takes a string as input and
# returns the longest even length word in the string
def findMaxLenEven(str):
# Initialize an empty string to store the longest even length word
maxLenEvenWord = ""
# Split the input string into a list of words
words = str.split()
# Iterate over each word in the list
for word in words:
# Check if the length of the word is even and greater than
# the length of the current longest even length word
if len(word) % 2 == 0 and len(word) > len(maxLenEvenWord):
# If so, update the current longest even length word
maxLenEvenWord = word
# Return the longest even length word
return maxLenEvenWord
# Define a string to test the function
str = "this is a test string"
# Call the function and print the result
print(findMaxLenEven(str))
using System;
public class GFG {
// Function to find the word with the maximum even length
public static string FindMaxLenEven(string str) {
string maxLenEvenWord = "";
string[] words = str.Split(' ');
foreach (string word in words) {
if (word.Length % 2 == 0 && word.Length > maxLenEvenWord.Length) {
maxLenEvenWord = word;
}
}
return maxLenEvenWord;
}
public static void Main(string[] args) {
string str = "this is a test string";
Console.WriteLine(FindMaxLenEven(str));
}
}
// Define a function that takes a string as input and
// returns the longest even length word in the string
function findMaxLenEven(str) {
// Initialize an empty string to store the longest even length word
let maxLenEvenWord = "";
// Split the input string into a list of words
let words = str.split(" ");
for (let i = 0; i < words.length; i++) {
let word = words[i];
if (word.length % 2 === 0 && word.length > maxLenEvenWord.length) {
maxLenEvenWord = word;
}
}
// Return the longest even length word
return maxLenEvenWord;
}
// Define a string to test the function
const str = "this is a test string";
// Call the function and print the result
console.log(findMaxLenEven(str));
Time Complexity: O(N+M) time, where N is the length of the input string. We iterate over each word once, and for each word, we perform a constant number of operations (length check and update), so the overall time complexity of the loop is O(M), where M is the total number of words in the input string. total time complexity of the algorithm is O(N+M).
Space Complexity: O(N), We need to store the input string and the maximum length even word, which takes O(N) space, where N is the length of the input string.
Approach: The idea is to traverse the input string and find length of each word. Check if the length of word is even or not. If even, then compare length with maximum length found so far. If length is strictly greater than maximum length then store current word as required string.
Below is the implementation of above approach:
C++
// C++ program to find maximum length even word
#include <bits/stdc++.h>
using namespace std;
// Function to find maximum length even word
string findMaxLenEven(string str)
{
int n = str.length();
int i = 0;
// To store length of current word.
int currlen = 0;
// To store length of maximum length word.
int maxlen = 0;
// To store starting index of maximum
// length word.
int st = -1;
while (i < n) {
// If current character is space then
// word has ended. Check if it is even
// length word or not. If yes then
// compare length with maximum length
// found so far.
if (str[i] == ' ') {
if (currlen % 2 == 0) {
if (maxlen < currlen) {
maxlen = currlen;
st = i - currlen;
}
}
// Set currlen to zero for next word.
currlen = 0;
}
else {
// Update length of current word.
currlen++;
}
i++;
}
// Check length of last word.
if (currlen % 2 == 0) {
if (maxlen < currlen) {
maxlen = currlen;
st = i - currlen;
}
}
// If no even length word is present
// then return -1.
if (st == -1)
return "-1";
return str.substr(st, maxlen);
}
// Driver code
int main()
{
string str = "this is a test string";
cout << findMaxLenEven(str);
return 0;
}
// Java program to find maximum length even word
class GFG
{
// Function to find maximum length even word
static String findMaxLenEven(String str)
{
int n = str.length();
int i = 0;
// To store length of current word.
int currlen = 0;
// To store length of maximum length word.
int maxlen = 0;
// To store starting index of maximum
// length word.
int st = -1;
while (i < n)
{
// If current character is space then
// word has ended. Check if it is even
// length word or not. If yes then
// compare length with maximum length
// found so far.
if (str.charAt(i) == ' ')
{
if (currlen % 2 == 0)
{
if (maxlen < currlen)
{
maxlen = currlen;
st = i - currlen;
}
}
// Set currlen to zero for next word.
currlen = 0;
}
else
{
// Update length of current word.
currlen++;
}
i++;
}
// Check length of last word.
if (currlen % 2 == 0)
{
if (maxlen < currlen)
{
maxlen = currlen;
st = i - currlen;
}
}
// If no even length word is present
// then return -1.
if (st == -1)
return "-1";
return str.substring(st, st + maxlen);
}
// Driver code
public static void main(String args[])
{
String str = "this is a test string";
System.out.println( findMaxLenEven(str));
}
}
// This code is contributed by Arnab Kundu
# Python3 program to find maximum
# length even word
# Function to find maximum length
# even word
def findMaxLenEven(str):
n = len(str)
i = 0
# To store length of current word.
currlen = 0
# To store length of maximum length word.
maxlen = 0
# To store starting index of maximum
# length word.
st = -1
while (i < n):
# If current character is space then
# word has ended. Check if it is even
# length word or not. If yes then
# compare length with maximum length
# found so far.
if (str[i] == ' '):
if (currlen % 2 == 0):
if (maxlen < currlen):
maxlen = currlen
st = i - currlen
# Set currlen to zero for next word.
currlen = 0
else :
# Update length of current word.
currlen += 1
i += 1
# Check length of last word.
if (currlen % 2 == 0):
if (maxlen < currlen):
maxlen = currlen
st = i - currlen
# If no even length word is present
# then return -1.
if (st == -1):
print("trie")
return "-1"
return str[st: st + maxlen]
# Driver code
if __name__ == "__main__":
str = "this is a test string"
print(findMaxLenEven(str))
# This code is contributed by Ita_c
// C# program to find maximum length even word
using System;
class GFG
{
// Function to find maximum length even word
static String findMaxLenEven(string str)
{
int n = str.Length;
int i = 0;
// To store length of current word.
int currlen = 0;
// To store length of maximum length word.
int maxlen = 0;
// To store starting index of maximum
// length word.
int st = -1;
while (i < n)
{
// If current character is space then
// word has ended. Check if it is even
// length word or not. If yes then
// compare length with maximum length
// found so far.
if (str[i] == ' ')
{
if (currlen % 2 == 0)
{
if (maxlen < currlen)
{
maxlen = currlen;
st = i - currlen;
}
}
// Set currlen to zero for next word.
currlen = 0;
}
else
{
// Update length of current word.
currlen++;
}
i++;
}
// Check length of last word.
if (currlen % 2 == 0)
{
if (maxlen < currlen)
{
maxlen = currlen;
st = i - currlen;
}
}
// If no even length word is present
// then return -1.
if (st == -1)
return "-1";
return str.Substring(st, maxlen);
}
// Driver code
public static void Main()
{
string str = "this is a test string";
Console.WriteLine(findMaxLenEven(str));
}
// This code is contributed by Ryuga
}
<script>
// Javascript program to find maximum length even word
// Function to find maximum length even word
function findMaxLenEven(str)
{
var n = str.length;
var i = 0;
// To store length of current word.
var currlen = 0;
// To store length of maximum length word.
var maxlen = 0;
// To store starting index of maximum
// length word.
var st = -1;
while (i < n) {
// If current character is space then
// word has ended. Check if it is even
// length word or not. If yes then
// compare length with maximum length
// found so far.
if (str[i] == ' ') {
if (currlen % 2 == 0) {
if (maxlen < currlen) {
maxlen = currlen;
st = i - currlen;
}
}
// Set currlen to zero for next word.
currlen = 0;
}
else {
// Update length of current word.
currlen++;
}
i++;
}
// Check length of last word.
if (currlen % 2 == 0) {
if (maxlen < currlen) {
maxlen = currlen;
st = i - currlen;
}
}
// If no even length word is present
// then return -1.
if (st == -1)
return "-1";
return str.substr(st, maxlen);
}
// Driver code
var str = "this is a test string";
document.write( findMaxLenEven(str));
// This code is contributed by noob2000.
</script>
Time Complexity: O(N), where N is the length of the string.
Auxiliary Space: O(1)
Similar Reads
Basics & Prerequisites
Data Structures
Array Data StructureIn this article, we introduce array, implementation in different popular languages, its basic operations and commonly seen problems / interview questions. An array stores items (in case of C/C++ and Java Primitive Arrays) or their references (in case of Python, JS, Java Non-Primitive) at contiguous
3 min read
String in Data StructureA string is a sequence of characters. The following facts make string an interesting data structure.Small set of elements. Unlike normal array, strings typically have smaller set of items. For example, lowercase English alphabet has only 26 characters. ASCII has only 256 characters.Strings are immut
2 min read
Hashing in Data StructureHashing is a technique used in data structures that efficiently stores and retrieves data in a way that allows for quick access. Hashing involves mapping data to a specific index in a hash table (an array of items) using a hash function. It enables fast retrieval of information based on its key. The
2 min read
Linked List Data StructureA linked list is a fundamental data structure in computer science. It mainly allows efficient insertion and deletion operations compared to arrays. Like arrays, it is also used to implement other data structures like stack, queue and deque. Here’s the comparison of Linked List vs Arrays Linked List:
2 min read
Stack Data StructureA Stack is a linear data structure that follows a particular order in which the operations are performed. The order may be LIFO(Last In First Out) or FILO(First In Last Out). LIFO implies that the element that is inserted last, comes out first and FILO implies that the element that is inserted first
2 min read
Queue Data StructureA Queue Data Structure is a fundamental concept in computer science used for storing and managing data in a specific order. It follows the principle of "First in, First out" (FIFO), where the first element added to the queue is the first one to be removed. It is used as a buffer in computer systems
2 min read
Tree Data StructureTree Data Structure is a non-linear data structure in which a collection of elements known as nodes are connected to each other via edges such that there exists exactly one path between any two nodes. Types of TreeBinary Tree : Every node has at most two childrenTernary Tree : Every node has at most
4 min read
Graph Data StructureGraph Data Structure is a collection of nodes connected by edges. It's used to represent relationships between different entities. If you are looking for topic-wise list of problems on different topics like DFS, BFS, Topological Sort, Shortest Path, etc., please refer to Graph Algorithms. Basics of
3 min read
Trie Data StructureThe Trie data structure is a tree-like structure used for storing a dynamic set of strings. It allows for efficient retrieval and storage of keys, making it highly effective in handling large datasets. Trie supports operations such as insertion, search, deletion of keys, and prefix searches. In this
15+ min read
Algorithms
Searching AlgorithmsSearching algorithms are essential tools in computer science used to locate specific items within a collection of data. In this tutorial, we are mainly going to focus upon searching in an array. When we search an item in an array, there are two most common algorithms used based on the type of input
2 min read
Sorting AlgorithmsA Sorting Algorithm is used to rearrange a given array or list of elements in an order. For example, a given array [10, 20, 5, 2] becomes [2, 5, 10, 20] after sorting in increasing order and becomes [20, 10, 5, 2] after sorting in decreasing order. There exist different sorting algorithms for differ
3 min read
Introduction to RecursionThe process in which a function calls itself directly or indirectly is called recursion and the corresponding function is called a recursive function. A recursive algorithm takes one step toward solution and then recursively call itself to further move. The algorithm stops once we reach the solution
14 min read
Greedy AlgorithmsGreedy algorithms are a class of algorithms that make locally optimal choices at each step with the hope of finding a global optimum solution. At every step of the algorithm, we make a choice that looks the best at the moment. To make the choice, we sometimes sort the array so that we can always get
3 min read
Graph AlgorithmsGraph is a non-linear data structure like tree data structure. The limitation of tree is, it can only represent hierarchical data. For situations where nodes or vertices are randomly connected with each other other, we use Graph. Example situations where we use graph data structure are, a social net
3 min read
Dynamic Programming or DPDynamic Programming is an algorithmic technique with the following properties.It is mainly an optimization over plain recursion. Wherever we see a recursive solution that has repeated calls for the same inputs, we can optimize it using Dynamic Programming. The idea is to simply store the results of
3 min read
Bitwise AlgorithmsBitwise algorithms in Data Structures and Algorithms (DSA) involve manipulating individual bits of binary representations of numbers to perform operations efficiently. These algorithms utilize bitwise operators like AND, OR, XOR, NOT, Left Shift, and Right Shift.BasicsIntroduction to Bitwise Algorit
4 min read
Advanced
Segment TreeSegment Tree is a data structure that allows efficient querying and updating of intervals or segments of an array. It is particularly useful for problems involving range queries, such as finding the sum, minimum, maximum, or any other operation over a specific range of elements in an array. The tree
3 min read
Pattern SearchingPattern searching algorithms are essential tools in computer science and data processing. These algorithms are designed to efficiently find a particular pattern within a larger set of data. Patten SearchingImportant Pattern Searching Algorithms:Naive String Matching : A Simple Algorithm that works i
2 min read
GeometryGeometry is a branch of mathematics that studies the properties, measurements, and relationships of points, lines, angles, surfaces, and solids. From basic lines and angles to complex structures, it helps us understand the world around us.Geometry for Students and BeginnersThis section covers key br
2 min read
Interview Preparation
Practice Problem