반응형
Notice
Recent Posts
Recent Comments
Link
| 일 | 월 | 화 | 수 | 목 | 금 | 토 |
|---|---|---|---|---|---|---|
| 1 | 2 | |||||
| 3 | 4 | 5 | 6 | 7 | 8 | 9 |
| 10 | 11 | 12 | 13 | 14 | 15 | 16 |
| 17 | 18 | 19 | 20 | 21 | 22 | 23 |
| 24 | 25 | 26 | 27 | 28 | 29 | 30 |
| 31 |
Tags
- 비트연산
- css
- event
- React
- map
- bit
- Callback
- node.js
- component
- Context
- axios
- MySQL
- Props
- nodeJS
- Navigation
- count
- route
- UE5
- queue
- DP
- state
- server
- treenode
- priority_queue
- BinaryTree
- c++
- array
- JSX
- leetcode
- routes
Archives
- Today
- Total
목록pair (1)
우사미 코딩
[Leetcode] 2542. Maximum Subsequence Score
1. 문제링크 https://leetcode.com/problems/maximum-subsequence-score/ Maximum Subsequence Score - LeetCode Can you solve this real interview question? Maximum Subsequence Score - You are given two 0-indexed integer arrays nums1 and nums2 of equal length n and a positive integer k. You must choose a subsequence of indices from nums1 of length k. For chosen indic leetcode.com - nums1 : sum nums - nums2..
Leetcode
2023. 6. 18. 09:38