Google Coding Interview: Longest Increasing Subsequence

preview_player
Показать описание
Solving one of the common Google coding interview problems. Given an array find longest increasing subsequence in this array.

Time Stamps:
0:00 Introduction
1:12 Coding question
2:41 Brute force approach
4:50 Dynamic programming
7:35 Greedy
9:50 Coding
Рекомендации по теме