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\0400-0499\0491.Non-decreasing Subsequences\Solution.java
6
1
-
A
solution\0900-0999\0911.Online Election\Solution.java
6
1
1
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.py
6
1
-
A
solution\2300-2399\2349.Design a Number Container System\Solution.cpp
6
1
-
A
solution\0600-0699\0635.Design Log Storage System\Solution.cpp
6
1
-
A
solution\2300-2399\2349.Design a Number Container System\Solution.java
6
1
1
A
solution\0900-0999\0982.Triples with Bitwise AND Equal To Zero\Solution.cpp
6
1
-
A
solution\0900-0999\0980.Unique Paths III\Solution.py
6
1
-
A
solution\2300-2399\2345.Finding the Number of Visible Mountains\Solution.java
6
1
-
A
solution\2300-2399\2344.Minimum Deletions to Make Array Divisible\Solution.cpp
6
1
-
A
solution\0400-0499\0494.Target Sum\Solution.java
6
1
-
A
solution\2400-2499\2458.Height of Binary Tree After Subtree Removal Queries\Solution.java
6
1
-
A
solution\0400-0499\0426.Convert Binary Search Tree to Sorted Doubly Linked List\Solution.cpp
6
1
-
A
solution\0400-0499\0494.Target Sum\Solution.js
6
1
1
A
solution\2300-2399\2354.Number of Excellent Pairs\Solution.java
6
1
-
A
solution\2100-2199\2113.Elements in Array After Removing and Replacing Elements\Solution.cpp
6
1
-
A
solution\0900-0999\0911.Online Election\Solution.py
6
1
-
A
solution\0800-0899\0801.Minimum Swaps To Make Sequences Increasing\Solution.java
6
1
-
A
solution\0400-0499\0426.Convert Binary Search Tree to Sorted Doubly Linked List\Solution.js
5
1
1
A
solution\0900-0999\0931.Minimum Falling Path Sum\Solution.py
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!