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 6756309
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 26, 20262026-05-26T13:30:32+00:00 2026-05-26T13:30:32+00:00

Let’s say I have the string: You are pretty < lady > but that

  • 0

Let’s say I have the string:

You are pretty <lady> but that <girl> is prettier <than> you.

Sorry about the English but how could I count how many <> there are in the above text ?

I know I could do:

int count = message.Length - message.Replace("<", "").Replace(">", "").Length;

But that would count even if the text was like this:

Hey <<<< you <<<<< how you doing >>>

When in fact I just want to count the pairs of <> so the count goes by one when it finds a starting < and ending > and should only starting counting when < is found.

  • 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-05-26T13:30:33+00:00Added an answer on May 26, 2026 at 1:30 pm

    What about doing it like this. Basically you should only count the > if you have encountered a < at some time before. Or said in another way. You stack up <‘s, and then you use one of them each when you encounter a >.

    string test = "You are pretty <lady> but that <girl> is prettier <than> you.";
    
    int startcount = 0;
    int paircount = 0;
    foreach( char c in test ){
      if( c == '<' )
        startcount++;
      if( c == '>' && startcount > 0 ){
        startcount--;
        paircount++;
      }
    }
    //paircount should now be the value you are after.
    

    EDIT

    I thought that <<<>>> should count 3 not 1, so then you need a quick fix above. For it to count <<<>>> as only 1, change to this

    string test = "You are pretty <lady> but that <girl> is prettier <than> you.";
    
    bool foundstart = false;
    int paircount = 0;
    foreach( char c in test ){
      if( c == '<' )
        foundstart = true;
      if( c == '>' && foundstart ){
        foundstart = false;
        paircount++;
      }
    }
    //paircount should now be the value you are after.
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

Let's say that we have an ARGB color: Color argb = Color.FromARGB(127, 69, 12,
Let's say I have multiple requirements for a password. The first is that the
Let's say that I have a date in R and it's formatted as follows.
Let's say I have the string: hello world; some random text; foo; How could
Let's say that I have a set of relations that looks like this: relations
Let's say that I have a binary that I am building, and I include
Let's say that I have classes like this: public class Parent { public int
Let's say I'm creating an OpenGL game in C++ that will have many objects
Let's say we have two concave 2d polygons(A, B), that don't intersect. The problem
Let's say I'm building a data access layer for an application. Typically I have

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.