CT340

The Consonant Tally of Lodebarrow

EasyL2 · Byte BanditAcceptance: 0.0%XP: 10

Deep in the silver mines of Lodebarrow, Wheelwright studies rows of verses entries. One clean number will settle the guild's oldest argument. Task: Read a lowercase string s and print the number of consonants. Input format: One line with a single lowercase string s. Output format: Print the consonant count. Constraints: 1 <= |s| <= 67; s contains lowercase English letters.

Example 1:

Input: ujxmjspfagxvkmqoirkxeykloldyopsmw
Output: 26

Example 2:

Input: xfynlremueelhwkin
Output: 12

Example 3:

Input: isvzsctjkrkblwczscbqajpoyhftoamfgpwzzyxbuhsvzvuqvzayafbe
Output: 46

Constraints:

1 <= |s| <= 67; s contains lowercase English letters.

Loading...
Test Cases:No test cases
No test cases available.
The Consonant Tally of Lodebarrow - EASY Coding Problem | CodeTikki