목록알고리즘 (285)
넘치게 채우기
https://leetcode.com/problems/widest-vertical-area-between-two-points-containing-no-points/submissions/1124652257/ LeetCode - The World's Leading Online Programming Learning Platform Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com leetcode - Widest Vertical Area BetWeen Two Points 문제 유형 : 수..
https://leetcode.com/problems/buy-two-chocolates/ Buy Two Chocolates - LeetCode Can you solve this real interview question? Buy Two Chocolates - You are given an integer array prices representing the prices of various chocolates in a store. You are also given a single integer money, which represents your initial amount of money. You m leetcode.com leetcode - Buy Two Chocolates 문제 유형 : 배열, 구현 문제 ..
https://leetcode.com/problems/image-smoother/description/ Image Smoother - LeetCode Can you solve this real interview question? Image Smoother - An image smoother is a filter of the size 3 x 3 that can be applied to each cell of an image by rounding down the average of the cell and the eight surrounding cells (i.e., the average of the nin leetcode.com leetcode - Image Smoother 문제 유형 : 행렬 문제 난이도..
https://leetcode.com/problems/maximum-product-difference-between-two-pairs/description/ Maximum Product Difference Between Two Pairs - LeetCode Can you solve this real interview question? Maximum Product Difference Between Two Pairs - The product difference between two pairs (a, b) and (c, d) is defined as (a * b) - (c * d). * For example, the product difference between (5, 6) and (2, 7) is (5 *..
https://leetcode.com/problems/design-a-food-rating-system/description/ Design a Food Rating System - LeetCode Can you solve this real interview question? Design a Food Rating System - Design a food rating system that can do the following: * Modify the rating of a food item listed in the system. * Return the highest-rated food item for a type of cuisine in the syst leetcode.com leetcode - Design ..
오늘의 문제는 이전에 푼 경험이 있는 문제라서 생략합니다! 오늘은 Leetcode에게 상을 받은 날입니다. 2023년 4월 26일부터 쭉 달려와서, 이제는 열흘 뒤면 8개월이 되어갑니다. 제가 처음으로 정착한 Problem Solving 플랫폼이고, 현재도 편리한 기능과 UI/UX, 좋은 질의 문제 등의 이유로 가장 애용하고 있습니다. 특히, 문제와 예시가 직관적이고, 테스트 케이스가 친절해서 가장 좋아합니다. 일이 생겨서 중간에 끊긴 적도 몇 번 있었지만, 그런 때를 제외하고는 매일 Daily Challenge에 도전하였습니다. 이제는 이 블로그에 수많은 문제들이 쌓여있습니다. 저는 릿코드의 문제를 푸는 것이 재미있습니다. (물론, 다른 플랫폼들도 좋아합니다!) 앞으로도 계속 코딩 문제를 풀어나갈 것입..
https://leetcode.com/problems/destination-city/description/ Destination City - LeetCode Can you solve this real interview question? Destination City - You are given the array paths, where paths[i] = [cityAi, cityBi] means there exists a direct path going from cityAi to cityBi. Return the destination city, that is, the city without any path ou leetcode.com leetcode - Destination City 문제 유형 : 탐색 /..
https://leetcode.com/problems/difference-between-ones-and-zeros-in-row-and-column/description/ Difference Between Ones and Zeros in Row and Column - LeetCode Can you solve this real interview question? Difference Between Ones and Zeros in Row and Column - You are given a 0-indexed m x n binary matrix grid. A 0-indexed m x n difference matrix diff is created with the following procedure: * Let th..
https://leetcode.com/problems/special-positions-in-a-binary-matrix/description/ Special Positions in a Binary Matrix - LeetCode Can you solve this real interview question? Special Positions in a Binary Matrix - Given an m x n binary matrix mat, return the number of special positions in mat. A position (i, j) is called special if mat[i][j] == 1 and all other elements in row i and co leetcode.com ..
https://leetcode.com/problems/maximum-product-of-two-elements-in-an-array/description/ Maximum Product of Two Elements in an Array - LeetCode Can you solve this real interview question? Maximum Product of Two Elements in an Array - Given the array of integers nums, you will choose two different indices i and j of that array. Return the maximum value of (nums[i]-1)*(nums[j]-1). Example 1: Inpu le..