forked from doocs/leetcode
-
Notifications
You must be signed in to change notification settings - Fork 0
[pull] main from doocs:main #489
New issue
Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.
By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.
Already on GitHub? Sign in to your account
Open
pull
wants to merge
117
commits into
AlgorithmAndLeetCode:main
Choose a base branch
from
doocs:main
base: main
Could not load branches
Branch not found: {{ refName }}
Loading
Could not load tags
Nothing to show
Loading
Are you sure you want to change the base?
Some commits from the old base branch may be removed from the timeline,
and old review comments may become outdated.
Open
+72,563
−34,218
Conversation
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
No.3392.Count Subarrays of Length Three With a Condition
No.2300.Successful Pairs of Spells and Potions
No.1295.Find Numbers with Even Number of Digits
No.3528.Unit Conversion I
No.3527.Find the Most Common Response
No.2071.Maximum Number of Tasks You Can Assign
No.0838.Push Dominoes
No.1007.Minimum Domino Rotations For Equal Row
No.1128.Number of Equivalent Domino Pairs
No.3531.Count Covered Buildings
No.3532.Path Existence Queries in a Graph I
No.0790.Domino and Tromino Tiling
No.3541.Find Most Frequent Vowel and Consonant
No.3405.Count the Number of Arrays with K Matching Adjacent Elements
No.2434.Using a Robot to Print the Lexicographically Smallest String
No.3170.Lexicographically Minimum String After Removing Stars
No.3573.Best Time to Buy and Sell Stock V
No.0440.K-th Smallest in Lexicographical Order
No.3576.Transform Array to All Equal Elements
No.3580.Find Consistently Improving Employees
No.3578.Count Partitions With Max-Min Difference at Most K
No.3445.Maximum Difference Between Even and Odd Frequency II
No.0006.Zigzag Conversion
Co-authored-by: yanglbme <yanglbme@users.noreply.github.com>
No.3579.Minimum Steps to Convert String with Operations
No.3579.Minimum Steps to Convert String with Operations
No.3423.Maximum Difference Between Adjacent Elements in a Circular Array
No.3574.Maximize Subarray GCD Score
No.0281.Zigzag Iterator
No.2040.Kth Smallest Product of Two Sorted Arrays
No.3424.Minimum Cost to Make Arrays Identical
No.2616.Minimize the Maximum Difference of Pairs
No.2614.Prime In Diagonal
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
See Commits and Changes for more details.
Created by
pull[bot] (v2.0.0-alpha.1)
Can you help keep this open source service alive? 💖 Please sponsor : )