PDC4S:\IT\DSA and Interview Preperation\[INTERVIEW ONLY MAAL] [EXCLUSIVE]\[APPLIED COURSE] Interview Preparation Course\Module 5 - Problem Solving\10. Problems on Greedy Algorithms

Up one directory...
NameSizeDate Modified
9.1. Partition Labels - Problem Statement [Leetcode].html569 KB12/12/2021 3:34 AM
9. Partition Labels - Problem Statement [Leetcode]-studyfever.mp414,446 KB12/12/2021 3:34 AM
8.1. Minimum Number of Arrows to Burst Balloons - Python Code[Leetcode].html599 KB12/12/2021 3:34 AM
8. Minimum Number of Arrows to Burst Balloons - Python Code[Leetcode]-studyfever.mp414,207 KB12/12/2021 3:34 AM
7.1. Minimum Number of Arrows to Burst Balloons - Explanation[Leetcode].html570 KB12/12/2021 3:34 AM
7. Minimum Number of Arrows to Burst Balloons - Explanation[Leetcode]-studyfever.mp426,310 KB12/12/2021 3:34 AM
6.1. Minimum Number of Arrows to Burst Balloons - Problem Statement [Leetcode].html570 KB12/12/2021 3:34 AM
6. Minimum Number of Arrows to Burst Balloons - Problem Statement [Leetcode]-studyfever.mp426,146 KB12/12/2021 3:34 AM
5. Water Connection Problem.html299 KB12/12/2021 3:34 AM
4. Given a universe of n elements Find a minimum cost sub collection that covers all elements.html300 KB12/12/2021 3:34 AM
3. Given an array of jobs with different time intervals Find the minimum time to finish all jobs.html301 KB12/12/2021 3:34 AM
2.1. Minimum Swaps for Bracket Balancing.html601 KB12/12/2021 3:34 AM
2. Minimum Swaps for Bracket Balancing-studyfever.mp434,208 KB12/12/2021 3:34 AM
11.1. Partition Labels - Python code[Leetcode].html569 KB12/12/2021 3:34 AM
11. Partition Labels - Python code[Leetcode]-studyfever.mp415,761 KB12/12/2021 3:34 AM
10.1. Partition Labels - Explanation [Leetcode].html569 KB12/12/2021 3:34 AM
10. Partition Labels - Explanation [Leetcode]-studyfever.mp423,501 KB12/12/2021 3:34 AM
1.1. Given weights and values of n items we need to put these items in a knapsack of capacity W to get the maximum total value in the knapsack.html599 KB12/12/2021 3:34 AM
1. Given weights and values of n items we need to put these items in a knapsack of capacity W to get the maximum total value in the knapsack-studyfever.mp4107,026 KB12/12/2021 3:34 AM