Count the number of words having sum of ASCII values less than and greater than k
Last Updated :
11 Jul, 2025
Given a string, the task is to count the number of words whose sum of ASCII values is less than and greater than or equal to given k.
Examples:
Input: str = "Learn how to code", k = 400
Output:
Number of words having the sum of ASCII less than k = 2
Number of words having the sum of ASCII greater than or equal to k = 2
Input: str = "Geeks for Geeks", k = 400
Output:
Number of words having sum of ASCII less than k = 1
Number of words having sum of ASCII greater than or equal to k = 2
Brute Force Approach:
The approach is to solve this problem is to first split the given string into individual words and calculate the sum of ASCII values of each word. Then, we can iterate through each word and check whether its sum of ASCII values is less than or greater than or equal to the given value k. Finally, we can count the number of words that satisfy each condition and print the results.
Below is the implementation of the above approach:
C++
#include <bits/stdc++.h>
using namespace std;
// Function to split the given string into individual words
vector<string> splitWords(string str)
{
vector<string> words;
stringstream ss(str);
string word;
while (ss >> word)
words.push_back(word);
return words;
}
// Function to count the words
void CountWords(string str, int k)
{
vector<string> words = splitWords(str);
int lessThanK = 0;
int greaterThanOrEqualK = 0;
for (string word : words)
{
int sum = 0;
for (char c : word)
sum += c;
if (sum < k)
lessThanK++;
else
greaterThanOrEqualK++;
}
cout << "Number of words having sum of ascii less than k = " << lessThanK << endl;
cout << "Number of words having sum of ascii greater than or equal to k = " << greaterThanOrEqualK << endl;
}
// Driver code
int main()
{
string str = "Learn how to code";
int k = 400;
CountWords(str, k);
return 0;
}
import java.util.*;
public class Main {
// Function to split the given string into individual words
static List<String> splitWords(String str) {
List<String> words = new ArrayList<>();
Scanner sc = new Scanner(str);
while (sc.hasNext()) {
words.add(sc.next());
}
return words;
}
// Function to count the words
static void countWords(String str, int k) {
List<String> words = splitWords(str);
int lessThanK = 0;
int greaterThanOrEqualK = 0;
for (String word : words) {
int sum = 0;
for (char c : word.toCharArray()) {
sum += (int) c;
}
if (sum < k) {
lessThanK++;
} else {
greaterThanOrEqualK++;
}
}
System.out.println("Number of words having sum of ascii less than k = " + lessThanK);
System.out.println("Number of words having sum of ascii greater than or equal to k = " + greaterThanOrEqualK);
}
// Driver code
public static void main(String[] args) {
String str = "Learn how to code";
int k = 400;
countWords(str, k);
}
}
# Importing the regular expression module
import re
# Function to split the given string into individual words
def splitWords(s):
return re.findall(r'\w+', s)
# Function to count the words
def countWords(s, k):
words = splitWords(s)
lessThanK = 0
greaterThanOrEqualK = 0
for word in words:
sum = 0
for c in word:
sum += ord(c)
if sum < k:
lessThanK += 1
else:
greaterThanOrEqualK += 1
print("Number of words having sum of ascii less than k =", lessThanK)
print("Number of words having sum of ascii greater than or equal to k =",
greaterThanOrEqualK)
# Driver code
str = "Learn how to code"
k = 400
countWords(str, k)
using System;
using System.Collections.Generic;
using System.Linq;
using System.Text.RegularExpressions;
class Program {
// Function to split the given string into individual
// words
static List<string> SplitWords(string str)
{
List<string> words = new List<string>();
Regex regex = new Regex(@"\w+");
MatchCollection matches = regex.Matches(str);
foreach(Match match in matches)
{
words.Add(match.Value);
}
return words;
}
// Function to count the words
static void CountWords(string str, int k)
{
List<string> words = SplitWords(str);
int lessThanK = 0;
int greaterThanOrEqualK = 0;
foreach(string word in words)
{
int sum = 0;
foreach(char c in word) { sum += c; }
if (sum < k) {
lessThanK++;
}
else {
greaterThanOrEqualK++;
}
}
Console.WriteLine(
"Number of words having sum of ascii less than k = "
+ lessThanK);
Console.WriteLine(
"Number of words having sum of ascii greater than or equal to k = "
+ greaterThanOrEqualK);
}
// Driver code
static void Main(string[] args)
{
string str = "Learn how to code";
int k = 400;
CountWords(str, k);
}
}
// Function to split the given string into individual words
function splitWords(str) {
let words = [];
let sc = str.split(" ");
for (let i = 0; i < sc.length; i++) {
words.push(sc[i]);
}
return words;
}
// Function to count the words
function countWords(str, k) {
let words = splitWords(str);
let lessThanK = 0;
let greaterThanOrEqualK = 0;
for (let word of words) {
let sum = 0;
for (let c of word.split('')) {
sum += c.charCodeAt(0);
}
if (sum < k) {
lessThanK++;
} else {
greaterThanOrEqualK++;
}
}
console.log("Number of words having sum of ascii less than k = " + lessThanK);
console.log("Number of words having sum of ascii greater than or equal to k = " + greaterThanOrEqualK);
}
// Driver code
let str = "Learn how to code";
let k = 400;
countWords(str, k);
OutputNumber of words having sum of ascii less than k = 2
Number of words having sum of ascii greater than or equal to k = 2
Time Complexity: O(n*m), where n is the length of the string and m is the average length of each word in the string.
Space Complexity: O(m), as we are using a vector to store each word in the string.
Approach: Count the number of words having the sum of ASCII values less than k and subtract it from the total number of words to get the number of words having ASCII values to the sum greater than or equal to k. Start traversing the string letter by letter and add the ASCII value to sum. If there is a space then increment the count if the sum is less than k and will also set the sum to 0.
Below is the implementation of the above approach:
C++
// C++ implementation of the above approach
#include <bits/stdc++.h>
using namespace std;
// Function to count the words
void CountWords(string str, int k)
{
// Sum of ascii values
int sum = 0;
int NumberOfWords = 0;
// Number of words having
// sum of ascii less than k
int counter = 0;
int len = str.length();
for (int i = 0; i < len; ++i) {
// If character is a space
if (str[i] == ' ') {
if (sum < k)
counter++;
sum = 0;
NumberOfWords++;
}
else
// Add the ascii value to sum
sum += str[i];
}
// Handling the Last word separately
NumberOfWords++;
if (sum < k)
counter++;
cout << "Number of words having sum of ASCII"
" values less than k = "
<< counter << endl;
cout << "Number of words having sum of ASCII values"
" greater than or equal to k = "
<< NumberOfWords - counter;
}
// Driver code
int main()
{
string str = "Learn how to code";
int k = 400;
CountWords(str, k);
return 0;
}
// Java implementation of the
// above approach
class GFG
{
// Function to count the words
static void CountWords(String str, int k)
{
// Sum of ascii values
int sum = 0;
int NumberOfWords = 0;
// Number of words having
// sum of ascii less than k
int counter = 0;
int len = str.length();
for (int i = 0; i < len; ++i)
{
// If character is a space
if (str.charAt(i) == ' ')
{
if (sum < k)
{
counter++;
}
sum = 0;
NumberOfWords++;
}
else // Add the ascii value to sum
{
sum += str.charAt(i);
}
}
// Handling the Last word separately
NumberOfWords++;
if (sum < k)
{
counter++;
}
System.out.println("Number of words having sum " +
"of ASCII values less than k = " +
counter);
System.out.println("Number of words having sum of " +
"ASCII values greater than or equal to k = " +
(NumberOfWords - counter));
}
// Driver code
public static void main(String[] args)
{
String str = "Learn how to code";
int k = 400;
CountWords(str, k);
}
}
// This code is contributed by RAJPUT-JI
# Python 3 implementation of the
# above approach
# Function to count the words
def CountWords(str, k):
# Sum of ascii values
sum = 0
NumberOfWords = 0
# Number of words having
# sum of ascii less than k
counter = 0
l = len(str)
for i in range(l):
# If character is a space
if (str[i] == ' ') :
if (sum < k):
counter += 1
sum = 0
NumberOfWords += 1
else:
# Add the ascii value to sum
sum += ord(str[i])
# Handling the Last word separately
NumberOfWords += 1
if (sum < k):
counter += 1
print("Number of words having sum of ASCII",
"values less than k =", counter)
print("Number of words having sum of ASCII values",
"greater than or equal to k =",
NumberOfWords - counter)
# Driver code
if __name__ == "__main__":
str = "Learn how to code"
k = 400
CountWords(str, k)
# This code is contributed
# by ChitraNayal
// C# implementation of the
// above approach
using System;
class GFG
{
// Function to count the words
static void CountWords(String str,
int k)
{
// Sum of ascii values
int sum = 0;
int NumberOfWords = 0;
// Number of words having
// sum of ascii less than k
int counter = 0;
int len = str.Length;
for (int i = 0; i < len; ++i)
{
// If character is a space
if (str[i]==' ')
{
if (sum < k)
{
counter++;
}
sum = 0;
NumberOfWords++;
}
else // Add the ascii value to sum
{
sum += str[i];
}
}
// Handling the Last word
// separately
NumberOfWords++;
if (sum < k)
{
counter++;
}
Console.WriteLine("Number of words having sum " +
"of ASCII values less than k = " +
counter);
Console.WriteLine("Number of words having sum of " +
"ASCII values greater than or equal to k = " +
(NumberOfWords - counter));
}
// Driver code
public static void Main(String[] args)
{
String str = "Learn how to code";
int k = 400;
CountWords(str, k);
}
}
// This code is contributed by RAJPUT-JI
<script>
// JavaScript implementation of the
// above approach
// Function to count the words
function CountWords(str, k)
{
// Sum of ascii values
let sum = 0;
let NumberOfWords = 0;
// Number of words having
// sum of ascii less than k
let counter = 0;
let len = str.length;
for (let i = 0; i < len; ++i) {
// If character is a space
if (str[i] == " ") {
if (sum < k) {
counter++;
}
sum = 0;
NumberOfWords++;
}
else {
// Add the ascii value to sum
sum += str.charCodeAt(i);
}
}
// Handling the Last word separately
NumberOfWords++;
if (sum < k) {
counter++;
}
document.write("Number of words having sum " +
"of ASCII values less than k = " +
counter + "<br>");
document.write("Number of words having sum of " +
"ASCII values greater than or equal to k = " +
(NumberOfWords - counter) + "<br>");
}
// Driver code
let str = "Learn how to code";
let k = 400;
CountWords(str, k);
// This code is contributed by Surbhi Tyagi.
</script>
<?php
// PHP implementation of the above approach
// Function to count the words
function CountWords($str, $k)
{
// Sum of ascii values
$sum = 0;
$NumberOfWords = 0;
// Number of words having
// sum of ascii less than k
$counter = 0;
$len = strlen($str);
for ($i = 0; $i < $len; ++$i)
{
// If character is a space
if ($str[$i] == ' ')
{
if ($sum < $k)
$counter++;
$sum = 0;
$NumberOfWords++;
}
else
// Add the ascii value to sum
$sum += ord($str[$i]);
}
// Handling the Last word separately
$NumberOfWords++;
if ($sum < $k)
$counter++;
echo "Number of words having sum of ASCII" .
" values less than k = " . $counter . "\n";
echo "Number of words having sum of ASCII " .
"values greater than or equal to k = " .
($NumberOfWords - $counter);
}
// Driver code
$str = "Learn how to code";
$k = 400;
CountWords($str, $k);
// This code is contributed by mits
?>
OutputNumber of words having sum of ASCII values less than k = 2
Number of words having sum of ASCII values greater than or equal to k = 2
Complexity Analysis:
- Time Complexity: O(N), as we are using a loop to traverse N times so it will cost us O(N) time
- Auxiliary Space: O(1), as we are not using any extra space.
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