본문 바로가기

공부, 알고리즘/LeetCode (리트코드)

 (8)
[리트코드/JAVA] 1528. Shuffle String leetcode.com/problems/shuffle-string/ Shuffle String - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # 문제설명 Given a string s and an integer array indices of the same length. The string s will be shuffled such that the character at the ith position moves to indices[i] in the shuff..
[리트코드/JAVA] 1832. Check if the Sentence Is Pangram leetcode.com/problems/check-if-the-sentence-is-pangram/ Check if the Sentence Is Pangram - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # 문제설명 A pangram is a sentence where every letter of the English alphabet appears at least once. Given a string sentence containing only lowerc..
[리트코드/JAVA] 1822. Sign of the Product of an Array leetcode.com/problems/sign-of-the-product-of-an-array/ Sign of the Product of an Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # 문제설명 There is a function signFunc(x) that returns: 1 if x is positive. -1 if x is negative. 0 if x is equal to 0. You are given an integer arra..
[리트코드/JAVA] 771. Jewels and Stones leetcode.com/problems/jewels-and-stones/ Jewels and Stones - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # 문제설명 You're given strings jewels representing the types of stones that are jewels, and stones representing the stones you have. Each character in stones is a type of stone..
[리트코드/JAVA] 1470. Shuffle the Array leetcode.com/problems/shuffle-the-array/ Shuffle the Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # 문제설명 Given the array nums consisting of 2n elements in the form [x1,x2,...,xn,y1,y2,...,yn]. Return the array in the form [x1,y1,x2,y2,...,xn,yn]. # 제한사항 1
[리트코드/JAVA] 1672. Richest Customer Wealth leetcode.com/problems/richest-customer-wealth/ Richest Customer Wealth - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # 문제설명 You are given an m x n integer grid accounts where accounts[i][j] is the amount of money the i​​​​​​​​​​​th​​​​ customer has in the j​​​​​​​​​​​th​​​​ ban..
[리트코드/JAVA] 1431. Kids With the Greatest Number of Candies leetcode.com/problems/kids-with-the-greatest-number-of-candies/ Kids With the Greatest Number of Candies - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # 문제설명 Given the array candies and the integer extraCandies, where candies[i] represents the number of candies that the ith kid..
[리트코드/JAVA] 1480. Running Sum of 1d Array leetcode.com/problems/running-sum-of-1d-array/ Running Sum of 1d Array - LeetCode Level up your coding skills and quickly land a job. This is the best place to expand your knowledge and get prepared for your next interview. leetcode.com # 문제설명 Given an array nums. We define a running sum of an array as runningSum[i] = sum(nums[0]…nums[i]). Return the running sum of nums. # 입출력 예 예 1. Input: nums..

티스토리툴바