1. You have two strings. A test string and a glob
Test string can have a & b, any number of times, any location.
Glob can have a, b, ? and *, any number of times, any location.
E.g.
test= {a,b,a,a,a,a,b,b,b,b,b,b}
glob = {a,?, *, b}
Now, ? means ANY character, single occurrence. So it's either a or b, one time
* means ANY OR NO character, any number of occurrences.
E.g. the above glob and test actually match.
Problem is: write an algorithm to match glob with test. You MAY NOT use regular expressions :D
2. The input is any string of any length of any characters.
Write a program to generate ALL unique permutations of those characters. Unique.
You may not store in an array or list, due to memory constraints.
e.g. for input of abc
your program should give 6 permutations
but for aba
your program should give 3.
Hint: make the list alphabetical.
