Longest increasing subsequence
Given an array of integers, return the length of the longest strictly increasing subsequence.
Implement
length_of_lis(nums: list[int]) → intExamples
in
[[10,9,2,5,3,7,101,18]]out4What a strong answer looks like
State your approach and its time/space complexity out loud before you optimize. Handle the edge cases (empty input, duplicates, overflow), and say why you chose this over the brute force. Green tests are the floor, not the grade.
0:00 of about 35 min
solution.py
InputExpectedGot
[[10,9,2,5,3,7,101,18]]4not run yetsample