LeetCode342 leetcode 196. Delete Duplicate Emails https://leetcode.com/problems/delete-duplicate-emails/description/ Delete Duplicate Emails - LeetCode Delete Duplicate Emails - Table: Person +-------------+---------+ | Column Name | Type | +-------------+---------+ | id | int | | email | varchar | +-------------+---------+ id is the primary key column for this table. Each row of this table contains an em leetcode.com 1 2 3 4 5 6 7 # Please wri.. 2023. 1. 29. leetcode 2433. Find The Original Array of Prefix Xor https://leetcode.com/problems/find-the-original-array-of-prefix-xor/description/ Find The Original Array of Prefix Xor - LeetCode Find The Original Array of Prefix Xor - You are given an integer array pref of size n. Find and return the array arr of size n that satisfies: * pref[i] = arr[0] ^ arr[1] ^ ... ^ arr[i]. Note that ^ denotes the bitwise-xor operation. It can be proven that leetcode.com.. 2023. 1. 27. leetcode 2545. Sort the Students by Their Kth Score https://leetcode.com/problems/sort-the-students-by-their-kth-score/description/ Sort the Students by Their Kth Score - LeetCode Sort the Students by Their Kth Score - There is a class with m students and n exams. You are given a 0-indexed m x n integer matrix score, where each row represents one student and score[i][j] denotes the score the ith student got in the jth exam. The matr leetcode.com .. 2023. 1. 27. leetcode 2396. Strictly Palindromic Number https://leetcode.com/problems/strictly-palindromic-number/description/ Strictly Palindromic Number - LeetCode Strictly Palindromic Number - An integer n is strictly palindromic if, for every base b between 2 and n - 2 (inclusive), the string representation of the integer n in base b is palindromic. Given an integer n, return true if n is strictly palindromic and f leetcode.com 1 2 3 4 5 6 7 8 9 .. 2023. 1. 27. leetcode 1393. Capital Gain/Loss https://leetcode.com/problems/capital-gainloss/description/ Capital Gain/Loss - LeetCode Capital Gain/Loss - Table: Stocks +---------------+---------+ | Column Name | Type | +---------------+---------+ | stock_name | varchar | | operation | enum | | operation_day | int | | price | int | +---------------+---------+ (stock_name, operation_day) i leetcode.com 1 2 3 4 5 6 7 8 9 10 # Write your MySQL.. 2023. 1. 26. leetcode 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers https://leetcode.com/problems/partitioning-into-minimum-number-of-deci-binary-numbers/description/ Partitioning Into Minimum Number Of Deci-Binary Numbers - LeetCode Partitioning Into Minimum Number Of Deci-Binary Numbers - A decimal number is called deci-binary if each of its digits is either 0 or 1 without any leading zeros. For example, 101 and 1100 are deci-binary, while 112 and 3001 are not.. 2023. 1. 26. leetcode 1684. Count the Number of Consistent Strings https://leetcode.com/problems/count-the-number-of-consistent-strings/description/ Count the Number of Consistent Strings - LeetCode Count the Number of Consistent Strings - You are given a string allowed consisting of distinct characters and an array of strings words. A string is consistent if all characters in the string appear in the string allowed. Return the number of consistent st leetcode... 2023. 1. 22. leetcode 58. Length of Last Word https://leetcode.com/problems/length-of-last-word/description/ Length of Last Word - LeetCode Length of Last Word - Given a string s consisting of words and spaces, return the length of the last word in the string. A word is a maximal substring consisting of non-space characters only. Example 1: Input: s = "Hello World" Output: 5 Explanation: Th leetcode.com 1 2 3 4 class Solution: def lengthOfL.. 2023. 1. 21. leetcode 2404. Most Frequent Even Element https://leetcode.com/problems/most-frequent-even-element/description/ Most Frequent Even Element - LeetCode Most Frequent Even Element - Given an integer array nums, return the most frequent even element. If there is a tie, return the smallest one. If there is no such element, return -1. Example 1: Input: nums = [0,1,2,2,4,4,1] Output: 2 Explanation: The even leetcode.com 1 2 3 4 5 6 7 8 9 10 11.. 2023. 1. 19. leetcode 2465. Number of Distinct Averages https://leetcode.com/problems/number-of-distinct-averages/description/ Number of Distinct Averages - LeetCode Number of Distinct Averages - You are given a 0-indexed integer array nums of even length. As long as nums is not empty, you must repetitively: * Find the minimum number in nums and remove it. * Find the maximum number in nums and remove it. * Calculate th leetcode.com 12345678910111213c.. 2023. 1. 19. leetcode 2496. Maximum Value of a String in an Array https://leetcode.com/problems/maximum-value-of-a-string-in-an-array/description/ Maximum Value of a String in an Array - LeetCode Maximum Value of a String in an Array - The value of an alphanumeric string can be defined as: * The numeric representation of the string in base 10, if it comprises of digits only. * The length of the string, otherwise. Given an array strs of alphanumeric leetcode.co.. 2023. 1. 19. leetcode 2535. Difference Between Element Sum and Digit Sum of an Array https://leetcode.com/problems/difference-between-element-sum-and-digit-sum-of-an-array/description/ Difference Between Element Sum and Digit Sum of an Array - LeetCode Can you solve this real interview question? Difference Between Element Sum and Digit Sum of an Array - You are given a positive integer array nums. * The element sum is the sum of all the elements in nums. * The digit sum is the s.. 2023. 1. 17. 이전 1 ··· 10 11 12 13 14 15 16 ··· 29 다음