Automaton-based model checking on finite traces
The nice thing about finite traces is that they end at some point. LTLf is now a logic in which you can only look into the future, and not in the past.

This means that you label every character in the word by which subformulas of your LTLf formula hold for a word starting from that character. You start with the last character and just apply the semantics of LTLf there. Then you do the same for the second-last character, where you can use the fact that for the last character, you already know which LTL subformulas hold.

And then you continue in this way until you hit the first letter. Once you are done with that, you know for all subformulas if they hold there. You just have to look at the whole formula as subformula and are done.