Sliding Window Maximum | Technical Interview Questions | Ep 1 | CodeChef

Introducing Technical Interview Questions series, where top coders in the industry will be discussing the must-learn problems and explain them in detail. Almost all the top-notch companies ask about these problems in their interviews (Yes, including FAANG companies). In this week's video, Saptarshi Mukherjee, an incoming SDE at Google, talks about the challenging Sliding Window Maximum problem. This is one of the hardest yet essential problems that you need to know. This problem is about finding the maximum of all the subarrays of size k. He discusses how to approach the question, the logic, the concepts, and how to implement them. Timestamp⏰ Introduction: 00:00 Problem Statement with Example: 02:55 Brute Force Technique: 08:45 Analysis of Brute Force Method: 11:25 Solution in O(nlogn): 14:50 Intuition behind O(n) approach: 19:15 Coding Implementation: 37:55 Conclusion: 52:33 Learn problem solving using this roadmap https://www.codechef.com/roadmap/cpp-dsa?utm_source=youtube&utm_medium=video&utm_campaign=youtube_previous Master DSA following this roadmap: https://www.codechef.com/roadmap/data-structures-and-algorithms?utm_source=youtube&utm_medium=video&utm_campaign=youtube_previous ▶️Do Like 👍, comment & share the the Video with your friends & subscribe our CodeChef YouTube Channel and press the 🔔 bell icon to get notifications for all new video editorials of all your favourite CodeChef problems.. 🔵Reach out to us on any of our social media handles: 🔸Instagram: https://www.instagram.com/codechef 🔸LinkedIn: https://www.linkedin.com/company/codechef #Coding #Competitive_Programming #Codechef