You are not logged in. Please login at to post your questions!


[closed] Compiler code

In the code compilers and parsers in may long challenge, we need to find the maximum length of valid expression which occurs continuously as a seried without any invalid character in between OR we need to sum up all the valid expressions wheresoever they may be. eg. <><<> should return 2 or 4? If you cant tell the soln of this, just clarify my doubt.

asked 03 May '14, 22:21

k3k33's gravatar image

accept rate: 0%

closed 04 May '14, 07:24

kunal361's gravatar image


the problem statement is clear!!!

(04 May '14, 07:24) kunal3614★

So output of <><>><><><> is 4 @princelegolas?

(04 May '14, 11:38) jeffrycopps_22★

The question has been closed for the following reason "Ongoing Contest!!!" by kunal361 04 May '14, 07:24

did you miss the word "prefix".See the question statement again.


answered 04 May '14, 00:13

princelegolas's gravatar image

accept rate: 15%

Follow this question

By Email:

Once you sign in you will be able to subscribe for any updates here



Answers and Comments

Markdown Basics

  • *italic* or _italic_
  • **bold** or __bold__
  • link:[text]( "title")
  • image?![alt text](/path/img.jpg "title")
  • numbered list: 1. Foo 2. Bar
  • to add a line break simply add two spaces to where you would like the new line to be.
  • basic HTML tags are also supported
  • mathemetical formulas in Latex between $ symbol

Question tags:


question asked: 03 May '14, 22:21

question was seen: 1,715 times

last updated: 04 May '14, 11:38