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; } };

https://leetcode.com/problems/meeting-rooms-ii/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: int minMeetingRooms(vector& intervals) { sort(intervals.begin(), intervals.end()); priorit..

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

To design a hashmap, we need 1) hashing function -- will use hash() method 2) an array for the hash table 3) Linkedlist for hash collision class Node: def __init__(self, key, val, nxt=None): self.key = key self.val = val self.nxt = nxt class LinkedList: def __init__(self): self.head = Node(0, 0) def append(self, key, val) -> None: prv, cur = self.head, self.head.nxt while cur is not None: if cur..

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

https://leetcode.com/problems/binary-search-tree-iterator/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 Python Code with yield # Definition for a binary tree node..

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