daily DEV chloe

유튭 링ㅋ 📋 LeetCode 322번 Coin Change - LeetCode Can you solve this real interview question? Coin Change - You are given an integer array coins representing coins of different denominations and an integer amount representing a total amount of money. Return the fewest number of coins that you need to make leetcode.com F(n)이 합해서 n이 되는 coins의 합이라고 정해준다. F(11)이 되는 경우의 수는 ( F(11-1) or F(11-2) or F(11-5) ..

유튭 링ㅋ 📋 LeetCode 64번 Minimum Path Sum - LeetCode Can you solve this real interview question? 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 all numbers along its path. Note: You can only move either down or rig leetcode.com grid cost [[ 1, 3, 1 ], [[ 1, 4, 5 ], [ 1, 5, 1 ], → [ 2, _, _ ], [ 4, 2, 1 ]] ..

→ 📋 LeetCode 70번 Climbing Stairs - LeetCode Can you solve this real interview question? Climbing Stairs - You are climbing a staircase. It takes n steps to reach the top. Each time you can either climb 1 or 2 steps. In how many distinct ways can you climb to the top? Example 1: Input: n = 2 Outpu leetcode.com 올라가야 하는 계단의 수: n n으로 올라가기 위한 경우의 수는 n-1에서 1칸 or n-2에서 2칸 올라 가는 두 가지 방법이 있다. -> 피보나치 수와 ..