일 | 월 | 화 | 수 | 목 | 금 | 토 |
---|---|---|---|---|---|---|
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 |
- Generator
- 715. Range Module
- attribute
- Protocol
- Regular Expression
- 파이썬
- 밴픽
- Python Implementation
- Convert Sorted List to Binary Search Tree
- 운영체제
- data science
- 43. Multiply Strings
- DWG
- shiba
- LeetCode
- concurrency
- 컴퓨터의 구조
- Decorator
- Python Code
- t1
- iterator
- 30. Substring with Concatenation of All Words
- Python
- Class
- 109. Convert Sorted List to Binary Search Tree
- kaggle
- 315. Count of Smaller Numbers After Self
- 시바견
- Substring with Concatenation of All Words
- 프로그래머스
- Today
- Total
목록Computer Science (367)
Scribbling
1. String substr(pos, len) find(str) replace(pos, len, str) starts_with(str) ends_with(str) int main() { string str{ "Hello!" }; if (str.find("!") != string::npos) { cout
1937. Maximum Number of Points with Cost https://leetcode.com/problems/maximum-number-of-points-with-cost/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 class Solution { public: long long maxPoints(vector& poi..
1. import C++20 has a new feature called "module" - replacing the conventional header file mechanism. #pragma once import ; import ; import ; int main() { std::cout
https://leetcode.com/problems/the-earliest-moment-when-everyone-become-friends/description/ LeetCode - The World's Leading Online Programming Learning Platform 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 class Solution: def earliestAcq(self, logs: List[List[int]], n: int) -> int: parent..
LeetCode: 452. Minimum Number of Arrows to Burst Balloons https://leetcode.com/problems/minimum-number-of-arrows-to-burst-balloons/description/?envType=study-plan-v2&envId=top-interview-150 Minimum Number of Arrows to Burst Balloons - LeetCode Can you solve this real interview question? Minimum Number of Arrows to Burst Balloons - There are some spherical balloons taped onto a flat wall that rep..
LeetCode: 373. Find K Pairs with Smallest Sums https://leetcode.com/problems/find-k-pairs-with-smallest-sums/description/?envType=study-plan-v2&envId=top-interview-150 Find K Pairs with Smallest Sums - LeetCode Can you solve this real interview question? Find K Pairs with Smallest Sums - You are given two integer arrays nums1 and nums2 sorted in non-decreasing order and an integer k. Define a pa..
LeetCode: 416. Partition Equal Subset Sum https://leetcode.com/problems/partition-equal-subset-sum/description/ Partition Equal Subset Sum - LeetCode Can you solve this real interview question? Partition Equal Subset Sum - Given an integer array nums, return true if you can partition the array into two subsets such that the sum of the elements in both subsets is equal or false otherwise. Example..
LeetCode: 30. Substring with Concatenation of All Words https://leetcode.com/problems/substring-with-concatenation-of-all-words/description/?envType=study-plan-v2&envId=top-interview-150 Substring with Concatenation of All Words - LeetCode Can you solve this real interview question? Substring with Concatenation of All Words - You are given a string s and an array of strings words. All the string..
LeetCode: 410. Split Array Largest Sum https://leetcode.com/problems/split-array-largest-sum/description/ Split Array Largest Sum - LeetCode Can you solve this real interview question? Split Array Largest Sum - Given an integer array nums and an integer k, split nums into k non-empty subarrays such that the largest sum of any subarray is minimized. Return the minimized largest sum of the split. ..
LeetCode: 394. Decode String https://leetcode.com/problems/decode-string/description/ Decode String - LeetCode Can you solve this real interview question? Decode String - Given an encoded string, return its decoded string. The encoding rule is: k[encoded_string], where the encoded_string inside the square brackets is being repeated exactly k times. Note that k is g leetcode.com class Solution { ..