A string is given and you have to find all the words (substrings separated by a space) which are greater than given length k.
Examples:
Input : str = "hello geeks for geeks
is computer science portal"
k = 4
Output : hello geeks geeks computer
science portal
Explanation : The output is list of all
words that are of length more than k.
Input : str = "string is fun in python"
k = 3
Output : string python
The idea is to first split given string around space. Then traverse through all words. For every word, check
C++
// C++ program to find all string // which are greater than given length k #include <bits/stdc++.h> using namespace std; // function find sttring greater than // length k void string_k(string s, int k) { // create the empty string string w = ""; // iterate the loop till every space for(int i = 0; i < s.size(); i++) { if(s[i] != ' ') // append this sub string in // string w w = w + s[i]; else { // if length of current sub // string w is greater than // k then print if(w.size() > k) cout << w << " "; w = ""; } } } // Driver code int main() { string s = "geek for geeks"; int k = 3; s = s + " "; string_k(s, k); return 0; } // This code is contributed by // Manish Shaw (manishshaw1) |
chevron_right
filter_none
Java
// Java program to find all string // which are greater than given length k import java.io.*; import java.util.*; public class GFG { // function find sttring greater than // length k static void string_k(String s, int k) { // create the empty string String w = ""; // iterate the loop till every space for(int i = 0; i < s.length(); i++) { if(s.charAt(i) != ' ') // append this sub string in // string w w = w + s.charAt(i); else { // if length of current sub // string w is greater than // k then print if(w.length() > k) System.out.print(w + " "); w = ""; } } } // Driver code public static void main(String args[]) { String s = "geek for geeks"; int k = 3; s = s + " "; string_k(s, k); } } // This code is contributed by // Manish Shaw (manishshaw1) |
chevron_right
filter_none
Python
# Python program to find all string # which are greater than given length k # function find sttring greater than length k def string_k(k, str): # create the empty string string = [] # split the string where space is comes text = str.split(" ") # iterate the loop till every substring for x in text: # if length of current sub string # is greater than k then if len(x) > k: # append this sub string in # string list string.append(x) # return string list return string # Driver Program k = 3str ="geek for geeks"print(string_k(k, str)) |
chevron_right
filter_none
C#
// C# program to find all string // which are greater than given length k using System; class GFG { // function find sttring greater than // length k static void string_k(string s, int k) { // create the empty string string w = ""; // iterate the loop till every space for(int i = 0; i < s.Length; i++) { if(s[i] != ' ') // append this sub string in // string w w = w + s[i]; else { // if length of current sub // string w is greater than // k then print if(w.Length > k) Console.Write(w + " "); w = ""; } } } // Driver code static void Main() { string s = "geek for geeks"; int k = 3; s = s + " "; string_k(s, k); } } // This code is contributed by // Manish Shaw (manishshaw1) |
chevron_right
filter_none
PHP
<?php // PHP program to find all $ // which are greater than given length k // function find sttring greater than // length k function string_k($s, $k) { // create the empty string $w = ""; // iterate the loop till every space for($i = 0; $i < strlen($s); $i++) { if($s[$i] != ' ') // append this sub $in $w $w = $w.$s[$i]; else { // if length of current sub // $w is greater than // k then print if(strlen($w) > $k) echo ($w." "); $w = ""; } } } // Driver code $s = "geek for geeks"; $k = 3; $s = $s . " "; string_k($s, $k); // This code is contributed by // Manish Shaw (manishshaw1) ?> |
chevron_right
filter_none
Output:
['geek', 'geeks']
Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.
Recommended Posts:
- Find words which are greater than given length k using stringstream
- Count the number of words having sum of ASCII values less than and greater than k
- Length of the largest substring which have character with frequency greater than or equal to half of the substring
- Check if the given string of words can be formed from words present in the dictionary
- Length of Smallest subarray in range 1 to N with sum greater than a given value
- Count of alphabets having ASCII value less than and greater than k
- Count words that appear exactly two times in an array of words
- Smallest number greater than X which is K-periodic
- Smallest Greater (than S) String of length K whose letters are subset of S
- Count number of binary strings such that there is no substring of length greater than or equal to 3 with all 1's
- Subarray with difference between maximum and minimum element greater than or equal to its length
- Find the starting indices of the substrings in string (S) which is made by concatenating all words from a list(L)
- K length words that can be formed from given characters without repetition
- Maximum length L such that the sum of all subarrays of length L is less than K
- Find Largest Special Prime which is less than or equal to a given number
- Find a string such that every character is lexicographically greater than its immediate next character
- Smallest alphabet greater than a given character
- Python | Select dictionary with condition given key greater than k
- Python program to print even length words in a string
- Generating Lyndon words of length n
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
Improved By : manishshaw1
