# LeetCode 279. Perfect Squares

Description https://leetcode.com/problems/perfect-squares/ Given an integer n, return the least number of perfect square numbers that sum to n. A perfect square is an integer that…

Be a Good Techer and Tech for Good. www.goodtecher.com

Description https://leetcode.com/problems/perfect-squares/ Given an integer n, return the least number of perfect square numbers that sum to n. A perfect square is an integer that…

Description https://leetcode.com/problems/wildcard-matching/ Given an input string (s) and a pattern (p), implement wildcard pattern matching with support for ‘?’ and ‘*’ where: ‘?’ Matches any…

Description https://leetcode.com/problems/triangle/ Given a triangle array, return the minimum path sum from top to bottom. For each step, you may move to an…

Description https://leetcode.com/problems/maximum-product-subarray/ Given an integer array nums, find the contiguous subarray within an array (containing at least one number) which has…

Description https://leetcode.com/problems/longest-increasing-subsequence/ Given an integer array nums, return the length of the longest strictly increasing subsequence. A subsequence is a sequence that can…

Description https://leetcode.com/problems/coin-change/ You are given coins of different denominations and a total amount of money amount. Write a function to compute…

Description https://leetcode.com/problems/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. A subsequence of a string is…

Description https://leetcode.com/problems/jump-game/ Given an array of non-negative integers, you are initially positioned at the first index of the array. Each…

Description https://leetcode.com/problems/minimum-path-sum/ Given a m x n grid filled with non-negative numbers, find a path from top left to bottom right which minimizes the sum of…

Description https://leetcode.com/problems/count-primes/ Given an integer n, return the number of prime numbers that are strictly less than n. Example 1: Input: n =…