Scribbling

https://leetcode.com/problems/sliding-window-maximum/ class Solution { public: vector maxSlidingWindow(vector& nums, int k) { vector ret; deque q; for(int i=0; i= k - 1) { ret.push_back(nums[q[0]]); } } return ret; } };

1. Default Constructor In C++, when making an array, we cannot explicitly call a constructor other than the default one. 2. Converting Constructor C++ compiler may implicitly convert a value to an object. (In this case, integer to Cell object) class Cell { public: int num = 0; Cell() = default; Cell(int num) { this->num = num; } }; int main() { Cell cell1{ 4 }; cell1 = 5; cout

https://leetcode.com/problems/minimum-genetic-mutation/description/?envType=study-plan-v2&envId=top-interview-150 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: int minMutation(string startGene, st..

1. unique_ptr int main() { auto intPtr{ make_unique(42) }; cout

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

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..