Done is better than perfect

Question Given an m x n grid of characters board and a string word, return true if word exists in the grid. The word can be constructed from letters of sequentially adjacent cells, where adjacent cells are horizontally or vertically neighboring. The same letter cell may not be used more than once. Follow up: Could you use search pruning to make your solution faster with a larger board? 문자판의 m x ..

Question Given an integer array nums of unique elements, return all possible subsets (the power set). The solution set must not contain duplicate subsets. Return the solution in any order. 중복이 없는 정수 배열이 주어지면 가능한 모든 subsets(the power set)을 반환하여라. 중복된 subset이 포함되어서는 안 된다. 어떤 순서로 subset을 반환하건 상관이 없다. 제약사항 1

Question There is an integer array nums sorted in ascending order (with distinct values). Prior to being passed to your function, nums is possibly rotated at an unknown pivot index k (1

Question Write an efficient algorithm that searches for a value target in an m x n integer matrix matrix. This matrix has the following properties: Integers in each row are sorted in ascending from left to right. Integers in each column are sorted in ascending from top to bottom. m x n 정수 행렬 행렬에서 값 대상을 찾는 효율적인 알고리즘을 작성하십시오. 이 행렬에는 다음과 같은 속성이 있습니다. 각 행의 정수는 왼쪽에서 오른쪽으로 오름차순으로 정렬됩니다. 각 열의 정수는 위에서 아..

Question Given an array of integers nums sorted in non-decreasing order, find the starting and ending position of a given target value. If target is not found in the array, return [-1, -1]. You must write an algorithm with O(log n) runtime complexity. 오름차순으로 정렬된 정수 배열이 주어지면 주어진 목표 값의 시작 위치와 끝 위치를 찾습니다. 배열에서 target을 찾을 수 없으면 [-1, -1]을 반환합니다. 시간 복잡도가 O(log n)인 알고리즘을 작성해야 합니다. 제약사항 0

Question A peak element is an element that is strictly greater than its neighbors. Given a 0-indexed integer array nums, find a peak element, and return its index. If the array contains multiple peaks, return the index to any of the peaks. You may imagine that nums[-1] = nums[n] = -∞. In other words, an element is always considered to be strictly greater than a neighbor that is outside the array..

Question Given an integer array nums, return all the triplets [nums[i], nums[j], nums[k]] such that i != j, i != k, and j != k, and nums[i] + nums[j] + nums[k] == 0. Notice that the solution set must not contain duplicate triplets. integer 변수로 이루어진 배열 nums 가 주어질 때 i != j, i != k, j != k 이고 nums[i] + nums[j] + nums[k] == 0 인 모든 세 쌍 [nums[i], nums[j], nums[k]] 을 return 하라 제약사항 3

Question 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 up that amount. If that amount of money cannot be made up by any combination of the coins, return -1. You may assume that you have an infinite number of each kind of coin. 다른 단위의 동전을 나타내는 정수..