We give an algorithm which decides unifiability in the modal logic K of single variable formulas of modal degree one. For this we introduce a finite Kripke frame which characterises unifiability for such formulas. We also present an example suggested to the author by E. Jeřábek, showing that this approach does not directly generalise to multiple variables.