Skip to content

Greedy

Directory actions

More options

Directory actions

More options

Latest commit

 

History

History

Greedy

Folders and files

NameName
Last commit message
Last commit date

parent directory

..
Leetcode Easy
Leetcode Easy
 
 
Bag of Tokens.cpp
Bag of Tokens.cpp
 
 
Boats to Save People.cpp
Boats to Save People.cpp
 
 
Break a Palindrome.cpp
Break a Palindrome.cpp
 
 
Broken Calculator.cpp
Broken Calculator.cpp
 
 
Candy.cpp
Candy.cpp
 
 
Dota2 Senate.cpp
Dota2 Senate.cpp
 
 
Earliest Possible Day of Full Bloom.cpp
Earliest Possible Day of Full Bloom.cpp
 
 
Earliest Second to Mark Indices I.cpp
Earliest Second to Mark Indices I.cpp
 
 
Eliminate Maximum Number of Monsters.cpp
Eliminate Maximum Number of Monsters.cpp
 
 
Find Polygon With the Largest Perimeter.cpp
Find Polygon With the Largest Perimeter.cpp
 
 
Find the Maximum Sum of Node Values.cpp
Find the Maximum Sum of Node Values.cpp
 
 
Find the Most Competitive Subsequence
Find the Most Competitive Subsequence
 
 
Fractional Knapsack.cpp
Fractional Knapsack.cpp
 
 
Gas Station.cpp
Gas Station.cpp
 
 
Greatest Sum Divisible by Three.cpp
Greatest Sum Divisible by Three.cpp
 
 
Least Number of Unique Integers after K Removals.cpp
Least Number of Unique Integers after K Removals.cpp
 
 
Lexicographically Smallest Generated String.cpp
Lexicographically Smallest Generated String.cpp
 
 
Longest Binary Subsequence Less Than or Equal to K.cpp
Longest Binary Subsequence Less Than or Equal to K.cpp
 
 
Longest Palindrome by Concatenating Two Letter Words.cpp
Longest Palindrome by Concatenating Two Letter Words.cpp
 
 
Max Difference You Can Get From Changing an Integer.cpp
Max Difference You Can Get From Changing an Integer.cpp
 
 
Maximize Happiness of Selected Children.cpp
Maximize Happiness of Selected Children.cpp
 
 
Maximize Subarrays After Removing One Conflicting Pair.cpp
Maximize Subarrays After Removing One Conflicting Pair.cpp
 
 
Maximum 69 Number.cpp
Maximum 69 Number.cpp
 
 
Maximum Average Pass Ratio.cpp
Maximum Average Pass Ratio.cpp
 
 
Maximum Bags With Full Capacity of Rocks.cpp
Maximum Bags With Full Capacity of Rocks.cpp
 
 
Maximum Distance in Arrays.cpp
Maximum Distance in Arrays.cpp
 
 
Maximum Element After Decreasing and Rearranging.cpp
Maximum Element After Decreasing and Rearranging.cpp
 
 
Maximum Ice Cream Bars.cpp
Maximum Ice Cream Bars.cpp
 
 
Maximum Manhattan Distance After K Changes.cpp
Maximum Manhattan Distance After K Changes.cpp
 
 
Maximum Number of Coins You Can Get.cpp
Maximum Number of Coins You Can Get.cpp
 
 
Maximum Number of Distinct Elements After Operations.cpp
Maximum Number of Distinct Elements After Operations.cpp
 
 
Maximum Number of Integers to Choose From a Range I.cpp
Maximum Number of Integers to Choose From a Range I.cpp
 
 
Maximum Number of Operations to Move Ones to the End.cpp
Maximum Number of Operations to Move Ones to the End.cpp
 
 
Maximum Score of a Good Subarray.cpp
Maximum Score of a Good Subarray.cpp
 
 
Maximum_Performance_of_a_Team.cpp
Maximum_Performance_of_a_Team.cpp
 
 
Min Swaps to Make Palindrome (Distorted Palindrome)
Min Swaps to Make Palindrome (Distorted Palindrome)
 
 
Minimum Cost for Cutting Cake I - II.cpp
Minimum Cost for Cutting Cake I - II.cpp
 
 
Minimum Deletion Cost to Avoid Repeating Letters.cpp
Minimum Deletion Cost to Avoid Repeating Letters.cpp
 
 
Minimum Deletions to Make Character Frequencies Unique.cpp
Minimum Deletions to Make Character Frequencies Unique.cpp
 
 
Minimum Deletions to Make String K-Special.cpp
Minimum Deletions to Make String K-Special.cpp
 
 
Minimum Domino Rotations For Equal Row.cpp
Minimum Domino Rotations For Equal Row.cpp
 
 
Minimum Equal Sum of Two Arrays After Replacing Zeros.cpp
Minimum Equal Sum of Two Arrays After Replacing Zeros.cpp
 
 
Minimum Moves to Balance Circular Array.cpp
Minimum Moves to Balance Circular Array.cpp
 
 
Minimum Number of Arrows to Burst Balloons.cpp
Minimum Number of Arrows to Burst Balloons.cpp
 
 
Minimum Number of Operations to Make All Array Elements Equal to 1.cpp
Minimum Number of Operations to Make All Array Elements Equal to 1.cpp
 
 
Minimum Number of Operations to Make Array Empty.cpp
Minimum Number of Operations to Make Array Empty.cpp
 
 
Minimum Number of People to Teach.cpp
Minimum Number of People to Teach.cpp
 
 
Minimum Number of Taps to Open to Water a Garden.cpp
Minimum Number of Taps to Open to Water a Garden.cpp
 
 
Minimum Replacements to Sort the Array.cpp
Minimum Replacements to Sort the Array.cpp
 
 
Minimum Rounds to Complete All Tasks.cpp
Minimum Rounds to Complete All Tasks.cpp
 
 
Minimum Swaps to Make Strings Equal
Minimum Swaps to Make Strings Equal
 
 
Minimum Time to Make Rope Colorful.cpp
Minimum Time to Make Rope Colorful.cpp
 
 
Non-overlapping Intervals.cpp
Non-overlapping Intervals.cpp
 
 
Optimal Partition of String.cpp
Optimal Partition of String.cpp
 
 
Partitioning Into Minimum Number Of Deci-Binary Numbers.cpp
Partitioning Into Minimum Number Of Deci-Binary Numbers.cpp
 
 
Patching Array.cpp
Patching Array.cpp
 
 
Put_Boxes_Into_the_Warehouse_I.cpp
Put_Boxes_Into_the_Warehouse_I.cpp
 
 
README.md
README.md
 
 
Rearranging Fruits.cpp
Rearranging Fruits.cpp
 
 
Remove Colored Pieces if Both Neighbors are the Same Color.cpp
Remove Colored Pieces if Both Neighbors are the Same Color.cpp
 
 
Reschedule Meetings for Maximum Free Time II.cpp
Reschedule Meetings for Maximum Free Time II.cpp
 
 
Smallest String With A Given Numeric Value
Smallest String With A Given Numeric Value
 
 
Split Array into Consecutive Subsequences.cpp
Split Array into Consecutive Subsequences.cpp
 
 
Task Scheduler.cpp
Task Scheduler.cpp
 
 
Two_City_Scheduling.cpp
Two_City_Scheduling.cpp
 
 
Water the plants.cpp
Water the plants.cpp
 
 
Wiggle Subsequence
Wiggle Subsequence
 
 

