main
leetcode-beef
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\0700-0799\0753.Cracking the Safe\Solution.cpp
3 1 -
A
solution\0900-0999\0946.Validate Stack Sequences\Solution.ts
3 1 -
A
solution\0700-0799\0754.Reach a Number\Solution.js
3 1 -
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.py
3 1 -
A
solution\2100-2199\2171.Removing Minimum Number of Magic Beans\Solution.java
3 1 -
A
solution\2300-2399\2378.Choose Edges to Maximize Score in a Tree\Solution.cpp
3 1 -
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
3 1 -
A
solution\2000-2099\2048.Next Greater Numerically Balanced Number\Solution.py
3 1 -
A
solution\0300-0399\0374.Guess Number Higher or Lower\Solution.java
3 1 -
A
solution\0800-0899\0870.Advantage Shuffle\Solution.ts
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\0700-0799\0760.Find Anagram Mappings\Solution.java
3 1 -
A
solution\0700-0799\0760.Find Anagram Mappings\Solution.py
3 1 -
A
solution\0300-0399\0374.Guess Number Higher or Lower\Solution.ts
3 1 -
A
solution\0700-0799\0762.Prime Number of Set Bits in Binary Representation\Solution.java
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3 1 -
A
solution\0800-0899\0852.Peak Index in a Mountain Array\Solution.java
3 1 -
A
solution\0700-0799\0763.Partition Labels\Solution.js
3 1 -