They give you a chess move based telephone number problem. And want you to write an algorithm to generate max count of numbers based on Chess moves Their problem statement says use OO and Design Patterns. And use stub functions where needed. Well, I provided the solution for 4 of the chess pieces and for the other 3, I didnt implement and clearly mentioned it that they could be implemented similar to the 4 I have already done. I also used Dependency inversion and interfaces and abstract classes. Finally, I was told my solution was complicated. This was the most ridiculous response I got. Someone who couldn't understand interfaces / design patterns. Real shame. Hindsight, it is better I didnt progress through with such a company.