Posted on Thu 06 February 2025 in Leetcode • Tagged with dp, priority-queue
Question Link : https://leetcode.com/problems/maximum-profit-in-job-scheduling/
Difficulty: Hard
Premium: False
We have n jobs, where every job is scheduled to be done from startTime[i] to endTime[i], obtaining a profit of profit[i]. You're given the startTime, endTime and profit arrays, return the maximum profit you can …
Question Link : https://leetcode.com/problems/house-robber-ii/
Difficulty: Medium
Premium: False
You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed. All houses at this place are arranged in a circle. That means the first house is the …
Posted on Sun 12 January 2025 in Leetcode • Tagged with dp, backtracking
Question Link : https://leetcode.com/problems/decode-ways/
Difficulty: Medium
Premium: False
You have intercepted a secret message encoded as a string of numbers. The message is decoded via the following mapping: "1" -> 'A' "2" -> 'B' ... "25" -> 'Y' "26" -> 'Z' However, while decoding the message, you realize that there are …
Posted on Thu 09 January 2025 in Leetcode • Tagged with dp, greedy, prefix-sum-subarray
Question Link : https://leetcode.com/problems/maximum-product-subarray/
Difficulty: Medium
Premium: False
Given an integer array nums, find a subarray that has the largest product, and return the product. The test cases are generated so that the answer will fit in a 32-bit integer. Example 1:
Input: nums = [2,3 …
Posted on Sun 05 January 2025 in Leetcode • Tagged with dfs, dp
Question Link : https://leetcode.com/problems/word-break/
Difficulty: Medium
Premium: False
Given a string s and a dictionary of strings wordDict, return true if s can be segmented into a space-separated sequence of one or more dictionary words. Note that the same word in the dictionary may be reused …
Posted on Thu 02 January 2025 in Leetcode • Tagged with dp, greedy
Question Link : https://leetcode.com/problems/jump-game/
Difficulty: Medium
Premium: False
You are given an integer array nums. You are initially positioned at the array's first index, and each element in the array represents your maximum jump length at that position. Return true if you can reach the last …
Posted on Sat 28 December 2024 in Leetcode • Tagged with subset-sum, dp
Question Link : https://leetcode.com/problems/maximum-subarray/
Difficulty: Medium
Premium: False
Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1:
Input: nums = [-2,1,-3,4,-1,2,1,-5,4] Output: 6 Explanation: The subarray [4,-1,2,1 …
Posted on Tue 17 December 2024 in Leetcode • Tagged with bits, dp
Question Link : https://leetcode.com/problems/counting-bits/
Difficulty: Easy
Premium: False
Given an integer n, return an array ans of length n + 1 such that for each i (0 <= i <= n), ans[i] is the number of 1's in the binary representation of i. Example 1:
Input: n = 2 …
Posted on Sun 24 November 2024 in Leetcode • Tagged with backtracking, dp, knapsack-1-0
Question Link : https://leetcode.com/problems/target-sum/
Difficulty: Medium
Premium: False
You are given an integer array nums and an integer target. You want to build an expression out of nums by adding one of the symbols '+' and '-' before each integer in nums and then concatenate all the integers …
Posted on Mon 27 March 2023 in Leetcode • Tagged with dp, knapsack-unbounded
Question Link : https://leetcode.com/problems/minimum-cost-for-tickets/
Difficulty: Medium
Premium: False
You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an integer from 1 to 365. Train tickets …