Algorithm (2139) 썸네일형 리스트형 (C++, Rust) - LeetCode (easy) 961. N-Repeated Element in Size 2N Array https://leetcode.com/problems/n-repeated-element-in-size-2n-array/description/ N-Repeated Element in Size 2N Array - LeetCode Can you solve this real interview question? N-Repeated Element in Size 2N Array - You are given an integer array nums with the following properties: * nums.length == 2 * n. * nums contains n + 1 unique elements. * Exactly one element of nums is repeated n leetcode.com 자료구.. (C++, Rust) - LeetCode (easy) 944. Delete Columns to Make Sorted https://leetcode.com/problems/delete-columns-to-make-sorted/description/ strs[j+1][i]) { isNotLexicographically = true; break; } } if (isNotLexicographically) columnsToDelete++; } return columnsToDelete; } }; 📔 Rust impl Solution { pub fn min_deletion_size(strs: Vec) -> i32 { let mut columns_to_delete = 0; for i in 0..strs[0].len() { for j in 0..strs.len() - 1 { if strs[j].as_bytes()[i] > strs[j.. (C++, Rust) - LeetCode (easy) 941. Valid Mountain Array https://leetcode.com/problems/di-string-match/description/ DI String Match - LeetCode Can you solve this real interview question? DI String Match - A permutation perm of n + 1 integers of all the integers in the range [0, n] can be represented as a string s of length n where: * s[i] == 'I' if perm[i] < perm[i + 1], and * s[i] == 'D' if perm leetcode.com 구현 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 s의 길이 sz, 숫자 .. (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++) - LeetCode (easy) 938. Range Sum of BST https://leetcode.com/problems/range-sum-of-bst/description/ Range Sum of BST - LeetCode Can you solve this real interview question? Range Sum of BST - Given the root node of a binary search tree and two integers low and high, return the sum of values of all nodes with a value in the inclusive range [low, high]. Example 1: [https://assets.l leetcode.com 재귀 구현 문제였습니다. 📕 풀이방법 📔 풀이과정 왼쪽 sub tree 의 정.. (C++, Rust) - LeetCode (easy) 933. Number of Recent Calls https://leetcode.com/problems/number-of-recent-calls/description/ Number of Recent Calls - LeetCode Can you solve this real interview question? Number of Recent Calls - You have a RecentCounter class which counts the number of recent requests within a certain time frame. Implement the RecentCounter class: * RecentCounter() Initializes the counter with ze leetcode.com 자료구조를 이용하거나 이분탐색을 사용해본 문제였습니.. (C++) - LeetCode (easy) 929. Unique Email Addresses https://leetcode.com/problems/unique-email-addresses/description/ (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 문자열을 다뤄보는 문제였습니다. 📕 풀이방법 📔 입력 및 초기화 * .. 이전 1 ··· 60 61 62 63 64 65 66 ··· 268 다음