넘치게 채우기

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..

https://leetcode.com/problems/element-appearing-more-than-25-in-sorted-array/description/ Element Appearing More Than 25% In Sorted Array - LeetCode Can you solve this real interview question? Element Appearing More Than 25% In Sorted Array - Given an integer array sorted in non-decreasing order, there is exactly one integer in the array that occurs more than 25% of the time, return that integer..

https://school.programmers.co.kr/learn/courses/15009/lessons/121690 프로그래머스 코드 중심의 개발자 채용. 스택 기반의 포지션 매칭. 프로그래머스의 개발자 맞춤형 프로필을 등록하고, 나와 기술 궁합이 잘 맞는 기업들을 매칭 받으세요. programmers.co.kr 프로그래머스 - 보물 지도 (PCCP 모의고사 #2 4번) 문제 유형 : dfs/bfs, 다이나믹 프로그래밍 문제 난이도 : Level 3 문제 설명 진수는 보물이 묻힌 장소와 함정이 표시된 보물 지도를 이용해 보물을 찾으려 합니다. 보물지도는 가로 길이가 n, 세로 길이가 m인 직사각형 모양입니다. 맨 왼쪽 아래 칸의 좌표를 (1, 1)으로, 맨 오른쪽 위 칸의 좌표를 (n, m)으로 나..