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\0800-0899\0849.Maximize Distance to Closest Person\Solution.cpp
5
1
-
A
solution\2100-2199\2187.Minimum Time to Complete Trips\Solution.java
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.java
5
1
-
A
solution\0800-0899\0849.Maximize Distance to Closest Person\Solution.py
5
1
-
A
solution\2300-2399\2371.Minimize Maximum Value in a Grid\Solution.py
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.ts
5
1
1
A
solution\0500-0599\0510.Inorder Successor in BST II\Solution.js
5
1
1
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.java
5
1
-
A
solution\0500-0599\0510.Inorder Successor in BST II\Solution.py
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.py
5
1
-
A
solution\0400-0499\0455.Assign Cookies\Solution.py
5
1
-
A
solution\2300-2399\2381.Shifting Letters II\Solution.py
5
1
-
A
solution\2100-2199\2195.Append K Integers With Minimal Sum\Solution.java
5
1
-
A
solution\2100-2199\2187.Minimum Time to Complete Trips\Solution.cpp
5
1
-
A
solution\2300-2399\2373.Largest Local Values in a Matrix\Solution.cpp
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.cpp
5
1
-
A
solution\0500-0599\0513.Find Bottom Left Tree Value\Solution.cpp
5
1
-
A
solution\0900-0999\0954.Array of Doubled Pairs\Solution.java
5
1
-
A
solution\0500-0599\0513.Find Bottom Left Tree Value\Solution.java
5
1
-
A
solution\0400-0499\0456.132 Pattern\Solution.cpp
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!