LeetCode Blind 22/75: Decode Ways
Given a string s containing only digits, return the number of ways to decode it.
blind75
LeetCode Blind 21/75: House Robber
Given an integer array nums representing the amount of money of each house, return the maximum amount of money you can rob tonight without alerting the police.
LeetCode Blind 20/75: Combination Sum IV
Given an array of distinct integers nums and a target integer target, return the number of possible combinations that add up to target.
LeetCode Blind 19/75: Word Break
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.
LeetCode Blind 18/75: Longest Common Subsequence
Given two strings text1 and text2, return the length of their longest common subsequence. If there is no common subsequence, return 0.
LeetCode Blind 17/75: Longest Increasing Subsequence
Given an integer array nums, return the length of the longest strictly increasing subsequence.
LeetCode Blind 16/75: Coin Change
Return the fewest number of coins that you need to make up that amount. If that amount of money cannot be made up by any combination of the coins, return -1.
LeetCode Blind 15/75: Climbing Stairs
In how many distinct ways can you climb to the top?
LeetCode Blind 14/75: Reverse Bits
Reverse bits of a given 32 bits unsigned integer.
LeetCode Blind 13/75: Missing Number
Given an array nums containing n distinct numbers in the range [0, n], return the only number in the range that is missing from the array.