Brute-force search consists of systematically enumerating every possible solution of a problem until a solution is found, or all possible solutions have been exhausted. For example, an anagram problem can be solved by enumerating all possible combinations of words with the same number of letters as the desired phrase, and checking one by one whether the words make a valid anagram.

hi. i just joined an embedding company and they provide me some tasks and one of it is this anagram ... i try hard but unable so i kindly request u to help me find all the possible combinations of the inputed string.

For solving anagrams, you'll need a word list! Then you'll need to try all possible combinations of the inputed word against the word list.