The Job Sequencing Problem asks you to schedule jobs to maximize total profit, given that each job: You need to…
Browsing: Intermediate
This classic scheduling problem asks you to find the minimum number of railway platforms required so that no train has…
This problem asks: given an array nums where nums[i] is the maximum jump length from index i, find the minimum…
The Jump Game is a popular interview problem and a classic example of applying a Greedy Algorithm. It appears frequently…
The N Meetings in One Room problem is a classic example of the Greedy Algorithm. It focuses on scheduling tasks…
The Fractional Knapsack problem is one of the most famous problems in the Greedy Algorithm category. It is widely asked…
The problem “Maximum Points You Can Obtain from Cards” asks you to pick exactly k cards from either the start or the end of the array cardPoints to maximize the total points. The key insight is that if…
The problem “Number of Substrings Containing All Three Characters” asks: given a string s consisting only of the characters ‘a’, ‘b’, and ‘c’, count how many substrings contain at least one of each of…
The problem “Binary Subarrays With Sum” asks to count the number of contiguous subarrays in a binary array nums whose sum equals a given goal.…
The problem “Longest Repeating Character Replacement” asks for the length of the longest substring that can be converted into a string of…