Google Interview Question | Maximum subsequence | leetcode

#google #interview #algorithm
In this video, we look into this google interview question from leetcode that is about finding a maximum subsequence (from a given dictionary) in a given string.

In this current video, we look into a greedy solution to this problem. Also, we look into optimizing that greedy solution for better time complexity.

Here are some links to our other popular videos:

1. Learn about public-key cryptography

2. maximum substring in a string (Google interview question)

3. How the javascript engine works?

4. Real time median in a stream, another google interview question

5. Understand the Javascript event loop

6. Understand Promises in javascript

7. Git basics you must know

8. Styled components in React

9. JavaScript Interview question null vs undefined

10. The reason behind that silly CORS error

#leetcode #google #interview

[chakrapani_nallam]

Wonderful content, loved watching it.

[iscxii]

explained so easily such a complex looking problem!!

[krishnachaitanya]

I didn't understand the optimized solution, could you please share the code.