Question: Searching Challenge Have the function SearchingChallenge ( str ) take the str parameter, search for all the numbers in the string, add them together, then
Searching Challenge
Have the function
SearchingChallenge str take the str parameter, search for all the numbers in the string, add them together, then return that final number divided by the total amount of letters in the string. For example: if str is "Hello World Nice Day the output should be First if you add up all the numbers, you get
Then there are letters in the string.
and the final answer should
be rounded to the nearest whole number, so the answer is Only single digit numbers separated by spaces will be used throughout the whole string So this won't ever be the case: hello world Each string will also have at least one letter.
Examples
Input: He
Output:
Input: "One Number
Output:
Browse Resources
powered by Google
Search for any help or documentation you might need for this problem. For example: array indexing, Ruby hash tables, etc.
C#
using System
class MainCli
public stat
code g
return str
static void M
keep this
Console. Writ
Step by Step Solution
There are 3 Steps involved in it
1 Expert Approved Answer
Step: 1 Unlock
Question Has Been Solved by an Expert!
Get step-by-step solutions from verified subject matter experts
Step: 2 Unlock
Step: 3 Unlock
