64. Minimum Path Sum
518. Coin Change II
416. Partition Equal Subset Sum
416. Partition Equal Subset Sum
Description
Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false otherwise.
1312. Minimum Insertion Steps to Make a String Palindrome
1312. Minimum Insertion Steps to Make a String Palindrome
Description
Given a string s. In one step you can insert any character at any index of the string.
3224. Minimum Array Changes to Make Differences Equal
3224. Minimum Array Changes to Make Differences Equal
Description
You are given an integer array nums of size n where n is even , and an integer k.
3229. Minimum Operations to Make Array Equal to Target
3229. Minimum Operations to Make Array Equal to Target
Description
You are given two positive integer arrays nums and target, of the same length.
3228. Maximum Number of Operations to Move Ones to the End
3228. Maximum Number of Operations to Move Ones to the End
Description
You are given a binary string s.