← OYO questions
CodingReported in a candidate post, Sep 2019

Longest Increasing Subsequence and Count Possible Decodings

Filed under OYO

Solve two standard dynamic programming problems: 1. Find the length of the Longest Increasing Subsequence (LIS) in an array. 2. Count the number of possible decodings for a given digit string where…

You've read your 3 free write-ups

Sign up free to keep reading. Your account opens the first 10 questions of every company.

Related OYO questions

Collected from public candidate posts and coding forums. Updated Nov 2026.