How to find $L_q = \emptyset$, a state that is not reachable for any given string?
You're right. There is no such state with $L_q = \emptyset$

The first step in the minimization algorithm is: "delete all nonreachable states".