Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-umka
1,187
issues
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.ts
3
1
1
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.py
3
1
-
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.java
3
1
-
A
solution\0600-0699\0643.Maximum Average Subarray I\Solution.ts
3
1
2
A
solution\1000-1099\1016.Binary String With Substrings Representing 1 To N\Solution.ts
3
1
1
A
solution\0800-0899\0857.Minimum Cost to Hire K Workers\Solution.py
3
1
-
A
solution\2300-2399\2367.Number of Arithmetic Triplets\Solution.py
3
1
-
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.cpp
3
1
-
A
solution\2200-2299\2208.Minimum Operations to Halve Array Sum\Solution.py
3
1
-
A
solution\0900-0999\0998.Maximum Binary Tree II\Solution.py
3
1
-
A
solution\0900-0999\0961.N-Repeated Element in Size 2N Array\Solution.js
3
1
1
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.cpp
3
1
-
A
solution\1000-1099\1016.Binary String With Substrings Representing 1 To N\Solution.py
3
1
-
A
solution\2300-2399\2368.Reachable Nodes With Restrictions\Solution.py
3
1
-
A
solution\2000-2099\2027.Minimum Moves to Convert String\Solution.java
3
1
-
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.java
3
1
-
A
solution\2000-2099\2099.Find Subsequence of Length K With the Largest Sum\Solution.cpp
3
1
-
A
solution\0600-0699\0646.Maximum Length of Pair Chain\Solution.py
3
1
-
A
solution\2200-2299\2207.Maximize Number of Subsequences in a String\Solution.py
3
1
-
A
solution\2000-2099\2095.Delete the Middle Node of a Linked List\Solution.cpp
3
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!