Algorithm/Implementation (750) 썸네일형 리스트형 (C++) - LeetCode (easy) 941. Valid Mountain Array https://leetcode.com/problems/valid-mountain-array/description/ Valid Mountain Array - LeetCode Can you solve this real interview question? Valid Mountain Array - Given an array of integers arr, return true if and only if it is a valid mountain array. Recall that arr is a mountain array if and only if: * arr.length >= 3 * There exists some i with 0 arr[i+1]) { peak = i; break; } stat = INCREASIN.. (C++, Rust) - LeetCode (easy) 925. Long Pressed Name https://leetcode.com/problems/long-pressed-name/description/ Long Pressed Name - LeetCode Can you solve this real interview question? Long Pressed Name - Your friend is typing his name into a keyboard. Sometimes, when typing a character c, the key might get long pressed, and the character will be typed 1 or more times. You examine the typed cha leetcode.com 문자열을 다뤄보는 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 * .. (C++, Rust) - LeetCode (easy) 922. Sort Array By Parity II https://leetcode.com/problems/sort-array-by-parity-ii/description/ Sort Array By Parity II - LeetCode Can you solve this real interview question? Sort Array By Parity II - Given an array of integers nums, half of the integers in nums are odd, and the other half are even. Sort the array so that whenever nums[i] is odd, i is odd, and whenever nums[i] is even leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초.. (C++, Rust) - LeetCode (easy) 908. Smallest Range I https://leetcode.com/problems/smallest-range-i/description/ Smallest Range I - LeetCode Can you solve this real interview question? Smallest Range I - You are given an integer array nums and an integer k. In one operation, you can choose any index i where 0 (C++, Rust) - LeetCode (easy) 896. Monotonic Array https://leetcode.com/problems/monotonic-array/description/ Monotonic Array - LeetCode Can you solve this real interview question? Monotonic Array - An array is monotonic if it is either monotone increasing or monotone decreasing. An array nums is monotone increasing if for all i (C++, Rust) - LeetCode (easy) 892. Surface Area of 3D Shapes https://leetcode.com/problems/surface-area-of-3d-shapes/description/ Surface Area of 3D Shapes - LeetCode Can you solve this real interview question? Surface Area of 3D Shapes - You are given an n x n grid where you have placed some 1 x 1 x 1 cubes. Each value v = grid[i][j] represents a tower of v cubes placed on top of cell (i, j). After placing these cubes, leetcode.com 공간지각능력 문제였습니다? 📕 풀이방법 .. (C++) - LeetCode (easy) 696. Count Binary Substrings https://leetcode.com/problems/count-binary-substrings/description/ Count Binary Substrings - LeetCode Can you solve this real interview question? Count Binary Substrings - Given a binary string s, return the number of non-empty substrings that have the same number of 0's and 1's, and all the 0's and all the 1's in these substrings are grouped consecutively leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초.. (C++) - LeetCode (easy) 883. Projection Area of 3D Shapes https://leetcode.com/problems/projection-area-of-3d-shapes/ Projection Area of 3D Shapes - LeetCode Can you solve this real interview question? Projection Area of 3D Shapes - You are given an n x n grid where we place some 1 x 1 x 1 cubes that are axis-aligned with the x, y, and z axes. Each value v = grid[i][j] represents a tower of v cubes placed on to leetcode.com 공식을 찾아내 구현한 문제였습니다. 📕 풀이방법 📔.. 이전 1 ··· 35 36 37 38 39 40 41 ··· 94 다음