Practice Real Company Assessment Patterns • Latest 2025–2026 Mock Tests

Programming Exercises

Write a program to find the longest increasing subsequence (LIS) in an array of numbers.

Hard

Problem Statement

Write a program to find the longest increasing subsequence (LIS) in an array of numbers.

Sample Input

[10, 22, 9, 33, 21, 50, 41, 60, 80]

Sample Output

Longest Increasing Subsequence: 6

Limits

Time: 2s · Memory: 256 MB

Code Editor
00:00
function longestIncreasingSubsequence(arr: number[]): number { // Your logic here }
Log in or sign up to run or submit your code.Log inSign up
Input
[10, 22, 9, 33, 21, 50, 41, 60, 80]
Expected Output
Longest Increasing Subsequence: 6