3013. Divide an Array Into Subarrays With Minimum Cost II | Sliding Window | Multisets

In this video, I'll talk about how to solve Leetcode 3013. Divide an Array Into Subarrays With Minimum Cost II
Problem Link: leetcode.com/problems/divide-...
Checkout DSA-169 Series: • Aryan DSA-169 Series |...
100Days 100k Placements: • 100 Days 100K Placement
Sol1 - leetcode.com/problems/divide-...
Let's Connect:
📝Linkedin: / aryan-mittal-0077
📸 Instagram: / ez.pz.dsa
📱Telegram : t.me/aryan_mittal_group
🤖 Github: github.com/aryan-0077
About Me:
I am Aryan Mittal - A Software Engineer in Goldman Sachs, Speaker, Creator & Educator. During my free time, I create programming education content on this channel & also how to use that to grow :)
✨ Timelines✨
0:00 - Problem Explanation
3:12 - Brute Force / Basic Approach
6:53 - Intuition
12:46 - Explanation
21:22 - Dry Run
26:00 - Code Explanation
✨ Hashtags ✨
#programming #Interviews #leetcode #faang #maang #datastructures #algorithms

[@abdulsakibshekhayyub3498]

Best channel for leetcoders

[@ShivamKumar-zn4uc]

Fantastic approach and intuition brother, thanks for this video

[@shivamgarg269]

Good explanation brother..😊😊✌✌

[@sahilanand30]

Awesome explanation

[@sunny_23561]

great explanation.. Thanks Alot

[@nikhilahuja6301]

great explanation🔥🔥

[@divyanshojha9888]

By using only one multiset does we have difficulty while removing elements?

[@divyanshojha9888]

why I'm getting WA for tc 673 class Solution { public: long long minimumCost(vector& nums, int k, int dist) { long long ans=INT_MAX,cur=nums[0],n=nums.size(); multisetl,r; k--; int j=1; for(int i=1;idist){ if(l.find(nums[j])!=l.end()){ cur-=nums[j]; auto it = l.find(nums[j]); l.erase(it); } else{ auto it = r.find(nums[j]); r.erase(it); } j++; } if(i-j==dist){ if(l.size()==k) ans=min(ans,cur); } } return ans; } };