Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 8065409
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 5, 20262026-06-05T11:39:36+00:00 2026-06-05T11:39:36+00:00

What is the most pythonic and/or efficient way to count the number of characters

  • 0

What is the most pythonic and/or efficient way to count the number of characters in a string that are lowercase?

Here’s the first thing that came to mind:

def n_lower_chars(string):
    return sum([int(c.islower()) for c in string])
  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-06-05T11:39:38+00:00Added an answer on June 5, 2026 at 11:39 am

    Clever trick of yours! However, I find it more readable to filter the lower chars, adding 1 for each one.

    def n_lower_chars(string):
        return sum(1 for c in string if c.islower())
    

    Also, we do not need to create a new list for that, so removing the [] will make sum() work over an iterator, which consumes less memory.

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Just curious, what's the most pythonic/efficient way to determine if sequence of 3 characters
Which is the most pythonic way to convert a list of tuples to string?
What´s the most efficient, elegant and pythonic way of solving this problem? Given a
What would be the most Pythonic way to find the first index in a
I'm wondering about the correct/easiest/most pythonic way of dealing with subprojects that you want
I'm writing an api and was wondering what's the most pythonic way to do
I know that this is not the most pythonic approach but I have a
What would be the easiest/shortest/ most-Pythonic way to get the weighted average of a
I am looking for the most pythonic way of splitting a list of numbers
What is the most pythonic way to truncate a list to N indices when

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.