More Problems

• You are given an array of positive integers where each element represents the number of steps you can take forward from that index. Find the minimum number of steps required to jump to the last index.
• Given a list of activities with start and end times, find the maximum number of non-overlapping activities that can be completed.
• You are given a graph where each edge has a cost. Find the minimum cost required to connect all nodes of the graph (Minimum Spanning Tree).
• Given a set of items with a value and a weight, find the maximum value you can carry in a knapsack with a fixed capacity using the fractional knapsack approach.
• You are given a list of jobs, each with a start time, end time, and a profit. Maximize the total profit by scheduling the jobs optimally without any overlaps.
• Given an array of integers, partition the array into two subsets such that the difference between the sum of elements in both subsets is minimized.
• You are given a set of coins with different denominations. Find the minimum number of coins required to make an exact change for a given amount using the Greedy algorithm.
• You are given a set of events, each with a start and end time. Maximize the number of events that can be attended without overlap.