I have been given a task of finding the permutations of the letters of a given word. For example, if the given word is like then possible answers are liek, lkie, and so on. This can be implemented in any language, but the rule is not to use any built-in functions/API to find the combinations.
We know that design patterns are for solving any problem with a given solution. For example, Information Expert is a design pattern. Is there any design pattern for finding combinations? Or will design patterns not suit for this situation? Will I have to learn a good algorithm for finding the solution? In that case, what’s the difference between an algorithm and a design pattern? Both try to solve the problem in a good, efficient way, right?
Please correct me if I’m wrong!