Programming Challenges

Hey everyone,

Given a compressed string, give the number of ways it can be decompressed. - A compressed string is a string where substrings of repeated characters are changed to a format similar to aaa -> a3 - For example for the string aaabbhhhh33aaa the compressed string would be a3b2h432a3

Given a string, compress substrings of repeated characters in to a format similar to aaa -> a3

Given some assortment of brackets, you must find the largest substring that is a valid matching bracket pattern - A bracket match is an opening and closing version of the same kind of bracket beside each other () - If a bracket matches then outer brackets can also match (()) - The valid brackets are ()[]{}

Bracket Inc. wants to ship out new products using their excess brackets. They have tasked you with generating every possible assortment of brackets for some n brackets where the brackets will match - A bracket match is an opening and closing version of the same kind of bracket beside each other () - If a bracket matches then outer brackets can also match (()) - n will be an even number - The valid brackets are ()[]{}

Welcome to the first programming challenge! Three of these will be posted a week and you can complete it in any language you want.

This is a community that will have various programming challenges to complete (in any language of your choosing)