[LeetCode] 2405. Optimal Partition of String - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/optimal-partition-of-string/description/ Optimal Partition of String - LeetCode Can you solve this real interview question? Optimal Partition of String - Given a string s, partition the string into one or more substrings such that the characters in each substring are unique. That is, no letter appears in a single substring more than o leetcode.com 문제 Given a string ..
[LeetCode] 881. Boats to Save People - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/boats-to-save-people/description/ Boats to Save People - LeetCode Can you solve this real interview question? Boats to Save People - You are given an array people where people[i] is the weight of the ith person, and an infinite number of boats where each boat can carry a maximum weight of limit. Each boat carries at most leetcode.com 문제 You are given an array people..
[LeetCode] 2300. Successful Pairs of Spells and Potions - Java
·
알고리즘/LeetCode
https://leetcode.com/problems/successful-pairs-of-spells-and-potions/description/ Successful Pairs of Spells and Potions - LeetCode Can you solve this real interview question? Successful Pairs of Spells and Potions - You are given two positive integer arrays spells and potions, of length n and m respectively, where spells[i] represents the strength of the ith spell and potions[j] repre leetcode...
[LeetCode] 1402. Reducing Dishes - Java/Dart
·
알고리즘/LeetCode
https://leetcode.com/problems/reducing-dishes/description/ Reducing Dishes - LeetCode Can you solve this real interview question? Reducing Dishes - A chef has collected data on the satisfaction level of his n dishes. Chef can cook any dish in 1 unit of time. Like-time coefficient of a dish is defined as the time taken to cook that dish incl leetcode.com 문제 A chef has collected data on the satisf..
[LeetCode] 983. Minimum Cost For Tickets - Java/Dart
·
알고리즘/LeetCode
https://leetcode.com/problems/minimum-cost-for-tickets/description/ Minimum Cost For Tickets - LeetCode Can you solve this real interview question? Minimum Cost For Tickets - You have planned some train traveling one year in advance. The days of the year in which you will travel are given as an integer array days. Each day is an integer from 1 to 365. Train leetcode.com 문제 You have planned some ..
HYOJUN
'분류 전체보기' 카테고리의 글 목록 (5 Page)