Watch and track your favorite playlist.
Curated by: Code Sketched (96 videos)
#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 https://youtu.be/64DL9BNVwkU& 2. maximum substring in a string (Google interview question) https://youtu.be/IHsX70r-fIQ 3. How the javascript engine works? https://youtu.be/KM9coMpy5sQ 4. Real time median in a stream, another google interview question https://youtu.be/1CxyVdA_654 5. Understand the Javascript event loop https://youtu.be/XzXIMZMN9k4 6. Understand Promises in javascript https://youtu.be/gV7SaMIFyg8 7. Git basics you must know https://youtu.be/HDRXwokgWpo 8. Styled components in React https://youtu.be/kClcUzAhz9g 9. JavaScript Interview question null vs undefined https://youtu.be/XKDsb08-TMA 10. The reason behind that silly CORS error https://youtu.be/Qf2V6v1pdRY This video makes use of Icons made by Flat Icons (https://www.flaticon.com/authors/flat-icons) from www.flaticon.com #leetcode #google #interview