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\2400-2499\2430.Maximum Deletions on a String\Solution.go
1
-
A
solution\0900-0999\0984.String Without AAA or BBB\Solution.cpp
8
1
-
A
solution\2400-2499\2430.Maximum Deletions on a String\Solution.java
7
1
-
A
solution\2400-2499\2430.Maximum Deletions on a String\Solution.py
1
1
-
A
solution\2600-2699\2604.Minimum Time to Eat All Grains\Solution.cpp
15
1
-
A
solution\0900-0999\0984.String Without AAA or BBB\Solution.java
7
1
-
A
solution\2600-2699\2604.Minimum Time to Eat All Grains\Solution.java
14
1
-
A
solution\0500-0599\0516.Longest Palindromic Subsequence\Solution.java
5
1
-
A
solution\0300-0399\0394.Decode String\Solution.java
7
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.py
5
1
-
A
solution\0600-0699\0640.Solve the Equation\Solution.py
3
1
-
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.cpp
5
1
-
A
solution\2400-2499\2431.Maximize Total Tastiness of Purchased Fruits\Solution.cpp
6
1
-
A
solution\2400-2499\2431.Maximize Total Tastiness of Purchased Fruits\Solution.go
1
-
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.go
1
-
A
solution\2400-2499\2431.Maximize Total Tastiness of Purchased Fruits\Solution.java
7
1
-
A
solution\2400-2499\2431.Maximize Total Tastiness of Purchased Fruits\Solution.py
1
1
-
A
solution\0800-0899\0889.Construct Binary Tree from Preorder and Postorder Traversal\Solution.py
5
1
-
A
solution\2400-2499\2432.The Employee That Worked on the Longest Task\Solution.c
5
1
-
We use cookies in order to offer you the most relevant information. See our
Privacy Policy
.
Ok, got it!