Print all strings of maximum length from an array of strings Last Updated : 22 Jun, 2021 Comments Improve Suggest changes Like Article Like Report Try it on GfG Practice Given an array of strings arr[], the task is to print all the strings of maximum length from the given array. Example: Input: arr[] = {“aba”, “aa”, “ad”, “vcd”, “aba”}Output: aba vcd abaExplanation:Maximum length among all the strings from the given array is 3.The strings having length equal to 3 from the array are “aba”, “vcd”, “aba”. Input: arr[] = {“abb”, “abcd”, “guw”, “v”}Output: abcdExplanation:Maximum length among all the strings from the given array is 4.The string having length equal to 4 from the array is “abcd”. Approach: Follow the steps below to solve the problem: Traverse the given array of strings. Calculate the maximum length among all the strings from the array and store it in a variable, say len.Now, traverse the array of string again and print those strings from the array having a length equal to len. Below is the implementation of the above approach: C++ // C++ program to implement // the above approach #include <bits/stdc++.h> using namespace std; // Function to find the length // of the longest string from // the given array of strings int maxLength(vector<string> arr) { int len = INT_MIN; int N = arr.size(); // Traverse the array for (int i = 0; i < N; i++) { // Stores the length // of current string int l = arr[i].size(); // Update maximum length if (len < l) { len = l; } } // Return the maximum length return len; } // Function to print the // longest strings from the array void maxStrings(vector<string> arr, int len) { int N = arr.size(); vector<string> ans; // Find the strings having length // equals to len for (int i = 0; i < N; i++) { if (len == arr[i].size()) { ans.push_back(arr[i]); } } // Print the resultant // vector of strings for (int i = 0; i < ans.size(); i++) { cout << ans[i] << " "; } } // Function to print all the // longest strings from the array void printStrings(vector<string>& arr) { // Find the length of longest string int max = maxLength(arr); // Find and print all the strings // having length equals to max maxStrings(arr, max); } // Driver Code int main() { vector<string> arr = { "aba", "aa", "ad", "vcd", "aba" }; printStrings(arr); return 0; } Java // Java program to implement // the above approach import java.util.*; class GFG{ // Function to find the length // of the longest String from // the given array of Strings static int maxLength(String []arr) { int len = Integer.MIN_VALUE; int N = arr.length; // Traverse the array for(int i = 0; i < N; i++) { // Stores the length // of current String int l = arr[i].length(); // Update maximum length if (len < l) { len = l; } } // Return the maximum length return len; } // Function to print the // longest Strings from the array static void maxStrings(String []arr, int len) { int N = arr.length; Vector<String> ans = new Vector<String>(); // Find the Strings having length // equals to len for(int i = 0; i < N; i++) { if (len == arr[i].length()) { ans.add(arr[i]); } } // Print the resultant // vector of Strings for(int i = 0; i < ans.size(); i++) { System.out.print(ans.get(i) + " "); } } // Function to print all the // longest Strings from the array static void printStrings(String [] arr) { // Find the length of longest String int max = maxLength(arr); // Find and print all the Strings // having length equals to max maxStrings(arr, max); } // Driver Code public static void main(String[] args) { String []arr = { "aba", "aa", "ad", "vcd", "aba" }; printStrings(arr); } } // This code is contributed by Amit Katiyar Python3 # Python3 program to implement # the above approach import sys # Function to find the length # of the longest string from # the given array of strings def maxLength(arr): lenn = -sys.maxsize - 1 N = len(arr) # Traverse the array for i in range(N): # Stores the length # of current string l = len(arr[i]) # Update maximum length if (lenn < l): lenn = l # Return the maximum length return lenn # Function to print the # longest strings from the array def maxStrings(arr, lenn): N = len(arr) ans = [] # Find the strings having length # equals to lenn for i in range(N): if (lenn == len(arr[i])): ans.append(arr[i]) # Print the resultant # vector of strings for i in range(len(ans)): print(ans[i], end = " ") # Function to print all the # longest strings from the array def printStrings(arr): # Find the length of longest string max = maxLength(arr) # Find and print all the strings # having length equals to max maxStrings(arr, max) # Driver Code if __name__ == '__main__': arr = [ "aba", "aa", "ad", "vcd", "aba" ] printStrings(arr) # This code is contributed by mohit kumar 29 C# // C# program to implement // the above approach using System; using System.Collections.Generic; class GFG{ // Function to find the length // of the longest String from // the given array of Strings static int maxLength(String []arr) { int len = int.MinValue; int N = arr.Length; // Traverse the array for(int i = 0; i < N; i++) { // Stores the length // of current String int l = arr[i].Length; // Update maximum length if (len < l) { len = l; } } // Return the maximum length return len; } // Function to print the // longest Strings from the array static void maxStrings(String []arr, int len) { int N = arr.Length; List<String> ans = new List<String>(); // Find the Strings having length // equals to len for(int i = 0; i < N; i++) { if (len == arr[i].Length) { ans.Add(arr[i]); } } // Print the resultant // vector of Strings for(int i = 0; i < ans.Count; i++) { Console.Write(ans[i] + " "); } } // Function to print all the // longest Strings from the array static void printStrings(String [] arr) { // Find the length of longest String int max = maxLength(arr); // Find and print all the Strings // having length equals to max maxStrings(arr, max); } // Driver Code public static void Main(String[] args) { String []arr = {"aba", "aa", "ad", "vcd", "aba"}; printStrings(arr); } } // This code is contributed by Rajput-Ji JavaScript <script> // Javascript program to implement // the above approach // Function to find the length // of the longest String from // the given array of Strings function maxLength(arr) { let len = Number.MIN_VALUE; let N = arr.length; // Traverse the array for(let i = 0; i < N; i++) { // Stores the length // of current String let l = arr[i].length; // Update maximum length if (len < l) { len = l; } } // Return the maximum length return len; } // Function to print the // longest Strings from the array function maxStrings(arr,len) { let N = arr.length; let ans = []; // Find the Strings having length // equals to len for(let i = 0; i < N; i++) { if (len == arr[i].length) { ans.push(arr[i]); } } // Print the resultant // vector of Strings for(let i = 0; i < ans.length; i++) { document.write(ans[i] + " "); } } // Function to print all the // longest Strings from the array function printStrings(arr) { // Find the length of longest String let max = maxLength(arr); // Find and print all the Strings // having length equals to max maxStrings(arr, max); } // Driver Code let arr=["aba", "aa", "ad", "vcd", "aba" ]; printStrings(arr); // This code is contributed by unknown2108 </script> Output: aba vcd aba Time Complexity: O(N)Auxiliary Space: O(N) Comment More infoAdvertise with us Next Article Print all strings of maximum length from an array of strings S svrrrsvr Follow Improve Article Tags : Strings C/C++ Puzzles Searching Computer Science Fundamentals DSA Arrays +2 More Practice Tags : ArraysSearchingStrings Similar Reads DSA Tutorial - Learn Data Structures and Algorithms DSA (Data Structures and Algorithms) is the study of organizing data efficiently using data structures like arrays, stacks, and trees, paired with step-by-step procedures (or algorithms) to solve problems effectively. Data structures manage how data is stored and accessed, while algorithms focus on 7 min read Quick Sort QuickSort is a sorting algorithm based on the Divide and Conquer that picks an element as a pivot and partitions the given array around the picked pivot by placing the pivot in its correct position in the sorted array. It works on the principle of divide and conquer, breaking down the problem into s 12 min read Merge Sort - Data Structure and Algorithms Tutorials Merge sort is a popular sorting algorithm known for its efficiency and stability. It follows the divide-and-conquer approach. It works by recursively dividing the input array into two halves, recursively sorting the two halves and finally merging them back together to obtain the sorted array. Merge 14 min read Data Structures Tutorial Data structures are the fundamental building blocks of computer programming. They define how data is organized, stored, and manipulated within a program. Understanding data structures is very important for developing efficient and effective algorithms. What is Data Structure?A data structure is a st 2 min read Bubble Sort Algorithm Bubble Sort is the simplest sorting algorithm that works by repeatedly swapping the adjacent elements if they are in the wrong order. This algorithm is not suitable for large data sets as its average and worst-case time complexity are quite high.We sort the array using multiple passes. After the fir 8 min read Breadth First Search or BFS for a Graph Given a undirected graph represented by an adjacency list adj, where each adj[i] represents the list of vertices connected to vertex i. Perform a Breadth First Search (BFS) traversal starting from vertex 0, visiting vertices from left to right according to the adjacency list, and return a list conta 15+ min read Binary Search Algorithm - Iterative and Recursive Implementation Binary Search Algorithm is a searching algorithm used in a sorted array by repeatedly dividing the search interval in half. The idea of binary search is to use the information that the array is sorted and reduce the time complexity to O(log N). Binary Search AlgorithmConditions to apply Binary Searc 15 min read Insertion Sort Algorithm Insertion sort is a simple sorting algorithm that works by iteratively inserting each element of an unsorted list into its correct position in a sorted portion of the list. It is like sorting playing cards in your hands. You split the cards into two groups: the sorted cards and the unsorted cards. T 9 min read Dijkstra's Algorithm to find Shortest Paths from a Source to all Given a weighted undirected graph represented as an edge list and a source vertex src, find the shortest path distances from the source vertex to all other vertices in the graph. The graph contains V vertices, numbered from 0 to V - 1.Note: The given graph does not contain any negative edge. Example 12 min read Selection Sort Selection Sort is a comparison-based sorting algorithm. It sorts an array by repeatedly selecting the smallest (or largest) element from the unsorted portion and swapping it with the first unsorted element. This process continues until the entire array is sorted.First we find the smallest element an 8 min read Like