Point72 SWE Interview Question 2023 August | Binary Search and DP | on-campus

Question 1: Longest Increasing Subsequence Problem Statement Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is derived by deleting some or no elements without changing the relative order of the remaining elements. Constraints 1 <= nums.length <= 2500 -104 <= nums[i] <= 104 Examples Example 1: Input: nums = [10, 9, 2, 5, 3, 7, 101, 18] Output: 4 Explanation 1: Longest increasing subsequence is [2, 3, 7, 101] or [2, 5, ...