Homework assignment: Write code to find the length of the longest non-decreasing sequence through adjacent, non-repeating cells (including diagonals) in a rectangular grid of numbers.

Question

Homework assignment:  Write code to find the length of the longest non-decreasing sequence through adjacent, non-repeating cells (including diagonals) in a rectangular grid of numbers.

Derrick Isaacson · Accepted Answer

Thanks for sharing the questions. We've found that the ability to code a simple clean solution to the calculation mentioned is an indicator of success at Lucid. In other words, the intent is simply to solicit some clean, reasonable code as a step in the interview process. Hope that helps!

Sigiloso · Answer

While this assignment was designated "open-internet", I tried to solve it myself first and struggled to find an efficient algorithm.  I later did look online and found on stackoverflow.com that this problem is known to be at least NP-Hard if not NP-Complete.  
I'm not sure why they would ask this type of homework question.  Are they trying to see if I will push back when there is no known efficient solution?  Or are they wanting to see if I will push through it anyway?  It seems like a trick question.  Even more annoying was that after I solved it anyway, they never even asked me about it.

Lucid Software

Pergunta de entrevista da empresa Lucid Software

Respostas da entrevista

Empresas seguidas

Buscas de vagas