https://github.com/xfactor-toml/rust-coding-challenges/tree/master/medium/short-palindrome #22
Answered
by
xfactor-toml
soldev-comai
asked this question in
Q&A
-
|
My solution returns What algorithm did you use? |
Beta Was this translation helpful? Give feedback.
Answered by
xfactor-toml
Jun 10, 2024
Replies: 1 comment
-
|
Dynamic Planning Algorithm. Some calls this algorithm as dynamic programming. I created table for letter i, ij, ijj with one time search to reduce the recursive time. |
Beta Was this translation helpful? Give feedback.
0 replies
Answer selected by
soldev-comai
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Dynamic Planning Algorithm.
Some calls this algorithm as dynamic programming.
I created table for letter i, ij, ijj with one time search to reduce the recursive time.