This series is related to C++20 coroutine.part 1: Generatorpart 2: co_await/co_returnpart 3: Some tips about life cycle when using coroutinespart 4: Some examples about co_awaitpart

Problem DescriptionThis problem is from Zhihu https://www.zhihu.com/question/596919226 Write a program to find a reasonable answer. Assume there is a meeting and there are 5 possible studunts as atte

Difficulty: easy Problem DescriptionEnglish (Palindrome Number)Given an integer x, return true if x is a palindrome, and false otherwise. Example 1: 123Input: x = 121Output: t

Difficulty: medium Problem DescriptionEnglish (Longest Palindromic Substring)Given a string s, return the longest palindromic substring in s. Example 1: 123Input: s = "ba

Difficulty: medium Problem DescriptionEnglish (Maximum Subarray)Given an integer array nums, find the subarray with the largest sum, and return its sum. Example 1: 123Input: n

Difficulty: hard Problem DescriptionEnglish (Sliding Window Maximum)You are given an array of integers nums, there is a sliding window of size k which is moving from the very

Difficulty: medium Problem DescriptionEnglish (LRU Cache)Design a data structure that follows the constraints of a Least Recently Used (LRU) cache. Implement the LRUCache clas

Difficulty: hard Problem DescriptionEnglish (Trapping Rain Water)Given n non-negative integers representing an elevation map where the width of each bar is 1, compute how much

BackgroundIn traditional C++, we used to use an integer to make an iteration as below: 123for (auto i = begin; i < end; ++i) { ...} However, this way looks verbose. We potentially nee

Difficulty: hard Problem DescriptionEnglish (Merge k Sorted Lists)You are given an array of k linked-lists lists, each linked-list is sorted in ascending order. Merge all the