README.md

Fork me on GitHub

Greedy : 🚩

Questions

Problem Name
Boats to Save People (Leetcode-881)
Minimum Deletion Cost to Avoid Repeating Letters (2 approaches) (Leetcode-1578)
Task Scheduler (Leetcode-621)
Gas Station (or, Circular Tour) (Leetcode-134)
Minimum Number of Arrows to Burst Balloons (3 approaches) (Leetcode-452)
Minimum Domino Rotations For Equal Row (Leetcode - 1007)
Bag of Tokens (Leetcode-948)
Smallest String With A Given Numeric Value (Leetcode-1663)
Find the Most Competitive Subsequence (Leetcode-1673)
Min Swaps to Make Palindrome (Distorted Palindrome) (Microsoft)
Minimum Swaps to Make Strings Equal (Leetcode-1247)
Partitioning Into Minimum Number Of Deci-Binary Numbers (Leetcode-1689)
Broken Calculator (Leetcode-991)
Wiggle Subsequence (Leetcode-376)
Put Boxes Into the Warehouse I (Leetcode-1564)
Two City Scheduling (3 approaches) (Leetcode-1029)
Maximum Performance of a Team (Leetcode-1383)
Non-overlapping Intervals (Leetcode-435)
Candy (Leetcode-135)
Fractional Knapsack
Patching Array (Leetcode-330)
Break a Palindrome (Leetcode-1328)
Split Array into Consecutive Subsequences (Leetcode-659)
Minimum Time to Make Rope Colorful (Leetcode-1578)
Earliest Possible Day of Full Bloom (Leetcode-2136)
Longest Palindrome by Concatenating Two Letter Words (Leetcode-2131)
Maximum 69 Number (Leetcode-1323)
Maximum Bags With Full Capacity of Rocks (Leetcode-2279)
Minimum Rounds to Complete All Tasks (Leetcode-2244)
Maximum Ice Cream Bars (Leetcode-1833)
Optimal Partition of String (Leetcode-2405)
Dota2 Senate (Leetcode-649)
Minimum Replacements to Sort the Array (Leetcode-2366)
Minimum Number of Taps to Open to Water a Garden (Leetcode-1326)
Minimum Deletions to Make Character Frequencies Unique (Leetcode-1647)
Remove Colored Pieces if Both Neighbors are the Same Color (Leetcode-2038)
Maximum Score of a Good Subarray (Leetcode-1793)
Eliminate Maximum Number of Monsters (Leetcode-1921)
Maximum Element After Decreasing and Rearranging (Leetcode-1846)
Maximum Number of Coins You Can Get (Leetcode-1561)
Minimum Number of Operations to Make Array Empty (Leetcode-2870)
Water the plants (GFG)
Find Polygon With the Largest Perimeter (Leetcode-2971)
Earliest Second to Mark Indices I (Leetcode-3048)
Minimum Deletions to Make String K-Special (Leetcode-3085)
Maximize Happiness of Selected Children (Leetcode-3075)
Find the Maximum Sum of Node Values (Leetcode-3068)
Minimum Cost for Cutting Cake I - II (Leetcode-3218 & 3219)
Maximum Distance in Arrays (Leetcode-624)
Maximum Number of Integers to Choose From a Range I (Leetcode - 2554)
Maximum Average Pass Ratio (Leetcode - 1792)
Minimum Equal Sum of Two Arrays After Replacing Zeros (Leetcode - 2918)
Max Difference You Can Get From Changing an Integer (Leetcode - 1432)
Maximum Manhattan Distance After K Changes (Leetcode - 3443)
Longest Binary Subsequence Less Than or Equal to K (Leetcode - 2311)
Reschedule Meetings for Maximum Free Time II (Leetcode - 3440)
Maximize Subarrays After Removing One Conflicting Pair (Leetcode - 3480)
Rearranging Fruits (Leetcode - 2561)
Minimum Number of People to Teach (Leetcode - 1733)
Maximum Number of Distinct Elements After Operations (Leetcode - 3397)
Minimum Number of Operations to Make All Array Elements Equal to 1 (Leetcode - 2654)
Maximum Number of Operations to Move Ones to the End (Leetcode - 3228)
Greatest Sum Divisible by Three (Leetcode - 1262)
Minimum Moves to Balance Circular Array (Leetcode - 3776)
Lexicographically Smallest Generated String (Leetcode - 3474)