Beginner
1. Consecutive Prime Sum2. Alpha Numeric Sorting3. Longest Progressive Sequence4. Divine Divisor5. Forest Fire6. Minimum Distance7. Saving for a rainy day8. Online Communities Even Groups9. Coin Distribution10. Bank Compare11. Counting Rock Samples12. Collecting Candies13. Game Of Primes14. Kth Largest Factor15. Jumble With Numbers16. Philand Coins17. Reverse Gear18. String Rotation19. The Vita Sum20. Mountain Peak Sequence21. LAZY STUDENT22. LOGIC PYRAMID23. Super ASCII String Checker24. Min Product Array25. String Of Brackets26. Exchange Of Digits27. Marathon Winner28. Common Steps29. Swayamvar30. Digit Pairs31. Dole Out Cadbury32. Petrol Pump33. Grooving Monkeys34. Death BattleString Of Brackets
LEVEL:Beginner
Description
CODU loves to play with string of brackets.
He considers string as a good string if it is balanced with stars. A string is considered as balanced with stars if string contains balanced brackets and between every pair of bracket i.e. between opening and closing brackets, there are at least 2 stars(*) present.
CODU knows how to check whether a string is balanced or not but this time he needs to keep a track of stars too. He decided to write a program to check whether a string is good or not. But CODU is not as good in programming as you are, so he decided to take help from you. Will you help him for this task?
You need to print Yes and number of balanced pair if string satisfies following conditions(string is good if it satisfies following 2 conditions):
The string is balanced with respect to all brackets.
Between every pair of bracket there is at least two stars.
However if string doesn't satisfies above conditions then print No and number of balanced pair in string as an output.
Input Format
The first and only line of input contains a string of characters(a-z,A-Z), numbers(0-9), brackets( '{', '[', '(', ')', ']', '}' ) and stars(*).
Constraints
4 <= String length <= 1000
Output Format
Print space separated 'Yes' (without quotes) and number of balanced pair if string is good. Else print 'No' (without quotes) and number of balanced pair.
{**}Yes 1
{**(**{**[**]})}Yes 4
**}xasd[**]sda231
No 1
Login to see Discussion
Approach
Maintaining a stack to track the brackets. Iterate through the string and PUSH the bracket if it's an open bracket and POP the bracket if its closed bracket. Check for the consecutive '*' in the string, if there are consecutive '*' increase the count. At last check if the stack is empty, print 'Yes' and the count, else print 'No' and the count.
Note :
Let us know if you can come up with a better approach, mail us at support@theinquisitive.in Your approach will be reviewed and posted with credits to you.
Login to see Solution