1.Anagram.java You are given two strings, a ‘parent’ string and a ‘query’ string respectively. Determine how many times the query string – or an anagram of the query string – appears in the parent string.
Input : AdnBndAndBdaBn, dAn Output : 4
2.BalancedBrackets Given string consists of the characters ()[]{}, determine if it is "balanced". That is, every opening bracket must have a closing bracket of the same type following it, and the string in between the pair must also be balanced. For the purposes of the problem, an empty string should be considered balanced.
Input: ()[]{}(([])){[()][]} Output :balanced