Features
Pricing
Contact
Login with:
×
Features
Pricing
Contact
Login with:
GitHub
Bitbucket
×
main
leetcode-simula
1,196
issues
4,998
files
1
active branch
×
CodeFactor Rating A
{{format.Name}}
Grade
Name
Complexity
Churn
Issues
A
solution\2300-2399\2363.Merge Similar Items\Solution.c
5
1
-
A
solution\0900-0999\0920.Number of Music Playlists\Solution.py
5
1
-
A
solution\0500-0599\0528.Random Pick with Weight\Solution.java
5
1
-
A
solution\0500-0599\0528.Random Pick with Weight\Solution.js
5
1
-
A
solution\0500-0599\0528.Random Pick with Weight\Solution.py
5
1
-
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.java
5
1
-
A
solution\2300-2399\2359.Find Closest Node to Given Two Nodes\Solution.py
5
1
-
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.ts
5
1
3
A
solution\0900-0999\0921.Minimum Add to Make Parentheses Valid\Solution.cpp
5
1
-
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.cpp
5
1
-
A
solution\0700-0799\0710.Random Pick with Blacklist\Solution.py
5
1
-
A
solution\2300-2399\2349.Design a Number Container System\Solution.py
5
1
-
A
solution\2300-2399\2352.Equal Row and Column Pairs\Solution.cpp
5
1
-
A
solution\0400-0499\0402.Remove K Digits\Solution.ts
5
1
2
A
solution\2100-2199\2134.Minimum Swaps to Group All 1's Together II\Solution.cpp
5
1
-
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.py
5
1
1
A
solution\0400-0499\0447.Number of Boomerangs\Solution.ts
5
1
5
A
solution\2300-2399\2370.Longest Ideal Subsequence\Solution.py
5
1
-
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.py
5
1
-
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.py
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!