본문 바로가기

공부, 알고리즘

 (21)
[리트코드/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] Level 2. 이진 변환 반복하기 programmers.co.kr/learn/courses/30/lessons/70129 코딩테스트 연습 - 이진 변환 반복하기 programmers.co.kr # 문제설명 0과 1로 이루어진 어떤 문자열 x에 대한 이진 변환을 다음과 같이 정의합니다. x의 모든 0을 제거합니다. x의 길이를 c라고 하면, x를 "c를 2진법으로 표현한 문자열"로 바꿉니다. 예를 들어, x = "0111010"이라면, x에 이진 변환을 가하면 x = "0111010" -> "1111" -> "100" 이 됩니다. 0과 1로 이루어진 문자열 s가 매개변수로 주어집니다. s가 "1"이 될 때까지 계속해서 s에 이진 변환을 가했을 때, 이진 변환의 횟수와 변환 과정에서 제거된 모든 0의 개수를 각각 배열에 담아 return 하..
[리트코드/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..

티스토리툴바