For Example when we consider a DFA that allows the strings having neither sub strings
11 I can produce the following two DFAs:
First of all, your left DFA is incorrect - it accepts e.g. 011.
Secondly, DFAs can be canonically minimized, so in that sense, you can always find one canonical DFA for a certain language.
But in general, there are infinitely many different DFAs for every language, so you could get different correct answers.