In this video, you'll learn a very important programming interview problem which was asked in Amazon coding interview - "Find Minimum Number After K Removals".

This interview challenge will be explained by Vivekanand Vivek who has previously worked at Amazon as a Software Developer.

This problem involves,
1. How to build greedy intuition for this problem and prove it
2. How to use stack to implement that greedy intuition.
3. How to handle different corner cases

Amazon Coding Interview Question Playlist: [ Ссылка ]
How to Begin a Career in Tech: [ Ссылка ]
How to start Competitive Programming: Roadmap: [ Ссылка ]

Website: [ Ссылка ]
Instagram: [ Ссылка ]
LinkedIn: [ Ссылка ]
Vivekanand Vivek's Linkedin: [ Ссылка ]
Join our telegram channel for more updates: [ Ссылка ]

You can write to us at: info@programmingpathshala.com

If you are preparing for the coding interviews for top product-based companies then you should check out "Renaissance" our coding interview preparation platform where we teach our students how to master DSA, System design, low-level design, and how to become 100% coding interview ready!

Take a 7-day free trial here: [ Ссылка ]
Read stories of our students that made it into top tech companies: [ Ссылка ]

свернуть