Apart from $2SAT$, what versions of SAT problem is complete for the class NL?
Is there dynamic programming algorithm to solve the $2SAT$ Problem?
(1) is hard to answer unless you clarify what you mean by "versions of SAT problem." If we limit ourselves to the classes listed in Schaefer's "The Complexity of Satisfiability Problems", the only nontrivial class known to be in NL is 2-SAT.
As for question (2), 2-SAT is amenable to dynamic programming, as is SAT in general. During the DPLL process each partial assignment produces a new subformula: the previous formula with false literals removed and all satisfied clauses deleted. As subformulas are determined to be unsatisfiable, they can be memoized in a canonical form. If a known unsatisfiable subformula is encountered again during the DPLL search, a table lookup can identify it and the search can immediately backtrack. For SAT instances derived from problems with many symmetries (and therefore many identical subformulas) the time savings can be substantial.