main
leetcode-umka
Repository badge with A rating
View on GitHub
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.py
3 1 -
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.py
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.ts
3 1 1
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.java
3 1 -
A
solution\2300-2399\2366.Minimum Replacements to Sort the Array\Solution.cpp
3 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.cpp
3 1 -
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.cpp
3 1 -
A
solution\0900-0999\0905.Sort Array By Parity\Solution.java
3 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.java
3 1 -
A
solution\0500-0599\0559.Maximum Depth of N-ary Tree\Solution.py
3 1 -
A
solution\0900-0999\0991.Broken Calculator\Solution.py
3 1 -
A
solution\2300-2399\2365.Task Scheduler II\Solution.ts
3 1 1
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.py
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.java
3 1 -
A
solution\0500-0599\0561.Array Partition\Solution.js
3 1 1
A
solution\2100-2199\2178.Maximum Split of Positive Even Integers\Solution.cpp
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.js
3 1 1
A
solution\0900-0999\0935.Knight Dialer\Solution.py
3 1 -
A
solution\0400-0499\0485.Max Consecutive Ones\Solution.py
3 1 -
A
solution\0900-0999\0950.Reveal Cards In Increasing Order\Solution.py
3 1 -