Testing whether I can find the longest palindrome subsequence of a string optimally via a tabular or memoized dynamic programming solution in 20 minutes has pra

Testing whether I can find the longest palindrome subsequence of a string optimally via a tabular or memoized dynamic programming solution in 20 minutes has practically zero ability to measure how effective I am on the job. Not just "practically zero" - but like, "for sure zero". As in, there is absolutely zero chance you would need to solve a problems like this (or Sudoku, etc) in the course of actual engineering work. It's a bullshit question, essentially.