[Leetcode 518] Coin change II
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.
This is where I save my algorithm challenges.
You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money.
You have intercepted a secret message encoded as a string of numbers. The message is decoded via the following mapping...
Given two strings text1 and text2, return the length of their longest common subsequence.
You are given an m x n integer array grid. There is a robot initially located at the top-left corner (i.e., grid[0][0]).
There is a robot on an m x n grid. The robot is initially located at the top-left corner (i.e., grid[0][0]).
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 all numbers along its path.
🔍 How to Choose a Pivot in Quick Sort
You are given a 0-indexed array of integers nums of length n. You are initially positioned at nums[0].
Given n pairs of parentheses, write a function to generate all combinations of well-formed parentheses.
Given a string s, return the longest palindromic substring in s.