https://leetcode.com/problems/longest-common-subsequence/description/?envType=study-plan-v2&envId=leetcode-75Given 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 a new string generated from the original string with some characters (can be none) deleted without changing the relative orde..

https://leetcode.com/problems/daily-temperatures/description/?envType=study-plan-v2&envId=leetcode-75 Given an array of integers temperatures represents the daily temperatures, return an array answer such that answer[i] is the number of days you have to wait after the ith day to get a warmer temperature. If there is no future day for which this is possible, keep answer[i] == 0 instead.Example 1:..

https://developers.google.com/workspace/sheets/api/quickstart/python?hl=ko Python 빠른 시작 | Google Sheets | Google for Developers이 페이지는 Cloud Translation API를 통해 번역되었습니다. 의견 보내기 Python 빠른 시작 컬렉션을 사용해 정리하기 내 환경설정을 기준으로 콘텐츠를 저장하고 분류하세요. 빠른 시작에서는 Google Workdevelopers.google.com공식문서가 정말... 잘 돼있는데^^열받게도 이 문서를 찾는 게 너무 힘들었다. 사실상 이 글의 내용은 저 링크 하나만으로 충분하긴 하지만...언젠가 또 이런 삽질을 하게 될 지 모르기 때문에 간략하게나마 정리해 ..

http://leetcode.com/problems/minimum-flips-to-make-a-or-b-equal-to-c/description/?envType=study-plan-v2&envId=leetcode-75Given 3 positives numbers a, b and c. Return the minimum flips required in some bits of a and b to make ( a OR b == c ). (bitwise OR operation). Flip operation consists of change any single bit 1 to 0 or change the bit 0 to 1 in their binary representation.Example 1:Input: a =..

https://leetcode.com/problems/single-number/description/?envType=study-plan-v2&envId=leetcode-75 Given a non-empty array of integers nums, every element appears twice except for one. Find that single one. You must implement a solution with a linear runtime complexity and use only constant extra space.Example 1:Input: nums = [2,2,1]Output: 1 Example 2:Input: nums = [4,1,2,1,2]Output: 4 Example 3:..

https://leetcode.com/problems/counting-bits/description/?envType=study-plan-v2&envId=leetcode-75 Given an integer n, return an array ans of length n + 1 such that for each i (0 ans[i] is the number of 1's in the binary representation of i. Example 1: Input: n = 2 Output: [0,1,1] Explanation: 0 --> 0 1 --> 1 2 --> 10 Example 2: Input: n = 5 Output: [0,1,1,2,1,2] Explanation: 0 --> 0 1 --> 1 2 -->..

https://leetcode.com/problems/unique-paths/description/?envType=study-plan-v2&envId=leetcode-75 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]).The robot tries to move to the bottom-right corner (i.e., grid[m - 1][n -1]).The robot can only move either down or right at any point in time. Given the two integers m and n, return the number ..

https://leetcode.com/problems/domino-and-tromino-tiling/description/?envType=study-plan-v2&envId=leetcode-75You have two types of tiles: a 2 x 1 domino shape and a tromino shape. You may rotate these shapes. Given an integer n, return the number of ways to tile an 2 x n board. Since the answer may be very large, return it modulo 10^9 + 7. In a tiling, every square must be covered by a tile. Two..

https://leetcode.com/problems/house-robber/description/?envType=study-plan-v2&envId=leetcode-75You are a professional robber planning to rob houses along a street. Each house has a certain amount of money stashed, the only constraint stopping you from robbing each of them is that adjacent houses have security systems connected and it will automatically contact the police if two adjacent houses w..

https://leetcode.com/problems/min-cost-climbing-stairs/description/?envType=study-plan-v2&envId=leetcode-75 You are given an integer array cost where cost[i] is the cost of ith step on a staircase. Once you pay the cost, you can either climb one or two steps. You can either start from the step with index 0, or the step with index 1. Return the minimum cost to reach the top of the floor. Example..