Skip to content
loading...

re: Can you crack this google interview question? The maximum subsequence problem. VIEW POST

TOP OF THREAD FULL DISCUSSION
re: Google and their arrogant black book based interview questions, most of them with no real world applicability on their own
 

Well, while that is true about most of the brain teasers, it does not particularly apply to this question. It is a proper sub-sequence match problem that has several applications in Search, graph traversal, dictionaries just to state a few.

code of conduct - report abuse