← Samsung questions

Longest increasing subsequence in a 2D array and Kadane's Algorithm

Filed under Samsung

Find the Longest Increasing Subsequence (LIS) in a 2D matrix (moving only right or down) and implement Kadane's Algorithm to find the maximum sum subarray in a 1D array.

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 Samsung questions

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