Topological Sort - Longest Path With Different Adjacent Characters
Consider the same iterative DP solution for longest path with different adjacent characters. What is the output for n=1, edges=[], and s="a"?
15+ quiz questions · All difficulty levels · Free
Free Signup - Practice All Questions