넘치게 채우기

오늘의 문제는 이전에 푼 경험이 있는 문제라서 생략합니다! 오늘은 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://leetcode.com/problems/transpose-matrix/description/ Transpose Matrix - LeetCode Can you solve this real interview question? Transpose Matrix - Given a 2D integer array matrix, return the transpose of matrix. The transpose of a matrix is the matrix flipped over its main diagonal, switching the matrix's row and column indices. [https:// leetcode.com leetcode - Transpose Matrix 문제 유형 : 수학, ..

https://leetcode.com/problems/binary-tree-inorder-traversal/description/ Binary Tree Inorder Traversal - LeetCode Can you solve this real interview question? Binary Tree Inorder Traversal - Given the root of a binary tree, return the inorder traversal of its nodes' values. Example 1: [https://assets.leetcode.com/uploads/2020/09/15/inorder_1.jpg] Input: root = [1,nu leetcode.com leetcode - Binary..

https://leetcode.com/problems/construct-string-from-binary-tree/description/ Construct String from Binary Tree - LeetCode Can you solve this real interview question? Construct String from Binary Tree - Given the root of a binary tree, construct a string consisting of parenthesis and integers from a binary tree with the preorder traversal way, and return it. Omit all the empty leetcode.com leetco..

https://leetcode.com/problems/largest-odd-number-in-string/description/ Largest Odd Number in String - LeetCode Can you solve this real interview question? Largest Odd Number in String - You are given a string num, representing a large integer. Return the largest-valued odd integer (as a string) that is a non-empty substring of num, or an empty string "" if no odd i leetcode.com leetcode - Large..